Algorithm 921: alphaCertified: certifying solutions to polynomial systems
From MaRDI portal
Abstract: Smale's alpha-theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to a square polynomial system. The program alphaCertified implements algorithms based on alpha-theory to certify solutions to polynomial systems using both exact rational arithmetic and arbitrary precision floating point arithmetic. It also implements an algorithm to certify whether a given point corresponds to a real solution to a real polynomial system, as well as algorithms to heuristically validate solutions to overdetermined systems. Examples are presented to demonstrate the algorithms.
Recommendations
- Certifying solutions to square systems of polynomial-exponential equations
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Certification Using Newton-Invariant Subspaces
- Certifying reality of projections
- Effective certification of approximate solutions to systems of equations involving analytic functions
Cited in
(65)- A heuristic method for certifying isolated zeros of polynomial systems
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- Robust certified numerical homotopy tracking
- Numerically computing real points on algebraic sets
- A new deflation method for verifying the isolated singular zeros of polynomial systems
- Solving decomposable sparse systems
- Euclidean distance degree and mixed volume
- Smooth points on semi-algebraic sets
- Exact solutions in log-concave maximum likelihood estimation
- On the equations defining some Hilbert schemes
- Mixed precision path tracking for polynomial homotopy continuation
- Seven mutually touching infinite cylinders
- Homotopy techniques for tensor decomposition and perfect identifiability
- Computing complex and real tropical curves using monodromy
- Adaptive strategies for solving parameterized systems using homotopy continuation
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- A certified iterative method for isolated singular roots
- Machine learning the real discriminant locus
- Certified Hermite matrices from approximate roots
- The average condition number of most tensor rank decomposition problems is infinite
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation
- Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials
- A primal-dual formulation for certifiable computations in Schubert calculus
- Statistics of stationary points of random finite polynomial potentials
- A certified numerical algorithm for the topology of resultant and discriminant curves
- Algebraic geometrization of the Kuramoto model: Equilibria and stability analysis
- Algebraic certification of numerical algorithms computing Lagrange resolvents
- Efficient certification of numeric solutions to eigenproblems
- Using monodromy to avoid high precision in homotopy continuation
- Overdetermined Weierstrass iteration and the nearest consistent system
- Epsilon local rigidity and numerical algebraic geometry
- Polymake.jl: a new interface to \texttt{polymake}
- Foreword. What is numerical algebraic geometry?
- Mixed cell computation in HOM4ps
- Certifying solutions to square systems of polynomial-exponential equations
- A lifted square formulation for certifiable Schubert calculus
- Effective certification of approximate solutions to systems of equations involving analytic functions
- Identifying the number of components in Gaussian mixture models using numerical algebraic geometry
- 96120: the degree of the linear orbit of a cubic surface
- Generic properties of dispersion relations for discrete periodic operators
- The Secant Conjecture in the Real Schubert Calculus
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
- Experiments on the zeros of harmonic polynomials using certified counting
- Probabilistic saturations and Alt's problem
- Certifying approximate solutions to polynomial systems on Macaulay2
- Algebraic compressed sensing
- Using monodromy to recover symmetries of polynomial systems
- VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities
- Rigid continuation paths II. structured polynomial systems
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Conics meeting eight lines over perfect fields
- Massively parallel computation of tropical varieties, their positive part, and tropical Grassmannians
- Effective Reconstruction of Generic Genus 5 Curves from their Theta Hyperplanes
- An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search
- Certifying zeros of polynomial systems using interval arithmetic
- Effective alpha theory certification using interval arithmetic: alpha theory over regions
- Robust numerical algebraic geometry
- Galois groups in enumerative geometry and applications
- Exact certificates for the solvability of stabilization problems through numerical algebraic geometry
- Certified homotopy tracking using the Krawczyk method
- Numerical elimination and moduli space of vacua
- Numerical polynomial homotopy continuation method and string vacua
- Certification for polynomial systems via square subsystems
- Inflation of poorly conditioned zeros of systems of analytic functions
This page was built for publication: Algorithm 921: alphaCertified: certifying solutions to polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989171)
