Multiple zeros of nonlinear systems

Abstract

As an attempt to bridge between numerical analysis and algebraic geometry, this paper formulates the multiplicity for the general nonlinear system at an isolated zero, presents an algorithm for computing the multiplicity structure, proposes a depth-deflation method for accurate computation of multiple zeros, and introduces the basic algebraic theory of the multiplicity. Furthermore, this paper elaborates and proves some fundamental properties of the multiplicity, including local finiteness, consistency, perturbation invariance, and depth-deflatability. As a justification of this formulation, the multiplicity is proved to be consistent with the multiplicity defined in algebraic geometry for the special case of polynomial systems. The proposed algorithms can accurately compute the multiplicity and the multiple zeros using floating point arithmetic even if the nonlinear system is perturbed.

Cited by in corpus (17)

• Enumerating rigid sphere packings
• Certifying isolated singular points and their multiplicity structure
• Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
• The Pitchfork Bifurcation
• Multidimensional Realization Theory and Polynomial System Solving
• On the sensitivity of singular and ill-Conditioned linear systems
• Complexity of Sparse Polynomial Solving 2: Renormalization
• Computing tensor eigenvalues via homotopy methods
• Punctual Hilbert Schemes and Certified Approximate Singularities
• On isolation of singular zeros of multivariate analytic systems
• Approximation Numérique de Racines Isolées Multiples de Systèmes Analytiques
• Computing Simple Multiple Zeros of Polynomial Systems
• Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One
• Singular algebraic equations with empirical data
• On deflation and multiplicity structure
• The Breadth-one $D$-invariant Polynomial Subspace
• A New Deflation Method For Verifying the Isolated Singular Zeros of Polynomial Systems