On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial

DOI10.2307/2008771MaRDI QIDQ3477120zbMATH OpenOpenAlexFDO

Authors Myong-Hi Kim

Publication date 1988

Full work available at URL https://doi.org/10.2307/2008771

zbMATH Keywords

Newton's method

Mathematics Subject Classification ID

Moment problems and interpolation problems in the complex plane (30E05) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Random Polynomials and Approximate Zeros of Newton’s Method
• On Euler-like methods for the simultaneous approximation of polynomial zeros
• Algorithms – ESA 2005
• How to be sure of finding a root of a complex polynomial using Newton's method
• Approximate Zeros of Quadratically Convergent Algorithms

Cites work

• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• A proof of the Bieberbach conjecture
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• Families of rational maps and iterative root-finding algorithms
• scientific article; zbMATH DE number 3167270 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 3613366 (Why is no real title available?)
• scientific article; zbMATH DE number 3260031 (Why is no real title available?)
• On the efficiency of algorithms of analysis
• On the existence of generally convergent algorithms
• The fundamental theorem of algebra and complexity theory

Cited in

(22)

• Unified complexity analysis for Newton LP methods
• On the convergence of Wang-Zheng's method
• Improved algorithms for computing determinants and resultants
• The convergence of a family of parallel zero-finding methods
• Point estimation of a family of simultaneous zero-finding methods
• Initial approximations in Euler-Chebyshev's method
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
• Robust approximate zeros in Banach space
• Accelerated approximation of the complex roots of a univariate polynomial
• Finding polynomial roots: A fast algorithm convergent on the complex plane
• Approximate Zeros of Quadratically Convergent Algorithms
• Geometry of polynomials and root-finding via path-lifting
• On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
• A short survey on Kantorovich-like theorems for Newton's method
• Algorithms and Computation
• Random Polynomials and Approximate Zeros of Newton’s Method
• Kronecker's and Newton's approaches to solving: a first comparison
• Point estimation of simultaneous methods for solving polynomial equations: A survey
• On the guaranteed convergence of the square-root iteration method
• The guaranteed convergence of Laguerre-like method
• On the convergence condition of generalized root iterations for the inclusion of polynomial zeros

This page was built for publication: On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial

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