A symbolic-numerical method for finding a real solution of an arbitrary system of nonlinear algebraic equations (Q1281848)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A symbolic-numerical method for finding a real solution of an arbitrary system of nonlinear algebraic equations |
scientific article; zbMATH DE number 1268451
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A symbolic-numerical method for finding a real solution of an arbitrary system of nonlinear algebraic equations |
scientific article; zbMATH DE number 1268451 |
Statements
A symbolic-numerical method for finding a real solution of an arbitrary system of nonlinear algebraic equations (English)
0 references
16 September 1999
0 references
A hybrid symbolic-numerical method is proposed for finding solutions of systems of polynomial equations which may be overdetermined or underdetermined. A reduction algorithm due to \textit{J. F. Ritt} [Differential equations from the algebraic standpoint (1932; Zbl 0005.39404)] is used to derive sets of regular systems from the original system. The regular systems have Jacobians which are of full rank. For such systems a Gauss-Newton method can be applied. A convergence result analogous to the Newton-Kantorovich theory is given for an appropriate starting value for a regular system. Two numerical examples are given involving an underdetermined system and an overdetermined system.
0 references
system of nonlinear algebraic equations
0 references
symbolic-numerical methods
0 references
reduction algorithm
0 references
Gauss-Newton method
0 references
convergence
0 references
numerical examples
0 references
underdetermined system
0 references
overdetermined system
0 references
0 references
0 references
0.8974646
0 references