Two observations on Durand-Kerner's root-finding method

DOI10.1007/BF01934913zbMath0551.65025MaRDI QIDQ800688

Göran Kjellberg

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

iterative methodfast convergenceDurand-Kerner methodsimultaneous determination of all zeros of a polynomial

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) Real polynomials: location of zeros (26C10)

Related Items

On quadratic-like convergence of the means for two methods for simultaneous rootfinding of polynomials, Initial approximations in Durand-Kerner's root finding method, The Durand-Kerner method for trigonometric and exponential polynomials, The behaviour of approximations of the SOR Weierstrass method, The Durand-Kerner polynomials roots-finding method in case of multiple roots, Simultaneous factorization of a polynomial by rational approximation, Multiplicity estimating algorithm for zeros of a complex polynomial and its applications, On some iteration functions for the simultaneous computation of multiple complex polynomial zeros, The Weierstrass iterative method as a Petrov-Galerkin method for solving eigenvalue problem

Cites Work

• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots