同时求解f(x)零点的一种迭代解法

1　引　　言在许多实际问题中 ,常常会遇到求解非线性方程 f( x) =0的根 ,或称为求函数 f( x)的零点 .此时 f( x) =( x-α) μg( x) ,且 g(α)≠ 0 ,μ为大于零的常数 ,称为零点α的根指数 .当 f( x)为 n次多项式 ,设 δ(l)k =-f( z(l)k ) /f′( z(l)k ) ,牛顿修正量迭代解法为z(l+1 )k =z(l)k +δ(l)k /( 1 +δ(l)k ni=1 ,i≠ k1z(l)k -z(l)i) ,　　 k =1 ,2 ,… ,n,　 l =0 ,1 ,2 ,… ( 1 )当所有根为单根时 ,迭代法收敛 ,且收敛阶为 3阶 (见 [1 ] ,[2 ] ,[3 ] ,[4 ] ) .当 f ( x)为 n次多项式 ,所有互不相同的根为 r1 ,r2 ,… ,rm,对应…     

矩阵方程AX—XB=C的最小多项式解法

关于矩阵方程AX—XB=C的解法有不少的论文,大部分是采用矩阵的拉直运算或拉直运算的变形方法求解,文献[1]给出了连分式解法,本文利用矩阵A,B的最小多项式求解此方程,使得方程的解比目前已见的结果较简洁,同时当B=-A~T稳定、C为任意正定矩阵时所构造的正定二次型Liapunov函数的表达式较目前的结果更明确、简单.     

多项式的根的一个性质的判定

