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ženo v:

Podrobná bibliografie
Vydáno v:	Computers & mathematics with applications (1987) Ročník 33; číslo 4; s. 69 - 79
Hlavní autoři:	Eidelman, Y., Gohberg, I.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.02.1997
Témata:	Linear complexity algorithm Semiseparable matrices Linear complexity algorithm Semiseparable matrices
ISSN:	0898-1221, 1873-7668
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

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