Extended concept of stair-shape sparsity for the inverse of an asymmetric matrix (Q2365959)

The concept of stair-shape sparsity introduced by the author [ibid. 25, No. 5, 83-90 (1993); reviewed below] for a symmetric matrix is extended for an asymmetric matrix \(A\) to reduce the complexity in inverting and in solving large sparse sets of linear algebraic equations. Suppose \(A^{- 1}=LDU\), where \(L\) is a lower triangular matrix with unit diagonal coefficients, \(D\) is a diagonal matrix, and \(U\) is an upper triangular matrix. First, \(A\) is considered as composed of \(L\) and \(U\) with the same sparsity structure of the corresponding parts as \(A\). Then the stair- shape sparsity applies to \(L\) and \(U\) in the form of element-based or block-based procedures.