We discuss some properties of the structure of the inverse of a sparse matrix. In particular, we show that the structural inverse of an irreducible sparse matrix is always full. We first show that Gaussian elimination always yields a full structural inverse and then show the result directly. We believe that our lemmas concerning Gaussian elimination are of interest in their own right. (ERA citation 10:040911)
展开▼