Abstract
Here are considered matrices represented as a sum of diagonal and semiseparable ones. These matrices belong to the class of structured matrices which arises in numerous applications. FastO(N) algorithms for their inversion were developed before under additional restrictions which are a source of instability. Our aim is to eliminate these restrictions and to develop reliable and stable numerical algorithms. In this paper we obtain such algorithms with the only requirement that the considered matrix is invertible and its determinant is not close to zero. The case of semiseparable matrices of order one was considered in detail in an earlier paper of the authors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Gohberg, T. Kailath and I. Koltracht,Linear complexity algorithms for semiseparable matrices, Integral Equations and Operator Theory8 (1985), 780–804.
I. Gohberg, T. Kailath and I. Koltracht,A note on diagonal innovation matrices, Acoustics, Speech and Signal Processing7 (1987), 1068–1069.
I. Gohberg and M. A. Kaashoek,Time varying linear systems with boundary conditions and integral operators, 1. The transfer operator and its properties, Integral Equations and Operator Theory7 (1984), 325–391.
Y. Eidelman and I. Gohberg,Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices, In Press.
U. M. Ascher, R. M. M. Mattheij and R. D. Russel,Numerical Solution of Boundary Value Problems for Ordinary Differential Equations, SIAM, Philadelphia, 1995.
G. Golub and C. Van Loan,Matrix Computations, John Hopkins U.P., Baltimore, 1989.