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

DOI10.1007/BF02241861MaRDI QIDQ1262084zbMATH OpenOpenAlexFDO

Authors Deren Wang, Fengguang Zhao

Publication date 1989

Published in Computing (Search for Journal in Brave)

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

zbMATH Keywords

complex polynomialcomplexity analysisiterative methodsstarting valueszeros

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 authors consider the problem to find starting values for certain iterative methods for the simultaneous computation of the zeros of a complex polynomial.

Cites work

• Circular arithmetic and the determination of polynomial zeros
• Generalised Root Iterations for the Simultaneous Determination of Multiple Complex Zeros
• scientific article; zbMATH DE number 3635964 (Why is no real title available?)
• On the convergence order of a modified method for simultaneous finding polynomial zeros
• On the Convergence Speed of Some Algorithms for the Simultaneous Approximation of Polynomial Roots

Cited in

(10)

• Algebraic complexity of computing polynomial zeros
• On the determination of the safe initial approximation for the Durand- Kerner algorithm
• The globalization of Durand-Kerner algorithm
• On the convergence of high-order Ehrlich-type iterative methods for approximating all zeros of a polynomial simultaneously
• scientific article; zbMATH DE number 440790 (Why is no real title available?)
• On the local convergence of Ehrlich method for numerical computation of polynomial zeros
• scientific article; zbMATH DE number 4037051 (Why is no real title available?)
• scientific article; zbMATH DE number 1131781 (Why is no real title available?)
• The Root Separation of Polynomials and Some Applications
• On the local convergence of Gargantini-Farmer-Loizou method for simultaneous approximation of multiple polynomial zeros

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

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