Computing the block triangular form of a sparse matrix
@article{Pothen1990ComputingTB,
title={Computing the block triangular form of a sparse matrix},
author={A. Pothen and C. Fan},
journal={ACM Trans. Math. Softw.},
year={1990},
volume={16},
pages={303-324}
}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… CONTINUE READING
Figures, Tables, and Topics from this paper
337 Citations
Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Computer Science, Mathematics
- SIAM J. Sci. Comput.
- 2004
- 145
- PDF
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- Computer Science, Mathematics
- SIAM J. Matrix Anal. Appl.
- 1999
- 227
- PDF
The design and use of algorithms for permutinglarge entries to the diagonal of sparse matrices 1
- 1997
- 2
On the Block Triangular Form of Symmetric Matrices
- Computer Science, Mathematics
- SIAM Rev.
- 2010
- 10
- Highly Influenced
- PDF
A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap
- Mathematics, Computer Science
- SIAM J. Sci. Comput.
- 2013
- 11
- PDF
References
SHOWING 1-3 OF 3 REFERENCES
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
- Computer Science
- TOMS
- 1978
- 174
- Highly Influential
On Algorithms for Obtaining a Maximum Transversal
- Mathematics, Computer Science
- TOMS
- 1981
- 184
- Highly Influential
- PDF
Remarks on implementation of O(n1/2τ) assignment algorithms
- Computer Science, Mathematics
- TOMS
- 1988
- 35
- Highly Influential
- PDF