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

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 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

Reduced-basis method for linear response within nuclear density functional theory

Nobuo Hinohara, Xilin Zhang, Jonathan Engel

Background: The quasiparticle random-phase approximation (QRPA) within nuclear density functional theory provides a powerful framework for describing collective excitations. Although the finite-amplitude method (FAM) efficiently solves the QRPA problem, repeated calculations for different external-field parameters remain computationally demanding. Purpose: We construct a reduced basis method (RBM)-based emulator for the FAM that treats the complex energy of the external field as a model parameter to efficiently reproduce FAM amplitudes and QRPA eigenmodes. Methods: High-fidelity FAM calculations are performed at a small set of training points in the complex-energy plane. The resulting FAM amplitudes form a non-orthogonal reduced basis. A variational equation yields an emulator that can predict the response at arbitrary complex energies and QRPA eigensolutions without additional full FAM calculations. Results: The RBM emulator accurately reproduces FAM strength distributions in both giant-resonance and low-energy regions when the relevant energy domain is covered by the training set. It also reproduces imaginary QRPA modes associated with shape instabilities of the HFB state. Applied to the $K^π=0^+$ mode of rare-earth Dy isotopes in a realistic model space, the emulator reproduces strength distributions and the lowest $0^+$ collective states with precision comparable to full FAM calculations, reducing the computational cost by more than an order of magnitude. Conclusions: The RBM provides an efficient and accurate FAM emulator. Its ability to reproduce giant-resonance, low-energy, and imaginary-energy modes at drastically reduced computational cost makes it promising for density-functional optimization, calculations of collective inertia, and large-scale surveys of nuclear collective excitations.

arXiv:2609.03903•Sep 3, 2026•1 citation
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.
Background: The quasiparticle random-phase approximation (QRPA) within nuclear density functional theory provides a powerful framework for describing collective excitations. Although the finite-amplitude method (FAM) efficiently solves the QRPA problem, repeated calculations for different external-field parameters remain computationally demanding. Purpose: We construct a reduced basis method (RBM)-based emulator for the FAM that treats the complex energy of the external field as a model parameter to efficiently reproduce FAM amplitudes and QRPA eigenmodes. Methods: High-fidelity FAM calculations are performed at a small set of training points in the complex-energy plane. The resulting FAM amplitudes form a non-orthogonal reduced basis. A variational equation yields an emulator that can predict the response at arbitrary complex energies and QRPA eigensolutions without additional full FAM calculations. Results: The RBM emulator accurately reproduces FAM strength distributions in both giant-resonance and low-energy regions when the relevant energy domain is covered by the training set. It also reproduces imaginary QRPA modes associated with shape instabilities of the HFB state. Applied to the Kπ=0+K^π=0^+Kπ=0+ mode of rare-earth Dy isotopes in a realistic model space, the emulator reproduces strength distributions and the lowest 0+0^+0+ collective states with precision comparable to full FAM calculations, reducing the computational cost by more than an order of magnitude. Conclusions: The RBM provides an efficient and accurate FAM emulator. Its ability to reproduce giant-resonance, low-energy, and imaginary-energy modes at drastically reduced computational cost makes it promising for density-functional optimization, calculations of collective inertia, and large-scale surveys of nuclear collective excitations.