LAPACK Working Note 24: LAPACK Block Factorization Algorithms on the INtel iPSC/860

The aim of this project is to implement the basic factorization routines for solving linear systems of equations and least squares problems from LAPACK—namely, the blocked versions of LU with partial pivoting, QR, and Cholesky on a distributed-memory machine. We discuss our implementation of each of the algorithms and the results we obtained using varying orders of matrices and blocksizes.

[1]  Michael T. Heath,et al.  Visual Animation of Parallel Algorithms for Matrix Computations , 1990, Proceedings of the Fifth Distributed Memory Computing Conference, 1990..

[2]  G. A. Geist,et al.  A machine-independent communication library , 1989 .

[3]  Jack J. Dongarra,et al.  A set of level 3 basic linear algebra subprograms , 1990, TOMS.