Seminar Announcement

A Block Variant of the GMRES Method on Massively Parallel Processors

Guangye Li
SGI

Monday, November 8, 1999
9:00 - 10:00 am
Bldg. 921, Room 137

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 is theoretically equivalent to the GMRES method. The numerical results demonstrate 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 massively parallel computers due to both efficient block operations and efficient block data communications. Preliminary numerical results on some real-world problems also show that this algorithm may be stable up to some reasonable block size.

This seminar is hosted by the Computational Sciences and Mathematics Research Department at Sandia National Labs in Livermore, CA. For more information on this or other events, visit http://csmr.ca.sandia.gov/news.html. Visitors from outside Sandia require advance arrangements in order to attend. For more information, please contact the CSMR office management assistant Doretha Smith at dahall@sandia.gov or (925) 294-4630.