Block implementations of the symmetric QR and Jacobi algorithms

A common approach to solve problems in numerical linear algebra eciently on modern high speed computers is to redesign the classical algorithm which was originally developed for serial computers In this paper we discuss block variants of QR and Jacobi algorithms for the computation of the complete spectral decomposition of symmetric matrices We report on numerical tests which have been performed on a CRAY YMP and an ALLIANT FX/80