Regeneration homotopies for solving systems of polynomials
Publication:3081287
DOI10.1090/S0025-5718-2010-02399-3zbMath1221.65121MaRDI QIDQ3081287
Charles W. Wampler, Jonathan D. Hauenstein, Andrew John Sommese
Publication date: 7 March 2011
Published in: Mathematics of Computation (Search for Journal in Brave)
embeddinghomotopy continuationpolynomial systemalgebraic setpath followingpolyhedral homotopyirreducible componentnumerical algebraic geometrywitness pointgeneric pointnumerical irreducible decompositionproduct decompositioncomponent of solutionsdiagonal homotopyequation-by-equation solverincremental regenerationpositive dimensional solution
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) 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) Polynomials, factorization in commutative rings (13P05) Numerical computation of roots of polynomial equations (65H04)
Related Items (42)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modified deflation algorithm for the solution of singular problems. I. A system of nonlinear algebraic equations
- Deflation algorithm for the multiple roots of a system of nonlinear equations
- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- A transformation to avoid solutions at infinity for polynomial systems
- A homotopy for solving general polynomial systems that respects m- homogeneous structures
- Coefficient-parameter polynomial continuation
- Symbolic homotopy construction
- The adjunction theory of complex projective varieties
- Quadratic Newton iteration for systems with multiplicity
- Algebraic Geometry. I: Complex projective varieties.
- An intrinsic homotopy for intersecting algebraic varieties
- Newton's method with deflation for isolated singularities of polynomial systems
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
- A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
- Adaptive Multiprecision Path Tracking
- A Hybrid Polynomial System Solving Method for Mixed Trigonometric Polynomial Systems
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Algorithm 795
- Homotopies for Intersecting Solution Components of Polynomial Systems
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- A Product-Decomposition Bound for Bezout Numbers
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Computing the multiplicity structure in solving polynomial systems
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
This page was built for publication: Regeneration homotopies for solving systems of polynomials