Nonlinear reduction for solving deficient polynomial systems by continuation methods

DOI10.1007/BF01385861zbMath0756.65080OpenAlexW2074560817WikidataQ57779015 ScholiaQ57779015MaRDI QIDQ1195900

Ronald Cools, Jan Verschelde

Publication date: 2 February 1993

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133681

zbMATH Keywords

continuation methodsreduction algorithmsymbolic elimination methods\(S\)-polynomialsdeficient polynomial system

Mathematics Subject Classification ID

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)

Related Items (2)

Symmetric homotopy construction ⋮ Incomplete Gröbner basis as a preconditioner for polynomial systems

Uses Software

• minpack
• Groebner

Cites Work

• Globally convergent homotopy methods: A tutorial
• On an installation of Buchberger's algorithm
• Solving Deficient Polynomial Systems with Homotopies which Keep the Subschemes at Infinity Invariant
• Testing Unconstrained Optimization Software
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Nonlinear reduction for solving deficient polynomial systems by continuation methods