Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 547

The DOI matches its Crossref record.

Algorithms for brownian dynamics

van Gunsteren, W.F., Berendsen, H.J.C.·1982·Molecular Physics

Abstract

A third order algorithm for brownian dynamics (BD) simulations is proposed, which is identical to the powerful molecular dynamics (MD) algorithm due to Verlet in the limit of infinitely small friction coefficient γ. In contrast to most BD algorithms used up till now, the integration time step Δt is not limited by the condition Δt ≪ γ-1. It is shown how constraints, such as bondlength or bond angle constraints, can be incorporated in the computational scheme. For the molecule considered here the proposed BD algorithm is about ten times more efficient than the second order ones that are generally used. The introduction of bondlength constraints saves about a factor of three in computing time, as in the MD case. The application of bond angle constraints is not recommended.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/00268978200100491

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 547

Metadata

Authors
van Gunsteren, W. F., & Berendsen, H. J. C.
Venue
Molecular Physics
Published
1982-02-20
Volume
45
Issue
3
Pages
637-647
ISSN
  • 0026-8976 (ISSN-L)
  • 1362-3028
OpenAlex
W2073658284
Cited by
547
References
0
FWCI
4.22
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Algorithms for brownian dynamics. https://app.cochat.ai/papers/10.1080/00268978200100491
The paper
van Gunsteren, W. F., & Berendsen, H. J. C. (1982). Algorithms for brownian dynamics. Molecular Physics. https://doi.org/10.1080/00268978200100491

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.