Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
DOI10.1007/S11425-016-0297-1zbMATH Open1358.65021OpenAlexW2410795307MaRDI QIDQ341304FDOQ341304
W. Lin, Zhaojun Bai, Ren-Cang Li
Publication date: 16 November 2016
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-016-0297-1
preconditioningalgorithmeigenvalue problemnumerical exampledeflationlinear responseconjugate-gradient
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- An Inverse Free Preconditioned Krylov Subspace Method for Symmetric Generalized Eigenvalue Problems
- Algorithm 845
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- Solution of the large matrix equations which occur in response theory
- A KQZ algorithm for solving linear-response eigenvalue equations
- Trace minimization and definiteness of symmetric pencils
- An adaptive block Lanczos algorithm
- Trace minimization principles for positive semi-definite pencils
- Minimization principles and computation for the generalized linear response eigenvalue problem
- Minimization principles for the linear response eigenvalue problem. II: Computation
- Extensions of Wielandt’s min–max principles for positive semi-definite pencils
- Vibrational states of nuclei in the random phase approximation
- Rayleigh Quotient Based Optimization Methods for Eigenvalue Problems
- On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
- Minimization Principles for the Linear Response Eigenvalue Problem I: Theory
- Convergence of the block Lanczos method for eigenvalue clusters
- Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision
- Bounding the spectrum of large Hermitian matrices
- Error bounds of Rayleigh-Ritz type contour integral-based eigensolver for solving generalized eigenvalue problems
- Basis selection in LOBPCG
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Numerical methods for Bogoliubov-de Gennes excitations of Bose-Einstein condensates
- Error bounds for approximate deflating subspaces for linear response eigenvalue problems
- Heavy ball restarted CMRH methods for linear systems
- On generalizing trace minimization principles
- Eigenvalue inclusion sets for linear response eigenvalue problems
- Efficient and accurate algorithms for solving the Bethe-Salpeter eigenvalue problem for crystalline systems
- 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
- Trace minimization method via penalty for linear response eigenvalue problems
- On generalizing trace minimization principles. II
Uses Software
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)
