Preconditioned conjugate gradient method for rank deficient least-squares problems (Q4944666)
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 1420191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preconditioned conjugate gradient method for rank deficient least-squares problems |
scientific article; zbMATH DE number 1420191 |
Statements
Preconditioned conjugate gradient method for rank deficient least-squares problems (English)
0 references
13 November 2000
0 references
conjugate gradient method
0 references
preconditioning
0 references
comparison of methods
0 references
rank deficient least squares problems
0 references
large sparse problems
0 references
error bounds
0 references
iterative method
0 references
successive overrelaxation
0 references
0 references
0.8324221968650818
0 references
0.8253089189529419
0 references
0.8211305141448975
0 references
0.8150890469551086
0 references
Some conjugate gradient methods for solving rank deficient least squares problems are proposed. Such iterative methods are preferred for handling large sparse problems. Error bounds and comparison with 2-block and 3-block successive overrelaxation methods are investigated. It is shown theoretically that the best iterative method is the conjugate gradient method for solving rank deficient least squares problems. No results of computational experiments are given.
0 references
