Efficient algorithms for the solution of block linear systems with Toeplitz entries
From MaRDI portal
Publication:1208301
DOI10.1016/0024-3795(93)90322-FzbMath0764.65013MaRDI QIDQ1208301
Nicholas Kalouptsidis, George-Othon Glentis
Publication date: 16 May 1993
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
fast algorithms; parallel processing; Toeplitz matrices; block Levinson structure; block linear systems with Toeplitz entries; positive definite block matrix
65Y05: Parallel numerical computation
65F05: Direct numerical methods for linear systems and matrix inversion
Cites Work
- Unnamed Item
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- Highly parallel multichannel LS algorithms and application to decision-feedback equalizers
- Fast recursive algorithms for a class of linear equations
- A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systems
- Efficient inversion of Toeplitz-block Toeplitz matrix
- Fast algorithm for identification of an ARX model and its order determination
- A fixed point computation of partial correlation coefficients
- Block Toeplitz Matrix Inversion
- Algorithms for Triangular Decomposition of Block Hankel and Toeplitz Matrices with Application to Factoring Positive Matrix Polynomials