Title :
On methods for ordering sparse matrices in circuit simulation
Author :
Reissig, Gunther
Author_Institution :
MIT, Cambridge, MA
Abstract :
Recently proposed methods for ordering sparse symmetric matrices are discussed and their performance is compared with that of the Minimum Degree and the Minimum Local Fill algorithms. It is shown that these methods applied to symmetrized modified nodal analysis matrices yield orderings significantly better than those obtained from the Minimum Degree and Minimum Local Fill algorithms, in some cases at virtually no extra computational cost
Keywords :
circuit simulation; sparse matrices; circuit simulation; matrix ordering; minimum degree algorithm; minimum local fill algorithm; sparse matrices; symmetrized modified nodal analysis matrices; Circuit simulation; Circuit testing; Computational complexity; Computational efficiency; Computational modeling; Equations; Genetic mutations; Software performance; Sparse matrices; Symmetric matrices;
Conference_Titel :
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Conference_Location :
Sydney, NSW
Print_ISBN :
0-7803-6685-9
DOI :
10.1109/ISCAS.2001.922048
