A note on the preconditioner P_m = (I + S_m)
From MaRDI portal
In [\textit{Wen Li}, J. Comput. Appl. Math. 182, No. 1, 81--90 (2005; Zbl 1072.65042)], the author presented a counterexample for the convergence rate comparison result shown in [\textit{H. Kotakemori}, \textit{K. Harada}, \textit{M. Morimoto} and \textit{H. Niki}, J. Comput. Appl. Math. 145, No. 2, 373--378 (2002; Zbl 1003.65029)]. In this note, the authors analyze the reasons of that counterexample and propose a preconditioner to overcome this difficulties.
Recommendations
- Study on the preconditioners (I+S_m)
- The preconditioned Gauss-Seidel method faster than the SOR method
- Preconditioned SOR iterative method and comparison of convergence
- Iterative method with the preconditioner \((I +S_{\max})\) for H-matrices
- Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices
Cites work
- A comparison theorem for the iterative method with the preconditioner \((I+S_{max})\)
- A note on the preconditioned Gauss--Seidel (GS) method for linear systems
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Modified iterative methods for consistent linear systems
- The Gauss-Seidel iterative method with the preconditioning matrix (I+S+S_m)
Cited in
(3)
This page was built for publication: A note on the preconditioner \(P_m = (I + S_m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004023)
