Newmark-beta method

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 \beta\leq 1

Newmark showed that a reasonable value of γ 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 1 can give a wide range of results. Typically β = 1/4, which yields the constant average acceleration method, is used.

References

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

Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Newmark — is a surname that may refer to: Andy Newmark, American musician Betsy Newmark, High school teacher and blogger Bobby Newmark, Fictional character in novel Brooks Newmark, Member of Parliament Craig Newmark, Founder of Craigslist Dave Newmark,… …   Wikipedia

  • Nathan M. Newmark — Born September 22, 1910(1910 09 22) Plainfield, New Jersey, USA Died January 25, 1981(19 …   Wikipedia

  • Crank–Nicolson method — In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.[1] It is a second order method in time, implicit in time, and is numerically …   Wikipedia

  • Linear multistep method — Adams method redirects here. For the electoral apportionment method, see Method of smallest divisors. Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an …   Wikipedia

  • Midpoint method — For the midpoint rule in numerical quadrature, see rectangle method. Illustration of the midpoint method assuming that yn equals the exact value y(tn). The midpoint method computes yn + 1 …   Wikipedia

  • Semi-implicit Euler method — In mathematics, the semi implicit Euler method, also called symplectic Euler, semi explicit Euler, Euler–Cromer, and Newton–Størmer–Verlet (NSV), is a modification of the Euler method for solving Hamilton s equations, a system of ordinary… …   Wikipedia

  • Heun's method — In mathematics and computational science, Heun s method may refer to the improved or modified Euler s method (that is, the explicit trapezoidal rule[1]), or a similar two stage Runge–Kutta method. It is named after Karl L. W. M. Heun and is a… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • Numerical ordinary differential equations — Illustration of numerical integration for the differential equation y = y,y(0) = 1. Blue: the Euler method, green: the midpoint method, red: the exact solution, y = et. The step size is h = 1.0 …   Wikipedia

  • Dynamic errors of numerical methods of ODE discretization — The dynamical characteristic of the numerical method of ordinary differential equations (ODE) discretization – is the natural logarithm of its function of stability . Dynamic characteristic is considered in three forms: – Complex dynamic… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”