A note on two block-SOR methods for sparse least squares problems (Q1090078): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Iterative Methods for Equality-Constrained Least Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Direct Method for the Least Squares Solution of Slightly Overdetermined Sets of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jordan-Elimination und Ausgleichung nach kleinsten Quadraten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a direct-iterative method for large-scale least-squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of block iterative methods applied to sparse least-squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The least squares problem and pseudo-inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank

Latest revision as of 19:14, 17 June 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
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references