vibrations, ode45

Attribution Non-Commercial (BY-NC)

206 tayangan

vibrations, ode45

Attribution Non-Commercial (BY-NC)

- Syllabus_F13
- DOC-20170108-WA0002.pdf
- Mechanical Engineering Curricilum
- Varga - Functional Analysis and Approximations in Numerical Analysis
- Numerical Interpolation Differentiation and Integration
- Math 135A Laurent Ucr 2010 Fall Numerical Analysis
- Dynamics of structures Humar
- Parallel Iterative Block and Direct Block Methods for 2-Space Dimension Problems on Distributed Memory Architecture
- On the integration schemes for Drucker–Prager’s elastoplastic models based on exponential maps
- chs8
- bathe_FEM
- Combinatorial Algorithms
- Vol. 5 No. 5; June 2018
- MV(7th&8th)Dec2014
- Adaptive Mesh Methods for Hiperbolic Eq
- Nq 28470
- Advect Report
- hu
- BSQ
- Numerical Solutions of Various Cables and Their Applications.pdf

Anda di halaman 1dari 19

4.1 INTRODUCTION The behavior of many dynamic systems undergoing time-dependant changes (transients) can be described by ordinary differential equations. When the solution to the differential equation(s) of motion of a dynamic system cannot be obtained in closed form, a numerical procedure is warranted. Many numerical integration methods are available for the approximate solution of such equation(s) of motion. All the numerical integration methods have two basic characteristics. First, they do not satisfy the differential equation(s) at all time t, but only at discrete time intervals, say t apart. Secondly, within each time interval t , a specific type of variation of , and acceleration X is assumed. Thus several numerical intethe displacement X, velocity X

and X gration schemes are available depending on the type of variation assumed for X, X within each time interval t . In this chapter we discuss several widely used step-by-step numerical integration schemes for solutions of both single and multi degree of freedom systems. A brief description of these methods is presented for linear dynamic response analysis and their application is illustrated by several examples.

4.2 SINGLE DEGREE OF FREEDOM SYSTEM The general equation of a viscously damped single degree of freedom dynamical system, which is linear, can be expressed in the following general form:

+ CX + KX = F (t) MX

(4.1)

where M, C and K are the mass, damping and stiffness of the system; F (t) is the applied force; and X are the displacement, velocity and acceleration of the system. and X , X 4.2.1 Finite Difference Method If the equilibrium relation (4.1) is regarded as an ordinary differential equation with constant coefficients, it follows that any convenient finite difference expressions to approximate the velocities and accelerations in terms of displacements can be used. The central idea in the finite difference method is to use approximations to derivatives. Hence, the general differential equation such as (4.1) and the associated boundary conditions, if any, are replaced by the corresponding finite difference equations. The continuous variable t is replaced by the discrete 536

537

variable ti and the differential equation is solved progressively in time increments h = t starting from known initial conditions. The solution obtained is approximate but by suitably selecting the time increment the accuracy of the solution can be improved. In this method, we replace the solution domain with a finite number of points, known as mesh or grid points, and obtain the solution at these points. The mesh or grid points are generally equally spaced along the independent coordinate as shown in Fig. 4.1. Central difference method is based on the Taylors series expansion of X i + 1 and X i 1 about the grid point i.

x(t) x(t) Xi+3 Xi+2 Xi+1 Xi-2 Xi-1 Xi

i1 0 ti2

i2 ti1 h ti

i+1 ti+1 h h

i+2 ti+2 h

i+3 t ti+3

Dt = h

Fig. 4.1

3 + h2 X + h X + X i + 1 = X i + hX i i i 2 6 3 + h2 X h X + X i 1 = X i hX i i i 2 6

(4.2) (4.3)

where X i = X (t = ti ) and the interval h = ti + 1 ti = t . By taking the first two terms only and subtracting Eq. (4.3) from (4.2), we obtain

= 1 (X X ) X i i+ 1 i 1 2h

Adding Eqs. (4.3) and (4.2), we get

= 1 ( X 2 X + X ) X i i 1 i i+1 h2

(4.4)

(4.5)

Although there exist a number of finite difference schemes, here we consider only two methods selected for their simplicity. They are the central difference method and the RungeKutta method.

Let the duration over which the numerical solution of Eq. (4.1) is required be divided into n equal parts of interval h = t each. The initial conditions are assumed to be given by

(t = 0) = X . X (t = 0) = X o and X 0

The accuracy of the solution always depends on the size of the time step. The critical time step is given by tcri = n / , where n is the natural period of the system. If t is selected to be larger than tcri , the method becomes unstable, that is the truncation of higher order terms or rounding-off in the computer causes errors to grow and makes the dynamic response calculations meaningless. Numerical methods, which require the use of time, step t smaller than the critical time step tcri are said to be conditionally stable. A safe rule to use is to and X respectively in Eq. (4.1) at choose h n / 10. Substituting Eqs. (4.5) and (4.4) for X i i mesh or grid point i give

R X S T

i+ 1

2 X i + X i1 (t) 2

U RX +CS V W T

i+ 1

X i 1 + KX i = Fi 2 t

U V W

