The Kernel Polynomial Method

dc.creatorWeisse, Alexander
dc.creatorWellein, Gerhard
dc.creatorAlvermann, Andreas
dc.creatorFehske, Holger
dc.date2005-04-25
dc.date2006-04-03
dc.date.accessioned2026-07-07T06:37:43Z
dc.date.available2026-07-07T06:37:43Z
dc.descriptionEfficient 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.
dc.description32 pages, 17 figs; revised version
dc.identifierhttps://arxiv.org/abs/cond-mat/0504627
dc.identifierhttp://arxiv.org/abs/cond-mat/0504627
dc.identifierRev. Mod. Phys. 78, 275-306 (2006)
dc.identifierdoi:10.1103/RevModPhys.78.275
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100488
dc.subjectOther Condensed Matter
dc.subjectComputational Physics
dc.titleThe Kernel Polynomial Method
dc.typetext

Files

Collections