期刊文献+

求解非线性方程重根的二阶迭代法 被引量:1

A second-order iterative method for extracting multiple roots of nonlinear equations
下载PDF
导出
摘要 考虑非线性方程的求根问题,将非线性方程问题转化为求函数极值问题.利用无约束优化技术中的牛顿法,对于单根,得到的算法与New-Raphson求根算法等价;对于重根,在不计算二阶导数的情况下,给出了具有二阶收敛速度的求根算法. This paper concerns the problem of solving nonlinear equations. It is shown that solving nonlinear equations is equivalent to finding out the extremum of function. Applying Newton method of unconstrained optimization technology, the algorithm we have obtained for single root is equivalence to New-Raphson's algorithm;and for multiple roots, the root-extracting algorithm having second-order convergence rate is proposed without calculating 2-order derivatives.
作者 袁媛 杨建伟
出处 《南京信息工程大学学报(自然科学版)》 CAS 2010年第1期71-73,共3页 Journal of Nanjing University of Information Science & Technology(Natural Science Edition)
基金 国家自然科学基金(60973157) 江苏省高校自然科学基金(08KJB520004) 南京信息工程大学科研基金(JG032006J03)
关键词 优化求根 牛顿法 迭代法 重根 extraction of roots using optimization technology Newton method iteration method multiple root
  • 相关文献

参考文献8

  • 1Jain P.Steffensen type methods for solving non-linear equations. Applied Mathematics and Computation . 2007
  • 2Weerakoom,S,Fernando,T G I.A variant of Newton’s method with accelerated third-order convergence. Journal of Applied Mathematics . 2000
  • 3Grau,M.,Díaz-Barrero,J.L.An improvement to Ostrowski root-finding method. Applied Mathematics and Computation . 2006
  • 4J. Kou,Y. Li,X. Wang.Efficient Continuation Newton-like Method for Solving System of Nonlinear Equations. Applied Mathematics and Computa-tion . 2006
  • 5S Amat,S Busquier,J MGutierrez.Geometric constructions of iterative functions to solve nonlinear equations. Journal of Computational and Applied Mathematics . 2003
  • 6Ozban,A.Y.Some new variants of Newton’s method. Journal of Applied Mathematics . 2004
  • 7I.K. Argyros.Convergence and Applications of Newton-Type Iterations. . 2008
  • 8Gautschi W.Numerical AnalysisAn Introduction. . 1997

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部