• DocumentCode
    2644459
  • Title

    Visualizing sparse matrix computations

  • Author

    Alvarado, Fernando L.

  • Author_Institution
    Wisconsin Univ., Madison, WI, USA
  • fYear
    1990
  • fDate
    1-3 May 1990
  • Firstpage
    1268
  • Abstract
    A description is given of ideas and tools that help with the visualization of sparse matrix computations. The Sparse Matrix Manipulation System, an environment for handling sparse matrices of all types in a flexible manner via ASCII file interfaces, is used. Two commands in this environment are ShowMatrix and ShowTree. The first illustrates the pattern of nonzeroes of a sparse matrix. The second illustrates dependencies among matrix elements. Other tools in the package are described, including tools for ordering, factoring and multiplying sparse matrices. This software environment is then used to study the effect of several recent ordering and partitioning algorithms for working with the sparse inverses of L and U. These new algorithms have been proposed as a means of enhancing the parallelism of sparse matrix computations. The effect of these algorithms on parallelism and fill-in is illustrated in a graphic manner
  • Keywords
    mathematics computing; matrix algebra; parallel algorithms; software packages; ASCII file interfaces; ShowMatrix; ShowTree; factoring; fill-in; matrix elements; multiplying; nonzeroes; ordering; parallelism; partitioning algorithms; software environment; sparse matrix computations; visualization; Graphics; Large-scale systems; Packaging; Parallel processing; Partitioning algorithms; Software algorithms; Sparse matrices; Topology; Tree graphs; Visualization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1990., IEEE International Symposium on
  • Conference_Location
    New Orleans, LA
  • Type

    conf

  • DOI
    10.1109/ISCAS.1990.112361
  • Filename
    112361