The Levinson recurrence and fast algorithms for solving Toeplitz systems of linear equations
- 1 June 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Acoustics, Speech, and Signal Processing
- Vol. 35 (6), 839-848
- https://doi.org/10.1109/tassp.1987.1165219
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Levinson recurrence and fast algorithms for solving Toeplitz systems of linear equationsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1987
- A fast algorithm for solving a Toeplitz system of equationsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- Zero location with respect to the unit circle of discrete-time linear system polynomialsProceedings of the IEEE, 1984
- On the reducibility of finite Toeplitz matrices - applications in speech analysis and pattern recognitionSignal Processing, 1982
- Fast recursive algorithms for a class of linear equationsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of EquationsSIAM Journal on Scientific and Statistical Computing, 1980
- Fast algorithms for rational Hermite approximation and solution of Toeplitz systemsIEEE Transactions on Circuits and Systems, 1979
- Inverses of Toeplitz Operators, Innovations, and Orthogonal PolynomialsSIAM Review, 1978
- The Solution of a Toeplitz Set of Linear EquationsJournal of the ACM, 1974
- An Algorithm for the Inversion of Finite Toeplitz MatricesJournal of the Society for Industrial and Applied Mathematics, 1964