Improving the order of convergence of iteration functions
From MaRDI portal
Publication:1301699
DOI10.1016/S0377-0427(98)00131-9zbMath0935.65052MaRDI QIDQ1301699
Publication date: 12 September 1999
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
numerical examplesorder of convergenceroot-finding methodsmultiple rootsacceleration of convergenceiteration functionsreal or complex functionsingle equations
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to single equations (65H05)
Related Items (5)
Some third-order families of iterative methods for solving nonlinear equations ⋮ A preconditioned iterative method for solving systems of nonlinear equations having unknown multiplicity ⋮ Family of Cubically Convergent Schemes Using Inverse Newton Function for Multiple Roots ⋮ A simply constructed third-order modification of Newton's method ⋮ A study of accelerated Newton methods for multiple polynomial roots
Cites Work
This page was built for publication: Improving the order of convergence of iteration functions