Documente Academic
Documente Profesional
Documente Cultură
Abstract: We describe a recursive computer algorithm which generates line spectra from relaxation modulus or creep compliance data without producing
negative spectrum lines. We apply the algorithm here to data read from
mathematical models for the relaxation modulus. Since these data were thus free
of the usual experimental error, we could use a relatively simple form of the basic
algorithm that is applicable also to smoothed data. The spectra faithfully
reproduced the input functions and may serve for data storage as well as for
predicting other experimental responses.
Key words."Creep compliance - line spectrum - relaxation modulus - relaxation spectrum - retardation spectrum
Introduction
312
acceptable). Such a fit will not produce the best fit to
the datum points, but will more closely approach the
intrinsic material property. No line spectrum - produced by whatever method - is ever the true spectrum. This necessarily remains unknown. Furthermore, no such spectrum is unique because its exact
nature depends on the parameters introduced to obtain it. The success of a spectral distribution is measured by comparing the original experimental data
with those reconstructed from the distribution.
Unfortunately, attempts to develop suitable
methods for obtaining well-determined line spectra
from which the input function can be faithfully
reconstructred, have hitherto not met with unqualified success. Among the better known older
methods of this type (Tschoegl, 1989; Sect. 3.6, p.
136ff) are Procedure X of Tobolsky and Murakami
(1959), the Collocation method of Schapery (1962),
and an extension of it by Cost and Becker (1970) called the Multidata method. The two last named require
matrix inversion. Both are likely to generate negative
modulus or compliance values in portions of the line
spectrum. If positive lines appropriately compensate
such negative lines, the occurrence of the latter may
not unduly affect the reconstruction of the input
curve. However, this compensation depends on the
exact choice of the input parameters. This makes it
virtually impossible to generate any other experimental responses from a "compensated" spectrum with
any degree of confidence.
Due undoubtedly to the easy availability of sufficiently powerful computers, the last several years
have seen an increase in interest in methods for computing spectral distributions. The literature now contains several more recent papers devoted to this subject (Baumgaertel and Winter, 1989; Elster and
Honercamp, 1991, 1992; Elster, Honercamp and
Weese, 1991; Honercamp, 1989; Honercamp and
Weese, 1989; Janzen and Scanlan, 1993; Kamath and
Mackley, 1989; Laun, 1986, Orbey and Dealy, 1991).
We wish to make our own contribution to it by offering a recursive computer algorithm specifically
designed to avoid negative spectrum lines. The method of Baumgaertel and Winter (1989), e.g., also
avoids negative spectrum lines, albeit at the expense
of reducing the density of the lines. However, we
refrain here from a detailed review o f earlier papers
by other authors because an extensive comparison is
currently in preparation (Tschoegl and Emri, to be
submitted). We do point out, however, that our
algorithm does not require matrix inversion and that
- in contrast to all other methods of which we are
aware - it computes each spectrum line utilizing only
(1)
{i = 1,2,3,4}
(2)
+g3 +g4 .
a.
313
.6
i=N
.2
O
~ 0
.6
(WINOOW lh
i
(3)
~ gi ,
i=k+l
(WlNOOW llz
~.2
~" A I
g(tt<--t<-tu)=gNexp[--(tl<--t<--tu)/rU]
(4)
(WINDOW lh
~ '2I
,
(WINDOW lh
__ 68it ...............
02
"~
........... r
,4
i=N
g(tt<-t<-tu) -
.2
-4
-3
-2
-1
Io0 (fir)
Fig. l a. Discrete relaxation spectrum consisting of four
(normalized) spectrum lines; b, c, d, e. gih(t-ri) and
gi exp ( - t/zt) as functions of log t; f. (normalized) relaxation modulus, g(t), as function of log t
gk =
gi
i=k+l
(5)
314
g(t)=
~ gih(ri-t)+gkh(rk-t)
i=1
i=N
gi h(T i - t ) .
(6)
i=k+l
gk=g(t)[t=r~ -
gi.
(7)
i=k+l
g4=g(t)lt=~l ,
function of time. As we have just shown, the discontinuous nature of the step function at t = Tk allows
the calculation of the kth spectrum line only from the
single datum point on the relaxation curve which lies
at t = Zk (or, at most, from one very close to it). By
contrast, the exponential function replaces the sharp
cut-off at t = rk by a continuous "transition" region
on the logarithmic time scale, This vastly reduces the
error involved in using neighboring datum points in
the calculation and is important because, in any practical application, the location of the "coinciding"
data point is not known. The advantage is valid in the
reverse case also. To model the relaxation modulus
with exponential kernels instead of step functions requires, for the same error, a much smaller number of
elements.
The salient conclusion to be drawn from these
observations is that datum points should be selected
only within a window covering essentially the "transition" region. This window is what we have earlier
called the "vicinity". The exponential kernel function
can model the relaxation modulus effectively only in
the transition region where the first derivative is significantly larger than zero. Figure 2 shows that the exponential kernel function well satisfies this condition
in the region from about log t/rk = - 0.6 to 0.4. This
region is the Boundary Window. Further below, we
introduce a second window, the Modeling Window. It
is this window in which the algorithm models the transient response most efficiently. The span of this window will be "bounded" by the first window which
takes its name from this property. However, to save
space in the figures, we will refer to these windows as
Window 1, and Window 2, respectively.
In this region the exponential function, when plotted semilogarithmically, can be well modeled by a
WINOOW 1
(8)
"-'- .6
'i"
OL
1.5
-.5
log (t/v)
Fig. 2. Definition of Window 1 (the Boundary Window)
-2
-1.5
-!
315
ber (one) per window. The number may then be incremented until there is no further improvement.
When the number of lines per decade is increased
the windows will necessarily overlap. In the overlap
regions the algorithm will then engage in unnecessary
calculations by going over the overlap regions twice.
These unnecessary calculations can be avoided. Let us
examine the situation in detail. Figure 3 plots the
negative inverse of the first logarithmic derivative of
the transient kernel, exp ( - t / r ) , defined by
Dtran ( t / c ) -
d
- exp ( - t / r )
d log t / r
= 2.303 ( t / z ) exp ( - t / z ) ,
(9)
as a function of log ( t / z ) for each of three neighboring spectrum lines. Window 1 is shown in the same
figure for comparison.
The span between the points of intersection of
Dtran(t/rk) with Dtran(t/rk-1) on the left, and
Dtran ( t / r k + l ) on the right, defines the Modeling Window. We denote the endpoints of the Modeling Window (Window 2) by tt and tu (for lower and upper,
respectively). Beyond these endpoints we enter the domains of the neighboring Windows 2. For this reason,
datum points for calculating the kth spectrum line
should be drawn from Window 2 when computing
more than one line per decade. The limits tt and t u
satisfy the equations
( t t / r k - 1 ) exp ( - t ) l / r k _ 1 = (tl/rK ) exp ( - tt/rk)
(lo)
and
( 6 / r k ) exp ( -- tu/r~) = (tu/rk + ~) exp ( -- tu/rk + i )
(11)
A little rearrangement yields
i.O
.8
t l - --rk'Ck--------~ ln rk
rk-- Tk_ 1 rk-1
and
tu-- r k + l r k lnrk+l
rk+l-rk
rk
.2
0
log (t/~)
Fig. 3. Definition of Window 2 (the Modeling Window)
(12)
(13)
tl-
2.303
(101/,
"ok
n
-1)
(4)
316
and
2.303 x 101/n
t u --
n (101/n -- 1 )
r~.
(15)
Relaxation modulus
Values for n = 1 to n = 8 are tabulated below.
Table 1. Limits of Window 2
n
log tt/r ~
log tu/r k
log tl/zg
log t~/r k
1
2
3
4
-0.59
- 0.27
-0.18
-0.13
0.41
0.23
0.15
0.12
5
6
7
8
-0.10
- 0.08
-0.07
-0.06
0.10
0.08
0.07
0.06
i=N
(17)
i=1
(16)
n ---r ~
marks the transition from the discrete to the continuous form of the representation of G(t). We emphasize that W i n d o w 2 must contain at least one
datum point. In practice, this puts some limitation on
the width of Window2, i.e., on the number of
preselected spectrum lines one may choose.
Window 1 spans the region in which the exponential kernel function is at all effective in modeling the
relaxation modulus. Window 2, on the other hand,
demarcates the region over which this modeling is
most effective. Table 1 shows that the two windows
coincide for the choice of one spectrum line per
decade. We have chosen the limits of Window i as
- 0 . 6 and 0.4 instead of - 0 . 5 9 and 0.41 purely for
convenience in later calculations. The small difference
is without practical consequence.
The algorithm
The preceding theoretical discussion served to
clarify which datum points should be considered in
the evaluation of a particular spectrum line. We now
develop the detailed algorithm for the calculation of
the distribution of spectrum lines from experimental
responses to excitations applied as step functions of
time. We take the (shear) relaxation modulus first,
and follow this with the (shear) creep compliance. The
method is easily adapted to dealing with the tensile
relaxation modulus and with the tensile creep compliance or, for the matter, with any other response to
g(t)={ge}+ ~ g i e x p ( - t / z i )
(18)
i=1
~ gi'cit~('c-'ci).
i=1
(19)
(20)
i=1
317
where
i=k-1
~(tj) = g ( t j ) - - g ( t u ) -
gi
exp ( - tj/%)
i=m
i=N
i=k-1
g(tj) = ~(tM) +
--
giexp ( - tj/zi)
2
i=k+l
gi
exp (
tj/~ci)
(25)
i=l
giexp(-tj/zi)+Aj
(21)
i=k+l
~(tj)=g(tM)+
~,
Creep compliance
~iexp(-tj/zi)
i=m
+ ge exp ( - tj/rk)
i=N
i=N
giexp(-tj/ri)+Aj.
(22)
i=k+l
i=N
(26)
i=1
J =~k, u
Ek =
Aj ,
(23)
j = Sk, l
where sk, l and Sk, u are the first and the last discrete
points in the window which belong to the kth spectrum line. Minimizing the error according to
OEk/O~ k = 0, leads to
J = Sk, u
g k - - :j = s/c' !
J =s~u
(24)
exp ( - 2 tj/rk)
J = slc, l
318
Results
Garrh(t ) = G e + G exp ( - t / r ) .
8
7
Z
'
G,rra(l)
__w~5
,oltl
3
I
II
log I - seconds
log Garrh(t),
and
(28)
1st Sweep
Final Sweep
- 6.00
- 5.50
-5.00
-4.50
-4.00
-3.50
- 3.00
-2.50
-2.00
0
0
0
0.0746
0.8930
0.0527
0.0007
0
0
0
0
0
0
1.0000
0
0
0
0
1st Sweep
Final Sweep
- 6.00
-5.50
0
0
0
0
- 5.00
0.0753
0.9011
0.0533
0.0007
0
0.9990
0
0
- 2.50
- 2.00
- 1.50
- 1.00
0
0
0
0
- 0.50
0.00
0.50
0.0001
0.0009
0.0001
0
0.999
0
1.00 "
1.50
0
0
0
0
2.00
4.50
4.00
3.50
3.00
10 -3
319
(29)
9
Table 4. Effect of increasing the number of spectrum lines
per decade. Standard arrheodictic model
log r
1/dec
2/dec
- 5.00
4.80
- 4.75
- 4.67
- 4.60
-4.50
4.40
-4.33
-4.25
4.20
-4.00
0.3350
.
.
.
.
.
.
.
.
0.6650
.
-
3/dec
4/dec
5/dec
0
-
H~(~)
.
.
0.5259
.
.
0.6831
.
.
0 . 4 7 4 1 0.3169
z=o
0
0.8393
_2,,
'-8 '-6
1.0000
0.1607
-4 -2 0 2 4
log t, Iog z:- seconds
10
Fig. 5. Discrete distribution of spectrum lines and the relaxation modulus derived from it
320
(30)
(31)
i
derived from it.
We engaged the algorithm a second time to determine a second set of parameters {Gj, z]}, also in steps
of 0.5 logarithmic units, but in the interval - log 5 . 5 0
to log 10.0. Despite the deliberate displacement introduced betwen the two sets, the moduli generated
from them are virtually identical. They overlap to
such an extent that they cannot be resolved on the
scale of the plot. In this exercise, we have generated
two slightly different discrete distributions of relaxation times which, however, represented the same
underlying unknown distribution. Although the data
sets differed from one another, they generated moduii
which were virtually indistinguishable from each
other. This strongly supports the contention that the
algorithm is capable of producing a discrete set of
spectrum lines from which the experimental response
can be recovered faithfully.
It is another remarkable feature of the algorithm
that it will calculate nearly correct spectrum lines even
from only a portion of the input data. To show this,
we obtained the spectrum lines from the segment of
Gw(t) lying between log t = 3 and 7. This portion
constitutes an especially severe test. The filled rectangles in Fig. 5 mark the heights of the spectrum
lines obtained from this portion. The deviations at
both ends are due to truncation errors, i.e., the
absence of information outside of the selected portion. The slight differences in the magnitudes of the
lines of the full and of the partial sets can be traced
to the change in slope of the envelope. In the region
between log t = - 3 and 1, for example, where the
envelope is a straight line, the agreement between the
full and the partial set is virtually complete. The filled
circles represent the modulus calculated from this
spectrum. Despite the deviations between the two
spectra, the filled circles still overlap Gw(t).
Truncation errors do, of course, always occur
because we never have experimental information ex-
Discussion
In a forthcoming publication (Tschoegl and Emri,
to be submitted) we intend to compare the results obtained with our algorithm with those produced by
other methods. It might be useful, however, to contrast our algorithm briefly with the Multidata method
of Cost and Becker (1970), because it clearly
demonstrates the difficulties that may arise when
negative spectrum lines are generated. When applied
to the standard linear models the Multidata method
yields spectrum line distributions as good as those
generated by our algorithm provided that a line of the
predetermined set coincides with an "original" spectrum line. Figure 6 shows a plot of Garrh(t ) generated
from Eq. (6) with the same values for the moduli but
with log r 0 = - 4.01.
Because of the slight displacement, the spectrum
lines found by the algorithm were log G 1 = 0.0311 at
log t = - 4.50, and log G2 = 0.9689 at log t = - 4.00.
Nevertheless, the relaxation modulus calculated from
these two lines using Eq. (31) was identical with that
shown in Fig. 4 within the resolving power of the plot.
The Multidata method recovered a much more complex set of spectrum lines in which the modulus of
almost every second line of the spectrum was
negative. This resulted in the oscillations exhibited by
the curve marked A in Fig. 6. Removal of the negative
I
N8
!
"-7
6
5
-
/
i
-5
10g ~,0=-4"01
A
/
i
i
-4
-3
-2
10g t - seconds
t
a
-1
Acknowledgements
The authors gratefully acknowledge support of this work
by the Slovene Ministry of Science under Grant
P2-1131-782/91, and partial support by the California
Institute of Technology.
321
References
Baumgaertel M, Winter HH (1989) Determination of
discrete relaxation and retardation spectra from dynamic
mechanical data. Rheol Acta 28:510-520
Cost TL, Becker EB (1970) A multidata method of approximate Laplace transform inversion. Intern J Num
Methods in Engg 2:207
Elster C, Honercamp J (1991) Modified maximum entropy