Main Page

From Werner KRAUTH

(Difference between revisions)
Jump to: navigation, search
Revision as of 19:41, 12 March 2011
Werner (Talk | contribs)

← Previous diff
Revision as of 22:59, 29 May 2011
Werner (Talk | contribs)

Next diff →
Line 1: Line 1:
<big>'''Welcome to my new webpage (Nov-29-2010) Construction area.'''</big> <big>'''Welcome to my new webpage (Nov-29-2010) Construction area.'''</big>
__FORCETOC__ __FORCETOC__
 +=Upcoming events=
 +Workshop:
 +[http://www.euroscipy.org/card/pyphy2011 PyPhy - Python in Physics 2011, August 29, 2011, ENS, Paris]
 +Satellite meeting of the
 +[http://www.euroscipy.org/conference/euroscipy2011 4th European Meeting of Python in Science (Euroscipy 2011)]
 +k
=A picture book of research= =A picture book of research=

Revision as of 22:59, 29 May 2011

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

Contents

Upcoming events

Workshop: PyPhy - Python in Physics 2011, August 29, 2011, ENS, Paris Satellite meeting of the 4th European Meeting of Python in Science (Euroscipy 2011) k

A picture book of research

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). This (fantastic) algorithm, about two orders of magnitude faster than local Monte Carlo, was used in our discovery of the first-order liquid-hexatic phase transition in hard disks.
Event-chain Monte Carlo algorithm for hard spheres and related systems (see article with E. P. Bernard and D. B. Wilson). This (fantastic) algorithm, about two orders of magnitude faster than local Monte Carlo, was used in our discovery of the first-order liquid-hexatic phase transition in hard disks.
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 infinite dimensions. Much of our early work in the field is written up in our review with Georges, Kotliar, and Rozenberg
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 infinite dimensions. Much of our early work in the field is written up in our review with Georges, Kotliar, and Rozenberg
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 flip about a symmetry axis between one valid configuration and another.
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 flip about a symmetry axis between one valid configuration and another.


Research areas

Address

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