Preconditioned GAOR methods for solving weighted linear least squares problems (Q2519716): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cam.2008.04.034 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2008.04.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972510327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence of the generalized AOR method for linear systems with diagonally dominant coefficient matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convergence of the generalized accelerated overrelaxation method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified iterative methods for consistent linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated Overrelaxation Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements of preconditioned AOR iterative method for \(L\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Jacobi and Gauss-Seidel iterations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for generalized least squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioned SOR methods for generalized least-squares problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of the generalized AOR method / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CAM.2008.04.034 / rank
 
Normal rank

Latest revision as of 04:49, 19 December 2024

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