Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights

The nonsymmetric Lanczos algorithm reduces a general matrix to tridiagonal by generating two sequences of vectors which satisfy a mutual bi-orthogonality property. The process can proceed as long as the two vectors generated at each stage are not mutually orthogonal, otherwise the process breaks down. In this paper, we propose a variant that does not break down by grouping the vectors into clusters and enforcing the bi-orthogonality property only between different clusters, but relaxing the property within clusters. We show how this variant of the matrix Lanczos algorithm applies directly to a problem of computing a set of orthogonal polynomials and associated indefinite weights with respect to an indefinite inner product, given the associated moments. We discuss the close relationship between the modified Lanczos algorithm and the modified Chebyshev algorithm. We further show the connection between this last problem and checksum-based error correction schemes for fault-tolerant computing.

[1]  Gene H. Golub,et al.  Calculation of Gauss quadrature rules , 1967, Milestones in Matrix Computation.

[2]  Franklin T. Luk,et al.  An Analysis of Algorithm-Based Fault Tolerance Techniques , 1988, J. Parallel Distributed Comput..

[3]  Jacob A. Abraham,et al.  Algorithm-Based Fault Tolerance for Matrix Operations , 1984, IEEE Transactions on Computers.

[4]  Beresford N. Parlett,et al.  Reduction to Tridiagonal Form and Minimal Realizations , 1992, SIAM J. Matrix Anal. Appl..

[5]  Gene H. Golub,et al.  On the calculation of Jacobi Matrices , 1983 .

[6]  W. Gautschi.  On Generating Orthogonal Polynomials , 1982 .

[7]  G. Golub,et al.  Modified moments for indefinite weight functions , 1990 .

[8]  Zhishun A. Liu,et al.  A Look Ahead Lanczos Algorithm for Unsymmetric Matrices , 1985 .

[9]  Christopher C. Paige,et al.  The computation of eigenvalues and eigenvectors of very large sparse matrices , 1971 .

[10]  J. Wheeler,et al.  Modified moments and Gaussian quadratures , 1974 .

[11]  Y. Saad.  On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods , 1980 .

[12]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[13]  R. A. Sack,et al.  An algorithm for Gaussian quadrature given modified moments , 1971 .

[14]  H. Rutishauser.  Der Quotienten-Differenzen-Algorithmus , 1954 .

[15]  Wayne Joubert,et al.  Lanczos Methods for the Solution of Nonsymmetric Systems of Linear Equations , 1992, SIAM J. Matrix Anal. Appl..

[16]  W. Gragg.  Matrix interpretations and applications of the continued fraction algorithm , 1974 .

[17]  J.A. Abraham,et al.  Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures , 1986, Proceedings of the IEEE.

[18]  Gene H. Golub,et al.  Matrix computations , 1983 .

[19]  C. Brezinski.  Padé-type approximation and general orthogonal polynomials , 1980 .

[20]  Mark David Kent.  Chebyshev, Krylov, Lanczos : matrix relationships and computations , 1989 .

[21]  Gene H. Golub,et al.  The numerically stable reconstruction of a Jacobi matrix from spectral data , 1977, Milestones in Matrix Computation.

[22]  Franklin T. Luk,et al.  A Theoretical Foundation For The Weighted Checksum Scheme , 1988, Optics & Photonics.

[23]  W. Gragg,et al.  The Padé Table and Its Relation to Certain Algorithms of Numerical Analysis , 1972 .

[24]  G. Golub,et al.  A survey of matrix inverse eigenvalue problems , 1986 .

[25]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[26]  George Cybenko,et al.  An explicit formula for Lanczos polynomials , 1987 .

[27]  S. Kaniel.  Estimates for Some Computational Techniques - in Linear Algebra , 1966 .

[28]  J. Cullum,et al.  Lanczos algorithms for large symmetric eigenvalue computations , 1985 .

[29]  M. Gutknecht.  A Completed Theory of the Unsymmetric Lanczos Process and Related Algorithms. Part II , 1994, SIAM J. Matrix Anal. Appl..