Main Page

From Werner KRAUTH

Revision as of 23:10, 5 February 2011; view current revision
←Older revision | Newer revision→
Jump to: navigation, search

Welcome to my new webpage (Nov-29-2010) Construction area.

Direct-sampling algorithm for ideal bosons in a trap (see article with M. Holzmann). Adapted for interacting bosons, this algorithm was used in a variety of articles.
Direct-sampling algorithm for ideal bosons in a trap (see article with M. Holzmann). Adapted for interacting bosons, this algorithm was used in a variety of articles.
Event-chain Monte Carlo algorithm for hard spheres and related systems (see article with E. P. Bernard and D. B. Wilson)
Event-chain Monte Carlo algorithm for hard spheres and related systems (see article with E. P. Bernard and D. B. Wilson)
Exact diagonalization algorithm for Dynamical mean field theory (see article with M. Caffarel). This algorithm has been instrumental in our discovery of a first-order Mott transition in the Hubbard model in <math>\infty</math> dimensions.
Exact diagonalization algorithm for Dynamical mean field theory (see article with M. Caffarel). This algorithm has been instrumental in our discovery of a first-order Mott transition in the Hubbard model in <math>\infty</math> dimensions.
Rejection-free cluster algorithm for dimers  (see article with R. Moessner). This algorithm was used for our discovery of a critical phase in three-dimensional dimer models (paper with Huse, Sondhi, and Moessner). Note that dimers move with respect to a symmetry axis between two valid configurations.
Rejection-free cluster algorithm for dimers (see article with R. Moessner). This algorithm was used for our discovery of a critical phase in three-dimensional dimer models (paper with Huse, Sondhi, and Moessner). Note that dimers move with respect to a symmetry axis between two valid configurations.



Werner Krauth
Laboratoire de Physique Statistique
École normale supérieure
24 rue Lhomond
75231 Paris Cedex 05
France
Tel +33 (0) 44 32 25 50
Personal tools