CoChat

Efficient hybrid algorithm for the dynamic creation of wormlike chains in solutions, brushes, melts and glasses

Kröger, Martin · 1999 · Computer Physics Communications
Cited by 50

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Abstract

We present an algorithm for the creation and relaxation of large, dense or diluted homogeneous many particle systems made of wormlike, finite extendable, semiflexible multibead chains and — optionally — solvent particles, which repulse each other. The key feature is its efficiency, its output has been proven to serve as an excellent basis for any subsequent off-lattice computer simulation. The application allows us to choose (i) the bead number density or packing fraction, temperature, chain length, system size, concentration, (ii) the interaction potentials, hence the local features such as bond length and bending rigidity of the chains, and (iii) the degree of pre-relaxation, parametrized and expressed through a minimum intermolecular distance. The monodisperse polymers are represented by chains of monomer coordinates in 3D space. During the dynamical two-step process of sample creation the initially (Monte Carlo step 1) predicted global characteristics of the molecular conformations remain as unaffected as possible (during molecular dynamics step 2) and the potential energy and the entropy production are relaxing towards their minima. The potentials, the distribution of bond lengths, the integration time step and temperature are smoothly controlled during the creation/relaxation process until they finally approach their prescribed or physical values. The quality of the algorithm is by its nature independent of concentration, system size or degree of polymerization; the computational speed is quite independent of the latter quantity and linear in the system size. Chains tethered to a surface (dry polymer brushes) can be generated as well. We provide a benchmark table.

Overview

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Integrity signals

Registry

Crossref · 10.1016/s0010-4655(98)00160-x

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

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

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

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

Cites

Show all 3 references

Cited by

See all 50

Metadata

Authors
Kröger, M.
Venue
Computer Physics Communications
Publisher
Elsevier BV
Published
1999-05
Volume
118
Issue
2-3
Pages
278-298
ISSN
0010-4655 (ISSN-L)
OpenAlex
W1975167928
Cited by
50
References
3
FWCI
0.81
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: Efficient hybrid algorithm for the dynamic creation of wormlike chains in solutions, brushes, melts and glasses. https://app.cochat.ai/papers/10.1016/s0010-4655(98)00160-x
The paper
Kröger, M. (1999). Efficient hybrid algorithm for the dynamic creation of wormlike chains in solutions, brushes, melts and glasses. Computer Physics Communications. https://doi.org/10.1016/s0010-4655(98)00160-x

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.