The $GBQ$-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems

DOI10.1137/0730028zbMath0806.65054OpenAlexW2024922171MaRDI QIDQ4695046

Jan Verschelde, Ann Haegemans

Publication date: 9 February 1995

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

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

zbMATH Keywords

homotopy methodsrandom product homotopystart systemdeficient polynomial systemsGBQ-algorithmgeneralized Bézout numbermulti-homogenization

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Related Items (8)

Symmetric homotopy construction ⋮ A convex geometric approach to counting the roots of a polynomial system ⋮ Homotopies for solving polynomial systems within a bounded domain ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ Efficiently counting affine roots of mixed trigonometric polynomial systems ⋮ The algebraic synthesis of a spatial TS chain for a prescribed acceleration task ⋮ A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems ⋮ Polynomial Homotopy Method for the Sparse Interpolation Problem Part I: Equally Spaced Sampling

Uses Software

• HOMPACK

This page was built for publication: The $GBQ$-Algorithm for Constructing Start Systems of Homotopies for Polynomial Systems