On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
type: Item
instance of: scholarly article
zbMATH Open document ID: 0699.30031
DOI: 10.2307/2008771
author: Myong-Hi Kim
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 30E05
Mathematics Subject Classification ID: 65E05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4146356
zbMATH Keywords: Newton's method
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.2307/2008771
OpenAlex ID: W4234679182
title: On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
cites work: Q4177796
cites work: A proof of the Bieberbach conjecture
cites work: Q4072022
cites work: Q3285751
cites work: Q5546070
cites work: Families of rational maps and iterative root-finding algorithms
cites work: Computational complexity. On the geometry of polynomials and a theory of cost. I
cites work: Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
cites work: On the existence of generally convergent algorithms
cites work: The fundamental theorem of algebra and complexity theory
cites work: On the efficiency of algorithms of analysis
Recommended article: Random Polynomials and Approximate Zeros of Newton’s Method
Recommended article: On Euler-like methods for the simultaneous approximation of polynomial zeros
Recommended article: Algorithms – ESA 2005
Recommended article: How to be sure of finding a root of a complex polynomial using Newton's method
Recommended article: Approximate Zeros of Quadratically Convergent Algorithms
description: scientific article; zbMATH DE number 4146356