SPARSEM: a subroutine package to operate with large sparse matrices

Published: 1 January 1993| Version 1 | DOI: 10.17632/6byr3ssd5s.1
S.J. Sciutto


Abstract We present here a subroutine package to operate with sparse matrices stored in compact form. For each row (or column) of the matrix, just the non-null elements are stored. The package contains routines to add and multiply matrices, convert from and to normal format, etc., and is thought to be called by programs performing more complex works. We also present the results of some tests which measure the routines' performance in comparison with standard procedures. Title of program: SPARSEM Catalogue Id: ACNQ_v1_0 Nature of problem Sparse matrices appear in a number of physical problems, such as discrete systems with many degrees of freedom; exact diagonalization of quantum clusters; etc. Versions of this program held in the CPC repository in Mendeley Data ACNQ_v1_0; SPARSEM; 10.1016/0010-4655(93)90039-F This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2019)



Computational Physics, Computational Method