Multiple root-finding methods

DOI10.1016/0377-0427(92)90045-YzbMath0755.65047OpenAlexW1990749444MaRDI QIDQ1196848

M. Vander Straeten, H. van de Vel

Publication date: 16 January 1993

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(92)90045-y

zbMATH Keywords

convergence accelerationiterative algorithmsNewton-Raphson methodorder of convergenceHalley methodOstrowski methoditeration functionsmultiple root-finding methods

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (6)

The rate of multiplicity of the roots of nonlinear equations and its application to iterative methods ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ Family of Cubically Convergent Schemes Using Inverse Newton Function for Multiple Roots ⋮ Iterative methods for ill-conditioned roots ⋮ Phase path tracing methods for solving the high order zeros of nonlinear systems ⋮ An alternative analysis for the local convergence of iterative methods for multiple roots including when the multiplicity is unknown

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for computing a root of a single nonlinear equation, including its multiplicity
• Improving the Van de Vel root-finding method
• Extension of Bairstow's Method for Multiple Quadratic Factors

This page was built for publication: Multiple root-finding methods