A generalized successive overrelaxation method for least squares problems (Q1267026): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Chang-jun Li / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Horst Hollatz / rank
Normal rank
 

Revision as of 07:39, 14 February 2024

scientific article
Language Label Description Also known as
English
A generalized successive overrelaxation method for least squares problems
scientific article

    Statements

    A generalized successive overrelaxation method for least squares problems (English)
    0 references
    0 references
    0 references
    0 references
    18 February 1999
    0 references
    A new iterative method (called generalized successive overrelaxation) is given for solving large sparse least squares problems and computing the minimum norm solution to underdetermined consistent linear systems. The method is convergent if the matrix has full column rank. The method involves a matrix \(P\) as a preconditioner and a parameter \(\rho\) as an accelerator parameter. By suitable choosing of matrix \(P\) parallel computations are possible.
    0 references
    large sparse least squares problems
    0 references
    iterative methods
    0 references
    generalized successive overrelaxation
    0 references
    minimum norm solution
    0 references
    preconditioner
    0 references
    parallel computations
    0 references

    Identifiers

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