Relationships between order and efficiency of a class of methods for multiple zeros of polynomials

DOI10.1016/0377-0427(94)00086-GzbMath0837.65048MaRDI QIDQ1900755

Masao Igarashi, Tjalling J. Ypma

Publication date: 1995

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

zbMATH Keywords

convergenceNewton's methodcomplex polynomialsefficiencyordermultiple roots

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05)

Related Items (5)

On the rediscovery of Halley's iterative method for computing the zero of an analytic function ⋮ Computing multiple roots of inexact polynomials ⋮ A study of accelerated Newton methods for multiple polynomial roots ⋮ Computing singular points of projective plane algebraic curves by homotopy continuation methods ⋮ On rediscovered iteration methods for solving equations

Cites Work

• Konstruktion und Durchführung von Iterationsverfahren höherer Ordnung
• Practical problems arising for finding roots of nonlinear equations
• A class of iterative methods for holomorphic functions
• A Termination Criterion for Iterative Methods Used to Find the Zeros of Polynomials
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously

This page was built for publication: Relationships between order and efficiency of a class of methods for multiple zeros of polynomials