A set of level 3 basic linear algebra subprograms
ACM Transactions on Mathematical Software (TOMS)
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
An Unsymmetric-Pattern Multifrontal Method for Sparse LU Factorization
SIAM Journal on Matrix Analysis and Applications
A combined unifrontal/multifrontal method for unsymmetric sparse matrices
ACM Transactions on Mathematical Software (TOMS)
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
A Supernodal Approach to Sparse Partial Pivoting
SIAM Journal on Matrix Analysis and Applications
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
ACM Transactions on Mathematical Software (TOMS)
Algorithm 529: Permutations To Block Triangular Form [F1]
ACM Transactions on Mathematical Software (TOMS)
On Algorithms for Obtaining a Maximum Transversal
ACM Transactions on Mathematical Software (TOMS)
Algorithm 575: Permutations for a Zero-Free Diagonal [F1]
ACM Transactions on Mathematical Software (TOMS)
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method
ACM Transactions on Mathematical Software (TOMS)
A column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Algorithm 836: COLAMD, a column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Algorithm 837: AMD, an approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Algorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
ACM Transactions on Mathematical Software (TOMS)
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
3D-ICE: fast compact transient thermal modeling for 3D ICs with inter-tier liquid cooling
Proceedings of the International Conference on Computer-Aided Design
Proceedings of the 49th Annual Design Automation Conference
Sparse LU factorization for parallel circuit simulation on GPU
Proceedings of the 49th Annual Design Automation Conference
New approach to parallel simulation of large power systems
Proceedings of the 2011 Grand Challenges on Modeling and Simulation Conference
Proceedings of the International Conference on Computer-Aided Design
PowerRush: efficient transient simulation for power grid analysis
Proceedings of the International Conference on Computer-Aided Design
Push-relabel based algorithms for the maximum transversal problem
Computers and Operations Research
Algorithm 930: FACTORIZE: An object-oriented linear system solver for MATLAB
ACM Transactions on Mathematical Software (TOMS)
IA^3 '13 Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms
Amesos2 and Belos: Direct and iterative solvers for large sparse linear systems
Scientific Programming
| Hi-index | 0.00 |
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 XyceTMcircuit simulation package developed by Sandia National Laboratories.