(4.6)

X i+ 1

R | =S M | | T (t)

1

2

U | LR 2 M S C VM T (t) N | + 2 t | W

K { Xi } +

U V W

R C M U X S T 2t (t) V W

2

i 1

+ Fi

OP Q

(4.7)

which is known as the recurrence formula. Thus the displacement of the mass, X i + 1 , can be calculated using Eq. (4.7) if we know the previous displacements, X i , X i 1 and the present external force Fi . Repeated application of Eq. (4.7) gives us the response time history of the behavior of the system. Since the solution of Xi+1 given in Eq. (4.7) is based on the previous displacement Xi given in Eq. (4.6), the integration procedure is known as an explicit integration method. Note that in order to compute . X , both X and X are required but the initial conditions provide only the values of X and X

1 o 1 o

o

Therefore the central difference method is not self-starting. However, the value of X 1 can be by substituting the obtained from Eqs. (4.4) and (4.5) as follows. First calculate the value of X

o

The value of X1 is then obtained by the application of Eqs. (4.4) and (4.5) at i = 0.

2 + ( t ) X X 1 = X o t X o o 2

(4.8)

(4.9)

539

4.2.3 Runge-Kutta Method In the Runge-Kutta method, an approximation to X (t +t) is obtained from Xt in such a way that the power series expansion of the approximation coincides, up to terms of a certain order (t) in the time interval t , with the actual Taylor series expansion of (t + t) in powers of t . The method is based on the assumption that the higher derivatives exist at points required. The Runge-Kutta method is self-starting and has the advantage that no initial values are needed beyond the prescribed values. A brief discussion of its basis is represented here. In the Runge-Kutta method the second-order differential equation is first reduced to two firstorder equations. Consider the differential equation for the single degree of freedom system given in Eq. (4.1). Equation (4.1) can be rewritten as

N

= 1 [ F (t) CX KX ] = f ( X , X , t) X (4.10) M , Eq. (4.10) can be reduced to the following two first-order By letting X 1 = X and X 2 = X equations: =X X 1 2

= f ( X X , t) X 2 1, 2

(4.11)

By defining

and

X (t ) U R S W T X (t)V R X U F (t) = S T f ( X , X , t) V W X (t ) =

1 2 2 1 2

the following recurrence formula is obtained to find the values of X (t) at mesh or grids points ti according to the fourth order Runge-Kutta method. We omit the details of the derivation of the method.

X i+ 1 = X i +

where K 1 = hF ( X i , ti )

1 [ K 1 + 2 K 2 + 2 K3 + K4 ] 6 1 1 K 1 , ti + h) 2 2 1 1 K 2 , ti + h) 2 2

(4.12)

K 2 = hF ( X i + K 3 = hF ( X i +

and

1 K 3 , ti + 1 ) 2 Although the Runge-Kutta method does not require the computation of derivatives beyond the first, its higher accuracy is obtained by four evaluations of the first derivatives to K 4 = hF ( X i +

obtain agreement with the Taylor series solution through terms of order h 4 . Since the fourth order Runge-Kutta method is an explicit method, the maximum time step is usually governed

540

by stability considerations. The change in time step can be easily implemented between iterations and hence the method can be considered as an inherently stable method. The main drawback of the method is that each forward step requires several computations of the functions thus increasing the computational cost. The Runge-Kutta method is applicable and extendable to a system of differential equations. 4.3 MULTI DEGREE OF FREEDOM SYSTEM The general form of the equations of motion for a multi-degree of freedom system are written as

} + [C] { X } + [ K ] { X } = { F (t)} [ M] { X

(4.13)

where [ M ], [C ], and [ K ] are the mass, damping and stiffness matrices for the system and ], [ X ], and [ X ] refer to the acceleration, velocity, and displacement vectors, respectively. [X

{ F (t)} is the force vector. Several numerical direct integrating schemes are available to determine the approximate solution of a system of equations of motion. For a linear dynamic system, matrices [ M ], [C] and [ K ] are independent of time and therefore remain unchanged during the integration procedure. These matrices vary with time for a nonlinear dynamic system and must be modified during the integration of equations of motion. For the solution of equations of motion for a linear dynamic system, either the normal mode superposition method of dynamic analysis or direct numerical integration methods can be used. However, for the solution of nonlinear equations of motion, direct numerical integration methods are generally recommended. In a direct integration method, the system of equations of motion is integrated successively by using a step-by-step numerical procedure. No transformation of the equations of motion is needed prior to integration and using difference formulas that involve one or more increments of time usually approximates time derivatives. Basically there are two principal approaches used in the direct integration method: explicit and implicit schemes. In an explicit scheme, the response quantities are expressed in terms of previously determined values of displacement, velocity and acceleration. In an implicit scheme, the difference equations are combined with the equations of motion, and the displacements are calculated directly by solving the equations. In this section, only selected numerical integration schemes widely used for linear and nonlinear dynamic analyses are considered. Three explicit and four implicit direct integration schemes are examined. A brief description of these schemes is presented and their application is illustrated. The explicit schemes presented are the central difference method, two-cycle iteration with trapezoidal rule, and fourth-order Runge-Kutta. The implicit schemes include the Houbolt, Wilson-Theta, Newark-Beta, and Park Stiffly stable methods. The accuracy, stability, and efficiency of these schemes are examined by comparing the results for sample problems.

4.4 EXPLICIT SCHEMES As mentioned earlier, in an explicit formulation, the response quantities are expressed in terms of previously determined values of displacement, velocity and acceleration.

541

4.4.1 Central Difference Method The procedure indicated for the case of a single degree of freedom system can be directly extended to this case. Consider a displacement time history curve as shown in Fig. 4.2. At the middle of the time interval t , the velocity is given by

X

and

1 i+ 2 1 i 2

= =

X i+1 X i t Xi X i1 t

(4.14) (4.15)

X

xi1

xi

xi+1

Dt

Dt

Fig 4.2

The acceleration is

= X i

X

i+

Substituting X

i+

1 2

and X

1 2

(4.16) t from the Eqs. (4.14) and (4.15) into Eq. (4.16), we get

1 2

X

1 2

= 1 (X 2X + X ) X (4.17) i i+1 i i1 t 2 The difference formulas in the central difference method for velocity and acceleration are written in terms of displacement as } = 1 [{X } {X }] {X (4.18) t t+t tt 2 t } = t [{ X {X (4.19) t t + t } 2{ X t } + { X t t }] t 2 } and { X } from Eqs. (4.18) and (4.19), respectively into Eq. (4.13), we Substituting { X t t get [ M ] { X t + t } = { Ft }

(4.20)

where [ M ] , the effective mass matrix, and [ Ft ] , the effective force vector, is given by 1 1 [M ] = 2 [M] [C] 2 t t 2 1 1 [ Ft ] = { Ft } ([ K ] 2 [ M ]) { X t } ( 2 [ M ] [C ]) { X t t } 2 t t t

(4.21) (4.22)

542

At time t + t , the displacements { X t +t } can be computed by solving Eq. (4.20), and the velocities and accelerations at time t are determined by substituting these values of { X t +t } into Eqs. (4.18) and (4.19). Note that the calculation of { X t + t } involves { X t } and { X t t } . Hence, in order to obtain the solution at time t , a special starting procedure is needed. Table 4.1 summarizes the time integration schedule as suitable for integration in the computer. Table 4.1 Algorithms based on the central-difference method

(a) Initial computations: 1. Form stiffness [K], mass [M], and damping [C] matrices. 2. Initialize {X0},

1 t 2

} , and { X } . {X 0 0

1 1 ; a2 = 2a0 ; a3 = . 2 t a2

; a1 =

} + a {X }. 4. Calculate { X t } = { X 0 } t { X 0 3 0

5. Form effective mass matrix

M = a0 [ M ] + a1 [C ].

T 6. Triangularize [ M ] : [ M ] = [ L ][ D ][L ]

(b) For each time step: 1. Calculate effective force vector at time t:

{ F } = { Ft } ([ K ] a2 [ M ]) { X t } ( a0 [ M ] a1 [C ]) { X t t }

2. Solve for displacements at time t + t : M { X t + t } = Ft

} and { X } at time t: 3. Calculate { X } = a ( { X {X 1 t t t } { X t + t })

} = a ({ X {X 0 t t t } 2{ X t } + { X t + t })

The local truncation error of this method is of the order of t 2 . An important consideration in the use of the central difference method is that the integration method requires that the time step t smaller than a critical value, tcr , which is limited by the highest frequency of the discrete system max , where t tcr

2 max

...(4.23)

If the time step is longer than tcr , the integration is unstable, meaning that any errors resulting from the numerical integration of round off in the computer grow and make the dynamic response calculations questionable. 4.4.2 Two-Cycle Iteration with Trapezoidal Rule The equations of motion at any time t are expressed in the incremental form as } = { F } [ K ] { X } [C ] {X } [ M ] { X

t t t t

(4.24)

543

The increments in the velocities and displacements are estimated by the use of the following relationships in the first iteration cycle: For the first time step:

} = t { X { X t t t }

} = 2 t { X { X t t t } { X t t } } = {X {X t t t } + { X t }

1 t [{ X (4.28) t t } + { X t }] 2 } and { X } from Eqs. (4.26) and (4.28) into Eq. (4.24) By substituting the relations { X t t we obtain the increments in the accelerations as } = [ M ]1 ({ F } [ K ] { X } [C ] { X }) (4.29) { X { X t } =

t t t t

These are then employed to obtain the estimate of the acceleration at time t as

} = { X {X t t t } + { X t }

(4.30)

In the second iteration cycle, the increments in the velocities and the accelerations are refined as

} = 1 t({ X { X t t t } + { X t }) 2 } = {X } {X } + { X

t t t t

(4.31) (4.32)

1 t({ X (4.33) t t } + { X t }) 2 } and { X } in Eqs. (4.31) and (4.33) are substituted into Finally, the relations for { X t t Eq. (4.29) to compute the new increments in the accelerations. These are then used in Eq. (4.30) to calculate the accelerations at time t. The computational algorithm based on this method is summarized in Table 4.2. Table 4.2 Algorithm based on two-cycle iteration with trapezoidal rule { X t } =

1. Form stiffness [K], mass [M] and damping [C] matrices

} and { X } 2. Initialize { X 0 }, { X 0 0

3. Select time step

t and calculate for the first time step in the first iteration cycle:

} = t { X { X t t t }

4. For other time steps:

} = 2t { X { X t t t } { X t t } } = {X {X t tt } + { Xt }

{ X t } =

t }) ({ X t t } { X t 2

544

} and { X } at time t: 5. Compute { X t t

} = [ M ]1 ({ F } [ K ] { X } [C ] { X }) { X t t t t

} = { X {X t tt } + { Xt }

6. Second iteration cycle:

} = t ({ X { X t t t } + { X t }) 2

} = {X {X t t t } + { X t }

{ X t } =

t }) ({ X t t } + { X t 2

8. Finally, compute { X t } from step 5, using { X t } and { X t } from step 7.

4.4.3 Fourth Order Runge-Kutta Method In the fourth order Runge-Kutta method, the system of second order differential Eq. (4.13) are converted into state variable form. That is, both the displacements and velocities are treated as unknowns {y} defined by { y} =

R {X}U S }V T{ X W

(4.34)

Using the identity

(4.35) (4.36)

} = { y } {y

we obtain from Eqs. (4.35) and (4.36)

} = {y

or That is

1 1

0 { F (t)}

U V W

In the Runge-Kutta method, an approximation to { y y+t } is obtained from {yt} in such a way that the power series expansion of the approximation coincides, upto the terms of a certain order (t)N in the time interval t, with the actual Taylor series expansion of (t + t) in powers of t. This method has the advantage that no initial values are required beyond the prescribed ones. The general fourth order algorithms are based on formulas of the form {yt+t} = {yt} + t(aK1 + bK2 + cK3 + dK4) (4.40) where a, b, c and d are constants and K1, K2, K3, and K4, are the approximate derivative values computed in the interval tK < t < tK+t. Several fourth order algorithms have been proposed. The following is due to Runge-Kutta and we omit presenting the details of its derivation.

545

(4.41)

t t , yt + K1 ) 2 2 t t K3 = f(t + , yt + K2 ) 2 2 K4 = f(t + t, yt + K3t) (4.42) The Runge-Kutta algorithm does not require the calculation of higher derivatives. This method is completely self-starting and the step size can be changed easily between iterations and hence the method can be considered inherently stable. The truncation error et for the fourth order Runge-Kutta scheme is of the form (4.43) et = c(t)5 where c is constant, which depends on f(t, y) and its higher-order partial derivatives. RungeKutta method generates an artificial damping that unduly suppresses the amplitude of the response of a dynamic system to some extent.

K2 = f(t + 4.5 IMPLICIT SCHEMES In an implicit scheme, the difference equations are combined with the equations of motion, and the displacements are calculated directly by solving the equations. 4.5.1 Houbolt Method The Houbolt method is based on third-order interpolation of displacements Xt, and the multistep and X are obtained in terms of X by using backward differences. implicit formulas for X

t t

The difference formulas are summarized in the following with reference to Fig. 4.3. By considering a cubic curve that passes through the four successive ordinates, the following equations can be obtained:

xt2Dt Dt

xtDt Dt

xt Dt

xt+Dt

Fig. 4.3

t 2 t 3 + X t = X t t tX X X t + t t + t t + t 2 6

(4.44)

546

(2 t) 2 (2 t) 3 X t t = X t + t (2 t) X X X t + t + t + t t + t 2 6

(3 t) 2 (3 t) 3 X t 2 t = X t + t (3 t) X X t + t X t + t t + t + 2 6 Solving Eqs. (4.44) to (4.46) for X t + t and X t + t we get 1 (2 X t + t 5 X t + 4 X t t X t 2 t ) X t + t = t 2

(4.45) (4.46)

(4.47) (4.48)

1 (11X t + t 18 X t + 9 X t t 2 X t 2 t ) X t + t = 6 t The difference formulas in the Houbolt algorithm are therefore given by

{X t + t } = 1 t 2 [2{ X t + t } 5{ X t } + 4{ X t t } { X t 2 t }]

(4.49)

1 [11{ X t + t } 18{ X t } + 9{ X t t } 2{ X t 2 t }] (4.50) 6 t By substituting the expressions for { X t + t } and { X t + t } from (4.49) and (4.50), respectively, into (4.13), we get {X t + t } = M { X t + t } = { Ft + t }

where M is the effective mass matrix and { Ft +t } is the effective force vector.

[M ] = 2 t

2

(4.51)

[M] +

11 [C ] + [ K ] 6 t

(4.52)

{ Ft + t } = { Ft + t } + (

(

5 3 [ M] + [C]) { X t } t t 2

4 3 1 1 [M] + [C ]) { X t t } + ( 2 [ M ] + [C ]) { X t 2 t } (4.53) 2 t 3 t t 2 t Note that the equilibrium equation at time t + t , Eq. (4.51) is used in finding the solution for {Xt + t}. For this reason, this method is called an implicit integration method. It can be seen that the velocities and accelerations at time t + t are obtained by substituting for {Xt+t} in (4.50) and (4.49) respectively. Also that a knowledge of Xt, Xtt, and Xt2 t is needed to find solution for {Xt+t}. Since there is no direct method available to find { X t t } and { X t 2 t } ,

initially we use the central difference method to find solution at time t and 2 t . This makes the method non-self-starting. The method also requires large computer storage to store displacements for the previous time steps. The step-by-step procedure to be used in the Houbolt method is summarized in Table 4.3. A basic difference between the Houbolt method in Table 4.3 and the central difference method in Table 4.2 is the appearance of the stiffness matrix K as a factor to the required displacements X t +t . The term KX t + t appears because the equilibrium is considered at time t + t and not at time t as in the central-difference method. There is no critical time-step limit, and t can in general be selected much larger than that given for the central-difference method.

547

(a) Initial Computations: 1. Form stiffness [K], mass [M] and damping [C] matrices

a0 = a6 = 2 t

2

; a1 =

a3 11 5 3 ; a2 = 2 ; a3 = ; a4 = 2a0 ; a5 = ; t 6t 2 t

{ X t } and { X 2 t } .

K = [ K ] + a0 [ M ] + a1 [C]

T 6. Triangularize [ K ]: [ K ] = [L ][ D ][L ]

(b) For each time step: 1. Calculate effective force vector at time t + t:

{ Ft + t } = { Ft+ t } + [ M ] ( a2 { X t } + a4 { X t t } + a6 { X t 2t })

+[C ] ( a3 { X t } + a5 { X t t } + a7 { X t 2 t })

K { X t + t } = { Ft + t }

} and { X } at time t + t: 3. Calculate { X

{X t + t } = a1 { X t + t } a3 { X t } a5 { X t t } a7 { X t 2t } {X t+ t } = a0 { X t + t } a2 { X t } a4 { X t t } a6 { X t 2 t }

4.5.2 Wilson Theta Method The Wilson Theta method assumes that the acceleration of the system varies linearly between two instants of time. Referring to Fig. 4.4, the acceleration is assumed to be linear from time t between ti = it to time ti + = ti + t , where 1.0. Because of this reason, the method is known as the Wilson Theta method. If is the increase in time t between t and t + t (0 t), then for time interval t to t + t , it can be assumed that

= X + ( X X t + t t + t X t ) t

(4.54)

548

.. Xt

.. Xt+Dt

.. Xt+QDt

t + Dt

t + QDt

Fig. 4.4

and X : Successive integration for Eq. (4.54) gives the following expressions for X t+ t+

2 X (X t+ = X t + X t + t + t X t ) 2t

(4.55)

3 + 1X 2 + ( X (4.56) X t + = X t + X t t t + t X t ) 2 6t Substituting = t into the above Eqs. (4.55) and (4.56), we obtain the following expres and X at time t + t : sions for X

t ( Xt + X X t + t = X t + t + t ) 2

2 2 + t ( X X t + t = X t + t X t t + t + 2 X t ) 6

(4.57) (4.58)

X t + t = 6 t

2 2

( X t +t X t )

6 ) 2 (X ) (X t t t

3 t X ( X t +t X t ) 2 X X t + t = t t 2 t The difference formulas in the Wilson Theta algorithm are then given by

{X t + t } = 6 t

2 2

(4.59)

({ X t + t } { X t })

6 } 2 {X } {X t t t

(4.60)

3 } t { X } {X ({ X t +t } { X t }) 2 { X (4.61) t + t } = t t 2 t We employ Eq. (4.13) at time + t to obtain a solution for displacement, velocity, and acceleration at time t + t. Since accelerations vary linearly, a linear projected force vector is used such that (4.62) [M] { X } + [C] { X } + [K ] { X } = {F }

t + t t + t t + t t + t

549

where { Ft +t } = { Ft } + t ({ Ft + t } { Ft }) .

By substituting the expressions for { X t + t } and { X t + t } from Eq. (4.60) and (4.61), respectively, into Eq.(4.62), we get M { X t + t } = { Ft + t }

(4.63)

where the effective mass matrix M and the effective force vector { Ft +t } are given by

[M ] = 6 t

2 2

[M] +

3 [C] + [ K ] t 6

2

(4.64)

{ Ft +t } = { Ft +t } + (

[M] +

3 [C]) { X t } t

6 } + (2[ M ] + t [C]) { X } (4.65) [ M ] + 2 [C ]) { X t t 2 t The solution of Eq. (4.63) gives {Xt+t} which is then substituted into the following relationships to obtain the displacements, velocities, and accelerations at time t + t. +(

{X t + t } = 6 t

2 2

({ X t + t } { X t })

} + (1 3 ) { X } {X t t t

2

(4.66) (4.67)

t }) {X ({ X t + t } { X t + t } = { X t } + t 2

2 } + t { X { X t + t } = { X t } + t ({ X (4.68) t t + t } 2 { X t }) 6 When = 1.0, the method reduces to the linear acceleration scheme. The method is unconditionally stable for linear dynamic systems when 1.37, and a value of = 1.4 is often used for nonlinear dynamic systems. It may also be noted that no special starting procedures and X are expressed at time + t in terms of the same quantities at are needed, since X, X

time t only. The complete algorithm used in the Wilson Theta method is given in Table 4.4. Table 4.4 Algorithm based on Wilson Theta method

(a) Initial Computations: 1. Form stiffness [K], mass [M] and damping [C] matrices 2. Initialize { X 0 } { X 0 } and { X 0 } . 3. Select time step t and calculate integration constants, = 1.4 (say):

a0 = 6 ( t )2 ; a1 = 2 a2 a t ; a2 = 2 a1 ; a3 = ; a4 = 0 ; a5 = ; 2 t

a6 = 1

3 t t 2 ; a7 = ; a8 = 2 6

550

(b) For each time step: 1. Calculate effective force vector at time t + t:

} + 2 {X }) { Ft +t } = { Ft } + ({ Ft + t } { Ft }) + [ M ] (a0 { X t } + a2 { X t t

} + a {X }) + [C ] (a1 { X1 } + 2 { X 3 t t

2. Solve for displacements at time t + t :

K { X t + t } = { Ft + t }

} and { X } at time t + t : 3. Calculated { X }, { X

{X t+ t } = a4 ({ X t + t } { X t }) + a5 { X t } + a6 { X t } {X t + t } = { X t } + a7 ({ X t + t } + { X t }) } + a ({ X { X t + t } = { X t } + t { X t 8 t + t } + 2 { X t })

4.5.3 Newmark Beta Method The Newmark Beta integration method is also based on the assumption that the acceleration varies linearly between two instants of time. Two parameters and are used in this method, which can be changed to suit the requirements of a particular problem. The expressions for velocity and displacements are given by

X t + t = X t + [(1 ) X t + aX t + t ] t

2 t + ( 1 ) X + X X t + t = X t + X t t t + t t 2

(4.69)

LM N

OP Q

(4.70)

The parameters and indicate how much the acceleration enters into the velocity and displacement equations at the end of the interval t. Therefore, and are chosen to obtain the desired integration accuracy and stability. When =1/6 and =1/2, Eqs. (4.69) and (4.70) correspond to the linear acceleration method (which can also be obtained using = 1 in Wilson during each time method). When = 1/2 and = 0, the acceleration is constant and equal to X

t

and interval t . If =1/2 and = 1/8, the acceleration is constant from the beginning as X t then changes to X t +t in the middle of the time interval t. When =1/2 and = 1/4, this corresponds to the assumption that the acceleration remains constant at an average value of + X (X ) / 2 . The finite difference formulas for the Newmark Beta scheme are

t t + t

{X t + t } =

1 1 1 } ({ X t + t } { X t }) { X t } ( 1) { X t 2 t t 2

(4.71) (4.72)

1 } t 1 { X } {X ({ X t + t } { X t }) 1 {X t + t } = t t 2 t

FG H

IJ K

FG H

IJ K

551

Equation (4.13) can be employed to obtain a solution for displacements, velocity and accelerations at time t + t. Therefore, by substituting the expressions for { X t + t } and { X t + t } from Eqs. (4.71) and (4.72), respectively, into Eq. (4.13), we get

M { X t + t } = { Ft + t }

where the effective mass matrix M and the effective force vector { Ft +t } are given by

[M ] = 1 t

2

(4.73)

[M] +

[C] + [ K ] t

t

(4.74)

{ Ft + t } = { Ft + t } + (

t 2 t

(4.75)

Solution of Eq. (4.73) gives { X t + t } , which is then substituted into (4.71) and (4.72) in order to obtain the accelerations and velocities at time t + t. One of the features of Newmark Beta method is that for linear systems the amplitude is conserved and the response is uncon-

1 1 1 1 1 and ( + ) 2 . For values of = and = the larg2 4 2 2 4 est truncation errors occur in the frequency of the response as opposed to other values. It is

ditionally stable, provided that also important to note that unless =

1 to ( ) . If = 0 , a negative damping results; this involves a self-excited vibration arising 2 1 solely from the numerical procedure. In a likewise manner, if is greater than , a positive 2 damping is introduced which reduces the magnitude of the response even without real damping in the problem. For a multidegree of freedom system in which a number of modes constitute the total response, the peak amplitude may not be correct. The complete algorithm using the Newmark Beta integration method is given in Table 4.5. Table 4.5 Algorithm based on Newmark Beta method

(a) Initial Computations: 1. Form stiffness [K], mass [M] and damping [C] matrices

2. Initialize { X 0 }, { X 0 } and { X 0 } . 3. Select time step t, parameters and , and calculate integration constants, 0.5; 0.25(0.5 + )2

552

1 ( t)

2

a0 =

a5 =

; a1 =

1 1 1 1; a4 = 1; ; a2 = ; a3 = ; a3 = 2 2 t t

t 2 ; a6 = t (1 ); a7 = t 2

FG H

IJ K

K = [ K ] + a0 [ M ] + a1 [C]

5. Triangularize [ K ]: [ K ] = [L ][ D ][L ]T (b) For each time step: 1. Calculate effective force vector at time t + t:

} + a {X } + a {X }) { Ft + t } = { Ft+ t } + [ M ] (a0 { X t } + a2 { X 2 3 t t t } + a {X }) + [C ] ( a1 { X t } + a4 { X 5 t t

2. Solve for displacements at time t +t

K { X t + t } = { Ft + t }

} and { X } at time t + t: 3. Calculate { X

{X t + t } = a0 ({ X t + t } { X t }) a2 { X t } a3 { X t } {X t + t } = a1 ({ X t + t } { X t } a4 { X t } a5 { X t }

4.5.4 Park Stiffly Stable Method The Park Stiffly Stable method is an accurate method for low frequency ranges and stable for all higher-frequency components. Using a linear combination of the following two difference formulas derives the velocity in the Park Stiffly Stable method:

or

(4.76) (4.77)

1 (11X t + t 18 X t + 9 X t t 2 X t 2 t ) (4.78) 12 t

(4.79)

(4.80)

553

{X t + t } =

1 [10 { X t + t } 15 { X t } + 6{ X t t } { X t 2 t }] 6 t

(4.81) (4.82)

We consider Eq. (4.13) to obtain solution for the displacements, velocities and accelerations at time t + t. By substituting the expressions for { X t + t } and { X t + t } from (4.81) and (4.82), respectively, into (4.13), we get

M { X t + t } = { Ft + t }

where the effective mass matrix M and the effective force vector { Ft +t } are given by

[M ] = 100 36 t

2

(4.83)

[M]

10 [C ] + [ K ] 6 t

(4.84)

{ Ft + t } =

15 1 } 1 [ M] { X [ M] { X [M] { X t t t } + t 2 t } 6 t 6 t t

+( +( 150 36 t 1

2

[M] + [M] +

15 10 1 [C]) { X t } ( [M ] + [C ]) { X t t } 2 6 t t 6 t

1 [C]) { X t 2 t } (4.85) 6 t 36 t The solution of Eq.(4.83) gives {Xt+t}, which is then substituted in Eq.(4.82) to obtain } are then obtained by the use of Eq.(4.81). Note that in the Park velocities. The values of { X

2

Stiffly stable method, the calculation of {Xt+t} requires the displacements and velocities at t, t t and t 2t. Therefore, in order to obtain the solution at time t and 2t, a special starting procedure is needed, which makes the method non-self-starting. The complete algorithm based on Park Stiffly stable method used in the integration is given in Table 4.6. The method requires a large computer memory in order to store the displacements and velocities for the two previous time steps. Table 4.6 Algorithm based on Park Stiffly stable method

(a) Initial Computations: 1. Form stiffness [K], mass [M], and damping [C] matrices

t + t

}, and { X } . 2. Initialize { X 0 }, { X 0 0

3. Select time step t and calculate integration constants:

a0 =

2 K = a0 [ M ] a0 [C] + [ K ]

554

(b) For each time step: 1. Calculate effective force vector at time t + t:

} a {X { Ft + t } = ( a1{ X 2 t t t } a3 { X t 2 t } a0 a1 { X t } a0 a2 { X t t }

2 { X t 2 t }) [ M ] ( a1 { X t } + a2 { X t t } + a3 { X t 2 t }) [C ] + a3

M { X t + t } = { Ft + t }

} and { X } at time t + t: 3. Calculate { X

4.6 SUMMARY In this chapter we have briefly reviewed the direct numerical integration methods for the solution of a single or system of differential equations. Many numerical methods are available for the solutions of the response of dynamic systems. We have discussed several widely used step-by-step numerical integration methods for linear dynamic response analysis. A brief description of these integration methods is presented and their application is illustrated. The integration schemes considered were three explicit and four implicit methods. They are the explicit schemes (the central difference method, two-cycle interaction with trapezoidal rule and fourth order Runge-Kutta method) and the implicit schemes(Houbolt method, Wilson Theta method, Newmark Beta method and the Park Stiffly stable method). Application of these direct numerical integration methods is illustrated with numerical examples for a linear dynamic system. The use of a particular integration method is mainly dependent on the nature of the problem and is often dictated by the desired solution accuracy. 4.7 EXAMPLE PROBLEMS AND SOLUTIONS USING MATLAB Example 4.1. Find the response of a viscously damped single degree of freedom system subjected to a force F(t) = F0 1 sin

FG H

t 2t0

IJ K

with the following data: F0 = 2N, t0= seconds, m = 2 kg, c = 0.3 Ns/m and k = 1 N/m. The values of the displacement and velocity of the mass at t = 0 are zero. Use the central difference method. Choose t = 1, 0.1 and 0.5 seconds and compare the results. Solution: This is a single-degree of freedom system problem with all initial conditions zero. The following MATLAB program is executed to obtain the results.

% INITIAL VALUES

- Syllabus_F13Diunggah olehnick10686
- DOC-20170108-WA0002.pdfDiunggah olehrahul
- Mechanical Engineering CurricilumDiunggah olehaogu
- Varga - Functional Analysis and Approximations in Numerical AnalysisDiunggah olehaedicofidia
- Numerical Interpolation Differentiation and IntegrationDiunggah olehKashish Gaur
- Math 135A Laurent Ucr 2010 Fall Numerical AnalysisDiunggah olehmath135a_ucr
- Dynamics of structures HumarDiunggah olehali_biscoeat
- Parallel Iterative Block and Direct Block Methods for 2-Space Dimension Problems on Distributed Memory ArchitectureDiunggah olehMd. Rajibul Islam
- On the integration schemes for Drucker–Prager’s elastoplastic models based on exponential mapsDiunggah olehcyrusnasirai
- chs8Diunggah olehPriya Sharma
- bathe_FEMDiunggah olehhiroshsakamoto
- Combinatorial AlgorithmsDiunggah olehnao
- Vol. 5 No. 5; June 2018Diunggah olehNilofa Yasmin
- MV(7th&8th)Dec2014Diunggah olehKarandeep Singh
- Adaptive Mesh Methods for Hiperbolic EqDiunggah olehTomek Dysarz
- Nq 28470Diunggah olehJunk Jettison
- Advect ReportDiunggah olehHarish KP
- huDiunggah olehAthul Gopinath
- BSQDiunggah olehdinchii
- Numerical Solutions of Various Cables and Their Applications.pdfDiunggah olehivy_publisher
- math09Diunggah olehAdrian Bagayan
- d 04302031042Diunggah olehInternational Journal of computational Engineering research (IJCER)
- ULH-midterm-7th.docxDiunggah olehPratik
- Mathematics r 18Diunggah olehVignesh
- 141811-140001-M-IVDiunggah olehBhakti Mahbubani
- Méthode Des Différences FiniesDiunggah olehAmine Ben
- EASY-FIT a Software System for Data Fitting in DynDiunggah olehZahirovic Muhizin
- Ganesh_paper.pdfDiunggah olehAbhiyan Paudel
- MATLAB L1Diunggah olehMahfujur Rahman
- Earthquake Engineering 1Diunggah olehChrysler Duaso

- 1980 Purdue Compressor Technology Conferece July 1980Diunggah olehallentvm
- Module7 Am FmDiunggah olehSiegfried Schultz
- Beam TheoriesDiunggah olehallentvm
- 1_1Diunggah olehallentvm
- Analysis of Limit Cycle Flutter of an Airfoil in Incompressible FlowDiunggah olehallentvm
- topDiunggah olehallentvm
- matodeDiunggah olehPointcarre
- Naca Report 496 TheodorsenDiunggah olehgarystevensoz
- BG2Diunggah olehallentvm
- Leissa_the Free Vibration of Rectangular PlatesDiunggah olehallentvm
- Theory of Machines and Mechanisms by ShigleyDiunggah olehallentvm
- Nonlinear VibrationsDiunggah olehBosonUp
- SketchDiunggah olehallentvm

- Dft PropertiesDiunggah olehprakashrout
- IECON'01: The 27th Annual Conference of TheDiunggah olehArulraj
- february 2015 - article 3 - revisiting the optimal distribution glide pathDiunggah olehapi-297524160
- Clustering In Data MiningDiunggah olehseventhsensegroup
- Nonlinear Differential EquationsDiunggah olehManali Patil
- Pert Cpm PresentationDiunggah olehNavneet Chugh
- Ham CodeDiunggah olehBob Janel
- Operations With MatricesDiunggah olehamir shaharan
- Identification and Classification of Leaf Diseases in Turmeric PlantsDiunggah olehAnonymous 7VPPkWS8O
- KEY-AGGREGATE SECURE DATA SHARING IN CLOUD COMPUTING FOR CRYPTOSYSTEMDiunggah oleheditor3854
- Chapter 7Diunggah olehZuko
- CMIME Question Bank.pdfDiunggah olehnik
- Hybrid Reward Architecture for Reinforcement LearningDiunggah olehPanthros
- SMC_BasicDiunggah olehmojinjo
- Fhe OverviewDiunggah olehunicycle1234
- An Optimal Two Stage Feature Selection for Speech Emotion Recognition Using Acoustic FeaturesDiunggah olehDiah Norhasanah
- UNIT 2.docxDiunggah olehSanthosh Kumar
- Assignments-discrete mathsDiunggah olehSundeep Chopra
- non linear predictive controlDiunggah olehMarcusMiller
- Part_1Diunggah olehLoard Sun
- 03-Arithmeding.pdfDiunggah olehKrisna Sharma
- Control. Hydraulic system [KOSAR].pdfDiunggah olehAbdulbasitHamza
- 06MinE332 SimulationDiunggah olehAlper Oztekin
- Math 104-184 Midterm 2 2012W Practice QuestionsDiunggah olehheartxanna
- Queueing_TheoryDiunggah olehvir1672
- Training a SVM in a PrimalDiunggah olehmpssassygirl
- Artificial Bee Colony Algorithm, Its VariantsDiunggah olehNestor Calizar Jr.
- ch6_perceptron_mlp.pdfDiunggah olehKrishnan
- Solving Higher Order PolynomialsDiunggah olehDVS2mona
- Cse405 Question Bank With AnswersDiunggah olehsitvijay