On location and approximation of clusters of zeros: Case of embedding dimension one
algorithmsclusters of isolated zerosconvergenceiterative methodNewton methodnumerical experimentszeros of analytic maps
Software, source code, etc. for problems pertaining to several complex variables and analytic spaces (32-04) Local complex singularities (32S05) Critical points of functions and mappings on manifolds (58K05) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to systems of equations (65H10)
This is a comprehensive study of locating and approximating clusters of isolated zeros with corank one of a complex analytic map \(f\) defined on a connected open subset of \({\mathbb C}^n\). The authors generalize the \(\alpha\)-theory for simple zeros of M. Shub and S. Smale with elegant geometric majorant series. They analyze properties of clusters of embedding dimension one under small deformation and discuss reduction techniques of the location and approximation of clusters of zeros to one variable problems. Algorithms are presented for locating and approximating clusters of zeros. Particularly, computable point estimates are discussed for evaluating convergence from an initial point. Numerical experiments illustrate consistence with the theoretical analysis.
- Nearest multivariate system with given root multiplicities
- Evaluation techniques for zero-dimensional primary decomposition
- A heuristic method for certifying isolated zeros of polynomial systems
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- Clustering complex zeros of triangular systems of polynomials
- Locating the closest singularity in a polynomial homotopy
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Numerical approximation of multiple isolated roots of analytical systems
- On the probability distribution of singular varieties of given corank
- Newton's method with deflation for isolated singularities of polynomial systems
- On location and approximation of clusters of zeros of analytic functions
- On deflation and multiplicity structure
- A certified iterative method for isolated singular roots
- Computing Tropical Curves via Homotopy Continuation
- On the probability distribution of condition numbers of complete intersection varieties and the average radius of convergence of Newton's method in the underdetermined case
- A certified numerical algorithm for the topology of resultant and discriminant curves
- Isosingular sets and deflation
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one
- Computing the multiplicity structure of an isolated singular solution: case of breadth one
- Foreword. What is numerical algebraic geometry?
- On isolation of simple multiple zeros and clusters of zeros of polynomial systems
- A short survey on Kantorovich-like theorems for Newton's method
- Isolating clusters of zeros of analytic systems using arbitrary-degree inflation
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- Verified error bounds for singular solutions of nonlinear systems
- Inflation of poorly conditioned zeros of systems of analytic functions
- General local convergence theory for a class of iterative processes and its applications to Newton's method
This page was built for publication: On location and approximation of clusters of zeros: Case of embedding dimension one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870481)
