Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization

DOI10.1137/0718008MaRDI QIDQ3936103zbMATH OpenOpenAlexFDO

Authors 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

generalized eigenvalue problemLanczos algorithmlargest eigenvaluesnumerical examplessymmetric matrix

Mathematics Subject Classification ID

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

Cited in

(13)

• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• Solving sparse symmetric definite quadratic lambda-matrix problems
• 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
• 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
• Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
• Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits
• Quantum algorithm for Laplacian eigenmap via Rayleigh quotient iteration
• A block preconditioned harmonic projection method for large-scale nonlinear eigenvalue problems
• Sparse matrices
• A subspace preconditioning algorithm for eigenvector/eigenvalue computation

This page was built for publication: Solving Sparse Symmetric Generalized Eigenvalue Problems without Factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936103)