Professional Documents
Culture Documents
0141-0296/78/010041-12 $02.00
© 1978 IPC Business Press Eng. Struct., 1 978, Vol 1, October 41
Dynamic response of linear systems: A. G. Collings and L, R. Saunders
approaches; in particular, the methods known as direct saving in computation can be achieved by simply
integration, mode superposition, and frequency domain truncating the interpolation formula at some point
analysis are frequently used. The texts by Bathe and N' < N. The formula then loses its interpolation
Wilson I and Clough and Penzien 2 contain expositions property in that it is no longer exact at the data
of these techniques. points. Nevertheless it can remain an excellent
In direct integration methods no transformation of approximation, and is indeed the formula of best fit in
the ordinary differential equation system into a the least squares sense to the data points, for the
different form is carried out. A step-by-step procedure specified value of N'. The truncated formula in effect
which discretizes the time domain and makes represents a smoothing of the data. The data is
assumptions as to the variation of displacement, supplied as a discrete series with time interval T
velocity and accelerations over each interval is used to (commonly a!o or ~!osee.), and the sampling theorem
integrate directly the equations of motion. With mode states that this series can only properly represent those
superposition techniques however, a change of basis is frequencies present in the actual disturbance; defined
made for the system of equations. This transformation for continuous time, which do not exceed ½T. Choosing
is such that the original system of equations is replaced N' < N is equivalent to suppressing the higher
by an uncoupled set. These equations are then solved frequencies in the band (0,½T).
by the use of closed form solutions, numerical
evaluation of the convolution integral, commonly
referred to as the Duhamel integral, or by numerical
integration. With frequency domain analyses use is Mathematical basis
made of the fact that the Fourier transform of the Trigonometric interpolation
response is the product of the Fourier transform of the Consider. a real sequence X(j) defined for:
input and the Fourier transform of the pulse response
of the system. j = -N,-(N- l) ..... 0,1,2 ..... N - 1,N
This paper expresses the input as a finite
trigonometric series which reproduces the discrete Then it may be readily shown that for the 2N + 1
input exactly and gives a very smooth interpolation integer values o f j we may writea:
between the given data points. This is the
N
trigonometric interpolation method due to Lanczos a-s. X(J~= ~,' C(n)e i"j~/'v (1)
It is applicable to any input series. To find the n = -N
coefficients of the trigonometric series an efficient
algorithm 6'7 is used. For long time series the fast where
Fourier transform can be exploited to advantage. 1 s
The normal mode method of analysis is applied in C(n} = "2-N~=~-'uX(j) e -i"i'm (2)
this paper. By means of matrix similarity
transformations the problem is resolved into the with i = v -/'-Z-II.The primes on equation (2) indicate
solution of a set of linear second order differential that the two extreme members of the sums are taken
equations with constant coefficients. The with half weight.
complementary functions give the evanescent transient To show that the relationships in equations (1) and
responses, and the particular integrals, corresponding (2) hold we use the identity:
to the trigonometric driving functions, give the steady
state responses. The earthquake record is divided into ~-lNO + e-i~u-l~o + ... + ei(N-l)O + ½eilvo
consecutive sections, the first datum of a section being
the last datum of the previous section, so that the = sinNOcotO/2 (3)
initial conditions for a section are provided by the end
results of the previous section. The solution is obtained which is valid for 0 :~ 2kTt. Assume the existence of
in the form of the sum of a finite cosine series, a finite equation (1) and consider the following sum:
sine series, and a further simple expression. It should N
be noted that the solution is given as a continuous s. = 2 ' x(j) e- i.j./~,
function of time. However, it is convenient to evaluate j=-N
original input sequence was given. This can be = Z' Y,' C(m) e'j''-"~'/N
j= -Nm= -N
economically achieved by using the Goertzel algorithm
N N
again. The problem of the approximate evaluation of = Z C(m) Z' eV"-"'"/N (4)
the Duhamel integral has thus been by-passed. m= -N )= -N
An example is given later in which the input to the
system is an earthquake acceleration record. The If we put (m - n)~/N = 0 with m :~ n the sum over j
example is explained in some detail in order to can be identified with the left hand side of equation (3)
indicate the utility of the method when applied to a with 0 not a multiple of 2n. It follows at once that this
realistic problem. sum is zero. If m = n the j sum is 2N, whence
When an earthquake record is processed to appear S, "= 2NC(n), from which equation (2) follows.
as a trigonometric series it is usually found that the In general C(n) is a complex number, but equation
higher frequency terms have low amplitudes. (2) reveals that C(0) and C(N) are real. It can also be
Moreover, the structure whose dynamic response is seen that C ( - n) = C(n), the complex conjugate, which
required may have an insignificant response to the implies that C ( - n ) e -l"~'m is the complex conjugate of
higher frequencies. In such situations a worthwhile C(n)e i"~'/N. Putting C(n) = E(n) + iF(n), then:
x {cos njn/N + i sin njrc/N} where T is the time interval between adjacent members
of the time series X(j~. At once we have:
+ C(N) cos Nrq/N (5)
z(jT) = Z(j~ ( - N <<.j<<.N) (14)
This expression may be rewritten:
N Provided that the boundary conditions
X(j) = ~.. A(n)cos(njrc/N) Z(O) = Z(N) = 0 hold, z(t) is the interpolation of a
n~O hypothetical function specified at the finite points iT. A
N-I general comment on trigonometrical interpolation can
+ ~ B(n)sin(njrqN) (6) be made. Consider the situation where a function f(t)
n=l is given as a continuous function, but the integrals
where A(n) = 2E(n) and B(n) - -2F(n). We now have required for a standard Fourier analysis cannot be
X(fl expressed as the sum of an even function and an conveniently determined. We may then use the
odd function, defined for integer j. It is easy to express sequence f ( j T ) and trigonometrical interpolation. A
X(j) as the sum of an even sequence and an odd lucid exposition of the closely related topics of
sequence. Defining: trigonometric interpolation at equidistant points, finite
Fourier series, band-limited functions, aliasing and the
Y(j) = ( X(J3 + X ( - j ) ) / 2 sampling theorem is given in Cooley et al. 18
(7)
Z(33 = ( X(3) - X(-j~)/2 Parallel to equation (13) we may write:
so that Y(j~ = Y(-j~ and Z(j~ = - Z ( - f l . Then:
y(t) = ~. A(n)cos(nnt/NT)
X(f) = Y(j) + Z(j3 ( - N <~j <~ N) (8) n=O
n=O N
A(n) = ( - 1)"A(n) (25) The complementary function of equation (27) has the
/~(n) = ( - l)"B(n) form:
with 0 ~< ~ ~< 2NT. Thus the transition from equation e - n ( K l cos c3 + K2 sin cr) (31)
(22) to (25) requires little more than changing the sign where c 2 = o)2 _ f12. It is assumed that the system is
of every second coefficient in the finite series. under-damped so that fl < to. Equations (28)-(31) show
This is an appropriate point at which to discuss the that the solution takes the form:
accuracy of trigonometric interpolation. Lanezos s has N
shown that the error bound of a trigonometric if(r) = ~ t~t(n)cos(nn3/NT)
interpolation is the same as that for a finite Fourier n=t
series of the same order. Though the coefficients may N
differ a little the approximations are of similar + E 0,(n)sin(n, r/Nr)+ : + Or + a3'
accuracy. Incidentally, equation (2) may be regarded as nml
the trapezoidal rule applied to the integrals with would + e-n'(Kt cos cr + K2 sin or) (32)
be used to obtain Fourier coefficients.
Because of the similarity between the two The constants KI and K2 are determined by initial
approaches it follows that conditions on the time conditions on displacement and velocity. Equation (32)
functions which make for accuracy in a Fourier series gives the displacements as eontinuous functions of 3,
also apply to an interpolation series. For an even and is therefore a general analytical representation of
function the coefficients of a cosine series decrease the response. It is convenient in practice to evaluate
if(z) = ~p(~) + ~,(~) (33) The functions S~f) and Tp(fl are respectively even and
odd functions of the integer j. The response at the
where ~p(~) and ~,(~) are the particular integral and
points z --- kT, 0 ~< k ~< 2N is given by:
complementary function. Also:
# d k ) = S , ( N - k) - T , ( N - k) )
I~(./) = i f j T ) = l,Vp(]') + I,V=(j') (34)
l~p(2N - k) = Sp(N - k) + Tp(N - k) ; (43)
where
for 0 ~< k ~< N. On adding l~p(k) and l~'dk) we have the
l~'~(j) = e - ~ r { r ~ cos(jcT) + Kz sin(jcT)} total response ifT) at the points "c = k T, 0 <~k <~ 2N.
(0~<j~<2N) (35)
Evaluation of finite trigonometric series
The terms e-l~rcos(jcT) and e -~#r sin(jcT) are the real To evaluate the sums in equations (10), (11) and (42)
and imaginary parts of e~-~+~r, and this permits an it is natural to use one of the economical algorithms
•flicient recursive algorithm to be adopted for the which have appeared in recent years. For long series it
computation of I,V=(j). Define: is possible to adapt the fast Fourier transform method
used for discrete Fourier transforms. This will be
~j = e~-~+~lir = e-i~r{cos(jcT) + isin(jcT)} (36)
elaborated on below. In situations where the given
Then input series has about 100 terms or less the splitting
into even and odd series of about 50 terms allows a
~+ ~ = ~j + r / ~ simpler approach to be adopted. Lanczos 4 has shown
where that the symmetry and periodic properties of
trigonometric functions can be exploited to reduce the
Fl = e - # r c o s c T - 1 + i e - # r s i n c T (37) number of multiplications by a factor of four, against
and direct evaluation of the sum. However, it is still
necessary to generate a table of cosines and sines. We
~o = 1 consider that in most applications the method of
evaluation of finite trigonometric series due to
The recursion is carried out for j = 0, 1, 2. . . . . 2N. This Goertzel 6 has much in its favour. This method uses
method involves the use of the computer library functions recursion and does not require the prior setting up of
only three times, to compute e -#r, cos cT, and sin cT. tables. It is a straightforward algorithm and is very
Despite the recursion the accumulation of rounding easily implemented by an efficient computer program.
errors is negligible. Thus, we obtain ¢¢,(3),0 <<.j<~2N. In our application we used the Goertzel method in the
Since fl can be small, e -#r can approach unity, and form given by Hamming 7, with the difference that our
then this algorithm is advantageous t°. N replaces Hamming's 2N - 1. Define:
The particular integral is:
N N
N C= ~ a~coskx and S= ~ aksinkx
~p(z) = ~ Ol(n)cos(nnl:/NT) k=0 k=l
n=l
Also let:
N
+ ~ t~,(n)sin(nn,/NT) Uo ----0 Ut = a~v
n=l (44)
Um= 2U,,_1 c o s x - U,,-2 + ate-,,+ 1
+ P + 0.~ + 1~ 2 0 <~• <<.2 N T (38)
for m = 2, 3.... , N. Then
At this stage we make the change of variable
C = U N C O S X - - U N + 1 "~- ao
r = N T + t so that - N T <~t <~NT. Consequently: (45)
N S = UN sin x
wp(t) = ~, Ol(n) cos(nnt/NT) In our application x is of the form nn/N. To obtain
n=l.
N
the sum ~ ' of equation (1(3) we first put Y(0) = Y(0)/2,
+ ~ Oz(n)sin(nm/NT) + P + Qt + Rt 2 (39)
Y(N) = Y(N)/2. For the sine summations the algorithm
is applied with U1 = 0. A single computer procedure
was developed for all of the summations in equations
where (10), (11) and (42), (an A L G O L procedure is supplied
in the Appendix).
0t(n) = (-l)'/~l(n) and 02(n) = ( - 1)"/~2(n) (40)
An alternative approach, attractive for long series, is
Putting t = jT, - N ~<j ~< N, P = 0~(0), and grouping to relate the trigonometric series to the discrete
even and odd functions, yields: Fourier transform, and apply a fast Fourier transform
computer routine. Consider equation (2):
w,(~ = sd~ +T,(~ (41)
C(n) = 2 ~ N=~_'tcX(J)e-'~'m ( - N <~n <~N)
where: 1
MrllXl + CII,~'I + KlIXl where ,~(n) and ~(n), 0 ~< n ~< N, are the frequency
coefficients of the trigonometric interpolation for the
= PI(z) - M12)/'2 - C I 2 X 2 - K I 2 X 2 (52)
qth set of real time series acceleration data. The time
where the right-hand side is a known function of 3. variable T, which operates over the qth set of real time
The system which equation (52) represents does not data, has the range 0 ~< ~ ~< 2NT. D = Z(N) is the final
cater for the complicated matter of member of the odd time series components.
structure-foundation interaction. Rather, it is If we integrate equation (56) then an expression for
concerned with a system which assumes that the the associated prescribed velocities for the qth set of
structure is connected to a rigid localized region (here time series data is obtained:
called the 'foundation'). This foundation under the
action of seismic disturbances may typically be
subjected to prescribed displacements, velocities and 7r / , = I n
accelerations.
W e observe that the inertial frame, in which -Y. +
equation (52) has been written provides a convenient n=l n n~l
system for measuring the prescribed displacements,
velocities and accelerations to which the system may + :i(o)- ~+4--~.~ + ¢ (57)
be subjected. However, a local non-inertial frame of
reference Y, rigidly attached to the foundation, from
which the time-dependent response of the non- The constant of integration (~ may be evaluated by
prescribed degrees of freedom can be measured, is of assuming continuity of velocity over the boundaries of
practical importance. A transformation between the the sets of real time data. In particular, we may assume
non-inertial and inertial coordinate systems may be that:
written as follows 1": ~q- t(2NT) = .¢q(0) (58)
Y = Xl - JX2 (53)
Thus, if we set z = 0 in equation (57) we then have:
where J, a transformation matrix, may be shown to
have the following construction I a: C = Jq(0)= .~-'(2NT) (59)
(o)
+ /](0)-~- ~+4--~,
o2 + E (61) s,(# ,----1 n + C} (68)
rtlrr k = l 2=1
o,,2 (73)
~here e~ is the flh element of the vector E and rki and
ski are the kj elements of the matrices R and S given
by equation (55).
A solution to equation (64) may be obtained if one
notes that the expressions for ~(¢) and ~q(~) are Equation (32) also contains two constants Kt and
composed entirely of sine and cosine terms, plus a few K,, these may be determined from the initial
N
where the suffix j denotes the jth element and p is
Kt = g'~q-I)(2NT}- ~ dr(n} - / ~ taken as the mass density per unit volume of the
ii = |
(75) element. The matrices B, E and N are defined by the
following relationships:
Discussion o f errors
The error function for the trigonometrical
interpolation method does not vary much over each
block of input data. It follows that when the input
function is small the relative error is large. This is in
contrast to the situation with the balanced Euler
(trapezoidal rule) numerical integration method where
the global error is some function of time and may be
shown to be proportional to the numerical integration
Figure 1 Steel membered skeletal space with seismic inputs at step length squared ~7. In practice it is of interest to
foundation nodes. System comprises 72 d.o.f.; 6 per node evaluate the dynamic response of the structure when
09 0.7
0.8 0.6
0.7 0.5
0.6 0.4
0.5 0.3 I
0.4 0.2
' ~ 0.1
?o 0.3
?o
,,~0.2
~/ 0.1 N -0.1
K K
o C -0.2
c c
-O.3 d
i -0.1
-~ -0.2 ~ -O.4
i5 -03 ~ -0.5
-0.4 • -0.6
-0.!5 -0.7
-0.6 -0.8
-0.7 -0.9
-0.8 -I .0 i
Table 1 Displacement of degree of freedom 1 for balanced Euler and trigonometric interpolation
solutions
Trigonometric
Caltech C2 interpolation
Time acceleration record Euler solution solution
(unit, 0 . 0 2 5 sec) M/sec = (M) (M)