Preconditioned GAOR methods for solving weighted linear least squares problems (Q2519716)

From MaRDI portal
Revision as of 04:49, 19 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Preconditioned GAOR methods for solving weighted linear least squares problems
scientific article

    Statements

    Preconditioned GAOR methods for solving weighted linear least squares problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    The paper is interesting and well written. In order to solve the weighted linear least squares problem, one has to solve a linear system \(Hy=f\). To solve the linear system, there are the three iterative methods: Jacobi, Gauss-Seidel and SOR (successive overrelaxation), then AOR (accelerated overrelaxation) method and finally GAOR (generalized AOR) method. In order to decrease the spectral radius of the iteration matrix, and to increase the convergence rate, the authors propose to precondition the linear system, namely to take \(H^{\sim}y=f^{\sim}\); hence they introduce the preconditioned GAOR method. Two kinds of preconditioning are proposed, each one containing three preconditioners. The convergence rates of the proposed six preconditioned GAOR methods are better than the rate of the original GAOR method, whenever this is convergent. A numerical example confirms the theoretical results.
    0 references
    preconditioning
    0 references
    weighted linear least squares problem
    0 references
    linear system
    0 references
    convergence
    0 references
    comparison
    0 references
    Jacobi method
    0 references
    Gauss-Seidel method
    0 references
    successive overrelaxation
    0 references
    accelerated overrelaxation
    0 references
    numerical example
    0 references

    Identifiers