Beeman's algorithm: Difference between revisions

From SklogWiki
Jump to navigation Jump to search
m (common factor)
(Link to wikipedia)
Line 21: Line 21:
==See also==
==See also==
*[[Velocity Verlet algorithm]]
*[[Velocity Verlet algorithm]]
==References==
*[http://en.wikipedia.org/wiki/Beeman%27s_algorithm Beeman's algorithm entry on wikipedia]
[[category: Molecular dynamics]]
[[category: Molecular dynamics]]

Revision as of 15:35, 17 April 2010

Beeman's algorithm 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.

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle v(t + \Delta t) (corrected) = v(t) + \frac{1}{3}a(t + \Delta t) \Delta t + \frac{5}{6}a(t) \Delta t - \frac{1}{6}a(t - \Delta t) \Delta t + O( \Delta t^3) }

See also

References