The complexity and geometry of numerically solving polynomial systems

DOI10.1090/CONM/604/12069zbMATH Open1317.65001arXiv1211.1528OpenAlexW1729785292MaRDI QIDQ5501604FDOQ5501604

Authors: Michael Shub, Carlos Beltran 

Publication date: 4 August 2015

Published in: Recent Advances in Real Complexity and Computation (Search for Journal in Brave)

Abstract: 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.

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

Recommendations

• Efficient polynomial system solving by numerical methods
• Efficient polynomial system-solving by numerical methods
• scientific article; zbMATH DE number 953044
• Smale's fundamental theorem of algebra reconsidered
• Resolution of polynomial systems

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)

Cited In (18)

• Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
• Smale's fundamental theorem of algebra reconsidered
• Title not available (Why is that?)
• Computing isolated roots of sparse polynomial systems in affine space
• A convex geometric approach to counting the roots of a polynomial system
• Constructing polynomial systems with many positive solutions using tropical geometry
• Geometry of polynomials and root-finding via path-lifting
• Efficient polynomial system solving by numerical methods
• Resolution of polynomial systems
• Title not available (Why is that?)
• Complexity of path-following methods for the eigenvalue problem
• On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection
• On the geometry and topology of the solution variety for polynomial system solving
• Efficient polynomial system-solving by numerical methods
• Condition length and complexity for the solution of polynomial systems
• Title not available (Why is that?)
• Condition number based complexity estimate for solving polynomial systems
• Title not available (Why is that?)

This page was built for publication: The complexity and geometry of numerically solving polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501604)