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