Proposed sparse extensions to the Basic Linear Algebra Subprograms

1 January 1985

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGNUM Newsletter

Vol. 20 (1) , 22-25
https://doi.org/10.1145/1057935.1057938

Abstract

Many codes now exist for solving sparse linear systems: MA28 /4/, SPARSPAK /7/, the Yale Sparse Matrix Package /6/, and ICCG/ILU preconditioning /10/. It has been found that sparse matrix computations are useful in many fields. Furthermore, much effort is being expended in other sparse matrix computations such as sparse least squares and eigenvalue extraction.

Keywords

SPARSE LINEAR SYSTEM
YALE SPARSE MATRIX PACKAGE
ILU PRECONDITIONING
SPARSE MATRIX
PROPOSED SPARSE EXTENSION
BASIC LINEAR ALGEBRA SUBPROGRAMS
EIGENVALUE EXTRACTION
SPARSE MATRIX COMPUTATION
EIGENVALUES
LEAST SQUARE

This publication has 3 references indexed in Scilit:

Issues relating to extension of the Basic Linear Algebra Subprograms
ACM SIGNUM Newsletter, 1985
A proposal for an extended set of Fortran Basic Linear Algebra Subprograms
ACM SIGNUM Newsletter, 1985
Basic Linear Algebra Subprograms for Fortran Usage
ACM Transactions on Mathematical Software, 1979