Numerical aspects of the generalized CG-method applied to least squares problems (Q1114333)
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 4082839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Numerical aspects of the generalized CG-method applied to least squares problems |
scientific article; zbMATH DE number 4082839 |
Statements
Numerical aspects of the generalized CG-method applied to least squares problems (English)
0 references
1989
0 references
The authors consider the generalized conjugate gradient method of \textit{P. Concus} and \textit{G. M. Golub} [Lect. Notes Econ. Math. Syst. 134, 56-65 (1976; Zbl 0344.65020)] and its adjusted form (AGCG) in comparison to standard conjugate gradient method and the SOR method for linear least squares problems. The numerical experiments performed indicate that AGCG is superior, in terms of CPU time, to generalized and standard gradients and SOR on the problems tried.
0 references
successive overrelaxation
0 references
generalized conjugate gradient method
0 references
linear least squares problems
0 references
numerical experiments
0 references
0 references
0.9051907062530518
0 references
0.8637501001358032
0 references
0.8618528842926025
0 references
