Parts | Days | Selection | Search | Updates | Downloads | Help
TT: Fachverband Tiefe Temperaturen
TT 11: Poster Session: Matter at Low Temperature
TT 11.14: Poster
Monday, March 14, 2011, 14:00–18:00, P4
Strong-coupling expansion in the Hubbard model by a diagrammatic-combinatorial computer algorithm — •Martin Paech1,2, Eva Kalinowski2,3, Walter Apel4,1, and Eric Jeckelmann1 — 1Leibniz Universität, Hannover, Germany — 2Academy of Computer Science and Management, Bielsko-Biała, Poland — 3Union IT Services GmbH, Frankfurt am Main, Germany — 4Physikalisch-Technische Bundesanstalt, Braunschweig, Germany
Motivated by the efficient diagrammatic approach for the evaluation of high-order terms in the strong-coupling limit for the Hubbard model on the half-filled Bethe lattice with infinite coordination number we present an optimized and parallelized implementation of the underlying `divide-and-conquer' algorithm. This new implementation is accompanied by a functional analysis of its recursive kernel and extended to systems away from half filling and finite-dimensional systems. As a first application, we study the ground-state energy and determine the critical coupling of the Mott-Hubbard transition from the radius of convergence of the series.