Efficient polynomial system-solving by numerical methods

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

Carlos Beltran, Luis Miguel Pardo

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

complexityNewton's methodresearch surveyhomotopy methodsMike Shubpolynomial equation-solvingSteve Smalesystems of multi-variate polynomial equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Related Items (2)

Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian ⋮ Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems

Uses Software

• Kronecker

This page was built for publication: Efficient polynomial system-solving by numerical methods