Isosingular sets and deflation
algorithmdeflationdeflation sequenceirreducible algebraic setisosingular pointisosingular setlocal dimensionmultiplicityNewton's methodnumerical algebraic geometrypolynomial systemregularizationsingularity structuresymbolic methodsystems of polynomialsThom-Boardman singularity theorywitness pointwitness set
Deflation is an important method of regularizing nonreduced solution sets of systems of polynomials over the complex numbers so that, for example, Newton's method can be applied to approximate solutions to arbitrary accuracy. The current article defines three new, equivalent methods of deflation, each having specific strengths and weaknesses. In particular, the method based on determinants (as in the Thom-Boardman singularity theory) avoids introducing extra variables, so that the deflated algebraic set is the same as the original. A second method, which does employ additional variables, reduces the number of polynomials and does not increase degrees, thus making it useful for numerical work. The third method more closely resembles previous definitions of deflation. All three have the advantage of building a complete basis for the null space of \(Jf(x)\) (where \(f: \mathbb{C}^N \rightarrow \mathbb{C}^n\) is a polynomial system, and \(J\) is the Jacobian), as opposed to just the one vector in the null space that previous definitions produced. Additionally, the approach taken leads to a finite stratification of the system's singularities such that each solution is a smooth point on a unique isosingular subset, allowing Newton's method to be applied to non-generic, as well as generic, solutions. Deflation is defined in terms of the deflation operator, the repeated application of which is called a deflation sequence. The authors prove that ultimately this sequence stabilizes, and they give both numeric and symbolic methods for computing deflation sequences, as well as for determining when they have stabilized. The article defines an isosingular set as the (nonempty, irreducible) closure of a set of points in an algebraic set with the same deflation sequence. The deflation sequence stabilizes to the dimension of the set. The number of such sets for a given polynomial system is shown to be finite, and an algorithm is given to compute all of them. It is shown that every isosingular set is generically isomorphic to an irreducible and generically reduced component of a polynomial system constructed using deflation. There are several examples within the paper. It is shown that the isosingular sets of the Whitney umbrella are the irreducible surface, the ``handle, and the origin. Additionally, a detailed description of the computation of the isosingular sets of a ``foldable Stewart-Gough platform, an example arising from kinematics, is provided.
- On deflation and multiplicity structure
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- Deflation and certified isolation of singular zeros of polynomial systems
- Certifying isolated singular points and their multiplicity structure
- Newton's method with deflation for isolated singularities of polynomial systems
- A power series method for computing singular solutions to nonlinear analytic systems
- Adaptive Multiprecision Path Tracking
- Analysis of Newton’s Method at Irregular Singularities
- Computing singular solutions to nonlinear analytic systems
- Computing singular solutions to polynomial systems
- Computing the multiplicity structure in solving polynomial systems
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- Efficient path tracking methods
- Finding all real points of a complex curve
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 2100972 (Why is no real title available?)
- scientific article; zbMATH DE number 5245181 (Why is no real title available?)
- Mechanism mobility and a local dimension test
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Newton's method with deflation for isolated singularities of polynomial systems
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Numerical primary decomposition
- Numerically intersecting algebraic varieties via witness sets
- On location and approximation of clusters of zeros: Case of embedding dimension one
- Polyhedral end games for polynomial continuation
- Quadratic Newton iteration for systems with multiplicity
- Regeneration homotopies for solving systems of polynomials
- Regenerative cascade homotopies for solving polynomial systems
- Singularities of differentiable maps
- SINGULARITIES OF SMOOTH MAPPINGS
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Stepsize control for path tracking
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Using Algebraic Geometry
- Witness sets of projections
- A heuristic method for certifying isolated zeros of polynomial systems
- Tensor decomposition and homotopy continuation
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Global structure of curves from generalized unitarity cut of three-loop diagrams
- Numerical algebraic geometry and semidefinite programming
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- Smooth points on semi-algebraic sets
- Isosingular loci of algebraic varieties
- Binomiality testing and computing sparse polynomials via witness sets
- Improved two-step Newton's method for computing simple multiple zeros of polynomial systems
- Multiprojective witness sets and a trace test
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- Computing complex and real tropical curves using monodromy
- Adaptive strategies for solving parameterized systems using homotopy continuation
- Cell decomposition of almost smooth real algebraic surfaces
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- On deflation and multiplicity structure
- Machine learning the real discriminant locus
- Decomposing solution sets of polynomial systems using derivatives
- Perturbed homotopies for finding all isolated solutions of polynomial systems
- Numerical irreducible decomposition over a number field
- Newton polytopes and witness sets
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- A numerical approach for computing Euler characteristics of affine varieties
- Foreword. What is numerical algebraic geometry?
- Eliminating dual spaces
- Numerical algorithms for detecting embedded components
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- On Computing the Nonlinearity Interval in Parametric Semidefinite Optimization
- A Newton’s iteration converges quadratically to nonisolated solutions too
- Two-step Newton's method for deflation-one singular zeros of analytic systems
- Solving parameterized polynomial systems with decomposable projections
- On computing local monodromy and the numerical local irreducible decomposition
- Deflation Conjecture and Local Dimensions of Brent Equations
- Sampling smooth points on real algebraic sets using perturbations
- Numerical elimination and moduli space of vacua
- Sweeping algebraic curves for singular solutions
This page was built for publication: Isosingular sets and deflation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q358629)
