The preconditioned Gauss-Seidel method faster than the SOR method

DOI10.1016/J.CAM.2007.07.002MaRDI QIDQ935766zbMATH OpenOpenAlexFDO

Authors Hiroshi Niki, Toshiyuki Kohno, Munenori Morimoto

Publication date 8 August 2008

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2007.07.002

zbMATH Keywords

convergencenumerical examplespreconditioningM-matrixGauss-Seidel methodsuccessive overrelaxation (SOR)splitting

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Recommendations

• Study on the preconditioners \((I+S_m)\)
• Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices
• Preconditioning the linear system for the sor method
• A note on the preconditioned Gauss--Seidel (GS) method for linear systems
• The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method.

Cites work

• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• A comparison theorem for the iterative method with the preconditioner \((I+S_{max})\)
• Accelerated iterative method for \(Z\)-matrices
• Adaptive gauss-seidel method for linear systems
• Comparisons of nonnegative splittings of matrices
• Improving the modified Gauss-Seidel method for \(Z\)-matrices
• Matrix theory. Basic results and techniques
• Modified iterative methods for consistent linear systems
• On optimal improvements of classical iterative schemes for \(Z\)-matrices
• The Gauss-Seidel iterative method with the preconditioning matrix \((I+S+S_m)\)
• The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method.

Cited in

(13)

• The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method.
• Two new modified Gauss-Seidel methods for linear system with M-matrices
• ESOR method with diagonal preconditioners for SPD linear systems
• A parallel bio-inspired shortest path algorithm
• Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices
• Erratum to: ``A note on the preconditioned Gauss-Seidel method for \(M\)-matrices
• Convergence analysis of the new splitting preconditioned SOR-type iterative methods for the linear system
• A note on the preconditioner \(P_m = (I + S_m)\)
• An acceleration technique for the Gauss-Seidel method applied to symmetric linear systems
• A new effective preconditioned Gauss-Seidel iterative method
• The optimal preconditioner for the generalized interval SOR method
• An extended \(GS\) method for dense linear systems
• Preconditioned SOR interative methods for \(L\)-matrices

This page was built for publication: The preconditioned Gauss-Seidel method faster than the SOR method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935766)