Computing the block triangular form of a sparse matrix

  title={Computing the block triangular form of a sparse matrix},
  author={A. Pothen and C. Fan},
  journal={ACM Trans. Math. Softw.},
  • A. Pothen, C. Fan
  • Published 1990
  • Mathematics, Computer Science
  • ACM Trans. Math. Softw.
  • 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
    337 Citations

    Figures, Tables, and Topics from this paper

    Permuting Sparse Rectangular Matrices into Block-Diagonal Form
    • 145
    • PDF
    The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
    • 227
    • PDF
    On the Block Triangular Form of Symmetric Matrices
    • 10
    • Highly Influenced
    • PDF
    A geometric framework for sparse matrix problems
    • 11
    Heuristics for a Matrix Symmetrization Problem
    • B. Uçar
    • Mathematics, Computer Science
    • PPAM
    • 2007
    • 4
    • PDF
    A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap
    • 11
    • PDF
    Computing Row and Column Counts for Sparse QR and LU Factorization
    • 17


    An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
    • 174
    • Highly Influential
    On Algorithms for Obtaining a Maximum Transversal
    • I. Duff
    • Mathematics, Computer Science
    • TOMS
    • 1981
    • 184
    • Highly Influential
    • PDF
    Remarks on implementation of O(n1/2τ) assignment algorithms
    • 35
    • Highly Influential
    • PDF