ABSTRACT
Consider a solution of systems of linear equations Ax = b when A is a symmetric positive definite matrix. We solve the equations using a direct method using Cholesky factorization, A = LLT or a preconditioned iterative method. In this paper, we are proposing a new preconditioner based on the iterative recursion to improve the performance of conjugate gradient method. We demonstrate through experiments that our recursive iterative preconditioner improves convergence when it is used as a preconditioner for the conjugate gradient method. We conjecture that the improvements in the quality of preconditioning arise from the ability of our method to generate better approximations to the complete factor.
- MatrixMarket, http://math.nist.gov/MatrixMarketGoogle Scholar
- On preconditionning Schur complement and Schur complement preconditioning, Jun Zhang, ETNA, Vol 10, 2000, pp115--130.Google Scholar
- Preconditining the Schur complement in a hybrid direct/iterative solver, Jeremie Gaidamour and Pascal Henon, SparseDays, 2010.Google Scholar
- Direct Methods for Sparse Linear Systems, Timothy A. Davis, SIAM, 2006.Google Scholar
- Iterative Methods for Sparse Linear Systems, Y. Saad, SIAM, 2003. Google ScholarDigital Library
- On Block Diagonal And Schur Complement Preconditioning, Jan Mandel, Numerical Mathematik, 58, 79--93, 1990.Google ScholarDigital Library
- Preconditioning Techniques for Large Linear Systems: A Survey, Michele Benzi, Journal of Computational Physics 182, 418--477, 2002. Google ScholarDigital Library
Index Terms
- Towards a recursive iterative preconditioner
Recommendations
Shifted SSOR-like preconditioner for non-Hermitian positive definite matrices
Based on the SSOR-like iteration method of Bai (Numer. Linear Algebra Appl. 23, 37-60, 2016), we give a shifted SSOR-like preconditioner which is positive definite for solving the non-Hermitian positive definite linear system with a dominant Hermitian ...
CIMGS: An Incomplete Orthogonal FactorizationPreconditioner
A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, compressed incomplete modified Gram--Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust both ...
An inexact relaxed DPSS preconditioner for saddle point problem
Based on the relaxed deteriorated positive-definite and skew-Hermitian splitting (DPSS) preconditioner, in this paper, we proposed a class of relaxed deteriorated positive-definite and skew-Hermitian splitting (RDPSS) preconditioner for solving the ...
Comments