Validating the Completeness of the Real Solution Set of a System of Polynomial Equations

DOI10.1145/2930889.2930910zbMath1362.13027arXiv1602.00700OpenAlexW2499901546MaRDI QIDQ2985821

Jonathan D. Hauenstein, Daniel A. Brake, Alan C. jun. Liddell

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

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

zbMATH Keywords

polynomialsnumerical analysisnumerical algebraic geometryvalidationreal solutionspolynomial solving

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Solving polynomial systems; resultants (13P15)

Related Items (4)

Dual Certificates and Efficient Rational Sum-of-Squares Decompositions for Polynomial Optimization over Compact Sets ⋮ Computing real radicals and \(S\)-radicals of polynomial systems ⋮ A hybrid procedure for finding real points on a real algebraic set ⋮ Numerical algebraic geometry and semidefinite programming

Uses Software

• Sostools
• alphaCertified
• Bertini_real

This page was built for publication: Validating the Completeness of the Real Solution Set of a System of Polynomial Equations