Skip to main content
Springer Nature Link
Log in

Sparse matrix multiplication package (SMMP)

  • Software Note
  • Published:
Advances in Computational Mathematics Aims and scope Submit manuscript

Abstract

Routines callable fromFortran and C are described which implement matrix-matrix multiplication and transposition for a variety of sparse matrix formats. Conversion routines between various formats are provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.E. Bank and R.K. Smith, General sparse elimination requires no permanent integer storage, SIAM J. Sci. Stat. Comp. 8(1987)574–584.

    Google Scholar 

  2. C.C. Douglas and W.L. Miranker, Constructive interference in parallel algorithms, SIAM J. Numer. Anal. 25(1988)376–398.

    Google Scholar 

  3. C.C. Douglas and B.F. Smith, Using symmetries and antisymmetries to analyze a parallel multigrid algorithm: The elliptic boundary value case, SIAM J. Numer. Anal. 26(1989)1439–1461.

    Google Scholar 

  4. S.C. Eisenstat, H.C. Elman, M.H. Schultz and A.H. Sherman, The (new) Yale sparse matrix package, in:Elliptic Problem Solvers II, ed. G. Birkoff and A. Schienstadt (Academic Press, New York, 1984) pp. 45–52.

    Google Scholar 

  5. S.C. Eisenstat, M.C. Gursky, M.H. Schultz and A.H. Sherman, Yale sparse matrix package I: The symmetric codes, Int. J. Numer. Meth. Eng. 18(1982)1145–1151.

    Google Scholar 

  6. S.C. Eisenstat, M.C. Gursky, M.H. Schultz and A.H. Sherman, Yale sparse matrix package II: The nonsymmetric codes, Research Report 114, Department of Computer Science, Yale University, New Haven, CT (1977).

    Google Scholar 

  7. I. Duff, M. Marrone and G. Radicati, A proposal for user level sparse BLAS, in preparation.

  8. M.A. Heroux, Proposal for a sparse BLAS toolkit, in preparation.

  9. Y. Saad, SPARSKIT: a basic tool kit for sparse matrix computations, preliminary version (1990). Available by anonymous ftp from riacs.edu.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics C012, University of California at San Diego, P.O. Box 109, 92093, LaJolla, CA, USA

    Randolph E. Bank

  2. Mathematical Sciences Department, IBM Research Division, Thomas J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, NY, USA

    Craig C. Douglas

  3. Department of Computer Science, Yale University, Yale Station, P.O. Box 2158, 06520, New Haven, CT, USA

    Craig C. Douglas

Authors
  1. Randolph E. Bank
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Craig C. Douglas
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The algorithms and routines described here were developed while both authors were visiting the Center for Applied Mathematics, Department of Mathematics, Purdue University. This research was supported in part by the Office of Naval Research, Grant No. N00014-895-1440.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bank, R.E., Douglas, C.C. Sparse matrix multiplication package (SMMP). Adv Comput Math 1, 127–137 (1993). https://doi.org/10.1007/BF02070824

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02070824

Keywords

Subject classification AMS(MOS)