Fast inversion algorithms of Toeplitz-plus-Hankel matrices

From MaRDI portal





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.




Cited in
(27)








This page was built for publication: Fast inversion algorithms of Toeplitz-plus-Hankel matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1118351)