Solving polynomial systems equation by equation
zbMATH Open1136.65052arXivmath/0503688MaRDI QIDQ5447288FDOQ5447288
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
Recommendations
numerical examplesembeddinghomotopy continuationpolynomial systemnumerical algebraic geometrywitness pointwitness setgeneric pointirreducible componentalgebraic setpath followingnumerical irreducible decompositioncomponent of solutionsdiagonal homotopyequation-by-equation solver
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) Polynomials, factorization in commutative rings (13P05) Computational aspects of higher-dimensional varieties (14Q15)
Cited In (19)
- A concise proof of the Kronecker polynomial system solver from scratch
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- \(u\)-generation: solving systems of polynomials equation-by-equation
- Title not available (Why is that?)
- On the bit complexity of polynomial system solving
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Algorithms for computing triangular decomposition of polynomial systems
- Homotopies for Intersecting Solution Components of Polynomial Systems
- Title not available (Why is that?)
- An intrinsic homotopy for intersecting algebraic varieties
- Title not available (Why is that?)
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- Systems of equations with a single solution
- Evaluating and differentiating a polynomial using a pseudo-witness set
- MRHS Equation Systems that can be Solved in Polynomial Time
- Foreword. What is numerical algebraic geometry?
- Regeneration homotopies for solving systems of polynomials
- Sampling algebraic sets in local intrinsic coordinates
Uses Software
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)