arXiv Analytics

Sign in

arXiv:1211.1528 [math.NA]AbstractReferencesReviewsResources

The complexity and geometry of numerically solving polynomial systems

Carlos Beltran, Michael Shub

Published 2012-11-07Version 1

These pages contain a short overview on the state of the art of efficient numerical analysis methods that solve systems of multivariate polynomial equations. We focus on the work of Steve Smale who initiated this research framework, and on the collaboration between Stephen Smale and Michael Shub, which set the foundations of this approach to polynomial system--solving, culminating in the more recent advances of Carlos Beltran, Luis Miguel Pardo, Peter Buergisser and Felipe Cucker.

Related articles: Most relevant | Search more
arXiv:1908.05943 [math.NA] (Published 2019-08-16)
Algorithms and Complexity for Functions on General Domains
arXiv:1409.6714 [math.NA] (Published 2014-09-23)
Some Results on the Complexity of Numerical Integration
arXiv:1511.05414 [math.NA] (Published 2015-11-17)
Complexity of Oscillatory Integrals on the Real Line