Foundations of Computational Mathematics

, Volume 7, Issue 1, pp 1–58 | Cite as

On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One

  • M. Giusti
  • G. Lecerf
  • B. Salvy
  • J.-C. Yakoubsohn


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.


Approximation Algorithm Cluster Location Location Criterion Newton Iteration Simple Zero 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Laboratoire STIX, Ecole Polytechnique, 91128 PalaiseauFrance
  2. 2.Laboratoire de Mathematiques, Universite de Versailles Saint-Quentin-en-Yvelines, 45 avenue des Etats-Unis, 78035 VersaillesFrance
  3. 3.Project ALGO, INRIA Rocquencourt, 78153 Le ChesnayFrance
  4. 4.Laboratoire MIP, Bureau 131, Universite Paul Sabatier, 118 route de Narbonne, 31062 ToulouseFrance

Personalised recommendations