✦ LIBER ✦

Dynamic critical behaviour of Wolff's algorithm for RPN σ-models

✍ Scribed by Sergio Caracciolo; Robert G. Edwards; Andrea Pelissetto; Alan D. Sokal

Book ID: 113392375
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 291 KB
Volume: 26
Category: Article
ISSN: 0920-5632
DOI: 10.1016/0920-5632(92)90344-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamical critical behaviours of the Isi

Dynamical critical behaviours of the Ising spin chain: Swendsen–Wang and Wolff algorithms

✍ Krapivsky, P L 📂 Article 📅 2004 🏛 Institute of Physics 🌐 English ⚖ 202 KB

Dynamic critical behavior of multi-grid

Dynamic critical behavior of multi-grid Monte Carlo for two-dimensional nonlinear σ-models

✍ Gustavo Mana; Tereza Mendes; Andrea Pelissetto; Alan D. Sokal 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 271 KB

Static and dynamic critical behaviour of

Static and dynamic critical behaviour of 3d random-site Ising model: Different Monte Carlo algorithms

✍ D. Ivaneyko; J. Ilnytskyi; B. Berche; Yu. Holovatch 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 84 KB

Dynamic critical behavio(u)r of a cluste

Dynamic critical behavio(u)r of a cluster algorithm for the Ashkin-Teller model

✍ Jesus Salas; Alan D. Sokal 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Dynamic critical behavior of the Swendse

Dynamic critical behavior of the Swendsen–Wang algorithm for the three-dimensional Ising model

✍ Giovanni Ossola; Alan D. Sokal 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 475 KB

The use of dynamic grid adaptation algor

The use of dynamic grid adaptation algorithms for the modelling of flow around a circular cylinder in sub-critical flow regime

✍ G. de With; A. E. Holdø; T. A. Huld 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB 👁 1 views

## Abstract In the present study a dynamic grid adaptation (DGA) algorithm is utilized for predicting flow around a circular cylinder in sub‐critical flow regime at a Reynolds number of 1.4×10^5^. The reason for adopting a DGA algorithm is the unsteadiness of the flow field which makes a convention