Some computational methods for systems of nonlinear equations and systems of polynomial equations

DOI10.1007/BF00122427MaRDI QIDQ1201902zbMATH OpenFDO

Publication date 17 January 1993

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00122427

homotopy methods Kuhn's method Nielsen fixed point theory pivoting algorithms simplicial algorithms systems of nonlinear equations systems of polynomial equations zeros of a polynomial

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

The paper presents a survey of computational methods for solving systems of nonlinear equations and, in particular, systems of polynomial equations. The emphasis is laid on simplicial algorithms and homotopy methods and, in fact, the material on other methods only consists of relatively general observations. After introductory comments, simplicial algorithms and their application are discussed and Kuhn's method for finding all zeros of a polynomial is presented and analyzed. Then homotopy methods are introduced for general systems and considered in more detail for systems of polynomial equations. Some enhancements of known methods are suggested in the paper but no numerical details are included.

Recommendations

Cites work

Cited in

(5)

Describes a project that uses

Uses Software

This page was built for publication: Some computational methods for systems of nonlinear equations and systems of polynomial equations

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