Main Page

From Werner KRAUTH

(Difference between revisions)
Jump to: navigation, search
Revision as of 21:55, 31 January 2011
Werner (Talk | contribs)

← Previous diff
Revision as of 23:10, 5 February 2011
Werner (Talk | contribs)

Next diff →
Line 3: Line 3:
[[Image:Event chain movie small.gif|100px|left|frame|Event-chain Monte Carlo algorithm for hard spheres and related systems (see [[Bernard Krauth Wilson 2009|article with E. P. Bernard and D. B. Wilson]])]] [[Image:Event chain movie small.gif|100px|left|frame|Event-chain Monte Carlo algorithm for hard spheres and related systems (see [[Bernard Krauth Wilson 2009|article with E. P. Bernard and D. B. Wilson]])]]
-<br clear="all" /> 
-[[image:Exact_diag.jpg|100px|center|frame|Exact diagonalization algorithm for Dynamical mean field theory (see [[Caffarel Krauth 1994|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.]] 
 +[[image:Exact_diag.jpg|100px|center|frame|Exact diagonalization algorithm for Dynamical mean field theory (see [[Caffarel Krauth 1994|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.]]
 +[[image:Dimer_cluster.gif|100px|right|frame|Rejection-free cluster algorithm for dimers (see [[Krauth Moessner|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.]]
 +<br clear="all" />

Revision as of 23:10, 5 February 2011

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