A comparison theorem for the iterative method with the preconditioner (I+S_max)
The authors propose the preconditioner \(P_m=I+S_{\max}\) where \(S_{\max}\) is contructed by using only the largest element of each row of the upper triangular part of the nonsingular diagonally dominant \(\mathbb Z\)-matrix \(A\), that is, \(S_{\max}=(s_{ij}^m)=-a_{ik_i}\) for \(i=1,2,\ldots,n-1\), \(j>i\), and \(0\) otherwise, where \(k_i=\min j\in\{j\mid \max_j|a_{ij}|\}\) for \(i<n\). Without loss of generality, it is assumed that \(A=I-L-U\), where \(I\) is the identity matrix, and \(L\) and \(U\) are strictly lower and upper triangular matrices, respectively. Under the additional assumption that \(a_{ii+1}a_{i+1j}\leq a_{ik_i}a_{k_ij}\), \(1\leq i\leq n-1\), \(j\leq i\), it is shown that \(P_m\) is preferable to the preconditioner \(P_s=I+S\) where \(S=(s_{ij}^m) = -a_{ij}\) for \(j=i+1\), \(i=1,2,\ldots,n-1\), and 0 otherwise. This \(P_s\) was proposed by \textit{A. D. Gunawardena, S. K. Jain} and \textit{L. Snyder} [Linear Algebra Appl. 154-156, 123-143 (1991; Zbl 0731.65016)].
- \(H\)-splittings and two-stage iterative methods
- Convergence of parallel multisplitting iterative methods for M-matrices
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 3215568 (Why is no real title available?)
- Iterative Solution Methods
- Modified iterative methods for consistent linear systems
- A note on the preconditioner \(P_m = (I + S_m)\)
- Two new modified Gauss-Seidel methods for linear system with M-matrices
- The survey of preconditioners used for accelerating the rate of convergence in the Gauss-Seidel method.
- Comparison results for solving preconditioned linear systems
- Comparison theorems of preconditioned Gauss-Seidel methods for \(M\)-matrices
- Preconditioned tensor splitting iterations method for solving multi-linear systems
- An extended \(GS\) method for dense linear systems
- Convergence analysis of the two preconditioned iterative methods for \(M\)-matrix linear systems
- Locally-synchronous, iterative solver for Fourier-based homogenization
- The comparison theorem of a new preconditioned USSOR iterative method
- Preconditioned Iterative Methods for Linear Equations Arising from the Boundary Element Method
- A note on the preconditioned Gauss--Seidel (GS) method for linear systems
- Preconditioned diagonal dominant matrices
- A new family of \((I+S)\)-type preconditioner with some applications
- On optimal improvements of classical iterative schemes for Z-matrices
- Letter to the editor: A note on the preconditioned Gauss-Seidel (GS) method for linear systems
- The preconditioned Gauss-Seidel method faster than the SOR method
- The optimal preconditioner of strictly diagonally dominant Z-matrix
- Study on the preconditioners (I+S_m)
- Preconditioners generated by minimizing norms
- Sequential iterations for two diagonal preconditioners
- Comment on `A comparison theorem of the SOR iterative method'
This page was built for publication: A comparison theorem for the iterative method with the preconditioner \((I+S_{max})\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1612412)
