• 论文 •

### 非线性方程组的Newton流线法

1. 高性能计算与随机信息处理省部共建教育部重点实验室 湖南师范大学数学与计算机科学学院, 长沙 410081
• 收稿日期:2011-06-26 出版日期:2012-08-15 发布日期:2012-08-16
• 基金资助:

国家自然科学基金(No.11071067)资助项目.

Chen Chuanmiao, Hu Hongling, Lei Lei, Zeng Xingxing. NEWTON FLOW METHOD FOR NONLINEAR SYSTEMS OF EQUATIONS[J]. Mathematica Numerica Sinica, 2012, 34(3): 235-258.

### NEWTON FLOW METHOD FOR NONLINEAR SYSTEMS OF EQUATIONS

Chen Chuanmiao, Hu Hongling, Lei Lei, Zeng Xingxing

1. Key Laboratory of High Performance Computing and Stochastic Information Processing (Ministry of Education of China), College of Mathematics and Computer Science, Hunan Normal University, Changsha 410081, China
• Received:2011-06-26 Online:2012-08-15 Published:2012-08-16

To solve nonlinear systems of equations F(x)=0, Newton’s flow equation xt=V(x)=-(DF(x))-1F(x),x(0)=x0, and its numerical flow xj+1=xj+hV(xj),h∈(0,1]. are studied. The damped index gj(h)=||F(xj+1)||/||F(xj)||=1-h+h2djh<1 and refine expression gj(h)=(1-h/m)m+h2O(||xj-x*||). near the m-ple root x? are derived. Finally based on fourth computable quantities gj,dj,Kj,qj, a new Newton flow algorithm is proposed, which can find all real, multiple and complex roots, if put into a large number of stochastic initial points.

MR(2010)主题分类:

