Exact and first-order error analysis of the Schur and split Schur algorithms: Theory and practice

see the original item page
in the repository's web site and access all digital files if the item*

1994 (EN)
Exact and first-order error analysis of the Schur and split Schur algorithms: Theory and practice (EN)

Glaros, Nicholas (EN)
Carayannis, George (EN)

N/A (EN)

A new analytical methodology is introduced here for fixed-point error analysis of various Toeplitz solving algorithms. The method is applied to the very useful Schur algorithm and the lately introduced split Schur algorithm. Both exact and first order error analysis are provided in this paper. The theoretical results obtained are consistent with experimentation. Besides the intrinsic symmetry of the error propagation recursive formulae, the technique presented here is capable of explaining many practical situations: For signals having a small eigenvalue spread the Schur algorithm behaves better than the split Schur in the fixed-point environment. The intermediate coefficients of the split Schur algorithm leading to the PARCOR's cannot serve as alternatives to the reflection coefficients in error sensitive applications. It is demonstrated that the error-weight vectors of the Schur propagation mechanism follow Levinson-like (second order) recursions, while the same vectors of the split Schur propagation mechanism follow split Levinson-like (third-order) recursions. (EN)


Computational methods (EN)
Convergence of numerical methods (EN)
Error analysis (EN)
Durbin algorithms (EN)
Correlation methods (EN)
Split Schur algorithms (EN)
Signal filtering and prediction (EN)
Algorithms (EN)
Recursive functions (EN)
Toeplitz solving algorithms (EN)
Schur algorithms (EN)
Levinson algorithms (EN)
Eigenvalues and eigenfunctions (EN)
Mathematical models (EN)
First order error analysis (EN)

Εθνικό Μετσόβιο Πολυτεχνείο (EL)
National Technical University of Athens (EN)

IEEE Transactions on Signal Processing (EN)


IEEE, Piscataway, NJ, United States (EN)

*Institutions are responsible for keeping their URLs functional (digital file, item page in repository site)