Comparison results for solving preconditioned linear systems

DOI10.1016/j.cam.2004.07.022zbMath1067.65047OpenAlexW2031486174MaRDI QIDQ1763655

Wen Li

Publication date: 22 February 2005

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.2004.07.022

zbMATH Keywords

preconditioningspectral radiusirreducibilitymodified Gauss-Seidel methodnon-singular M- and Z-matrices

Mathematics Subject Classification ID

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

Related Items

Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices ⋮ A note on the preconditioned Gauss--Seidel (GS) method for linear systems ⋮ Convergence analysis of the two preconditioned iterative methods for \(M\)-matrix linear systems ⋮ On optimal improvements of classical iterative schemes for \(Z\)-matrices

Cites Work

• Unnamed Item
• Modified iterative methods for consistent linear systems
• On regular splittings of an M-matrix
• Nonnegative splitting theory
• Improving the modified Gauss-Seidel method for \(Z\)-matrices
• Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices
• A comparison theorem for the iterative method with the preconditioner \((I+S_{max})\)
• More on modifications and improvements of classical iterative schemes for \(M\)-matrices
• The convergence of the modified Gauss--Seidel methods for consistent linear systems