Scinovex
articleTop 10% cited

P-LINCS:  A Parallel Linear Constraint Solver for Molecular Simulation

Journal of Chemical Theory and Computation · 2007 · Vol. 4(1) · pp. 116–122
Berk Hess

Abstract

By removing the fastest degrees of freedom, constraints allow for an increase of the time step in molecular simulations. In the last decade parallel simulations have become commonplace. However, up till now efficient parallel constraint algorithms have not been used with domain decomposition. In this paper the parallel linear constraint solver (P-LINCS) is presented, which allows the constraining of all bonds in macromolecules. Additionally the energy conservation properties of (P-)LINCS are assessed in view of improvements in the accuracy of uncoupled angle constraints and integration in single precision.

Protein Structure and DynamicsEnzyme Structure and FunctionNumerical methods for differential equationsSolverConstraint (computer-aided design)Computer scienceDomain decomposition methodsConstraint satisfaction problemDomain (mathematical analysis)DecompositionDegrees of freedom (physics and chemistry)Computational scienceMathematical optimization
Citations
3,976
FWCI
7.64
field-weighted impact
References
20
Percentile
98%
vs. same field & year
Citations per year
References
Settle: An analytical version of the SHAKE and RATTLE algorithm for rigid water models
Journal of Computational Chemistry · 1992 · 7,449 citations
LINCS: A linear constraint solver for molecular simulations
Journal of Computational Chemistry · 1997 · 16,756 citations
GROMACS: Fast, flexible, and free
Journal of Computational Chemistry · 2005 · 18,562 citations
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.

P-LINCS:  A Parallel Linear Constraint Solver for Molecular Simulation · Scinovex