Algorithm 907: KLU, a direct sparse solver for circuit simulation problems

ACM Transactions on Mathematical Software

Volumn 37, Issue 3, 2010, Pages

  Davis, Timothy A ^a   Natarajan, Ekanathan Palamadai ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b ANSYS INC   (United States)

Author keywords

Circuit simulation; LU factorization; Sparse matrices

Indexed keywords

BLOCK TRIANGULAR FORMS; LINEAR SYSTEMS OF EQUATIONS; LU FACTORIZATION; MINIMUM DEGREE; NESTED DISSECTION; SANDIA NATIONAL LABORATORIES; SIMULATION APPLICATIONS; SIMULATION MATRICES; SPARSE DIRECT SOLVER; SPARSE MATRICES; SPARSE SOLVERS;

COMPUTER SOFTWARE; FACTORIZATION; LINEAR SYSTEMS; MATRIX ALGEBRA;

CIRCUIT SIMULATION;

EID: 77957571020     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/1824801.1824814     Document Type: Article

References (28)

1. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 1996. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 4, 886-905.
2. AMESTOY, P. R., DAVIS, T. A., AND DUFF, I. S. 2004. Algorithm 837: AMD, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 381-388.
3. CHEN, Y., DAVIS, T. A., HAGER, W. W., AND RAJAMANICKAM, S. 2008. Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update/downdate. ACM Trans. Math. Softw. 35, 3, 1-14.
4. DAVIS, T. A. 2002. Algorithm 832: UMFPACK V4.3, an unsymmetric-pattern multifrontal method. ACM Trans. Math. Softw. 30, 2, 196-199.
5. DAVIS, T. A. 2006. Direct Methods for Sparse Linear Systems. SIAM, Philadelphia, PA.
6. DAVIS, T. A. AND DUFF, I. S. 1997. An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM J. Matrix Anal. Appl. 18, 1, 140-158.
7. DAVIS, T. A. AND DUFF, I. S. 1999. A combined unifrontal/multifrontal method for unsymmetric sparse matrices. ACM Trans. Math. Softw. 25, 1, 1-19.
8. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. G. 2004a. Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 377-380.
9. DAVIS, T. A., GILBERT, J. R., LARIMORE, S. I., AND NG, E. G. 2004b. A column approximate minimum degree ordering algorithm. ACM Trans. Math. Softw. 30, 3, 353-376.
10. DAVIS, T. A. AND HU, Y. To appear. University of Florida sparse matrix collection. ACM Trans. Math. Softw. To appear; (see also http://www.cise.ufl. edu/sparse/matrices).
11. DAVIS, T. A. AND PALAMADAI NATARAJAN, E. To appear. Sparse matrix methods for circuit simulation problems. In Proceedings of the Conference on Scientific Computing in Electrical Engineering (SCEE'10).
12. DEMMEL, J. W., EISENSTAT, S. C.,GILBERT, J. R., LI, X. S., AND LIU, J. W. H. 1999. A supernodal approach to sparse partial pivoting. SIAM J. Matrix Anal. Appl. 20, 3, 720-755.
13. DONGARRA, J. J., DU CROZ, J., DUFF, I. S., AND HAMMARLING, S. 1990. A set of level-3 basic linear algebra subprograms. ACM Trans. Math. Softw. 16, 1, 1-17.
14. DUFF, I. S. 1981a. Algorithm 575: Permutations for a zero-free diagonal. ACM Trans. Math. Softw. 7, 1, 387-390.
15. DUFF, I. S. 1981b. On algorithms for obtaining a maximum transversal. ACM Trans. Math. Softw. 7, 1, 315-330.
16. DUFF, I. S. AND REID, J. K. 1978a. Algorithm 529: Permutations to block triangular form. ACM Trans. Math. Softw. 4, 2, 189-192.
17. DUFF, I. S. AND REID, J. K. 1978b. An implementation of Tarjan's algorithm for the block triangularization of a matrix. ACM Trans. Math. Softw. 4, 2, 137-147.
18. GILBERT, J. R. AND PEIERLS, T. 1988. Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Statist. Comput. 9, 862-874.
19. HAGER, W. W. 1984. Condition estimates. SIAM J. Sci. Statist. Comput. 5, 2, 311-316.
20. HIGHAM, N. J. 2002. Accuracy and Stability of Numerical Algorithms, 2nd Ed. SIAM, Philadelphia, PA.
21. HUTCHINSON, S. A., KEITER, E. R., HOEKSTRA, R. J., WATERS, L. J., RUSSO, T., RANKIN, E., WIX, S. D., AND BOGDAN, C. 2002. The XyceTMparallel electronic simulator - An overview. In Proceedings of the Parallel Computing: Advances and Current Issues, G. R. Joubert, A. Murli, F. J. Peters, and M. Vanneschi Eds., Imperial College Press, London, 165-172.
22. KARYPIS, G. AND KUMAR, V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359-392. (Pubitemid 128689516)
23. KUNDERT, K. S. 1986. Sparse matrix techniques and their applications to circuit simulation. In Circuit Analysis, Simulation, and Design, A. E. Ruehli Ed. North-Holland, New York.
24. KUNDERT, K. S. AND SANGIOVANNI-VINCENTELLI, A. 1988. User's guide: Sparse 1.3. Tech. rep., Department of Electrical Engineering and Computer Science. University of California, Berkeley.
25. NICHOLS, K., KAZMIERSKI, T., ZWOLINSKI, M., AND BROWN, A. 1994. Overview of SPICE-like circuit simulation algorithms. IEEE Proc. Circ. Devices Syst. 141, 4, 242-250.
26. PALAMADAI NATARAJAN, E. 2005. KLU - A high performance sparse linear system solver for circuit simulation problems. M.S. Thesis, CISE Department, University of Florida.
27. SIPICS, M. 2007. Sparse matrix algorithm drives SPICE performance gains. SIAM News 40, 4, 1.
28. TARJAN, R. E. 1972. Depth first search and linear graph algorithms. SIAM J. Comput. 1, 146-160.