Skip to Main content Skip to Navigation
Conference papers

CERTIFICATION FOR POLYNOMIAL SYSTEMS VIA SQUARE SUBSYSTEMS

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [42 references]  Display  Hide  Download

https://hal.inria.fr/hal-02912296
Contributor : Alain Monteil <>
Submitted on : Wednesday, August 5, 2020 - 3:49:36 PM
Last modification on : Wednesday, August 5, 2020 - 5:14:12 PM
Long-term archiving on: : Monday, November 30, 2020 - 3:00:24 PM

File

10.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02912296, version 1

Collections

Citation

Timothy Duff, Nickolas Hein, Frank Sottile. CERTIFICATION FOR POLYNOMIAL SYSTEMS VIA SQUARE SUBSYSTEMS. MEGA 2019 - International Conference on Effective Methods in Algebraic Geometry, Jun 2019, Madrid, Spain. ⟨hal-02912296⟩

Share

Metrics

Record views

32

Files downloads

81