On the probability distribution of singular varieties of given corank
Journal of Symbolic Computation
Approximate bivariate factorization: a geometric viewpoint
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Nearest multivariate system with given root multiplicities
Journal of Symbolic Computation
Evaluation techniques for zero-dimensional primary decomposition
Journal of Symbolic Computation
Deflation and certified isolation of singular zeros of polynomial systems
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Computing the multiplicity structure of an isolated singular solution: Case of breadth one
Journal of Symbolic Computation
An improved method for evaluating Max Noether conditions: case of breadth one
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
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 |
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This paper is in the vein of the α-theory, initiated by M. Shub and S. Smale in the beginning of the 1980s. This theory restricts to simple zeros, i.e., where the map has corank zero. In this paper we deal with situations where the analytic map has corank one at the multiple isolated zero, which has embedding dimension one in the frame of deformation theory. These situations are the least degenerate ones and therefore most likely to be of practical significance. More generally, we define clusters of embedding dimension one. We provide a criterion for locating such clusters of zeros and a fast algorithm for approximating them, with quadratic convergence. In the case of a cluster with positive diameter our algorithm stops at a distance of the cluster which is about its diameter.