Efficient polynomial system-solving by numerical methods

DOI10.1007/s11784-009-0113-xzbMath1213.65075MaRDI QIDQ2431371

Publication date: 13 April 2011

Published in: Journal of Fixed Point Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11784-009-0113-x

zbMATH Keywords

complexity; Newton's method; research survey; homotopy methods; Mike Shub; polynomial equation-solving; Steve Smale; systems of multi-variate polynomial equations

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations

65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

65Y20: Complexity and performance of numerical algorithms

65H04: Numerical computation of roots of polynomial equations