back to Tim Davis' home page
other sparse matrix research
UF sparse matrix collection: submissions always welcome.
BTF: permutation to block triangular form
BTF permutes an unsymmetric matrix (square or rectangular) into its
block upper triangular form (more precisely, it computes a Dulmage-Mendelsohn
decomposition). BTF is required by the KLU package.
Copyright, and License:
BTF Copyright (c) 2004-2012, University of Florida. Author:
Timothy A. Davis. Distributed under the GNU LGPL license.
References (please cite these when using this software):
Algorithm 907: KLU, a direct sparse solver for circuit simulation problems
T. A. Davis and E. Palamadai Natarajan,
ACM Transactions on Mathematical Software, vol 37, no. 3, 2010.
Direct Methods for Sparse Linear Systems,
T. A. Davis,
SIAM, Philadelphia, Sept. 2006.
Part of the
SIAM Book Series on the Fundamentals of Algorithms.
KLU: a "Clark Kent" sparse LU factorization algorithm for circuit matrices,
a talk given by Ken Stanley at the 2004 SIAM Conference on Parallel Processing
for Scientific Computing (PP04).