Efficient polynomial system solving by numerical methods

MaRDI QIDQ3105510zbMATH OpenFDO

Authors Carlos Beltran, Luis Miguel Pardo

Publication date 5 January 2012

zbMATH Keywords

systems of multivariate polynomial equations

Mathematics Subject Classification ID

Numerical computation of roots of polynomial equations (65H04) Numerical computation of solutions to systems of equations (65H10)

Recommendations

• Efficient polynomial system-solving by numerical methods
• The complexity and geometry of numerically solving polynomial systems
• Resolution of polynomial systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Smale's fundamental theorem of algebra reconsidered

Cited in

(10)

• Thirty years of polynomial system solving, and now?
• An efficient method for computing resultant systems
• Solving polynomial systems using numeric Gröbner bases
• Efficient polynomial system-solving by numerical methods
• Numerical Solution of a Class of Deficient Polynomial Systems
• Smale's fundamental theorem of algebra reconsidered
• scientific article; zbMATH DE number 1057749 (Why is no real title available?)
• Decoupling highly structured polynomial systems
• Review of "Numerically Solving Polynomial Systems with Bertini" by Daniel J. Bates, Jonathan D. Hauenstein, Andrew J. Sommese, and Charles W. Wampler
• 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 Q3105510)