@inproceedings{e4afc2875fbf408da045d84cf1d1eaed,

title = "Orthogonal polynomials, Hankel matrices, and the Lanczos algorithm",

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.",

author = "Boley, {Daniel L.}",

year = "1991",

language = "English (US)",

isbn = "0819406945",

series = "Proceedings of SPIE - The International Society for Optical Engineering",

publisher = "Publ by Int Soc for Optical Engineering",

pages = "84--95",

editor = "Luk, {Franklin T.}",

booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

note = "Advanced Signal Processing Algorithms, Architectures, and Implementations II ; Conference date: 24-07-1991 Through 26-07-1991",

}