Proceedings Paper
Look-ahead Schur-type algorithm for solving general Toeplitz systems| Format | Member Price | Non-Member Price |
|---|---|---|
| $17.00 | $21.00 |
Paper Abstract
The classical fast Toeplitz solvers, such as the Levinson algorithm and Schur-type algorithms, require that all leading principal submatrices of the Toeplitz matrix be nonsingular, and they are numerically unstable for general Toeplitz systems. We present a Schur-type algorithm with look-ahead that can be applied to general Toeplitz systems with singular and nonsingular, but ill-conditioned leading principal submatrices.
Paper Details
Date Published: 28 October 1994
PDF: 12 pages
Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190860
Published in SPIE Proceedings Vol. 2296:
Advanced Signal Processing: Algorithms, Architectures, and Implementations V
Franklin T. Luk, Editor(s)
PDF: 12 pages
Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190860
Show Author Affiliations
Roland W. Freund, AT&T Bell Labs. (United States)
Published in SPIE Proceedings Vol. 2296:
Advanced Signal Processing: Algorithms, Architectures, and Implementations V
Franklin T. Luk, Editor(s)
© SPIE. Terms of Use
