28 October 1994 Look-ahead Schur-type algorithm for solving general Toeplitz systems
Author Affiliations +
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.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Roland W. Freund, Roland W. Freund, } "Look-ahead Schur-type algorithm for solving general Toeplitz systems", Proc. SPIE 2296, Advanced Signal Processing: Algorithms, Architectures, and Implementations V, (28 October 1994); doi: 10.1117/12.190860; https://doi.org/10.1117/12.190860
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Job-shop scheduling applied to computer vision
Proceedings of SPIE (September 18 1997)
Validating image-processing algorithms
Proceedings of SPIE (June 05 2000)
Nonparametric Estimation Of Fractal Dimension
Proceedings of SPIE (October 24 1988)
A Parallel Threshold Selection Algorithm
Proceedings of SPIE (April 20 1986)
A Linear Array For Covariance Differencing Via Hyperbolic SVD
Proceedings of SPIE (November 13 1989)

Back to Top