Basic linear algebra computations on the Sperry ISP
The Sperry ISP appears to be an attractive machine for implementing standard linear algebraic algorithms. It has similar characteristics to other vector-processing machines with an architecture based on vector-registers. Good performance of standard algorithms can be obtained via efficient implementations of matrix-vector operations, and we strongly recommend that these are added to the EML Library.
KeywordsDouble Precision Single Precision Vector Operation Fortran Compiler Basic Linear Algebra
Unable to display preview. Download preview PDF.
- C. Daly and J.J. Du Croz, Performance of subroutine library on vector-processing machines, Computer Physics Comm. 37, 181–186, 1985.Google Scholar
- J.J. Dongarra, Performance of various computers using standard linear equations software in a Fortran environment, Argonne National Laboratory report MCS/TM23, 1986.Google Scholar
- J.J. Dongarra, J.J. Du Croz, S. J. Hammarling and R.J. Hanson, An extended set of Fortran basic linear algebra subprograms, NAG technical report TR3/87, 1987, and Argonne National Laboratory report MCS/TM41 (revision 3), 1986.Google Scholar
- J.J. Dongarra and S. C. Eisenstat, Squeezing the most out of an algorithm in Cray Fortran, ACM Trans. Math. Software 10, 221–230, 1984.Google Scholar
- C.L. Lawson, R.J. Hanson, D. R. Kincaid and F. T. Krogh, Basic linear algebra subprograms for Fortran usage, ACM Trans. Math. Software 5, 308–323, 1979.Google Scholar