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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Rünger, G., & Schwind, M. (2005). Comparison of different parallel modified Gram-Schmidt algorithms. In Lecture Notes in Computer Science (Vol. 3648, pp. 826–836). Springer Verlag. https://doi.org/10.1007/11549468_90
Mendeley helps you to discover research relevant for your work.