On the mathematical foundations of the generalized Levinson algorithm
- 24 March 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7, 1717-1720
- https://doi.org/10.1109/icassp.1982.1171420
Abstract
The paper is concerned with the generalized Levinson algorithm based on the displacement rank concept. It turns out that this algorithm for inverting an arbitrary positive definite matrix can be approached from two different mathematical viewpoints : the theory of Σ-lossless transfer functions on the one hand and the matrix version of the standard Levinson algorithm applied to an appropriate block-Toeplitz embedding of the given matrix on the other hand.Keywords
This publication has 5 references indexed in Scilit:
- A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distanceIEEE Transactions on Information Theory, 1983
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matricesLinear Algebra and its Applications, 1979
- Displacement ranks of matrices and linear equationsJournal of Mathematical Analysis and Applications, 1979
- Orthogonal polynomial matrices on the unit circleIEEE Transactions on Circuits and Systems, 1978
- The multiplicative structure of 𝐽-contractive matrix functionsAmerican Mathematical Society Translations: Series 2, 1960