Translator Disclaimer
1 December 1991 Solution of the Yule-Walker equations
Author Affiliations +
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.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
I. Gohberg, Israel Koltracht, and Tongsan D. Xiao "Solution of the Yule-Walker equations", Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); https://doi.org/10.1117/12.49808
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

L-curve for the MINRES method
Proceedings of SPIE (November 12 2000)
Stability of Bareiss algorithm
Proceedings of SPIE (November 30 1991)
How bad are symmetric Pick matrices?
Proceedings of SPIE (November 12 2000)
Accurate fast Hankel matrix solver
Proceedings of SPIE (November 30 1991)

Back to Top