Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems

被引:231
作者
Davis, Timothy A. [1 ]
Natarajan, Ekanathan Palamadai [1 ]
机构
[1] Univ Florida, Gainesville, FL 32611 USA
来源
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE | 2010年 / 37卷 / 03期
基金
美国国家科学基金会;
关键词
Algorithms; Experimentation; Performance; LU factorization; sparse matrices; circuit simulation; MULTIFRONTAL METHOD; APPROXIMATE;
D O I
10.1145/1824801.1824814
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
KLU is a software package for solving sparse unsymmetric linear systems of equations that arise in circuit simulation applications. It relies on a permutation to Block Triangular Form (BTF), several methods for finding a fill-reducing ordering (variants of approximate minimum degree and nested dissection), and Gilbert/Peierls' sparse left-looking LU factorization algorithm to factorize each block. The package is written in C and includes a MATLAB interface. Performance results comparing KLU with SuperLU, Sparse 1.3, and UMFPACK on circuit simulation matrices are presented. KLU is the default sparse direct solver in the Xyce (TM) circuit simulation package developed by Sandia National Laboratories.
引用
收藏
页数:17
相关论文
共 28 条
[21]  
Hutchinson S., 2002, PARALLEL COMPUTING A, P165, DOI [DOI 10.1142/9781860949630_0021, 10.1142/9781860949630_0021]
[22]   A fast and high quality multilevel scheme for partitioning irregular graphs [J].
Karypis, G ;
Kumar, V .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 1998, 20 (01) :359-392
[23]  
Kundert K.S., 1988, USERS GUIDE SPARSE 1
[24]  
Kundert Kenneth., 1986, CIRCUIT ANAL SIMULAT
[25]  
Natarajan E.P., 2005, Ph.D. thesis,
[26]   OVERVIEW OF SPICE-LIKE CIRCUIT SIMULATION ALGORITHMS [J].
NICHOLS, KG ;
KAZMIERSKI, TJ ;
ZWOLINSKI, M ;
BROWN, AD .
IEE PROCEEDINGS-CIRCUITS DEVICES AND SYSTEMS, 1994, 141 (04) :242-250
[27]  
SIPICS M, 2007, SIAM NEWS, V40, P1
[28]  
Tarjan R., 1972, SIAM Journal on Computing, V1, P146, DOI 10.1137/0201010