Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Computer Physics Communications

Chebyshev kernel polynomial method for efficient calculation of the quasiparticle random phase approximation response function

Antonio Bjelčić, Tamara Nikšić, Zlatko Drmač

Published Jul 29, 2022• 7 citations
Publisher
DOI
10.1016/j.cpc.2022.108477

Related papers

Efficient maximum entropy algorithms for electronic structure

Richard N. Silver, H. Roeder, Arthur F. Voter +1 more

Two Chebyshev recursion methods are presented for calculations with very large sparse Hamiltonians, the kernel polynomial method (KPM) and the maximum entropy method (MEM). If limited statistical accuracy and energy resolution are acceptable, they provide linear scaling methods for the calculation of physical properties involving large numbers of eigenstates such as densities of states, spectral functions, thermodynamics, total energies for Monte Carlo simulations and forces for molecular dynamics. KPM provides a uniform approximation to a DOS, with resolution inversely proportional to the number of Chebyshev moments, while MEM can achieve significantly higher, but non-uniform, resolution at the risk of possible artifacts. This paper emphasizes efficient algorithms.

IEEE International Conference on High Performance Computing, Data, and Analytics•Apr 1, 1996•0 citations

Large-scale beta and double-beta decay computations in quasiparticle random-phase approximation

M. T. Mustonen, J. Engel

APS•Oct 1, 2013•0 citations

An Efficient Kernel Polynomial Method for Calculating Transition Rates in Large-Scale Materials

Chen Huang, Arthur F. Voter, Danny Pérez

Bulletin of the American Physical Society•Mar 20, 2013•0 citations

Quasiparticle spectra obtained through stochastic many-body methods

Vojtěch Vlček, Roi Baer, Eran Rabani +1 more

Bulletin of the American Physical Society•Mar 14, 2017•0 citations

Calculation of densities of states and spectral functions by Chebyshev recursion and maximum entropy

Richard N. Silver, Heinrich Röder

We present an efficient algorithm for calculating spectral properties of large sparse Hamiltonian matrices such as densities of states and spectral functions. The combination of Chebyshev recursion and maximum entropy achieves high-energy resolution without significant roundoff error, machine precision, or numerical instability limitations. If controlled statistical or systematic errors are acceptable, CPU and memory requirements scale linearly in the number of states. The inference of spectral properties from moments is much better conditioned for Chebyshev moments than for power moments. We adapt concepts from the kernel polynomial method, a linear Chebyshev approximation with optimized Gibbs damping, to control the accuracy of Fourier integrals of positive nonanalytic functions. We compare the performance of kernel polynomial and maximum entropy algorithms for an electronic structure example.

arXiv:cond-mat/9703229•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Oct 1, 1997•162 citations

Quasiparticle statistics from the ground state wave function

Julia Wildeboer

Bulletin of the American Physical Society•Mar 14, 2017•0 citations
Two Chebyshev recursion methods are presented for calculations with very large sparse Hamiltonians, the kernel polynomial method (KPM) and the maximum entropy method (MEM). If limited statistical accuracy and energy resolution are acceptable, they provide linear scaling methods for the calculation of physical properties involving large numbers of eigenstates such as densities of states, spectral functions, thermodynamics, total energies for Monte Carlo simulations and forces for molecular dynamics. KPM provides a uniform approximation to a DOS, with resolution inversely proportional to the number of Chebyshev moments, while MEM can achieve significantly higher, but non-uniform, resolution at the risk of possible artifacts. This paper emphasizes efficient algorithms.
We present an efficient algorithm for calculating spectral properties of large sparse Hamiltonian matrices such as densities of states and spectral functions. The combination of Chebyshev recursion and maximum entropy achieves high-energy resolution without significant roundoff error, machine precision, or numerical instability limitations. If controlled statistical or systematic errors are acceptable, CPU and memory requirements scale linearly in the number of states. The inference of spectral properties from moments is much better conditioned for Chebyshev moments than for power moments. We adapt concepts from the kernel polynomial method, a linear Chebyshev approximation with optimized Gibbs damping, to control the accuracy of Fourier integrals of positive nonanalytic functions. We compare the performance of kernel polynomial and maximum entropy algorithms for an electronic structure example.