• DocumentCode
    966842
  • Title

    Reordering for minimum infill in sparse-matrix solutions of linear equations

  • Author

    Azar, A. Rag HemI ; Nichols, K.G.

  • Author_Institution
    Southampton University, Department of Electronics, Southampton, UK
  • Volume
    10
  • Issue
    25
  • fYear
    1974
  • Firstpage
    529
  • Lastpage
    530
  • Abstract
    In sparse-matrix minimum infill algorithms, at each step of reordering, the pivot producing the least number of infills is selected. A scheme that reduces the computation required to identify such a node is proposed and investigated analytically and experimentally. A new criterion for when `ties¿ occur is presented.
  • Keywords
    computer-aided circuit analysis; matrix algebra; network analysis; algorithms; coefficient matrices; linear equations; minimum infill; node; reordering; sparse matrix;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19740420
  • Filename
    4245310
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=966842