• DocumentCode
    1598400
  • Title

    A fast Pascal program for the product of large sparse matrices on personal computers

  • Author

    Agnifili, Antonio ; Di Felice, Paolino

  • Author_Institution
    Dipartimento di Ingegneria Elettrica, Aquila Univ., Italy
  • fYear
    1990
  • Firstpage
    328
  • Lastpage
    335
  • Abstract
    An implementation of a slight variation of the near optimal Gustavson´s algorithm (1978) for the product of sparse matrices is given. Special care is devoted to the selection of data structures. The result is an elegant and very fast code specifically tailored for running on personal computers. An analysis is conducted of the X=X×Y problem in order to design the best compact representation for matrices X and Y. The code is briefly described, and test cases are presented
  • Keywords
    Pascal listings; data structures; matrix algebra; microcomputer applications; data structures; personal computers; sparse matrices; Application software; Computational modeling; Data structures; Equations; Linear systems; Microcomputers; Personal communication networks; Sparse matrices; Switches; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Applied Computing, 1990., Proceedings of the 1990 Symposium on
  • Conference_Location
    Fayetteville, AR
  • Print_ISBN
    0-8186-2031-5
  • Type

    conf

  • DOI
    10.1109/SOAC.1990.82192
  • Filename
    82192
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1598400