A polynomial preconditioner for the CMRH algorithm
From MaRDI portal
Publication:541488
DOI10.1155/2011/545470zbMath1215.65060OpenAlexW2034237012WikidataQ58693202 ScholiaQ58693202MaRDI QIDQ541488
Shiji Xu, Jiangzhou Lai, Lin-Zhang Lu
Publication date: 7 June 2011
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231894
Related Items (5)
Heavy ball restarted CMRH methods for linear systems ⋮ Preconditioning complex symmetric linear systems ⋮ Augmented and deflated CMRH method for solving nonsymmetric linear systems ⋮ MINRES seed projection methods for solving symmetric linear systems with multiple right-hand sides ⋮ Efficient variants of the CMRH method for solving a sequence of multi-shifted non-Hermitian linear systems simultaneously
Uses Software
Cites Work
- Implementation of an adaptive algorithm for Richardson's method
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- A polynomial preconditioner for the GMRES algorithm
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
- Unnamed Item
This page was built for publication: A polynomial preconditioner for the CMRH algorithm
