Beeman's algorithm

From SklogWiki
Revision as of 12:01, 19 April 2010 by Dduque (talk | contribs) (Interesting: same positions as Verlet)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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.

In its standard form, it produces the same trajectories as the Verlet algorithm, but the velocities are more accurate:

where x is the position, v is the velocity, a is the acceleration, t is time, and 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.

See also

References

External links