Convergence conditions of some methods for the simultaneous computation of polynomial zero
From MaRDI portal
Publication:1272804
DOI10.1007/s100920050005zbMath0913.65040OpenAlexW1990281657MaRDI QIDQ1272804
Publication date: 25 May 1999
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s100920050005
convergenceNewton's methodzeros of polynomialsiterative methodsAberth's methodDurand-Kerner's method
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 the local convergence of Ehrlich method for numerical computation of polynomial zeros, Exact symbolic-numeric computation of planar algebraic curves, On new higher order families of simultaneous methods for finding polynomial zeros, Solving secular and polynomial equations: a multiprecision algorithm, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, General local convergence theory for a class of iterative processes and its applications to Newton's method, General convergence theorems for iterative processes and applications to the Weierstrass root-finding method, On the guaranteed convergence of new two-point root-finding methods for polynomial zeros, On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros, On the convergence of Halley's method for multiple polynomial zeros, On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously, Real polynomial root-finding by means of matrix and polynomial iterations, Accelerated approximation of the complex roots and factors of a univariate polynomial
