Efficient polynomial system-solving by numerical methods
DOI10.1007/S11784-009-0113-XzbMATH Open1213.65075OpenAlexW2056822011MaRDI QIDQ2431371FDOQ2431371
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
Recommendations
complexityNewton's methodhomotopy methodsresearch surveyMike Shubpolynomial equation-solvingSteve Smalesystems of multi-variate polynomial equations
Complexity and performance of numerical algorithms (65Y20) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical computation of roots of polynomial equations (65H04)
Cited In (11)
- Smale's fundamental theorem of algebra reconsidered
- Spherical Radon transform and the average of the condition number on certain Schubert subvarieties of a Grassmannian
- Title not available (Why is that?)
- An elimination method for polynomial systems
- The complexity and geometry of numerically solving polynomial systems
- Efficient polynomial system solving by numerical methods
- Numerical Solution of a Class of Deficient Polynomial Systems
- Rigid continuation paths I. Quasilinear average complexity for solving polynomial systems
- Thirty years of polynomial system solving, and now?
- An efficient method for computing resultant systems
- Decoupling highly structured polynomial systems
Uses Software
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)