The behavior of a multiplicity independent root-finding scheme in the presence of error

DOI10.1007/BF01933649zbMath0475.65026MaRDI QIDQ3930545

G. W. Stewart

Publication date: 1980

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

Newton's methodsecant methodmultiple zerohigh order convergenceroot finding method20, 526-528 (1980)

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (6)

Derivative free multipoint iterative methods for simple and multiple roots ⋮ Error analysis of a new transformation for multiple zeros finding free from derivative evalua\-tions ⋮ Iterative methods for ill-conditioned roots ⋮ Improved Muller method and bisection method with global and asymptotic superlinear convergence of both point and interval for solving nonlinear equations ⋮ A study of accelerated Newton methods for multiple polynomial roots ⋮ Hyman's method revisited

Cites Work

• A derivative-free transformation preserving the order of convergence of iteration methods in case of multiple zeros
• A secant method for multiple roots
• Unnamed Item

This page was built for publication: The behavior of a multiplicity independent root-finding scheme in the presence of error