文献[1]在讨论多项式型的函数迭代方程的局部解析解的存在性时涉及到了多项式的根的一个性质.本文给出了判定该性质是否成立的一个简洁的条件,证明了多项式λ_nzⁿ+…+λ₂z²+λ₁z+λ₀有一个根α满足inf{｜λ_nα^nm+…+λ₂a^2m+λ₁α^m+λ₀｜：m=2,3,…｝>0当且仅当如下两个条件之中至少有一个成立：(i)该多项式有一个根β满足｜β｜>1;(ii)该多项式有一个根β满足｜β｜<1,且λ₀≠0.     

关于实系数代数多项式根的分布

给定一实系数多项式:p(z)=a_0z~n a_1z~(n-1) … a_n,不失一般性,假定a_0>0.本文主要给出有关多项式(1)的根的分布的结果.定理1 如果系数{a_i}_i=0~m满足条件△~2a_k≥0,k=0,1,2,…,(n-1),其中△~2 a_k是二级差分,那么多项式(1)的所有根位于圆|z|<1外.     

一个修正的Newton法之改进

众所周知,多项式方程的求解有很多应用背景,而Newton法是一种常用的数值方法,因此有不少文献讨论Newton法的各种改进,包括用于求解多项式方程时的变形[1-7],在文[1]中,Ehrlich,L.W.提出了一个同时决定n次多项式的n个单根的迭代法.对方程     

分圆多项式既约因式Φm（x）的快速计算方法

1 引言关于分圆多项式既约因式φm(x)的系数问题,近来《数学通报》连续刊登三篇文章(详见[1]、[2]、[3]进行讨论,为免于如[1]所指出的计算φm(x)时需作大量的多项式除法运算的不足,在文[2]的基础上,本文提出一种速算法,并应用它纠正了文[3]中一个反例φm(x)(m=399)的错误。2 方法     

图的伴随多项式的最小实根

本文讨论了含割点$u$的连通图G,其中$G-u$含路、圈或$D_{n}$分支时图$G$的伴随多项式的最小实根的变化情况.得到一些新的序关系,这推广了文[10-13]中有关图的伴随多项式最小根的一些结果.     

对线性分式函数n次迭代的一个补充

线性分式函数的迭代有着较为广泛的应用。现有的求函数的n次迭代式的方法有：定义法、数学归纳法、不动点法和桥函数相似法等．文[1]利用矩阵的特征多项式理论，得到了线性分式函数的n次迭代式的一般计算公式，此公式只能解决特征根互异的情形．本文就特征根相等的情形作了一些讨论，得到了特征根相等时的线性分式函数的n次迭代式的一般计算公式，并举例说明了它的应用。     

一个方程的几种解法

问题　同学们 ,你会解方程ｘ =2 2 ｘ吗 ?请动笔一试 .解法 1(平方法 )　这是一个无理方程 ,早在读初中的时候 ,同学们就知道无理方程可以通过两边平方将原方程转化为多项式方程 ,从而得 :(ｘ2 - 2 ) 2 - 2 -ｘ =0解这个四次方程 ,可求得ｘ1=- 1- 52 ,ｘ2 =- 1,ｘ3=- 1 52 ,ｘ4 =2 .经检验 ,原方程的根为ｘ =2 .本解法很自然 ,但有一个明显的缺点就是转化后所得的多项式方程次数太高 ,不利于求解 ,也于解法的推广不利 .还有别的解法吗 ?进高中学了不等式性质和熟悉反证法后 ,我们想到 :解法 2 (反证法 )　直接观察就知ｘ =2是原方程的一个…     

关于“2~k元域上的二次方程根的公式”的注记

对 2 k元域上的二次方程 ax2 +bx +c=0 (a≠ 0 )的根的多项式表示进行了讨论 ,从而解决了文献“2 k元域上的二次方程根的公式”中提出的问题 .     

A unified semilocal convergence analysis of a family of iterative algorithms for computing all zeros of a polynomial simultaneously

In this paper, we first present a family of iterative algorithms for simultaneous determination of all zeros of a polynomial. This family contains two well-known algorithms: Dochev-Byrnev’s method and Ehrlich’s method. Second, using Proinov’s approach to studying convergence of iterative methods for polynomial zeros, we provide a semilocal convergence theorem that unifies the results of Proinov (Appl. Math. Comput. 284: 102–114, 2016) for Dochev-Byrnev’s and Ehrlich’s methods.     

Semilocal convergence analysis for the modified Newton-HSS method under the Hölder condition

The present paper is concerned with theoretical properties of the modified Newton-HSS method for large sparse non-Hermitian positive definite systems of nonlinear equations. Assuming that the nonlinear operator satisfies the Hölder continuity condition, a new semilocal convergence theorem for the modified Newton-HSS method is established. The Hölder continuity condition is milder than the usual Lipschitz condition. The semilocal convergence theorem is established by using the majorizing principle, which is based on the concept of majorizing sequence given by Kantorovich. Two real valued functions and two real sequences are used to establish the convergence criterion. Furthermore, a numerical example is given to show application of our theorem.     

A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems

In this article, a modified PRP algorithm is presented for unconstrained optimization problems. This method possesses sufficiently descent property and the proposed direction is in a trust region. The global convergence and the linear convergence rate of the given method are established under weaker conditions. Numerical results show that the presented method is effective.     

Modified Newton method in circular interval arithmetic

The modified Newton method for multiple roots is organized in an interval method to include simultaneously the distinct roots of a given polynomialP in complex circular interval arithmetic. A condition on the starting disks which ensures convergence is given, and convergence is shown to be quadratic. As a consequence, a simple parallel algorithm to approach all the distinct roots ofP is derived from the modified Newton method.The research reported in this paper has been made possible through the support and the sponsorship of the Italian Government through the Ministero per l'Universitá e la Ricerca Scientifica under Contract MURST 60%, 1990 at the Universitá di L'Aquila.     

Convergence rates for Kaczmarz-type algorithms

By making use of the normal and skew-Hermitian splitting (NSS) method as the inner solver for the modified Newton method, we establish a class of modified Newton-NSS method for solving large sparse systems of nonlinear equations with positive definite Jacobian matrices at the solution points. Under proper conditions, the local convergence theorem is proved. Furthermore, the successive-overrelaxation (SOR) technique has been proved quite successfully in accelerating the convergence rate of the NSS or the Hermitian and skew-Hermitian splitting (HSS) iteration method, so we employ the SOR method in the NSS iteration, and we get a new method, which is called modified Newton SNSS method. Numerical results are given to examine its feasibility and effectiveness.     

Convergence analysis of generalized nonlinear inexact Uzawa algorithm for stabilized saddle point problems

This paper deals with a modified nonlinear inexact Uzawa (MNIU) method for solving the stabilized saddle point problem. The modified Uzawa method is an inexact inner-outer iteration with a variable relaxation parameter and has been discussed in the literature for uniform inner accuracy. This paper focuses on the general case when the accuracy of inner iteration can be variable and the convergence of MNIU with variable inner accuracy, based on a simple energy norm. Sufficient conditions for the convergence of MNIU are proposed. The convergence analysis not only greatly improves the existing convergence results for uniform inner accuracy in the literature, but also extends the convergence to the variable inner accuracy that has not been touched in literature. Numerical experiments are given to show the efficiency of the MNIU algorithm.     

On the convergence radius of the modified Newton method for multiple roots under the center–Hölder condition

It is very important to enlarge the convergence ball of an iterative method. Recently, the convergence radius of the modified Newton method for finding multiple roots of nonlinear equations has been presented by Ren and Argyros when the involved function is Hölder and center–Hölder continuous. Different from the technique and the hypothesis used by them, in this paper, we also investigate the convergence radius of the modified Newton method under the condition that the derivative $f^{(m)}$ of function f satisfies the center–Hölder continuous condition. The radius given here is larger than that given by Ren and Argyros. The uniqueness ball of solution is also discussed. Some examples are given to show applications of our theorem.     

A fifth-order iterative method for solving nonlinear equations

The object of this paper is to construct a new efficient iterative method for solving nonlinear equations. This method is mainly based on Javidi paper [1] by using a new scheme of a modified homotopy perturbation method. This new method is of the fifth order of convergence, and it is compared with the second-, third-, fifth-, and sixth-ordermethods. Some numerical test problems are given to show the accuracy and fast convergence of the method proposed.     

具有全局收敛性的求解对称非线性方程组的一个修改的信赖域方法

本文给出一个求解非线性对称方程组问题的修改的信赖域方法,在适当的条件下我们将建立此方法的全局收敛性.对给定的问题而言,数值结果表明此方法是有效的.     

A modified PRP conjugate gradient method

This paper gives a modified PRP method which possesses the global convergence of nonconvex function and the R-linear convergence rate of uniformly convex function. Furthermore, the presented method has sufficiently descent property and characteristic of automatically being in a trust region without carrying out any line search technique. Numerical results indicate that the new method is interesting for the given test problems. This work is supported by Guangxi University SF grands X061041 and China NSF grands 10761001.