Share Email Print

Proceedings Paper

Three Term Recurrences And Fast Algorithms For Toeplitz Matrices
Author(s): Hari Krishna
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 20 April 1988
PDF: 8 pages
Proc. SPIE 0880, High Speed Computing, (20 April 1988); doi: 10.1117/12.944049
Show Author Affiliations
Hari Krishna, Syracuse University (United States)

Published in SPIE Proceedings Vol. 0880:
High Speed Computing
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top