Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization

DOI10.1137/0718008zbMath0478.65023OpenAlexW2088847993MaRDI QIDQ3936103

David S. Scott

Publication date: 1981

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0718008

zbMATH Keywords

numerical examplesgeneralized eigenvalue problemsymmetric matrixLanczos algorithmlargest eigenvalues

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Related Items

A refinement method for maximal deflating bases of regular pencils, Numerical solution of large nonsymmetric eigenvalue problems, The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices, A survey of the advances in the exploitation of the sparsity in the solution of large problems, A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems, Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems, Solving sparse symmetric definite quadratic lambda-matrix problems, Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits, A subspace preconditioning algorithm for eigenvector/eigenvalue computation, Sparse matrices, New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem, A geometric theory for preconditioned inverse iteration. III: A short and sharp convergence estimate for generalized eigenvalue problems, Quantum algorithm for Laplacian eigenmap via Rayleigh quotient iteration