|
|
(11 intermediate revisions by 2 users not shown) |
Line 1: |
Line 1: |
| <div id="SHAKE"></div> | | <div id="SHAKE"></div> |
| Constrained molecular dynamics is performed using the SHAKE algorithm.<ref name="Ryckaert77"/>. | | Constrained molecular dynamics is performed using the SHAKE{{cite|ryckaertt:jcp:1977}} algorithm. |
| In this algorithm, the Lagrangian for the system <math>\mathcal{L}</math> is extended as follows: | | In this algorithm, the Lagrangian for the system <math>\mathcal{L}</math> is extended as follows: |
| :<math> | | :<math> |
Line 35: |
Line 35: |
| <div id="Slowgro"></div> | | <div id="Slowgro"></div> |
|
| |
|
| == Ho to == | | == References == |
| Geometric constraints are introduced by defining one or more entries with the STATUS parameter set to 0d in the {{FILE|ICONST}}-file. Constraints can be used within a standard NVT or NpT MD setting introduced by {{TAG|MDALGO}}=1|2|3. Note that fixing geometric parameters related to lattice vectors is not allowed within an NVT simulation. Constraints can be combined with restraints, time-dependent bias potentials ([[:Category:Metadynamics]])
| | |
| | | [[Category:Advanced molecular-dynamics sampling]][[Category:Theory]] |
| | |
| == References ==
| |
| <references>
| |
| <ref name="Ryckaert77">[http://dx.doi.org/10.1016/0021-9991(77)90098-5 J. P. Ryckaert, G. Ciccotti, and H. J. C. Berendsen, J. Comp. Phys. 23, 327 (1977).]</ref>
| |
| </references>
| |
| ----
| |
| | |
| [[Category:Molecular dynamics]][[Category:Constrained molecular dynamics]][[Category:Theory]][[Category:Howto]]
| |
Latest revision as of 09:59, 15 October 2024
Constrained molecular dynamics is performed using the SHAKE[1] algorithm.
In this algorithm, the Lagrangian for the system is extended as follows:
where the summation is over r geometric constraints, is the Lagrangian for the extended system, and λi is a Lagrange multiplier associated with a geometric constraint σi:
with ξi(q) being a geometric parameter and ξi is the value of ξi(q) fixed during the simulation.
In the SHAKE algorithm, the Lagrange multipliers λi are determined in the iterative procedure:
- Perform a standard MD step (leap-frog algorithm):
- Use the new positions q(t+Δt) to compute Lagrange multipliers for all constraints:
- Update the velocities and positions by adding a contribution due to restoring forces (proportional to λk):
- repeat steps 2-4 until either |σi(q)| are smaller than a predefined tolerance (determined by SHAKETOL), or the number of iterations exceeds SHAKEMAXITER.
References