Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices

Recommendations

Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
scientific article; zbMATH DE number 4078636
The Davidson Method
A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
Is Jacobi--Davidson Faster than Davidson?

Cited in

(65)

An extended shift-invert residual Arnoldi method
Solution of large eigenvalue problems in electronic structure calculations
A block Arnoldi method for the \(SP_N\) equations
Davidson's method and preconditioning for generalized eigenvalue problems
Numerical simulation of three dimensional pyramid quantum dot
Computation of a few small eigenvalues of a large matrix with application to liquid crystal modeling
Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
Computation of the fundamental singular subspace of a large matrix
Computing interior eigenvalues of large matrices
Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel
A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD
A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems
A note on harmonic Ritz values and their reciprocals
The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
A new iterative scheme for obtaining eigenvectors of large, real- symmetric matrices
A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
scientific article; zbMATH DE number 4078636 (Why is no real title available?)
Alternative correction equations in the Jacobi-Davidson method
A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
Inverse, shifted inverse, and Rayleigh quotient iteration as Newton's method
On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
Numerical solution of linear eigenvalue problems
Eigenvalue computation in the 20th century
New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
Preconditioning eigenvalues and some comparison of solvers
Efficient solution of the simplified \(P_N\) equations
On convergence of iterative projection methods for symmetric eigenvalue problems
On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
A refined Jacobi-Davidson method and its correction equation
Eigenvalue perturbation and generalized Krylov subspace method
On correction equations and domain decomposition for computing invariant subspaces
Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
A subspace preconditioning algorithm for eigenvector/eigenvalue computation
A new method for diagonalising large matrices
Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems I: The Preconditioning Aspect
Convergence Estimates for the Generalized Davidson Method for Symmetric Eigenvalue Problems II: The Subspace Acceleration
On global convergence of subspace projection methods for Hermitian eigenvalue problems
Numerical solution of large nonsymmetric eigenvalue problems
Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
scientific article; zbMATH DE number 4182700 (Why is no real title available?)
Is Jacobi--Davidson Faster than Davidson?
A block preconditioned harmonic projection method for large-scale nonlinear eigenvalue problems
Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems
On the subspace projected approximate matrix method.
Global convergence of the restarted Lanczos and Jacobi-Davidson methods for symmetric eigenvalue problems
Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices
State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
Robust preconditioning of large, sparse, symmetric eigenvalue problems
The subspace projected approximate matrix (SPAM) modification of the Davidson method
Some progress on parallel modal and vibration analysis using the JAUMIN framework
Super-matrix methods
The trace minimization method for the symmetric generalized eigenvalue problem
Computational materials science and engineering
Harmonic projection methods for large non-symmetric eigenvalue problems

This page was built for publication: Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices

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