Gunther Reißig.
On methods for ordering sparse matrices in circuit simulation.
Proc. 2001 Int. Symp. Circuits and Systems (ISCAS), Sydney, Australia, May 6-9, 2001,
vol. 5, pp. 315-318.
Full text.
(Definitive publication; restricted access.)
Full text.
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.
BibTeX entry:
@InProceedings{Reissig01,
AUTHOR = {Rei{\ss}ig, Gunther},
title = {On methods for ordering sparse matrices in circuit simulation},
booktitle = {Proc. 2001 IEEE Int. Symp. on Circuits and Systems (ISCAS), Sydney, Australia, } # may # { 6-9},
pages = {315-318},
year = 2001,
volume = 5,
doi = {10.1109/ISCAS.2001.922048}
}
Impressum und Haftungsausschluß