Certifying solutions to overdetermined and singular polynomial systems over
Authors:
- Tulay Ayyildiz AkogluTATulay Ayyildiz Akoglu
- Jonathan D. HauensteinJHJonathan D. Hauenstein
- Agnes SzantoASAgnes Szanto
- 1 January 2018
- journal article
- research article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 84, 147-171
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Ministry of National Education of Turkey
- Defense Advanced Research Projects Agency (YFA D14AP00052)
- Alfred P. Sloan Research Fellowship (BR2014-110 TR14)
- National Science Foundation (DMS-1262428, ACI-1440583)
- National Science Foundation (CCF-1217557)
This publication has 42 references indexed in Scilit:
- Robust Certified Numerical Homotopy TrackingFoundations of Computational Mathematics, 2013
- On the Minimum of a Polynomial Function on a Basic Closed Semialgebraic Set and ApplicationsSIAM Journal on Optimization, 2013
- Algorithm 921ACM Transactions on Mathematical Software, 2012
- Certified Numerical Homotopy TrackingExperimental Mathematics, 2012
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin)Journal of Symbolic Computation, 2008
- Sharp estimates for the arithmetic NullstellensatzDuke Mathematical Journal, 2001
- Newton’s method for overdetermined systems of equationsMathematics of Computation, 1999
- Analysis of PSLQ, an integer relation finding algorithmMathematics of Computation, 1999
- Lower bounds for diophantine approximationsJournal of Pure and Applied Algebra, 1997
- Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbersMathematics of Computation, 1988