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.

Today many high performance computers are reachable over some network However the access and use of these computers is often complicated This prevents many users to work on such machines The goal of our Remote Computation System RCS is to alleviate the usage of modern algorithms on high performance computers RCS has an easytouse mechanism for using computational resources remotely The computational resources available are used as eciently ...