()
 [1] Alexander J C and Yorke J A. The homotopy continuation method: numerically implementabletopological procedures[J]. Trans. Amer. Math. Soc., 1978, 242: 271-284.[2] Allgower E. A survey of homotopy methods for smooth mappings[J]. Springer Lecture notes inMath., 1981, 878: 1-29.[3] Allgower E and Georg K. Simplicial and continuation methods for approximating fixed points[J].SIAM Rev., 1980, 22: 28-85.[4] Allgower E, Georg K. Computational solution of nonlinear system of equations. Lecture in AppliedMathematics Series, American Mathematical society, Providence, 1990.[5] Allgower E, Georg K. Introduction to numerical continuation methods. Classics. In Applied Mathematics.SIAM, 2003, 45.[6] Branin F. Widely convergent method for finding multiple solution of simultaneous nonlinear equations[J]. IBM J. Res. Develop, 1972, 16: 504-522.[7] 蔡大用, 白峰杉. 现代科学计算[M]. 北京: 科学出版社, 2000.[8] 陈传淼. 科学计算概论[M]. 北京: 科学出版社, 2007.[9] 陈传淼, 谢资清. 非线性微分方程多解计算的搜索延拓法[M]. 北京: 科学出版社, 2005.[10] Park Chin-Hong, Shim Homh-Tae. What is the homotopy for a system of nonlinear equations(survey)? J. Appl. Math. Computing, 2005, 17(1-2-3): 689-700.[11] Davidenko D F. On the approximate solution of systems of nonlinear equations[J]. Ukrain. Mat.Z., 1953, 5: 196-206.[12] Deuflhard P. Newton Method for Nonlinear Problems: Affine Invariance and Adaptive Algorithms.Berlin, Heidelberg: Spinger-Verlag, 2004.[13] Garcia C B, Gould F J(1978). Relations between several path following algorithms and local andglobal Newton methods[J]. SIAM Rev., 1980, 22: 263-274.[14] Keller H B(1978). Global homotopies and Newton methods. In: Recent advances in numericalanalysis. C.de Boor and G.H.Golub editors. Academic Press. New York, London, 1978, 73-94.[15] 李庆扬, 莫孜中, 祁力群. 非线性方程组的数值解[M]. 北京: 科学出版社, 1987.[16] Li T Y, Sauer T. Regularity results for solving systems of polynomials by homotopy method[J].Numer. Math., 1987, 30: 283-289.[17] Meryer G H. On Solving nonlinear equations with a one-parameter operator imbedding[J]. SIAMJ. Numer. Anal., 1968, 5.[18] Percell P. Note on a global homotopy[J]. Numer. Funct. Anal. Optim., 1980, 2: 99-106.[19] Shen Z. Diffeomorphism and the feasibility of the numerical continuation methods[J]. NonlinearAnalysis TMA, 1985, 9(5): 495-502.[20] Smale S. A convergence process of price adjustment and global Newton methods[J]. J. Math.Econom., 1976, 3: 1-14.[21] Smale S. Algorithms for solving equations. Intern. Congress of Math. 1986.[22] Smale S. Mathematical problems for next century. Lecture given on the occasion of Arnold 60thbirthday at the Fields Institute, Torondo, June 1997.[23] Wacker H. Continuation methods. Academic Press. New York, 1978.[24] Wacker H. A summary of the development on imbedding methods. Academic Press. New York,1978. 1-35.[25] Zulehner W. A simple homotopy method for determining all isolated solutions to polynomialsystems[J]. Math. Comp., 1988, 50: 167-177.
 [1] 马积瑞, 范金燕. 信赖域方法在Hölderian局部误差界下的收敛性质[J]. 计算数学, 2021, 43(4): 484-492. [2] 刘金魁, 孙悦, 赵永祥. 凸约束伪单调方程组的无导数投影算法[J]. 计算数学, 2021, 43(3): 388-400. [3] 裕静静, 江平, 刘植. 两类五阶解非线性方程组的迭代算法[J]. 计算数学, 2017, 39(2): 151-166. [4] 郭俊, 吴开腾, 张莉, 夏林林. 一种新的求非线性方程组的数值延拓法[J]. 计算数学, 2017, 39(1): 33-41. [5] 张旭, 檀结庆, 艾列富. 一种求解非线性方程组的3p阶迭代方法[J]. 计算数学, 2017, 39(1): 14-22. [6] 刘晴, 檀结庆, 张旭. 一种基于Chebyshev迭代解非线性方程组的方法[J]. 计算数学, 2015, 37(1): 14-20. [7] 王洋, 伍渝江, 付军. 一类弱非线性方程组的Picard-MHSS迭代方法[J]. 计算数学, 2014, 36(3): 291-302. [8] 张旭, 檀结庆. 三步五阶迭代方法解非线性方程组[J]. 计算数学, 2013, 35(3): 297-304. [9] 杨爱利, 伍渝江, 李旭, 孟玲玲. 一类非线性方程组的Newton-PSS迭代法[J]. 计算数学, 2012, 34(4): 329-340. [10] 杨柳, 陈艳萍. 求解非线性方程组的一种新的全局收敛的Levenberg-Marquardt算法[J]. 计算数学, 2008, 30(4): 388-396. [11] 袁功林,鲁习文,韦增欣,. 具有全局收敛性的求解对称非线性方程组的一个修改的信赖域方法[J]. 计算数学, 2007, 29(3): 225-234. [12] 安恒斌,白中治. NGLM:一类全局收敛的Newton-GMRES方法[J]. 计算数学, 2005, 27(2): 151-174. [13] 杨柳,陈艳萍. 一种新的Levenberg-Marquardt算法的收敛性[J]. 计算数学, 2005, 27(1): 55-62. [14] 赵双锁,张新平. H-非线性方程组的一种高效迭代解法[J]. 计算数学, 2000, 22(4): 417-428. [15] 白中治. 异步并行非线性对称Gauss-Seidel迭代算法[J]. 计算数学, 1998, 20(2): 187-.