Share Email Print

Proceedings Paper

Orthogonal polynomials, Hankel matrices, and the Lanczos algorithm
Author(s): Daniel L. Boley
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

We explore the application of the nonsymmetric Lanczos algorithm to two different problem domains, the theory of moments and orthogonal polynomials, and the factorization of Hankel matrices. The connection with a third problem domain, algorithm-based fault tolerant computing, was explored in a companion paper. We find that in the simplest case, where all leading submatrices are nonsingular, the methods reduce to classical algorithms such as the original nonsymmetric Lanczos method and the Chebyshev algorithm. We propose a back-up pivoting strategy for factorizing a Hankel matrix which avoids treating rank deficiency as a special case.

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.49814
Show Author Affiliations
Daniel L. Boley, Univ. of Minnesota (United States)

Published in SPIE Proceedings Vol. 1566:
Advanced Signal Processing Algorithms, Architectures, and Implementations II
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top