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

DOI10.1007/BF01952788MaRDI QIDQ2640316zbMATH OpenOpenAlexFDO

Authors 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

Durand-Kerner algorithmmultiple zerospolynomial zerosquadratic-like convergence

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)

Review text

The author proposes a modification of the Durand-Kerner algorithm for the simultaneous computation of polynomial zeros which preserves the method's quadratic-like convergence even in the case of multiple zeros.

Cites work

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

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640316)