A modification of the Dewilde–van der Veen method for inversion of finite structured matrices

We study a class of block structured matrices R={ R ij } i, j=1 N with a property that the solution of the corresponding system Rx= y of linear algebraic equations may be performed for O( N) arithmetic operations. In this paper for finite invertible matrices we analyze in detail factorization and in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Linear algebra and its applications Ročník 343; s. 419 - 450
Hlavní autoři: Eidelman, Y., Gohberg, I.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.03.2002
Témata:
Factorization algorithms
Inversion algorithms
Linear complexity algorithms
Solution of linear equations
Structured matrices
Factorization algorithms
Structured matrices
Solution of linear equations
Inversion algorithms
Linear complexity algorithms
ISSN:0024-3795, 1873-1856
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í:We study a class of block structured matrices R={ R ij } i, j=1 N with a property that the solution of the corresponding system Rx= y of linear algebraic equations may be performed for O( N) arithmetic operations. In this paper for finite invertible matrices we analyze in detail factorization and inversion algorithms. These algorithms are related to those suggested by P.M. Dewilde and A.J. van der Veen (Time-varying Systems and Computations, Kluwer Academic Publishers, New York, 1998) for a class of finite and infinite matrices with a small Hankel rank. The algorithms presented here are more transparent and are a modification of the algorithms from the above reference. The approach and the proofs are essentially different from those in the above-mentioned reference. The paper contains also analysis of complexity and results of numerical experiments.
ISSN:0024-3795
1873-1856
DOI:10.1016/S0024-3795(01)00363-9