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
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;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19740420
