Fast intersection methods for the solution of some nonlinear systems of equations (Q2570879)
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: Fast intersection methods for the solution of some nonlinear systems of equations |
scientific article; zbMATH DE number 2220758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast intersection methods for the solution of some nonlinear systems of equations |
scientific article; zbMATH DE number 2220758 |
Statements
Fast intersection methods for the solution of some nonlinear systems of equations (English)
0 references
31 October 2005
0 references
Summary: We give a fast method to solve numerically some systems of nonlinear equations. This method applies basically to all systems which can be put in the form \(U\circ V(X)=Y\), where \(U\) and \(V\) are two possibly nonlinear operators. It uses a modification of Newton's algorithm, in the sense that one projects alternatively onto two subsets. But, here, these subsets are not subspaces any more, but manifolds in an Euclidean space.
0 references
systems of nonlinear equations
0 references
Newton's algorithm
0 references
0.9124873
0 references
0.8991295
0 references
0.8942957
0 references
0.8894275
0 references
0.8838774
0 references
0.8835705
0 references