Beeman's algorithm: Difference between revisions
Jump to navigation
Jump to search
(Link to wikipedia) |
Carl McBride (talk | contribs) m (Added a reference) |
||
Line 1: | Line 1: | ||
'''Beeman's algorithm''' is is a method for numerically integrating ordinary differential equations, generally position and velocity, which is closely related to Verlet integration. | '''Beeman's algorithm''' <ref>[http://dx.doi.org/10.1016/0021-9991(76)90059-0 D. Beeman "Some multistep methods for use in molecular dynamics calculations", Journal of Computational Physics '''20''' pp. 130-139 (1976)]</ref> is is a method for numerically integrating ordinary differential equations, generally position and velocity, which is closely related to Verlet integration. | ||
Line 23: | Line 23: | ||
==References== | ==References== | ||
<references/> | |||
==External links== | |||
*[http://en.wikipedia.org/wiki/Beeman%27s_algorithm Beeman's algorithm entry on wikipedia] | *[http://en.wikipedia.org/wiki/Beeman%27s_algorithm Beeman's algorithm entry on wikipedia] | ||
[[category: Molecular dynamics]] | [[category: Molecular dynamics]] |
Revision as of 09:52, 19 April 2010
Beeman's algorithm [1] is is a method for numerically integrating ordinary differential equations, generally position and velocity, which is closely related to Verlet integration.
where x is the position, v is the velocity, a is the acceleration, t is time, and \Delta t is the time-step.
A predictor-corrector variant is useful when the forces are velocity-dependent:
The velocities at time are then calculated from the positions.
The accelerations at time are then calculated from the positions and predicted velocities.