The Durand-Kerner polynomials roots-finding method in case of multiple roots

DOI10.1007/BF01952788zbMath0719.65039OpenAlexW2026629868MaRDI QIDQ2640316

Pierre Fraigniaud

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01952788

zbMATH Keywords

polynomial zerosmultiple zerosquadratic-like convergenceDurand-Kerner algorithm

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 (9)

On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials ⋮ Simultaneous factorization of a polynomial by rational approximation ⋮ Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials ⋮ On some methods for the simultaneous determination of polynomial zeros ⋮ On simultaneous factoring of a polynomial ⋮ Numerical computation of polynomial zeros by means of Aberth's method ⋮ Durand-Kerner method for the real roots ⋮ Multiplicity estimating algorithm for zeros of a complex polynomial and its applications ⋮ Symmetric functions and exact Lyapunov exponents

Cites Work

• Unnamed Item
• Two observations on Durand-Kerner's root-finding method
• Simultaneous determination of polynomial roots and multiplicities: An algorithm and related problems
• Finding the roots of a polynomial on an MIMD multicomputer
• Initial approximations in Durand-Kerner's root finding method
• The Durand-Kerner method for trigonometric and exponential polynomials
• On some iteration functions for the simultaneous computation of multiple complex polynomial zeros
• Convergence of the Newton process to multiple solutions
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• The evaluation of the zeros of ill-conditioned polynomials. I, II
• A Globally Convergent Method for Simultaneously Finding Polynomial Roots
• Methods of finding simultaneously all the roots of algebraic, trigonometric, and exponential equations
• On the efficiency of algorithms of analysis
• An algorithm for the total, or partial, factorization of a polynomial
• Methods for the simultaneous approximate derivation of the roots of algebraic, trigonometric and exponential equations
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots
• A modified Newton method for polynomials

This page was built for publication: The Durand-Kerner polynomials roots-finding method in case of multiple roots