Computing the block triangular form of a sparse matrix

Alex Pothen, Chin-Ju Fan
1990 ACM Transactions on Mathematical Software  
We consider the problem of permuting the rows and columns of a rectangular or square, unsymmetric sparse matrix to compute its block triangular form. This block triangular form is based on a canonical decomposition of bipartite graphs induced by a maximum matching and was discovered by Dulmage and Mendelsohn. We describe implementations of algorithms to compute the block triangular form and provide computational results on sparse matrices from test collections. Several applications of the block triangular form are also included.
doi:10.1145/98267.98287 fatcat:zc2y5kmesraunlihbofslyvymq