Structural and computational properties of possibly singular semiseparable matrices (Q5956249)

A generalization of a classical result about the inverses of semiseperable matrices is presented. It is pointed out that the structure of inverse of a general semiseperable matrix \(A\) suitably perturbed by a sparse perturbation can be determined according to the rank profile of \(A\). General recurrences among the rows and columns of \(A\) are established and recursive computational schemes of linear complexity are provided for the construction of a reflexive generalized inverse of \(A\) and also for the determination of its characteristic polynomial.