Fast O(n) complexity algorithms for diagonal innovation matrices

DOI10.1109/TASSP.1984.1164459MaRDI QIDQ3698157zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

arithmetic complexitydiagonal innovation matricesHankel matrixsignal processingToeplitz matrix

Mathematics Subject Classification ID

Hermitian, skew-Hermitian, and related matrices (15B57) Direct numerical methods for linear systems and matrix inversion (65F05)

Recommendations

• Fast inversion algorithms for diagonal plus semiseparable matrices
• Fast estimates for the diagonal of the inverse of large scale matrices appearing in applications
• Fast methods for computing the \(p\)-radius of matrices
• A fast randomized algorithm for the approximation of matrices
• Fast recursive algorithm for a class of structured matrices
• Fast block diagonalization of \(k\)-tridiagonal matrices
• Fast commutative matrix algorithms
• On a fast iterative method for approximate inverse of matrices
• Fast Algorithms for Displacement and Low-Rank Structured Matrices
• scientific article; zbMATH DE number 1350351

Cited in

(3)

• Linear complexity algorithms for semiseparable matrices
• A ring of Brownian matrices
• Brownian matrices: properties and extensions

This page was built for publication: Fast O(n) complexity algorithms for diagonal innovation matrices

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