Proceedings Paper
Stability of Bareiss algorithm| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper Abstract
In this paper, we present a numerical stability analysis of Bareiss algorithm for solving a symmetric positive definite Toeplitz system of linear equations. We also compare Bareiss algorithm with Levinson algorithm and conclude that the former has superior numerical properties.
Paper Details
Date Published: 1 December 1991
PDF: 12 pages
Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); doi: 10.1117/12.49809
Published in SPIE Proceedings Vol. 1566:
Advanced Signal Processing Algorithms, Architectures, and Implementations II
Franklin T. Luk, Editor(s)
PDF: 12 pages
Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); doi: 10.1117/12.49809
Show Author Affiliations
Adam W. Bojanczyk, Cornell Univ. (United States)
Richard P. Brent, Australian National Univ. (Australia)
Richard P. Brent, Australian National Univ. (Australia)
F. R. de Hoog, CSRIO (Australia)
Published in SPIE Proceedings Vol. 1566:
Advanced Signal Processing Algorithms, Architectures, and Implementations II
Franklin T. Luk, Editor(s)
© SPIE. Terms of Use
