Superlinear convergence theorem in the ABSg class of algorithms for nonlinear algebraic equations (Q1093536)
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: Superlinear convergence theorem in the ABSg class of algorithms for nonlinear algebraic equations |
scientific article; zbMATH DE number 4023028
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Superlinear convergence theorem in the ABSg class of algorithms for nonlinear algebraic equations |
scientific article; zbMATH DE number 4023028 |
Statements
Superlinear convergence theorem in the ABSg class of algorithms for nonlinear algebraic equations (English)
0 references
1988
0 references
It is shown that, when two subclasses of algorithms in the ABSg family are applied to a set of nonlinear algebraic equations, then the convergence is superlinear. The conditions for the theorem to be true are essentially the same as those that apply to the Newton method.
0 references
conjugate direction methods
0 references
projection algorithms
0 references
superlinear convergence
0 references
nonlinear algebraic equations
0 references
