Numerical aspects of the generalized CG-method applied to least squares problems (Q1114333): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02238742 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W402460180 / rank | |||
Normal rank | |||
Latest revision as of 10:48, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical aspects of the generalized CG-method applied to least squares problems |
scientific article |
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
