The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations

DOI10.1137/0726069zbMath0689.65032OpenAlexW2109596995MaRDI QIDQ3031836

Timothy Sauer, James A. Yorke, Tien-Yien Li

Publication date: 1989

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0726069

zbMATH Keywords

system of polynomial equationsdeficient systemscheater's homotopyParameter continuation

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Operations research and management science (90B99) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)

Related Items (34)

Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods ⋮ Decomposable sparse polynomial systems ⋮ Homotopies for solving polynomial systems within a bounded domain ⋮ Perturbed homotopies for finding all isolated solutions of polynomial systems ⋮ Finding all flux vacua in an explicit example ⋮ Exploring the potential energy landscape over a large parameter-space ⋮ Finding all real zeros of polynomial systems using multi-resultant ⋮ The globalization of Durand-Kerner algorithm ⋮ Unmixing the mixed volume computation ⋮ HomPINNs: homotopy physics-informed neural networks for solving the inverse problems of nonlinear differential equations with multiple solutions ⋮ Piecewise homotopy methods for nonlinear ordinary differential equations ⋮ Minimizing multi-homogeneous Bézout numbers by a local search method ⋮ A new start system for solving deficient polynomial systems using continuation ⋮ Decoupling highly structured polynomial systems ⋮ Mixed cell computation in HOM4ps ⋮ Numerical Evidence for a Conjecture in Real Algebraic Geometry ⋮ Computing singular solutions to polynomial systems ⋮ A systematic framework for solving geometric constraints analytically ⋮ The maximum likelihood degree of toric varieties ⋮ A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems ⋮ Galois groups of Schubert problems via homotopy computation ⋮ Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling ⋮ A homotopy method with adaptive basis selection for computing multiple solutions of differential equations ⋮ HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method ⋮ Solving decomposable sparse systems ⋮ Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes ⋮ An adaptive homotopy method for computing bifurcations of nonlinear parametric systems ⋮ A Numerical Method for Computing Border Curves of Bi-parametric Real Polynomial Systems and Applications ⋮ Numerical algebraic geometry and algebraic kinematics ⋮ Toric Newton method for polynomial homotopies ⋮ Directed acyclic decomposition of Kuramoto equations ⋮ Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets ⋮ Computing real witness points of positive dimensional polynomial systems

This page was built for publication: The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations