Solving large and sparse linear least-squares problems by conjugate gradient algorithms (Q1102707)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving large and sparse linear least-squares problems by conjugate gradient algorithms |
scientific article |
Statements
Solving large and sparse linear least-squares problems by conjugate gradient algorithms (English)
0 references
1988
0 references
Large and sparse least squares problems are transformed into equivalent problems which have a symmetric and positivedefinite matrix by a certain decomposition technique. The conjugate gradient algorithm (CG) is applied in the solution of the later problem. Numerical examples are performed with well-known test problems. The results illustrate that the CG algorithms applied to the modified problems is very efficient for some classes of problems.
0 references
Large and sparse least squares problems
0 references
decomposition technique
0 references
conjugate gradient algorithm
0 references
Numerical examples
0 references