Storage compression of inverses of band matrices
The inverse of a general upper Hessenberg matrix is usually full, but, because of its structure, it can often be stored in fewer locations than are needed for a general full matrix. This paper presents a deflation procedure for compressing the inverse, and discusses its numerical implementation. In addition, a recursive scheme for calculating and storing the inverse of a banded matrix is described.
scientific article; zbMATH DE number 4162140
scientific article