A parallel implementation of the CMRH method for dense linear systems
✍ Scribed by Sébastien Duminil
- Book ID
- 120755075
- Publisher
- Springer US
- Year
- 2012
- Tongue
- English
- Weight
- 923 KB
- Volume
- 63
- Category
- Article
- ISSN
- 1017-1398
No coin nor oath required. For personal study only.
✦ Synopsis
This paper presents an implementation of the CMRH (Changing Minimal Residual method based on the Hessenberg process) iterative method suitable for parallel architectures. CMRH is an alternative to GMRES and QMR, the well-known Krylov methods for solving linear systems with nonsymmetric coefficient matrices. CMRH generates a (non orthogonal) basis of the Krylov subspace through the Hessenberg process. On dense matrices, it requires less storage than GMRES. Parallel numerical experiments on a distributed memory computer with up to 16 processors are shown on some applications related to the solution of dense linear systems of equations. A comparison with the GMRES method is also provided on those test examples.
Keywords
Linear systems • Krylov method • Hessenberg process • Dense matrix • Parallel implementation • MPI • CMRH • GMRES • Preconditioned CMRH
📜 SIMILAR VOLUMES
projections pour les systèmes linéaires et non linéaires, Habilitation thesis, University of Lille1, Lille, France, 1994; H. Sadok, CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm, Numer. Algorithms 20 (1999) 303-321] is an algorithm for solving
Accurate estimation of the inductive coupling between interconnect segments of a VLSI circuit is critical to the design of high-end microprocessors. This paper presents a class of parallel iterative methods for solving the linear systems of equations that arise in the inductance extraction process.