Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C.F. Anfinson, R.P. Brent and F.T. Luk, A theoretical foundation for the weighted checksum scheme in:Proc. SPIE vol 975 Advanced Algorithms and Architectures for Signal Processing III, paper 2, 1988.
D.L. Boley and G.H. Golub, A survey of matrix inverse eigenvalue problems, Inverse Problems, Vol. 3 (Physics Trust Publications, Bristol, England, 1987) pp 595–622.
C. de Boor and G. Golub, The numerically stable reconstruction of a Jacobi matrix from spectral data, Lin. Alg and Appl. 21 (1978) 245–260.
C. Brezinski,Padé-Type Approximants and General Orthogonal Polynomials, ISNM, Vol. 50 (Birkhäuser, Basel/Stuttgart, 1980).
J. Cullum and R. Willoughby,Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Vol. I: Theory (Birkhäuser, Boston, 1985).
G. Cybenko, An explicit formula for Lanczos polynomials, Lin. Alg. and Appl. 88/89 (1987) 99–115.
W. Gautschi, On generating orthogonal polynomials, SIAM J. Sci. and Stat. Comput. 3 (1982) 289–317.
G. Golub and M. Gutknecht, Modified moments for indefinite weight functions, Numer. Math. 57 (1990) 607–624.
G. Golub and C. Van Loan,Matrix Computations 2/e (Johns Hopkins, 1989).
G. Golub and J. Welsch, Calculation of Gauss quadrature rules, Math. Comp. 23 (1969) 221–230.
W.B. Gragg, The Padé table and its relation to certain algorithms of numerical analysis, SIAM Rev. 14 (1972) 1–62.
W.B. Gragg, Matrix interpretations and applications of the continued fraction algorithm, Rocky Mountain J. Math. 4 (1974) 213–225.
M.H. Gutknecht, A completed theory for the unsymmetric Lanczos process and related algorithms, SIAM J. Matrix Anal., 1989, submitted.
M.H. Gutknecht, The unsymmetric Lanczos algorithms and their relations to Padé approximation, continued fractions, the qd algorithm, biconjugate gradient squared algorithms, and fast Hankel solvers, preprint, 1990.
K.H. Juang and J.A. Abraham, Algorithm-based fault tolerance for matrix operations, IEEE Trans. Comput. C-33 Nr. 6 (June 1984) 518–528.
J.Y. Jou and J.A. Abraham, Fault-tolerant matrix arithmetic and signal processing on highly concurrent computing structures; Proc. IEEE 74 Nr. 5, special issue on fault tolerance (May 1986) 732–741.
W. Joubert, Lanczos methods for the solution of nonsymmetric systems of linear equations in:Proc. Copper Mtn. Conf. on Iterative Methods, April 1–5, 1990; submitted to SIAM J. on Sci. and Stat. Comput.
J. Kautsky and G.H. Golub, On calculation of Jacobi matrices, Lin. Alg. and Appl. 52/53 (1983) 439–455.
S. Kaniel, Estimates for some computational techniques in linear algebra, Math. Comp. 20 (1966) 369–378.
M. Kent, Chebyshev, Krylov, Lanczos: Matrix Relationships and Computations, Ph.D. Thesis, Stanford Univ. Computer Sci. Report STAN-CS-89-1271, June 1989.
C. Lanczos, An iteration method for the solution of the eigenvalue problem linear differential and integral operators, J. Res. Natl. Bur. Stand. 45 (1950) 255–282.
F.T. Luk and H. Park, An analysis of algorithm-based fault tolerance, J. Parallel Distr. Comput. 5 (1988) 172–184.
C.C. Paige, The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. Thesis, London Univ., 1971.
B. Parlett,The Symmetric Eigenvalue Problem (Prentice Hall, 1980).
B.N. Parlett, Reduction to tridiagonal form and minimal realizations; preprint submitted to SIAM J. Matrix Anal., 1990.
B.N. Parlett, D.R. Taylor and Z.A. Liu, A look-ahead Lanczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985) 105–124.
H. Rutishauser, Der Quotienten-Differenzen-Algorithmus, Mitt. Inst. angew. Math. ETH, Nr. 7 (Birkhäuser, Basel/Stuttgart, 1957).
Y. Saad, On the rates of convergence of the Lanczos and the block Lanczos methods, SIAM J. Num. Anal. 17 (1980) 687–706.
R. Sack and A. Donovan, An algorithm for Gaussian quadrature given modified moments, Numer. Math. 18 (1972) 465–478.
D. Scott, Analysis of the symmetric Lanczos process, Univ. of Calif., Berkeley, Electronic Res. Lab. Report UCB/ERL M78/40, 1978.
J. Wheeler, Modified moments and Gaussian quadrature, Rocky Mtn. J. Math. 4 (1974) 287–296.
J.H. Wilkinson,The Algebraic Eigenvalue Problem (Clarendon Press, Oxford, 1965).
Author information
Authors and Affiliations
Additional information
The research reported by this author was supported in part by NSF grant CCR-8813493.
The research reported by this author was supported in part by ARO grant DAAL03-90-G-0105 and in part by NSF grant DCR-8412314.
Rights and permissions
About this article
Cite this article
Boley, D.L., Elhay, S., Golub, G.H. et al. Nonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weights. Numer Algor 1, 21–43 (1991). https://doi.org/10.1007/BF02145581
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02145581