Certification for polynomial systems via square subsystems
From MaRDI portal
Publication:820969
DOI10.1016/J.JSC.2020.07.010zbMATH Open1476.14103arXiv1812.02851OpenAlexW3041626282MaRDI QIDQ820969FDOQ820969
Authors: Timothy Duff, Nickolas Hein, Frank Sottile 
Publication date: 29 September 2021
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Abstract: We consider numerical certification of approximate solutions to a system of polynomial equations with more equations than unknowns by first certifying solutions to a square subsystem. We give several approaches that certifiably select which are solutions to the original overdetermined system. These approaches each use different additional information for this certification, such as liaison, Newton-Okounkov bodies, or intersection theory. They may be used to certify individual solutions, reject nonsolutions, or certify that we have found all solutions.
Full work available at URL: https://arxiv.org/abs/1812.02851
Recommendations
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Certifying simple zeros of over-determined polynomial systems
- A heuristic method for certifying isolated zeros of polynomial systems
- Effective certification of approximate solutions to systems of equations involving analytic functions
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
intersection theorySchubert calculuspolynomial systemnumerical algebraic geometryliaisonalpha theorycertified solutionsNewton-Okounkov bodies
Numerical computation of solutions to systems of equations (65H10) Algorithms with automatic result verification (65G20) Geometric aspects of numerical algebraic geometry (14Q65)
Cites Work
- Newton methods for nonlinear problems. Affine invariance and adaptive algorithms.
- Title not available (Why is that?)
- Introduction to Interval Analysis
- Validated numerics. A short introduction to rigorous computations.
- Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
- Gorenstein liaison, complete intersection liaison invariants and unobstructedness
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal Error Bounds for the Newton–Kantorovich Theorem
- Solving zero-dimensional systems through the rational univariate representation
- Title not available (Why is that?)
- Newton's method for overdetermined systems of equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The number of roots of a system of equations
- Title not available (Why is that?)
- Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Algorithm 921: alphaCertified: certifying solutions to polynomial systems
- Title not available (Why is that?)
- Complexity of Bezout's Theorem I: Geometric Aspects
- Mixed volume and an extension of intersection theory of divisors
- The Kantorovich Theorem for Newton's Method
- Title not available (Why is that?)
- A primal-dual formulation for certifiable computations in Schubert calculus
- Safe Starting Regions for Iterative Methods
- Title not available (Why is that?)
- Enumerative geometry for the real Grassmannian of lines in projective space
- Numerical algebraic geometry
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- A lifted square formulation for certifiable Schubert calculus
- Using SAGBI bases to compute invariants
- Effective certification of approximate solutions to systems of equations involving analytic functions
- Khovanskii bases, higher rank valuations, and tropical geometry
- A short survey on Kantorovich-like theorems for Newton's method
- Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm
Cited In (11)
- Certifying polynomials for AC^0(parity) circuits, with applications
- Newton-Okounkov bodies of chemical reaction systems
- Certification Using Newton-Invariant Subspaces
- Effective certification of approximate solutions to systems of equations involving analytic functions
- \texttt{SubalgebraBases} in Macaulay2
- Numerical homotopies from Khovanskii bases
- Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
- Certifying simple zeros of over-determined polynomial systems
- On the equations defining some Hilbert schemes
- Certifying solutions to square systems of polynomial-exponential equations
- Certifying approximate solutions to polynomial systems on Macaulay2
Uses Software
This page was built for publication: Certification for polynomial systems via square subsystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820969)
