Fast inversion algorithms of Toeplitz-plus-Hankel matrices (Q1118351)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Fast inversion algorithms of Toeplitz-plus-Hankel matrices |
scientific article; zbMATH DE number 4094670
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast inversion algorithms of Toeplitz-plus-Hankel matrices |
scientific article; zbMATH DE number 4094670 |
Statements
Fast inversion algorithms of Toeplitz-plus-Hankel matrices (English)
0 references
1988
0 references
The authors consider a fast version of matrices \(A=T+H\), where T is Toeplitz and H is Hankel matrix. A variety of algorithms for \(T+H\)-matrix inversions is offered. Some of them can be applied for arbitrary strongly nonsingular \(T+H\)-matrices without additional assumption. The complexity of the different algorithms is compared and some recommendations are given.
0 references
Toeplitz-plus-Hankel matrices
0 references
fast matrix inversion
0 references
algorithms
0 references
complexity
0 references
0.9874234
0 references
0.9535887
0 references
0.95134735
0 references
0.94119704
0 references
0.94119704
0 references
0.9410986
0 references
0.9377766
0 references
