Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Beeman's algorithm

Numerical Algorithm

Beeman's algorithm is a numerical method for integrating ordinary differential equations of second order, most specifically Newton's equations of motion in which acceleration depends on position. It was designed so that molecular dynamics simulations could handle large numbers of particles. The direct, explicit variant was published by Schofield in 1973 as a personal communication from Beeman, and this is what is commonly meant by Beeman's method. It is a variant of the Verlet integration method: it yields identical positions but uses a different formula for the velocities. In 1976 Beeman also published a class of implicit predictor-corrector multistep methods, of which the familiar direct method is the third-order member.

Connections

In Field

Source Beeman's algorithm (Wikipedia)
Sources
Beeman's algorithm (Wikipedia)
  • In Group: Numerical Integration and Differential Equations, Lead paragraph
    is a method for numerically integrating ordinary differential equations of order 2
  • In Field: Computational Science, Lead paragraph [in-field]
    It was designed to allow high numbers of particles in simulations of molecular dynamics
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.