20 April 1988 Three Term Recurrences And Fast Algorithms For Toeplitz Matrices
Author Affiliations +
Proceedings Volume 0880, High Speed Computing; (1988) https://doi.org/10.1117/12.944049
Event: 1988 Los Angeles Symposium: O-E/LASE '88, 1988, Los Angeles, CA, United States
Abstract
In this work, we study the design of computationally efficient order-recursive algorithms for computing the predictor polynomial and the reflection coefficients associated with a real, symmetric, positive-definite Toeplitz matrix T,and for solving the linear systemTx=b. New algorithms are derived which lead to significant improvements in the computational com-plexity as compared to the previously known order-recursive algorithms. They also provide further insight into the mathematical properties of the structurally rich Toeplitz matrices.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Hari Krishna, "Three Term Recurrences And Fast Algorithms For Toeplitz Matrices", Proc. SPIE 0880, High Speed Computing, (20 April 1988); doi: 10.1117/12.944049; https://doi.org/10.1117/12.944049
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT

Algorithm For Singular Value Decomposition
Proceedings of SPIE (November 28 1984)
Direction-set-based algorithm for spectral estimation
Proceedings of SPIE (November 13 2000)
CORDIC Algorithms: Theory And Extensions
Proceedings of SPIE (November 14 1989)
The seven wonders of computer arithmetic
Proceedings of SPIE (October 26 2004)
Approximations and fast algorithms
Proceedings of SPIE (December 05 2001)
Manipulator path planning in 3-dimensional space
Proceedings of SPIE (June 09 2006)

Back to Top