Solving polynomial systems equation by equation

MaRDI QIDQ5447288zbMATH OpenFDO

Authors J. Verschelde, Charles W. Wampler, Andrew J. Sommese

Publication date 6 March 2008

Full work available at URL https://arxiv.org/abs/math/0503688

zbMATH Keywords

algebraic setcomponent of solutionsdiagonal homotopyembeddingequation-by-equation solvergeneric pointhomotopy continuationirreducible componentnumerical algebraic geometrynumerical examplesnumerical irreducible decompositionpath followingpolynomial systemwitness pointwitness set

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Computational aspects of higher-dimensional varieties (14Q15) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Recommendations

• Homotopies for Intersecting Solution Components of Polynomial Systems
• Regeneration homotopies for solving systems of polynomials
• scientific article; zbMATH DE number 1069614
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• A homotopy for solving polynomial systems

Cited in

(20)

• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• On the bit complexity of polynomial system solving
• Unification and extension of intersection algorithms in numerical algebraic geometry
• An intrinsic homotopy for intersecting algebraic varieties
• A concise proof of the Kronecker polynomial system solver from scratch
• Sampling algebraic sets in local intrinsic coordinates
• Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
• MRHS Equation Systems that can be Solved in Polynomial Time
• Regeneration homotopies for solving systems of polynomials
• Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
• Algorithms for computing triangular decomposition of polynomial systems
• scientific article; zbMATH DE number 1057749 (Why is no real title available?)
• scientific article; zbMATH DE number 1475153 (Why is no real title available?)
• Homotopies for Intersecting Solution Components of Polynomial Systems
• Systems of equations with a single solution
• Evaluating and differentiating a polynomial using a pseudo-witness set
• Foreword. What is numerical algebraic geometry?
• scientific article; zbMATH DE number 6403662 (Why is no real title available?)
• \(u\)-generation: solving systems of polynomials equation-by-equation
• A Kronecker algorithm for locally closed sets over a perfect field

Describes a project that uses

Uses Software

• Kronecker
• PHCpack

This page was built for publication: Solving polynomial systems equation by equation

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