A new start system for solving deficient polynomial systems using continuation

DOI10.1016/0096-3003(91)90059-VMaRDI QIDQ1178319zbMATH OpenOpenAlexFDO

Authors J. Verschelde, Marc Beckers, Ann Haegemans

Publication date 26 June 1992

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(91)90059-v

zbMATH Keywords

\(m\)-homogeneous structurehomotopy continuation methodisolated zerospolynomial systemstart systemtarget system

Mathematics Subject Classification ID

Real polynomials: location of zeros (26C10) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Review text

When the homotopy continuation method is used to solve all finite isolated zeros of a polynomial system, some wasted computation can be saved if the start system is constructed properly to respect the \(m\)- homogeneous structure of the target system. This article suggests a way to robotically construct a start system which has the same \(m\)- homogeneous structure as the target system. This paper also contains some criticism of the homotopy procedures by \textit{T.-Y. Li, T. Sauer} and \textit{J. A. Yorke} [SIAM J. Numer. Anal. 26, No. 5, 1241-1251 (1989; Zbl 0689.65032)] and by \textit{T. Y. Li} and \textit{X. Wang} [A more efficient homotopy for solving deficient polynomial systems, Tech. Rep., Michigan State Univ. (1989)]. Unfortunately, that criticism is based on certain misunderstandings and misinterpretations of those works.

Recommendations

• An efficient start system for multi-homogeneous polynomial continuation
• The random product homotopy and deficient polynomial systems
• Solving Deficient Polynomial Systems with Homotopies which Keep the Subschemes at Infinity Invariant
• A simple homotopy for solving deficient polynomial systems
• scientific article; zbMATH DE number 2109418

Cites work

• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• A homotopy for solving polynomial systems
• Computing all solutions to polynomial systems using homotopy continuation
• scientific article; zbMATH DE number 47206 (Why is no real title available?)
• scientific article; zbMATH DE number 50337 (Why is no real title available?)
• The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
• The theory of Gröbner bases

Cited in

(10)

• Incomplete Gröbner basis as a preconditioner for polynomial systems
• The random product homotopy and deficient polynomial systems
• Symbolic homotopy construction
• An efficient start system for multi-homogeneous polynomial continuation
• Symmetric homotopy construction
• Polynomial root finding by means of continuation
• Solving polynomial systems by polyhedral homotopies
• A search for an optimal start system for numerical homotopy continuation
• The GBQ-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems
• A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems

This page was built for publication: A new start system for solving deficient polynomial systems using continuation

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