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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & mathematics with applications (1987) Ročník 33; číslo 4; s. 69 - 79
Hlavní autori:	Eidelman, Y., Gohberg, I.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.02.1997
Predmet:	Linear complexity algorithm Semiseparable matrices Linear complexity algorithm Semiseparable matrices
ISSN:	0898-1221, 1873-7668
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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