Complexity analysis of a process for simultaneously obtaining all zeros of polynomials

DOI10.1007/BF02241861zbMath0685.65042OpenAlexW26388196MaRDI QIDQ1262084

Fengguang Zhao, Deren Wang

Publication date: 1989

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

zerositerative methodscomplexity analysiscomplex polynomialstarting values

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

On the local convergence of Ehrlich method for numerical computation of polynomial zeros ⋮ The globalization of Durand-Kerner algorithm ⋮ The Root Separation of Polynomials and Some Applications ⋮ On the determination of the safe initial approximation for the Durand- Kerner algorithm ⋮ On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros ⋮ On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously

Cites Work

• Unnamed Item
• On the convergence order of a modified method for simultaneous finding polynomial zeros
• Circular arithmetic and the determination of polynomial zeros
• Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

This page was built for publication: Complexity analysis of a process for simultaneously obtaining all zeros of polynomials