Computing singular solutions of polynomial systems: towards superlinear convergence without deflation

DOI10.48550/arXiv.2607.06329MaRDI QIDQ7283957arXivFDO

Authors Vladimir Kolmogorov, Jeferson Zapata, Mikhail Karapetyants

Publication date 7 July 2026

Published in arXiv

Tldr We introduce an Arclength Endgame with superlinear convergence in some neighborhood of the root that uses only system evaluations. We extend this idea to larger corank systems via a Lifted Arclength Endgame and present improved methods for estimating Puiseux series exponents.

Full work available at URL https://doi.org/10.48550/arXiv.2607.06329

arXiv classification

math.NA

Cites work

• A Polyhedral Method for Solving Sparse Polynomial Systems
• A power series method for computing singular solutions to nonlinear analytic systems
• An algorithm for calculating Hermite-based finite difference weights
• Certifying isolated singular points and their multiplicity structure
• Computing singular solutions to polynomial systems
• Deflation algorithm for the multiple roots of a system of nonlinear equations
• Discrete approximations related to nonlinear theories of solids
• Kantorovich's Theorem on Newton's Method
• Newton's method with deflation for isolated singularities of polynomial systems
• Newton’s Method for Singular Problems when the Dimension of the Null Space is $>1$
• Numerically solving polynomial systems with Bertini
• On the topology of algebroid singularities
• Sur le problème de la division
• The Application of Newton’s Method to the Problem of Elastic Stability
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science

This page was built for publication: Computing singular solutions of polynomial systems: towards superlinear convergence without deflation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7283957)