Use of preconditioned Krylov subspaces in conjugate gradient-type methods for solving a nonlinear least squares problem (Q2563388)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 957045
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Use of preconditioned Krylov subspaces in conjugate gradient-type methods for solving a nonlinear least squares problem |
scientific article; zbMATH DE number 957045 |
Statements
Use of preconditioned Krylov subspaces in conjugate gradient-type methods for solving a nonlinear least squares problem (English)
0 references
11 December 1996
0 references
The problem of nonlinear least squares is solved by a family of globally convergent methods. At each iteration linear search is done in the direction of the Krylov subspace corresponding to the current residual and the preconditioned from the right Jacobian. The search direction can be interpreted as a solution to the linearized system. The convergence conditions are some rather weak conditions on the search directions and the smoothness of the Jacobian.
0 references
nonlinear least squares
0 references
Krylov subspace method
0 references
0.8341909050941467
0 references
0.8048428297042847
0 references
0.8027763366699219
0 references
