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

DOI10.1137/0907054zbMATH Open0602.65020OpenAlexW1963495087MaRDI QIDQ3738470FDOQ3738470

Authors: Ronald B. Morgan, David S. Scott 

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

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?

zbMATH Keywords

global convergencediagonal preconditioningeigenpairslarge sparse symmetric matrices

Mathematics Subject Classification ID

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

Cited In (65)

• An extended shift-invert residual Arnoldi method
• Solution of large eigenvalue problems in electronic structure calculations
• 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
• Solving large nonlinear generalized eigenvalue problems from density functional theory calculations in parallel
• Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
• A multigrid accelerated eigensolver for the Hermitian Wilson-Dirac operator in lattice QCD
• Computation of the fundamental singular subspace of a large matrix
• A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
• Computing interior eigenvalues of large matrices
• A Filtered-Davidson Method for Large Symmetric Eigenvalue Problems
• The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices
• 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
• Alternative correction equations in the Jacobi-Davidson method
• Inverse, shifted inverse, and Rayleigh quotient iteration as Newton's method
• A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
• On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
• Eigenvalue computation in the 20th century
• On restarting the Arnoldi method for large nonsymmetric eigenvalue problems
• 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
• A refined Jacobi-Davidson method and its correction equation
• Eigenvalue perturbation and generalized Krylov subspace method
• Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
• On correction equations and domain decomposition for computing invariant subspaces
• Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
• An integrated Davidson and multigrid solution approach for very large scale symmetric eigenvalue problems
• Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
• 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
• Numerical solution of large nonsymmetric eigenvalue problems
• Is Jacobi--Davidson Faster than Davidson?
• A block preconditioned harmonic projection method for large-scale nonlinear eigenvalue problems
• Accelerating large partial EVD/SVD calculations by filtered block Davidson methods
• Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
• JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
• Convergence proof of the harmonic Ritz pairs of iterative projection methods with restart strategies for symmetric eigenvalue problems
• A block Chebyshev-Davidson method with inner-outer restart for large 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
• Harmonic projection methods for large non-symmetric eigenvalue problems
• A block Arnoldi method for the \(SP_N\) equations
• A note on harmonic Ritz values and their reciprocals
• TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
• Title not available (Why is that?)
• Numerical solution of linear eigenvalue problems
• On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
• On global convergence of subspace projection methods for Hermitian eigenvalue problems
• Title not available (Why is that?)
• Computational materials science and engineering

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)