A block variant of the GMRES method on massively parallel processors
- Cray Research, Inc., Eagan, MN (United States)
This paper presents a block variant of the GMRES method for solving general unsymmetric linear systems. This algorithm generates a transformed Hessenberg matrix by solely using block matrix operations and block data communications. It is shown that this algorithm with block size s, denoted by BVGMRES(s,m), is theoretically equivalent to the GMRES(s*m) method. The numerical results show that this algorithm can be more efficient than the standard GMRES method on a cache based single CPU computer with optimized BLAS kernels. Furthermore, the gain in efficiency is more significant on MPPs due to both efficient block operations and efficient block data communications. Our numerical results also show that in comparison to the standard GMRES method, the more PEs that are used on an MPP, the more efficient the BVGMRES(s,m) algorithm is.
- Research Organization:
- Front Range Scientific Computations, Inc., Lakewood, CO (United States)
- OSTI ID:
- 433335
- Report Number(s):
- CONF-9604167-Vol.1; ON: DE96015306; TRN: 97:000720-0008
- Resource Relation:
- Journal Volume: 23; Journal Issue: 8; Conference: Copper Mountain conference on iterative methods, Copper Mountain, CO (United States), 9-13 Apr 1996; Other Information: PBD: [1996]; Related Information: Is Part Of Copper Mountain conference on iterative methods: Proceedings: Volume 1; PB: 422 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal size of the block in block GMRES on GPUs: computational model and experiments
Benchmarking: More Aspects of High Performance Computing