A block Chebyshev-Davidson method for linear response eigenvalue problems
From MaRDI portal
(Redirected from Publication:503482)
Recommendations
- A block Lanczos method for the linear response eigenvalue problem
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- A block Chebyshev-Davidson method for solving symmetric eigenvalue problems
- Minimization principles for the linear response eigenvalue problem. II: Computation
Cites work
- scientific article; zbMATH DE number 3168599 (Why is no real title available?)
- scientific article; zbMATH DE number 3849762 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 766233 (Why is no real title available?)
- A Chebyshev–Davidson Algorithm for Large Symmetric Eigenproblems
- A Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matrices
- A block Chebyshev-Davidson method with inner-outer restart for large eigenvalue problems
- A sharp version of Kahan's theorem on clustered eigenvalues
- A spectral scheme for Kohn-Sham density functional theory of clusters
- Adaptive projection subspace dimension for the thick-restart Lanczos method
- Backward perturbation analysis and residual-based error bounds for the linear response eigenvalue problem
- Bounding the spectrum of large Hermitian matrices
- Canonical formulation of a generalized coupled dispersionless system
- Chebyshev-filtered subspace iteration method free of sparse diagonalization for solving the Kohn-Sham equation
- 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
- Convergence analysis of Lanczos-type methods for the linear response eigenvalue problem
- GMRES with Deflated Restarting
- Matrix algorithms. Vol. 2: Eigensystems
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Minimization principles for the linear response eigenvalue problem. II: Computation
- Numerical methods for large eigenvalue problems
- On the convergence rate of a preconditioned subspace eigensolver
- Reduction of the RPA eigenvalue problem and a generalized Cholesky decomposition for real-symmetric matrices
- Self-consistent-field calculations using Chebyshev-filtered subspace iteration
- The University of Florida sparse matrix collection
- Vibrational states of nuclei in the random phase approximation
Cited in
(11)- Minimization principles for the linear response eigenvalue problem. II: Computation
- Error bounds for approximate deflating subspaces for linear response eigenvalue problems
- On flexible block Chebyshev-Davidson method for solving symmetric generalized eigenvalue problems
- Rayleigh-Ritz majorization error bounds for the linear response eigenvalue problem
- A block Lanczos method for the linear response eigenvalue problem
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
- Backward perturbation analysis and residual-based error bounds for the linear response eigenvalue problem
- Trace minimization method via penalty for linear response eigenvalue problems
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- Thick restarting the weighted harmonic Golub-Kahan-Lanczos algorithm for the linear response eigenvalue problem
- A distributed block Chebyshev-Davidson algorithm for parallel spectral clustering
This page was built for publication: A block Chebyshev-Davidson method for linear response eigenvalue problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503482)
