Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Berk Hess (Sat,) studied this question.
www.synapsesocial.com/papers/69b483d9ef5127bcfd9e5f54 — DOI: https://doi.org/10.1021/ct700200b
Berk Hess
Journal of Chemical Theory and Computation
Max Planck Institute for Polymer Research
Building similarity graph...
Analyzing shared references across papers
Loading...