Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
From MaRDI portal
Deflation techniques are often used to remove already computed eigenpairs from being recomputed and a common procedure is some kind of low-rank modification to the original matrix so as to displace the computed eigenvalues while keeping the unknown eigenvalues unchanged, or shifted in explicitely known ways. The authors propose improvements to their earlier LOBP4dCG algorithm for the linear response eigenvalue problem using a shifting deflation technique and extending the search space. Numerical examples demonstrate the efficiency of the deflation technique and show dramatic increase in the rate of convergence.
Recommendations
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- A refined block conjugate gradient method for symmetric eigenvalue problems
- Minimization principles for the linear response eigenvalue problem. II: Computation
- A block Lanczos method for the linear response eigenvalue problem
Cites work
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- A KQZ algorithm for solving linear-response eigenvalue equations
- Accuracy of the s-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Algorithm 845
- An adaptive block Lanczos algorithm
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Basis selection in LOBPCG
- Bounding the spectrum of large Hermitian matrices
- Convergence of the block Lanczos method for eigenvalue clusters
- Error bounds of Rayleigh-Ritz type contour integral-based eigensolver for solving generalized eigenvalue problems
- Extensions of Wielandt's min-max principles for positive semi-definite pencils
- scientific article; zbMATH DE number 3168599 (Why is no real title available?)
- scientific article; zbMATH DE number 4107010 (Why is no real title available?)
- scientific article; zbMATH DE number 53686 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Minimization principles for the linear response eigenvalue problem. II: Computation
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Rayleigh quotient based optimization methods for eigenvalue problems
- Solution of the large matrix equations which occur in response theory
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Trace minimization and definiteness of symmetric pencils
- Trace minimization principles for positive semi-definite pencils
- Vibrational states of nuclei in the random phase approximation
Cited in
(14)- Heavy ball restarted CMRH methods for linear systems
- A projected preconditioned conjugate gradient method for the linear response eigenvalue problem
- A block Lanczos method for the linear response eigenvalue problem
- Error bounds for approximate deflating subspaces for linear response eigenvalue problems
- Trace minimization method via penalty for linear response eigenvalue problems
- On generalizing trace minimization principles
- Eigenvalue inclusion sets for linear response eigenvalue problems
- Numerical methods for Bogoliubov-de Gennes excitations of Bose-Einstein condensates
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- Minimization principles for the linear response eigenvalue problem. II: Computation
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Convergence analysis of vector extended locally optimal block preconditioned extended conjugate gradient method for computing extreme eigenvalues
- On generalizing trace minimization principles. II
- A Chebyshev locally optimal block preconditioned conjugate gradient method for product and standard symmetric eigenvalue problems
This page was built for publication: Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341304)
