Algorithm 907: KLU, A Direct Sparse Solver for Circuit Simulation Problems 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.
Keywords for this software
References in zbMATH (referenced in 8 articles , 1 standard article )
Showing results 1 to 8 of 8.
- Roberts, Nathan V.: Camellia: A software framework for discontinuous Petrov-Galerkin methods (2014)
- Davis, Timothy A.: Algorithm 930, FACTORIZE: an object-oriented linear system solver for MATLAB (2013)
- Duff, Iain S.; Kaya, Kamer: Preconditioners based on strong subgraphs (2013)
- Davis, Timothy A.; Natarajan, E.Palamadai: Sparse matrix methods for circuit simulation problems (2012)
- Miettinen, Pekka; Honkala, Mikko; Roos, Janne; Valtonen, Martti: Improving model-order reduction methods by singularity exclusion (2012)
- Kapre, Nachiket; Dehon, André: An NoC traffic compiler for efficient FPGA implementation of sparse graph-oriented workloads (2011) ioport
- Davis, Timothy A.; Palamadai Natarajan, Ekanathan: Algorithm 907: KLU: a direct sparse solver for circuit simulation problems (2010)
- Sala, Marzio; Stanley, Kendall S.; Heroux, Michael A.: On the design of interfaces to sparse direct solvers. (2008)