Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
From MaRDI portal
Publication:3609033
DOI10.1137/060675435zbMath1159.65319OpenAlexW2024735648MaRDI QIDQ3609033
No author found.
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)
Related Items (10)
Direct minimization for ensemble electronic structure calculations ⋮ On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems ⋮ Limited‐memory polynomial methods for large‐scale matrix functions ⋮ Rational approximation to the Fermi-Dirac function with applications in density functional theory ⋮ Accelerating data uncertainty quantification by solving linear systems with multiple right-hand sides ⋮ A spectrum slicing method for the Kohn-Sham problem ⋮ On Chebyshev-Davidson method for symmetric generalized eigenvalue problems ⋮ Cucheb: a GPU implementation of the filtered Lanczos procedure ⋮ Solving large-scale interior eigenvalue problems to investigate the vibrational properties of the boson peak regime in amorphous materials ⋮ On relaxed filtered Krylov subspace method for non-symmetric eigenvalue problems
Uses Software
This page was built for publication: Computation of Large Invariant Subspaces Using Polynomial Filtered Lanczos Iterations with Applications in Density Functional Theory
