Nonlinear reduction for solving deficient polynomial systems by continuation methods

DOI10.1007/BF01385861MaRDI QIDQ1195900zbMATH OpenOpenAlexWikidataFDO

Authors J. Verschelde, Ronald Cools

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

\(S\)-polynomialscontinuation methodsdeficient polynomial systemreduction algorithmsymbolic elimination methods

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) Symbolic computation and algebraic computation (68W30)

Review text

Neither continuation methods, nor symbolic elimination methods can be directly applied to compute all finite solutions of polynomial systems, because the amount of computational time is mostly not proportional to the dimension of the system and to the number of finite solutions. The notion of \(S\)-polynomials is used to develop a reduction algorithm to lower the total degree of the deficient polynomial system, so that computing the solutions at infinity can be avoided. Applying the reduction algorithm before solving the system with continuation methods, yields a reliable solution method.

Recommendations

• The continuation method for rational and deficient systems
• Numerical Solution of a Class of Deficient Polynomial Systems
• The random product homotopy and deficient polynomial systems
• scientific article; zbMATH DE number 2109418
• The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations

Cites work

• Globally convergent homotopy methods: A tutorial
• scientific article; zbMATH DE number 3857249 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 3676228 (Why is no real title available?)
• scientific article; zbMATH DE number 50337 (Why is no real title available?)
• scientific article; zbMATH DE number 96390 (Why is no real title available?)
• On an installation of Buchberger's algorithm
• Solving Deficient Polynomial Systems with Homotopies which Keep the Subschemes at Infinity Invariant
• Testing Unconstrained Optimization Software

Cited in

(4)

• Incomplete Gröbner basis as a preconditioner for polynomial systems
• Symmetric homotopy construction
• The continuation method for rational and deficient systems
• Numerical Solution of a Class of Deficient Polynomial Systems

Describes a project that uses

Uses Software

• minpack
• Groebner

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

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