Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q786515 |
||
Property / reviewed by | |||
Property / reviewed by: Werner C. Rheinboldt / rank | |||
Revision as of 22:14, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some computational methods for systems of nonlinear equations and systems of polynomial equations |
scientific article |
Statements
Some computational methods for systems of nonlinear equations and systems of polynomial equations (English)
0 references
17 January 1993
0 references
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.
0 references
pivoting algorithms
0 references
Nielsen fixed point theory
0 references
systems of nonlinear equations
0 references
systems of polynomial equations
0 references
simplicial algorithms
0 references
homotopy methods
0 references
Kuhn's method
0 references
zeros of a polynomial
0 references