Newton's method with deflation for isolated singularities of polynomial systems
Theoretical Computer Science
On the probability distribution of singular varieties of given corank
Journal of Symbolic Computation
Nearest multivariate system with given root multiplicities
Journal of Symbolic Computation
Evaluation techniques for zero-dimensional primary decomposition
Journal of Symbolic Computation
Computing nearest Gcd with certification
Proceedings of the 2009 conference on Symbolic numeric computation
A subdivision method for computing nearest gcd with certification
Theoretical Computer Science
Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
SIAM Journal on Numerical Analysis
Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one
Theoretical Computer Science
Hi-index | 0.00 |
At the beginning of the 1980s, M. Shub and S. Smale developed a quantitative analysis of Newton's method for multivariate analytic maps. In particular, their α-theory gives an effective criterion that ensures safe convergence to a simple isolated zero. This criterion requires only information concerning the map at the initial point of the iteration. Generalizing this theory to multiple zeros and clusters of zeros is still a challenging problem. In this paper we focus on one complex variable function. We study general criteria for detecting clusters and analyze the convergence of Schroder's iteration to a cluster. In the case of a multiple root, it is well known that this convergence is quadratic. In the case of a cluster with positive diameter, the convergence is still quadratic provided the iteration is stopped sufficiently early. We propose a criterion for stopping this iteration at a distance from the cluster which is of the order of its diameter.