On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial

DOI10.2307/2008771zbMath0699.30031OpenAlexW4234679182MaRDI QIDQ3477120

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

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

Related Items

Point estimation of simultaneous methods for solving polynomial equations: A survey. II. ⋮ On the guaranteed convergence of the square-root iteration method ⋮ The guaranteed convergence of Laguerre-like method ⋮ Geometry of polynomials and root-finding via path-lifting ⋮ On the convergence condition of generalized root iterations for the inclusion of polynomial zeros ⋮ Unified complexity analysis for Newton LP methods ⋮ Improved algorithms for computing determinants and resultants ⋮ The convergence of a family of parallel zero-finding methods ⋮ Kronecker's and Newton's approaches to solving: a first comparison ⋮ Approximate Zeros of Quadratically Convergent Algorithms ⋮ Point estimation of simultaneous methods for solving polynomial equations: A survey ⋮ Point estimation of a family of simultaneous zero-finding methods ⋮ On the convergence of Wang-Zheng's method ⋮ A short survey on Kantorovich

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of the Bieberbach conjecture
• On the existence of generally convergent algorithms
• Families of rational maps and iterative root-finding algorithms
• Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
• On the efficiency of algorithms of analysis
• Computational complexity. On the geometry of polynomials and a theory of cost. I
• The fundamental theorem of algebra and complexity theory