DocumentCode :
3035631
Title :
Round-off error propagation in Durbin´s, Levinson´s, and Trench´s algorithms
Author :
Cybenko, George
Author_Institution :
Tufts University, Medford, Massachusetts
Volume :
4
fYear :
1979
fDate :
28946
Firstpage :
498
Lastpage :
501
Abstract :
The subject matter of this paper concerns the round-off error propagation in order n2algorithms for solving problems involving Toeplitz matrices. Since linear predictive techniques owe much of their appeal to the computational efficiency of Durbin´s, Levinson´s, and Trench´s algorithms, it is important to understand the accuracy of these methods. In what appears to be the first analysis of its kind, we derive bounds on the errors due to round-off and discuss their merits and tightness. In particular, it is shown that these errors enjoy certain stability properties and do not grow as quickly as may be feared. Simulations are presented to illustrate the results.
Keywords :
Bibliographies; Computational efficiency; Equations; Error analysis; Gaussian processes; Mathematics; Roundoff errors; Stability; Symmetric matrices;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '79.
Type :
conf
DOI :
10.1109/ICASSP.1979.1170666
Filename :
1170666
Link To Document :
بازگشت