Comparison of different parallel modified gram-schmidt algorithms

Authors:
Gudula Rünger;Michael Schwind
Affiliations:
Department of Computer Science, Technical University Chemnitz, Chemnitz, Germany;Department of Computer Science, Technical University Chemnitz, Chemnitz, Germany
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 5
Cited 1

Iterative algorithms for Gram-Schmidt orthogonalization

Computing
A set of level 3 basic linear algebra subprograms

ACM Transactions on Mathematical Software (TOMS)
Modified Gram-Schmidt QR factorization on hypercube SIMD computers

Journal of Parallel and Distributed Computing
Stability analysis and improvement of the block Gram-Schmidt algorithm

SIAM Journal on Scientific and Statistical Computing
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)

A unified co-processor architecture for matrix decomposition

Journal of Computer Science and Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The modified Gram-Schmidt algorithm (MGS) is used in many fields of computational science as a basic part for problems which relate to Numerical Linear Algebra. In this paper we describe different parallel implementations (blocked and unblocked) of the MGS-algorithm and show how computation and calculation overlap can increase the performance up to 38 percent on the two different Clusters platforms which where used for performance evaluation.