How to beat critical slowing-down: 1990 update

Alan D. Sokal

    Research output: Contribution to journalArticle

    Abstract

    We discuss the problem of critical slowing-down (CSD) in Monte Carlo simulations, and review recent progress in devising collective-mode algorithms that reduce or eliminate CSD. Emphasis is on cluster and embedding algorithms; multigrid and Fourier acceleration are also discussed briefly.

    Original languageEnglish (US)
    Pages (from-to)55-67
    Number of pages13
    JournalNuclear Physics B - Proceedings Supplements
    Volume20
    Issue numberC
    DOIs
    StatePublished - May 20 1991

    Fingerprint

    synchronism
    embedding
    simulation

    ASJC Scopus subject areas

    • Nuclear and High Energy Physics

    Cite this

    How to beat critical slowing-down : 1990 update. / Sokal, Alan D.

    In: Nuclear Physics B - Proceedings Supplements, Vol. 20, No. C, 20.05.1991, p. 55-67.

    Research output: Contribution to journalArticle

    @article{7d39da1306634e369dc25bae1f5e2168,
    title = "How to beat critical slowing-down: 1990 update",
    abstract = "We discuss the problem of critical slowing-down (CSD) in Monte Carlo simulations, and review recent progress in devising collective-mode algorithms that reduce or eliminate CSD. Emphasis is on cluster and embedding algorithms; multigrid and Fourier acceleration are also discussed briefly.",
    author = "Sokal, {Alan D.}",
    year = "1991",
    month = "5",
    day = "20",
    doi = "10.1016/0920-5632(91)90881-E",
    language = "English (US)",
    volume = "20",
    pages = "55--67",
    journal = "Nuclear and Particle Physics Proceedings",
    issn = "2405-6014",
    publisher = "Elsevier",
    number = "C",

    }

    TY - JOUR

    T1 - How to beat critical slowing-down

    T2 - 1990 update

    AU - Sokal, Alan D.

    PY - 1991/5/20

    Y1 - 1991/5/20

    N2 - We discuss the problem of critical slowing-down (CSD) in Monte Carlo simulations, and review recent progress in devising collective-mode algorithms that reduce or eliminate CSD. Emphasis is on cluster and embedding algorithms; multigrid and Fourier acceleration are also discussed briefly.

    AB - We discuss the problem of critical slowing-down (CSD) in Monte Carlo simulations, and review recent progress in devising collective-mode algorithms that reduce or eliminate CSD. Emphasis is on cluster and embedding algorithms; multigrid and Fourier acceleration are also discussed briefly.

    UR - http://www.scopus.com/inward/record.url?scp=44949280154&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=44949280154&partnerID=8YFLogxK

    U2 - 10.1016/0920-5632(91)90881-E

    DO - 10.1016/0920-5632(91)90881-E

    M3 - Article

    VL - 20

    SP - 55

    EP - 67

    JO - Nuclear and Particle Physics Proceedings

    JF - Nuclear and Particle Physics Proceedings

    SN - 2405-6014

    IS - C

    ER -