The preconditioned SOR iterative method for positive definite matrices
From MaRDI portal
Summary: We present several iterations for preconditioners introduced by \textit{P. Tarazaga} and \textit{D. Cuellar} [Comput. Math. Appl. 57, No. 8, 1305--1312 (2009; Zbl 1186.65039)], and study the convergence of the method for solving a linear system whose coefficient matrix is positive definite matrices, and we also find that they complete very well with the SOR iteration, which is shown through numerical examples.
Recommendations
- scientific article; zbMATH DE number 5811385
- Improving preconditioned SOR-type iterative methods for L-matrices
- Comparison analysis for improving preconditioned SOR-type iterative method
- The convergence discussion of an improved SOR iterative method in preconditioned (I+S)
- scientific article; zbMATH DE number 6311888
Cited in
(9)- High quality preconditioning of a general symmetric positive definite matrix based on its U^T U + U^T R + R^T U-decomposition
- Further results on the preconditioned sor method
- Subspace-by-subspace preconditioners for structured linear systems
- Improving preconditioned SOR-type iterative methods for L-matrices
- scientific article; zbMATH DE number 4190984 (Why is no real title available?)
- Préconditionnement S.S.O.R.: Optimisation du conditionnement obtenu en fonction du parametre de relaxation
- ESOR method with diagonal preconditioners for SPD linear systems
- Positive definiteness aspects of vectorizable preconditioners
- Sequential iterations for two diagonal preconditioners
This page was built for publication: The preconditioned SOR iterative method for positive definite matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1790105)
