Newmark-beta method

The Newmark-beta method is a method of numerical integration used to solve differential equations. It is widely used in numerical evaluation of the dynamic response of structures and solids such as in finite element analysis to model dynamic systems. The method is named after Nathan M. Newmark,^[1] former Professor of Civil Engineering at the University of Illinois, who developed it in 1959 for use in structural dynamics.

Using the extended mean value theorem, the Newmark-β method states that the first time derivative (velocity in the equation of motion) can be solved as,

\dot{u}_{n+1}=\dot{u}_n+ \Delta t~\ddot{u}_\gamma \,

where

\ddot{u}_\gamma = (1 - \gamma)\ddot{u}_n + \gamma \ddot{u}_{n+1}~~~~0\leq \gamma \leq 1

therefore

\dot{u}_{n+1}=\dot{u}_n + (1 - \gamma) \Delta t~\ddot{u}_n + \gamma \Delta t~\ddot{u}_{n+1}.

Because acceleration also varies with time, however, the extended mean value theorem must also be extended to the second time derivative to obtain the correct displacement. Thus,

u_{n+1}=u_n + \Delta t~\dot{u}_n+\begin{matrix} \frac 1 2 \end{matrix} \Delta t^2~\ddot{u}_\beta

where again

\ddot{u}_\beta = (1 - 2\beta)\ddot{u}_n + 2\beta\ddot{u}_{n+1}~~~~0\leq 2\beta\leq 1

Newmark showed that a reasonable value of $\gamma$ is 0.5, therefore the update rules are,

\dot{u}_{n+1}=\dot{u}_n + \begin{matrix}\frac{\Delta t}{2}\end{matrix}~(\ddot{u}_n + \ddot{u}_{n+1})

u_{n+1}=u_n + {\Delta}t~\dot{u}_n + \begin{matrix}\frac{1-2\beta}{2}\end{matrix} \Delta t^2 \ddot{u}_n + \beta {\Delta} t^2 \ddot{u}_{n+1}

Setting β to various values between 0 and 0.5 can give a wide range of results. Typically β = 1/4, which yields the constant average acceleration method, is used.

References

↑ Newmark, N. M. (1959) A method of computation for structural dynamics. Journal of Engineering Mechanics, ASCE, 85 (EM3) 67-94.

Numerical methods for integration

First-order methods	Euler method Backward Euler Semi-implicit Euler Exponential Euler

Second-order methods	Verlet integration Velocity Verlet Trapezoidal rule Beeman's algorithm Midpoint method Heun's method Newmark-beta method Leapfrog integration

Higher-order methods	Exponential integrators Runge–Kutta methods List of Runge–Kutta methods Linear multistep method General linear methods Backward differentiation formula

This article is issued from Wikipedia - version of the 6/15/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.