Certification for polynomial systems via square subsystems

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of symbolic computation 2022-03, Vol.109, p.367-385
Main Authors: Duff, Timothy, Hein, Nickolas, Sottile, Frank
Format: Article
Language:English
Subjects:
Alpha theory
Certified solutions
Newton-Okounkov bodies
Numerical algebraic geometry
Polynomial system
Schubert calculus
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0747-7171
1095-855X
DOI:10.1016/j.jsc.2020.07.010