When force depends on position, velocity, or time in a complicated way, the equation of motion may not have a simple closed-form solution. Numerical integration estimates the trajectory over small time steps. The explicit Euler method updates velocity and position using values at the start of each step; it is easy to implement but can accumulate error and may be unstable for some systems or large time steps. More accurate methods, such as midpoint or Runge–Kutta methods, evaluate the derivative multiple times per step. Numerical results should be checked by reducing the time step, comparing methods, checking units and limiting cases, and verifying conservation laws where applicable. A simulation is only as reliable as its force model, initial conditions, numerical method, and step size.
Numerical Methods for Force-Based Motion Problems
Numerical methods approximate motion when force-based equations are difficult to solve analytically.
Explicit Euler: vₙ₊₁ = vₙ + aₙΔt; xₙ₊₁ = xₙ + vₙΔt; aₙ = F(xₙ, vₙ, tₙ)/m
Explanation
Variables
| Symbol | Meaning | Unit |
|---|---|---|
xₙ | Position estimate at step n | metre (m) |
vₙ | Velocity estimate at step n | metre per second (m/s) |
aₙ | Acceleration estimate at step n | metre per second squared (m/s²) |
Δt | Time-step size | second (s) |
F | Net force evaluated from the model | newton (N) |
Example or application
For a falling object, a simple simulation calculates gravity minus drag at the current velocity, divides the net force by mass to estimate acceleration, and updates velocity and position by a small time step. Repeating the calculation approximates the object's path; repeating it with a smaller time step helps test numerical convergence.
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.