A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance

DOI10.1109/TIT.1983.1056642zbMath0519.65019MaRDI QIDQ3668727

Y. Kamp, Philippe Delsarte, Yves V. Genin

Publication date: 1983

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

zbMATH Keywords

reflection coefficientsSchur algorithmthree-term recurrence relationsChristoffel-Darboux formulageneralized Levinson algorithmnested submatricesSchur-Szegoe parametersToeplitz distance

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (5)

Inversion and factorization of non-Hermitian quasi-Toeplitz matrices ⋮ A generalized Schur-type algorithm for the joint factorization of a structured matrix and its inverse ⋮ Equivalence Classes of Hermitian Matrices and Their Schur Parametrization ⋮ Parametric Toeplitz systems ⋮ On the Toeplitz embedding of an arbitrary matrix

This page was built for publication: A polynomial approach to the generalized Levinson algorithm based on the Toeplitz distance