Abstract
A new linear complexity algorithm for general nonsingular semiseparable matrices is presented. For symmetric matrices whose semiseparability rank equals to 1 this algorithm leads to an explicit formula for the inverse matrix.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Rozsa, P., Belivacqua, R., Romani, F. and Favati, P., 1991, “On band matrices and their inverses”, Linear Alg. Appl. 150, 287–295.
Eidelman, Y. and Gohberg, I. 1997, “Fast inversion algorithms for diagonal plus semiseparable matrices”, Integ. Eq. Op. Theory, 27, 165–183.
Eidelman, Y. and Gohberg, I., “Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices”, Computer and Mathematics, to appear.
Golub, G. H., and Van Loan, C. H. 1983, “Matrix Computations”, Johns Hopkins University Press, Baltimore.
Gohberg, I., Kailath, T. and Koltracht, I., 1985, “Linear complexity algorithms for semiseparable matrices”, Integ. Eq. Op. Theory, 8, 780–804.
Gohberg, I. and Kaashoek M.A., 1984, “Time varying linear systems with boundary conditions and integral operators, I. The transfer operator and its properties”, Integ. Eq. Op. Theory, 7, 325–391.
Gonzales, R.A., Eisert, J., Koltracht, I., Neumann, M. and Rawitscher, G., 1997, “Integral equation method for the continuous spectrum radial Schroedinger equation”, Journal of Computational Physics, 134, 134–149.
Author information
Authors and Affiliations
Additional information
Supported in part by the NSF Grant DMS 9306357