Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices

DOI10.1016/j.amc.2012.08.037zbMath1291.65114OpenAlexW2008164806MaRDI QIDQ2250218

Diego D. Zontini, Jin Yun Yuan

Publication date: 4 July 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.08.037

zbMATH Keywords

convergencecomparison theorem\(M\)-matrixconjecturepreconditionerGauss-Seidel method

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (4)

A preconditioned AOR iterative scheme for systems of linear equations with \(L\)-matrics ⋮ Preconditioned parallel multisplitting USAOR method for \(H\)-matrices linear systems ⋮ Convergence analysis of the two preconditioned iterative methods for \(M\)-matrix linear systems ⋮ A new family of \((I+S)\)-type preconditioner with some applications

Cites Work

• Unnamed Item
• Unnamed Item
• A note on the preconditioned Gauss--Seidel (GS) method for linear systems
• Convergence of parallel multisplitting iterative methods for M-matrices
• Modified iterative methods for consistent linear systems
• The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method.
• A comparison theorem for the iterative method with the preconditioner \((I+S_{max})\)
• Comparison results for solving preconditioned linear systems
• COMPARISON RESULTS FOR THE PRECONDITIONED GAUSS-SEIDEL METHODS
• Adaptive gauss-seidel method for linear systems
• The AOR iterative method for new preconditioned linear systems

This page was built for publication: Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices