Fast O(n) complexity algorithms for diagonal innovation matrices
From MaRDI portal
Publication:3698157
DOI10.1109/TASSP.1984.1164459zbMath0577.65025MaRDI QIDQ3698157
Hari Krishna, Salvatore D. Morgera
Publication date: 1984
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
Toeplitz matrix; Hankel matrix; signal processing; arithmetic complexity; diagonal innovation matrices
15B57: Hermitian, skew-Hermitian, and related matrices
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Linear complexity algorithms for semiseparable matrices, A ring of Brownian matrices, Brownian matrices: properties and extensions