Algorithms for the CMRH method for dense linear systems
The CMRH (Changing Minimal Residual method based on the Hessenberg process) method is a Krylov subspace method for solving large linear systems with non-symmetric coefficient matrices. CMRH generates a (non orthogonal) basis of the Krylov subspace through the Hessenberg process, and minimizes a quasi-residual norm. On dense matrices, the CMRH method is less expensive and requires less storage than other Krylov methods. In this work, we describe Matlab codes for the best of these implementations. Fortran codes for sequential and parallel implementations are also presented.
KeywordsLinear systems Krylov method Hessenberg process Dense matrix CMRH method
Unable to display preview. Download preview PDF.
- 2.Davis, T.A., Hu, Y.: The University of Florida matrix collection. ACM T. Math. Software, 38 (2011). http://www.cise.ufl.edu/research/sparse/matrices
- 9.Matrix Market: http://math.nist.gov/MatrixMarket/data/, Test Matrices Database Maintained by NIST, Gaithersburg, MD.
- 11.Saad, Y.: Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia (2003)Google Scholar