The Lanczos algorithm for the generalized symmetric eigenproblem on shared-memory architectures

[1]  Mark T. Jones,et al.  Factoring Symmetric Indefinite Matrices on High-Performance Architectures , 1994 .

[2]  Mark T. Jones,et al.  Bunch-Kaufman factorization for real symmetric indefinite banded matrices , 1993 .

[3]  Anthony T. Chronopoulos,et al.  A class of Lanczos-like algorithms implemented on parallel computers , 1991, Parallel Comput..

[4]  Mark T. Jones,et al.  Lanz: Software Solving the Large Sparse Symmetric Generalized Eigenproblem , 1990 .

[5]  Mark Thomas Jones.  The use of Lanczos' method to solve the generalized eigenproblem , 1990 .

[6]  Merrell L. Patrick,et al.  The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem , 1989 .

[7]  E. L. Poole,et al.  The solution of linear systems of equations with a structural analysis code on the NAS CRAY-2 , 1988 .

[8]  B. Parlett,et al.  How to implement the spectral transformation , 1987 .

[9]  B. Parlett,et al.  The use of a refined error bound when updating eigenvalues of tridiagonals , 1985 .

[10]  H. Simon.  The Lanczos algorithm with partial reorthogonalization , 1984 .

[11]  B. Parlett,et al.  Lanczos versus subspace iteration for solution of eigenvalue problems , 1983 .

[12]  D. Scott.  The Advantages of Inverted Operators in Rayleigh–Ritz Approximations , 1982 .

[13]  B. Parlett.  The Symmetric Eigenvalue Problem , 1981 .

[14]  Jack J. Dongarra,et al.  Unrolling loops in fortran , 1979, Softw. Pract. Exp..

[15]  J. G. Lewis.  Algorithms for sparse matrix eigenvalue problems , 1977 .

[16]  M. Saunders,et al.  Solution of Sparse Indefinite Systems of Linear Equations , 1975 .