An intrinsic homotopy for intersecting algebraic varieties

DOI10.1016/j.jco.2004.09.007zbMath1108.13309arXivmath/0404108MaRDI QIDQ2387424

Jan Verschelde, Charles W. Wampler, Andrew John Sommese

Publication date: 2 September 2005

Published in: Journal of Complexity (Search for Journal in Brave)

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

zbMATH Keywords

embedding; homotopy continuation; polynomial system; components of solutions; generic points; irreducible numerical algebraic geometry

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

65H10: Numerical computation of solutions to systems of equations

65H20: Global methods, including homotopy approaches to the numerical solution of nonlinear equations

13P05: Polynomials, factorization in commutative rings

14Q99: Computational aspects in algebraic geometry

Related Items

Foreword. What is numerical algebraic geometry?, Generating the isocurve representation for configuration space of mechanisms, Unification and extension of intersection algorithms in numerical algebraic geometry, A homotopy method with adaptive basis selection for computing multiple solutions of differential equations, Sampling algebraic sets in local intrinsic coordinates, Regeneration homotopies for solving systems of polynomials, Numerical algebraic geometry and algebraic kinematics

Uses Software

• PHCpack

Cites Work

• Numerical Schubert calculus
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Algorithm 795
• Homotopies for Intersecting Solution Components of Polynomial Systems
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• A Rank-Revealing Method with Updating, Downdating, and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item