On location and approximation of clusters of zeros: Case of embedding dimension one (Q870481): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marc Giusti / rank
 
Normal rank
Property / author
 
Property / author: Grégoire Lecerf / rank
 
Normal rank
Property / author
 
Property / author: Bruno Salvy / rank
 
Normal rank
Property / author
 
Property / author: Jean-Claude Yakoubsohn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: mctoolbox / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FGb / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10208-004-0159-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101413883 / rank
 
Normal rank

Revision as of 20:25, 19 March 2024

scientific article
Language Label Description Also known as
English
On location and approximation of clusters of zeros: Case of embedding dimension one
scientific article

    Statements

    On location and approximation of clusters of zeros: Case of embedding dimension one (English)
    0 references
    12 March 2007
    0 references
    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.
    0 references
    0 references
    zeros of analytic maps
    0 references
    Newton method
    0 references
    convergence
    0 references
    iterative method
    0 references
    clusters of isolated zeros
    0 references
    algorithms
    0 references
    numerical experiments
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references