Obtaining triangular diagonal blocks in sparse matrices using cutsets

Abstract

The paper proposes an algorithm which computes a (2 × 2) block partition of an irreducible, sparse matrix with a zero-free diagonal so that one of the diagonal blocks is triangular. The algorithm works by computing a cutset of the directed graph associated with the off-diagonal part of the matrix and is linear in the number of nonzeros therein. The proposed… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics