Loading [MathJax]/jax/output/HTML-CSS/jax.js

Runge-Kutta Method for SDOF Systems

In this method the approximate formula used for obtaining x_i+1 from x_i is made to coincide with Taylor’s series expansion of x and x_i+1 up to terms of order (∆t)^n. The Taylor’s series expansion of x(t) at t+∆t is given by:

x(t+Δt)=x(t)+˙x(t)Δt+¨x(t)(Δt)22!+(t)(Δt)33!+(t)(Δt)44!+....


The previous equation requires higher-order derivatives while Runge-Kutta requires only first derivative and not higher than that. In order to solve the equation

m¨x+c˙x+kx=F


we need to reduce it to two first-order equations. But before we start to implement R-K method let’s rearrange previous second-order differential equation:

m¨x=Fc˙xkx¨x=1m[Fc˙xkx]=f(x,˙x,t)


Now we can define

x1=xx2=˙x


and then we can write previously rearranged second order differential equation in the following form. 

˙x1=x2˙x2=f(x1,x2,t)



The following recurrence formula is used to find values of X(t) at different grid points t_i according to the fourth order Runge-Kutta method. 
Xi+1=Xi+16[K1+2K2+2K3+K4]


Where:

K1=hF(Xi,ti)K2=hF(Xi+12K1,ti+12h)K3=hF(Xi+12K2,ti+12h)K4=hF(Xi+K3,ti+3)

Nema komentara:

Objavi komentar