Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
From MaRDI portal
Publication:3738470
DOI10.1137/0907054zbMath0602.65020OpenAlexW1963495087MaRDI QIDQ3738470
David S. Scott, Ronald B. Morgan
Publication date: 1986
Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/21ab2bdf86aee18867e7e167ffa7645e8a8e2ae5
Related Items
On global convergence of subspace projection methods for Hermitian eigenvalue problems ⋮ Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems ⋮ Super-matrix methods ⋮ Numerical solution of large nonsymmetric eigenvalue problems ⋮ The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices ⋮ A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices ⋮ Computation of the fundamental singular subspace of a large matrix ⋮ Accelerating large partial EVD/SVD calculations by filtered block Davidson methods ⋮ A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix ⋮ Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem ⋮ Some progress on parallel modal and vibration analysis using the JAUMIN framework ⋮ A Block Preconditioned Harmonic Projection Method for Large-Scale Nonlinear Eigenvalue Problems ⋮ Numerical simulation of three dimensional pyramid quantum dot ⋮ Harmonic projection methods for large non-symmetric eigenvalue problems ⋮ Robust preconditioning of large, sparse, symmetric eigenvalue problems ⋮ A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices ⋮ Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems ⋮ Iterative methods for the computation of a few eigenvalues of a large symmetric matrix ⋮ Solution of large eigenvalue problems in electronic structure calculations ⋮ Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems ⋮ A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems ⋮ A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ Numerical solution of linear eigenvalue problems ⋮ A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems ⋮ Davidson's method and preconditioning for generalized eigenvalue problems ⋮ Alternative correction equations in the Jacobi-Davidson method ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ On restarting the Arnoldi method for large nonsymmetric eigenvalue problems ⋮ TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems ⋮ State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems ⋮ Computational Materials Science and Engineering ⋮ On the subspace projected approximate matrix method. ⋮ Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems ⋮ An extended shift-invert residual Arnoldi method ⋮ A subspace preconditioning algorithm for eigenvector/eigenvalue computation ⋮ Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices ⋮ Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices ⋮ Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel ⋮ A refined Jacobi-Davidson method and its correction equation ⋮ An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems ⋮ JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices ⋮ The subspace projected approximate matrix (SPAM) modification of the Davidson method ⋮ Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems ⋮ Efficient solution of the simplified \(P_N\) equations ⋮ On convergence of iterative projection methods for symmetric eigenvalue problems ⋮ A note on harmonic Ritz values and their reciprocals ⋮ Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling ⋮ On correction equations and domain decomposition for computing invariant subspaces ⋮ New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem ⋮ A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc ⋮ Eigenvalue perturbation and generalized Krylov subspace method ⋮ Eigenvalue computation in the 20th century ⋮ Preconditioning eigenvalues and some comparison of solvers ⋮ The trace minimization method for the symmetric generalized eigenvalue problem ⋮ Inverse, Shifted Inverse, and Rayleigh Quotient Iteration as Newton's Method ⋮ Computing interior eigenvalues of large matrices ⋮ A Block Arnoldi Method for the SPN Equations