The Kernel Polynomial Method
摘要
Efficient and stable algorithms for the calculation of spectral quantities and correlation functions are some of the key tools in computational condensed matter physics. In this article we review basic properties and recent developments of Chebyshev expansion based algorithms and the Kernel Polynomial Method. Characterized by a resource consumption that scales linearly with the problem dimension these methods enjoyed growing popularity over the last decade and found broad application not only in physics. Representative examples from the fields of disordered systems, strongly correlated electrons, electron-phonon interaction, and quantum spin systems we discuss in detail. In addition, we illustrate how the Kernel Polynomial Method is successfully embedded into other numerical techniques, such as Cluster Perturbation Theory or Monte Carlo simulation.
引用
@article{arxiv.cond-mat/0504627,
title = {The Kernel Polynomial Method},
author = {Alexander Weisse and Gerhard Wellein and Andreas Alvermann and Holger Fehske},
journal= {arXiv preprint arXiv:cond-mat/0504627},
year = {2007}
}
备注
32 pages, 17 figs; revised version