Computing the block triangular form of a sparse matrix

doi:10.1145/98267.98287

Computing the block triangular form of a sparse matrix

1990-12-01

0

OA

AI

DOI：10.1145/98267.98287

原文链接

查看原文

摘要

En 中文

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.

Computing the block triangular form of a sparse matrix

摘要

AI总结

期刊

机构

引用论文