Abstract
Predictor polynomials corresponding to nested Toeplitz matrices are known to be connected by the Szego-Levinson recurrence relation. A generalization of that result, where the relevant reduction process for Toeplitz matrices (of decreasing order) is defined by an elementary one-parameter linear transformation, is addressed. The descending and ascending versions of the corresponding generalized Szego-Levinson recurrence relations are discussed in detail. In particular, these relations are shown to be essentially the same as the extraction formulas for canonical Schur and Brune sections in the Dewilde-Dym (1984) recursive solution of the lossless inverse scattering problem. Some extensions of the Levinson algorithm for linear prediction and of the Schur-Cohn algorithm for polynomial stability test are presented. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
