A note on two block-SOR methods for sparse least squares problems (Q1090078): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:19, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on two block-SOR methods for sparse least squares problems |
scientific article |
Statements
A note on two block-SOR methods for sparse least squares problems (English)
0 references
1987
0 references
Two block SOR methods of \textit{W. Niethammer}, \textit{J. de Pillis} and \textit{R. S. Varga} [ibid. 58, 327-341 (1984; Zbl 0565.65019)] and of \textit{T. L. Markham}, \textit{M. Neumann} and \textit{R. J. Plemmons} [ibid. 69, 155-167 (1985; Zbl 0576.65026)] for the solution of large least squares problems are compared with the conjugate gradient method for solving preconditioned normal equations. It is shown that the conjugate gradient method is generally preferable to the two SOR methods.
0 references
Krylov sequence
0 references
block overrelaxation
0 references
block SOR methods
0 references
large least squares problems
0 references
conjugate gradient method
0 references
preconditioned normal equations
0 references
