The kernel polynomial method

From MaRDI portal
Publication:3077076

DOI10.1103/REVMODPHYS.78.275zbMATH Open1205.81090arXivcond-mat/0504627MaRDI QIDQ3077076FDOQ3077076


Authors: Alexander Weisse, Gerhard Wellein, Andreas Alvermann, Holger Fehske Edit this on Wikidata


Publication date: 21 February 2011

Published in: Reviews of Modern Physics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/cond-mat/0504627




Recommendations




Cites Work


Cited In (65)





This page was built for publication: The kernel polynomial method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077076)