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

Bulletin of the American Physical Society

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

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

Published Mar 20, 2013• 0 citations
OpenAlex

Related papers

Linear-scaling electronic structure theory: Electronic temperature in the Kernel Polynomial Method

Eunan J. McEniry, Ralf Drautz

Linear-scaling electronic structure methods based on the calculation of moments of the underlying electronic Hamiltonian offer a computationally efficient and numerically robust scheme to drive large-scale atomistic simulations, in which the quantum-mechanical nature of the electrons is explicitly taken into account. We compare the kernel polynomial method to the Fermi operator expansion method and establish a formal connection between the two approaches. We show that the convolution of the kernel polynomial method may be understood as an effective electron temperature. The results of a number of possible kernels are formally examined, and then applied to a representative tight-binding model.

arXiv:1701.01568•Jan 6, 2017•1 citation

A New Numerical Method to Study Phase Transitions

J. Michael Kosterlitz, J. Lee, Enzo Granato

Springer proceedings in physics•Jan 1, 1993•1 citation

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

Many-Body Methods for Real Materials

Eva Pavarini, Schiwei Zhang, Erik Koch

•Jan 1, 2019•21 citations

Numerical methods for large-scale quantum material simulations

Hiroto Imachi

•Jan 1, 2017•1 citation

Kernel polynomial method for linear spin wave theory

Harry Lane, Hao Zhang, David Dahlbom +5 more

Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size.

arXiv:2312.08349•SciPost Physics•Nov 26, 2024•8 citations
Linear-scaling electronic structure methods based on the calculation of moments of the underlying electronic Hamiltonian offer a computationally efficient and numerically robust scheme to drive large-scale atomistic simulations, in which the quantum-mechanical nature of the electrons is explicitly taken into account. We compare the kernel polynomial method to the Fermi operator expansion method and establish a formal connection between the two approaches. We show that the convolution of the kernel polynomial method may be understood as an effective electron temperature. The results of a number of possible kernels are formally examined, and then applied to a representative tight-binding model.
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.
Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size.