CERTIFICATION FOR POLYNOMIAL SYSTEMS VIA SQUARE SUBSYSTEMS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

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.
Fichier principal
Vignette du fichier
10.pdf (405.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02912296 , version 1 (05-08-2020)

Identifiers

  • HAL Id : hal-02912296 , version 1

Cite

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⟩

Collections

MEGA MEGA2019
29 View
60 Download

Share

Gmail Facebook Twitter LinkedIn More