Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
DOI10.1137/060675435zbMATH Open1159.65319OpenAlexW2024735648MaRDI QIDQ3609033FDOQ3609033
Author name not available (Why is that?)
Publication date: 6 March 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/87298
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cited In (11)
- A spectrum slicing method for the Kohn-Sham problem
- Solving large-scale interior eigenvalue problems to investigate the vibrational properties of the boson peak regime in amorphous materials
- On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- Limited‐memory polynomial methods for large‐scale matrix functions
- Direct minimization for calculating invariant subspaces in density functional computations of the electronic structure
- Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides
- On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
- Rational approximation to the Fermi-Dirac function with applications in density functional theory
- Direct minimization for ensemble electronic structure calculations
- Cucheb: a GPU implementation of the filtered Lanczos procedure
Uses Software
This page was built for publication: Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3609033)
