Efficient polynomial system-solving by numerical methods

DOI10.1007/S11784-009-0113-XMaRDI QIDQ2431371zbMATH OpenOpenAlexFDO

Authors 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

complexityhomotopy methodsMike ShubNewton's methodpolynomial equation-solvingresearch surveySteve Smalesystems of multi-variate polynomial equations

Mathematics Subject Classification ID

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

Recommendations

• Efficient polynomial system solving by numerical methods
• The complexity and geometry of numerically solving polynomial systems
• Resolution of polynomial systems
• Numerically determining solutions of systems of polynomial equations
• Smale's fundamental theorem of algebra reconsidered

Cited in

(11)

• Thirty years of polynomial system solving, and now?
• An efficient method for computing resultant systems
• An elimination method for polynomial systems
• Numerical Solution of a Class of Deficient Polynomial Systems
• Efficient polynomial system solving by numerical methods
• Smale's fundamental theorem of algebra reconsidered
• Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
• scientific article; zbMATH DE number 1057749 (Why is no real title available?)
• Decoupling highly structured polynomial systems
• Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
• The complexity and geometry of numerically solving polynomial systems

Describes a project that uses

Uses Software

• Kronecker

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

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