Share Email Print

Proceedings Paper

Solution of the Yule-Walker equations
Author(s): I. Gohberg; Israel Koltracht; Tongsan D. Xiao
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The structured condition number of the solution of the Yule-Walker system of equations is given. It is found that there is little difference between this structured condition and the general condition number of a Toeplitz matrix. As a consequence, general purpose linear system solvers are stable for solving the Yule-Walker equations. By constructing appropriate examples it is shown that the Levinson algorithm is only weakly stable and is less trustworthy than the LDLT algorithm. Our round-off error analysis also suggests that for better accuracy Schur coefficients should be computed by the Schur algorithm and then used in the Levinson algorithm for computing the solution of Yule-Walker equations.

Paper Details

Date Published: 1 December 1991
PDF: 9 pages
Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991);
Show Author Affiliations
I. Gohberg, Tel-Aviv Univ. (Israel)
Israel Koltracht, Univ. of Connecticut (United States)
Tongsan D. Xiao, Univ. of Connecticut (United States)

Published in SPIE Proceedings Vol. 1566:
Advanced Signal Processing Algorithms, Architectures, and Implementations II
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?