On methods for ordering sparse matrices in circuit simulation

ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings

Volumn 5, Issue , 2001, Pages 315-318

  Reissig, G Reibig ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATRIX ALGEBRA; TIMING CIRCUITS; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GAUSSIAN NOISE (ELECTRONIC); GRAPHIC METHODS;

COMPUTATIONAL COSTS; MINIMUM DEGREE; MODIFIED NODAL ANALYSIS; SPARSE MATRICES; SYMMETRIC MATRICES;

CIRCUIT SIMULATION; NETWORKS (CIRCUITS);

CIRCUIT SIMULATIONS; NODAL ANALYSIS;

EID: 0035021064     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iscas.2001.922048     Document Type: Conference Paper

References (18)

1. L. O. Chua, C. A. Desoer, and E. S. Kuh, Linear and Nonlinear Circuits. McGraw-Hill, 1987.
2. U. Feldmann, U. A. Wever, Q. Zheng, R. Schultz, and H. Wriedt, "Algorithms for modern circuit simulation, " Archiv fur Elektronik und Ubertragungstechnik (AEU), vol. 46, no. 4, pp. 274-285, 1992.
3. L. W. Nagel, "SPICE 2: A computer program to simulate semiconductor circuits, " Tech. Rep. ERL-M520, Univ. of Calif. Berkeley, Electronic Res. Lab., Berkeley, CA, 1975.
4. I. N. Hajj, P. Yang, and T. N. Trick, "Avoiding zero pivots in the modified nodal approach, " IEEE Trans. Circuits and Systems, vol. 28, no. 4, pp. 271-278, 1981.
5. L. O. Chua and P.-M. Lin, Computer-Aided Analysis of Electronic Circuits. Englewood Cliffs, NJ: Prentice-Hall, 1975.
6. G. H. Golub and C. F. Van Loan, Matrix Computations. The John Hopkins Univ. Press, 2 ed., 1993.
7. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct methods for sparse matrices. Oxford University Press, 1986.
8. A. George and J. W. Liu, "The evolution of the minimum degree ordering algorithm, " SIAM Rev., vol. 31, pp. 1-19, Mar. 1989.
9. M. Yannakakis, "Computing the minimum fill-in is NP-complete, " SIAM J. Algebraic Discrete Methods, vol. 2, no. 1, pp. 77-79, 1981.
10. H. M. Markowitz, "The elimination form of the inverse and its application to linear programming, " Management., vol. 3, pp. 255-269, 1957.
11. E. G. Ng and P. Raghavan, "Performance of greedy ordering heuristics for sparse Cholesky factorization, " SIAM J. Matrix Anal. Appl., vol. 20, no. 4, pp. 902-914, 1999.
12. I. A. Cavers, "Using deficiency measure for tiebreaking the minimum degree algorithm, " Tech. Rep. 89-2, Dept. Comp. Sci., The Univ. Of British Columbia, Vancouver, British Columbia, Canada V6T 1W5, 10. Jan. 1989.
13. I. J. Lustig, R. E. Marsten, and D. F. Shanno, "The interaction of algorithms and architectures for interior point methods., " in Advances in optimization and parallel computing (P. M. Pardalos, ed.), pp. 190-204, North-Holland, 1992.
14. C. Meszaros. "Ordering heuristics in interior point LP methods, " in New trends in mathematical programming (F. Gi-annessi, S. Komlosi, and T. Rapcsak, eds.), pp. 203-221, Boston, MA, U.S.A.: Kluwer Acad. PubL, 1998.
15. E. Rothberg and S. C. Eisenstat, "Node selection strategies for bottom-up sparse matrix ordering, " SIAM J. Matrix Anal. Appl., vol. 19, pp. 682-695, July 1998.
16. S. V. Patter, "The use of linear graphs in Gauss elimination, " SIAM Rev., vol. 3, pp. 119-130, 1961.
17. G. ReiBig and T. Klimpel, "Fill-In Minimierung in der Schaltkreissimulation." Erfindungsmeldung, Infineon Technologies, MP PTS, Munchen, 28 Mar. 2000.
18. "SPOOLES-An object oriented software library for solving sparse linear systems of equations." netlib.bell-labs.com/netlib/linalg/spooles/, 1999.