Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices

Matrices represented as a sum of diagonal and semiseparable ones are considered here. These matrices belong to the class of structured matrices which arises in numerous applications. Fast O( N) algorithms for their inversion were developed before under additional restrictions which were a source of...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & mathematics with applications (1987) Vol. 33; no. 4; pp. 69 - 79
Main Authors:	Eidelman, Y., Gohberg, I.
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.02.1997
Subjects:	Linear complexity algorithm Semiseparable matrices Linear complexity algorithm Semiseparable matrices
ISSN:	0898-1221, 1873-7668
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Matrices represented as a sum of diagonal and semiseparable ones are considered here. These matrices belong to the class of structured matrices which arises in numerous applications. Fast O( N) algorithms for their inversion were developed before under additional restrictions which were a source of instability. Our aim is to eliminate these restrictions and to develop reliable and stable numerical algorithms. In this paper, the case of semiseparable matrices of order one is considered.
ISSN:	0898-1221 1873-7668
DOI:	10.1016/S0898-1221(97)00008-4