Certification for polynomial systems via square subsystems

DOI10.1016/j.jsc.2020.07.010zbMath1476.14103arXiv1812.02851OpenAlexW3041626282MaRDI QIDQ820969

Nickolas Hein, Timothy Duff, Frank J. Sottile

Publication date: 29 September 2021

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.02851

zbMATH Keywords

Schubert calculusintersection theorypolynomial systemnumerical algebraic geometryliaisonalpha theorycertified solutionsNewton-Okounkov bodies

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Algorithms with automatic result verification (65G20) Geometric aspects of numerical algebraic geometry (14Q65)

Related Items (3)

On the equations defining some Hilbert schemes ⋮ Numerical homotopies from Khovanskii bases ⋮ Newton-Okounkov bodies of chemical reaction systems

Uses Software

• Macaulay2
• NewtonLib
• alphaCertified
• ISOLATE
• NumericalAlgebraicGeometry
• NumericalCertification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A primal-dual formulation for certifiable computations in Schubert calculus
• Newton-Okounkov bodies, semigroups of integral points, graded algebras and intersection theory
• A lifted square formulation for certifiable Schubert calculus
• The number of roots of a system of equations
• Solving zero-dimensional systems through the rational univariate representation
• Using SAGBI bases to compute invariants
• Enumerative geometry for the real Grassmannian of lines in projective space
• Using Gröbner bases to determine algebra membership, split surjective algebra homomorphisms determine birational equivalence
• Numerical algebraic geometry
• Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\)
• Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
• Gorenstein liaison, complete intersection liaison invariants and unobstructedness
• Algorithm 921
• Newton Methods for Nonlinear Problems
• Introduction to Interval Analysis
• Complexity of Bezout's Theorem I: Geometric Aspects
• Safe Starting Regions for Iterative Methods
• Optimal Error Bounds for the Newton–Kantorovich Theorem
• Newton's method for overdetermined systems of equations
• Effective Certification of Approximate Solutions to Systems of Equations Involving Analytic Functions
• Mixed volume and an extension of intersection theory of divisors
• Khovanskii Bases, Higher Rank Valuations, and Tropical Geometry
• A short survey on Kantorovich
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• The Kantorovich Theorem for Newton's Method
• Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm

This page was built for publication: Certification for polynomial systems via square subsystems