Introduction to turbulence/Stationarity and homogeneity
(→Random fields of space and time)
(→Random fields of space and time)
|Line 456:||Line 456:|
Revision as of 20:17, 29 January 2008
Processes statistically stationary in time
Many random processes have the characteristic that their statistical properties do not appear to depend directly on time, even though the random variables themselves are time-dependent. For example, consider the signals shown in Figures 2.2 and 2.5
When the statistical properties of a random process are independent of time, the random process is said to be stationary. For such a process all the moments are time-independent, e.g., , etc. In fact, the probability density itself is time-independent, as should be obvious from the fact that the moments are time independent.
An alternative way of looking at stationarity is to note that the statistics of the process are independent of the origin in time. It is obvious from the above, for example, that if the statistics of a process are time independent, then , etc., where is some arbitrary translation of the origin in time. Less obvious, but equally true, is that the product depends only on time difference and not on (or ) directly. This consequence of stationarity can be extended to any product moment. For example can depend only on the time difference . And can depend only on the two time differences and (or ) and not , or directly.
One of the most useful statistical moments in the study of stationary random processes (and turbulence, in particular) is the autocorrelation defined as the average of the product of the random variable evaluated at two times, i.e. . Since the process is assumed stationary, this product can depend only on the time difference . Therefore the autocorrelation can be written as:
The importance of the autocorrelation lies in the fact that it indicates the "memory" of the process; that is, the time over which is correlated with itself. Contrast the two autocorrelation of deterministic sine wave is simply a cosine as can be easily proven. Note that there is no time beyond which it can be guaranteed to be arbitrarily small since it always "remembers" when it began, and thus always remains correlated with itself. By contrast, a stationary random process like the one illustrated in the figure will eventually lose all correlation and go to zero. In other words it has a "finite memory" and "forgets" how it was. Note that one must be careful to make sure that a correlation really both goes to zero and stays down before drawing conclusions, since even the sine wave was zero at some points. Stationary random process always have two-time correlation functions which eventually go to zero and stay there.
Consider the motion of an automobile responding to the movement of the wheels over a rough surface. In the usual case where the road roughness is randomly distributed, the motion of the car will be a weighted history of the road's roughness with the most recent bumps having the most influence and with distant bumps eventually forgotten. On the other hand, if the car is travelling down a railroad track, the periodic crossing of the railroad ties represents a determenistic input an the motion will remain correlated with itself indefinitely, a very bad thing if the tie crossing rate corresponds to a natural resonance of the suspension system of the vehicle.
Since a random process can never be more than perfectly correlated, it can never achieve a correlation greater than is value at the origin. Thus
An important consequence of stationarity is that the autocorrelation is symmetric in the time difference . To see this simply shift the origin in time backwards by an amount and note that independence of origin implies:
Since the right hand side is simply , it follows immediately that:
The autocorrelation coefficient
It is convenient to define the autocorrelation coefficient as:
Since the autocorrelation is symmetric, so is its coefficient, i.e.,
It is also obvious from the fact that the autocorrelation is maximal at the origin that the autocorrelation coefficient must also be maximal there. In fact from the definition it follows that
for all values of .
The integral scale
One of the most useful measures of the length of a time a process is correlated with itself is the integral scale defined by
It is easy to see why this works by looking at Figure 5.2. In effect we have replaced the area under the correlation coefficient by a rectangle of height unity and width .
The temporal Taylor microscale
The autocorrelation can be expanded about the origin in a MacClaurin series; i.e.,
But we know the aoutocorrelation is symmetric in , hence the odd terms in must be identically to zero (i.e., , , etc.). Therefore the expansion of the autocorrelation near the origin reduces to:
Similary, the autocorrelation coefficient near the origin can be expanded as:
where we have used the fact that . If we define we can write this compactly as:
Since has its maximum at the origin, obviously must be negative.
We can use the correlation and its second derivative at the origin to define a special time scale, (called the Taylor microscale) by:
Using this in equation 14 yields the expansion for the correlation coefficient near the origin as:
Thus very near the origin the correlation coefficient (and the autocorrelation as well) simply rolls off parabolically; i.e.,
This parabolic curve is shown in Figure 3 as the osculating (or 'kissing') parabola which approaches zero exactly as the autocorrelation coefficient does. The intercept of this osculating parabola with the -axis is the Taylor microscale, .
The Taylor microscale is significant for a number of reasons. First, for many random processes (e.g., Gaussian), the Taylor microscale can be proven to be the average distance between zero-crossing of a random variable in time. This is approximately true for turbulence as well. Thus one can quickly estimate the Taylor microscale by simply observing the zero-crossings using an oscilloscope trace.
The Taylor microscale also has a special relationship to the mean square time derivative of the signal, . This is easiest to derive if we consider two stationary random signals at two different times say and . The derivative of the first signal is and the second . Now lets multiply these together and rewrite them as:
where the right-hand side follows from our assumption that is not a function of nor a function of .
Now if we average and interchenge the operations of differentiation and averaging we obtain:
Here comes the first trick: we simply take to be exactly but evaluated at time . So simply becomes and its average is just the autocorrelation, . Thus we are left with:
Now we simply need to use the chain-rule. We have already defined . Let's also define and transform the derivatives involving and to derivatives involving and . The result is:
So equation 20 becomes
But since is a function only of , the derivative of it with respect to is identically zero. Thus we are left with:
And finally we need the second trick. Let's evaluate both sides at (or ) to obtain the mean square derivative as:
But from our definition of the Taylor microscale and the facts that and , this is exactly the same as:
This amasingly simple result is very important in the study of turbulence, especially after we extend it to spatial derivatives.
Time averages of stationary processes
It is common practice in many scientific disciplines to define a time average by integrating the random variable over a fixed time interval, i.e. ,
For the stationary random processes we are considering here, we can define to be the origin in time and simply write:
where is the integration time.
Figure 5.4. shows a portion of a stationary random signal over which such an integration might be performed. The ime integral of over the integral corresponds to the shaded area under the curve. Now since is random and since it formsthe upper boundary of the shadd area, it is clear that the time average, is a lot like the estimator for the mean based on a finite number of independent realization, we encountered earlier in section Estimation from a finite number of realizations (see Elements of statistical analysis)
It will be shown in the analysis presented below that if the signal is stationary, the time average defined by equation 27 is an unbiased estimator of the true average . Moreover, the estimator converges to as the time becomes infinite; i.e., for stationary random processes
Thus the time and ensemble averages are equivalent in the limit as , but only for a stationary random process.
Bias and variability of time estimators
It is easy to show that the estimator, , is unbiased by taking its ensemble average; i.e.,
Since the process has been assumed stationary, is independent of time. It follows that:
To see whether the etimate improves as increases, the variability of must be examined, exactly as we did for earlier in section Bias and convergence of estimators (see chapter The elements of statistical analysis). To do this we need the variance of given by:
But since the process is assumed stationary where is the correlation coefficient. Therefore the integral can be rewritten as:
Now we need to apply some fancy calculus. If new variables and are defined, the double integral can be transformed to (see Figure 5.5):
where the factor of arises from the Jacobian of the transformation. The integrals over can be evaluated directly to yield:
By noting that the autocorrelation is symmetric, the second integral can be transformed and added to the first to yield at last the result we seek as:
Now if our averaging time, , is chosen so large that over the range for which is non-zero, the integral reduces:
where is the integral scale defined by equation 10. Thus the variability of our estimator is given by:
Therefore the estimator does, in fact, converge (in mean square) to the correct result as the averaging time, increases relative to the integral scale, .
There is a direct relationship between equation 39 and equation 52 in chapter The elements of statistical analysis ( section Bias and convergence of estimators) which gave the mean square variability for the ensemble estimate from a finite number of statistically independent realizations, . Obviously the effective number of independent realizations for the finite time estimator is:
so that the two expressions are equivalent. Thus, in effect, portions of the record separated by two integral scales behave as though they were statistically independent, at least as far as convergence of finite time estimators is concerned.
Thus what is required for convergence is again, many independent pieces of information. This is illustrated in Figure 5.6. That the length of the recordn should be measured in terms of the integral scale should really be no surprise since it is a measure of the rate at which a process forgets its past.
It is desired to mesure the mean velocity in a turbulent flow to within an rms error of 1% (i.e. ). The expected fluctuation level of the signal is 25% and integral scale is estimated as 100 ms. What is the required averaging time?
From equation 39
Similar considerations apply to any other finite time estimator and equation 55 from chapter Statistical analysis can be applied directly as long as equation 40 is used for the number of independent samples.
It is common common experimental practice to not actually carry out an analog integration. Rather the signal is sampled at fixed intervals in time by digital means and the averages are computed as for an esemble with a finite number of realizations. Regardless of the manner in which the signal is processed, only a finite portion of a stationary time series can be analyzed and the preceding considerations always apply.
It is important to note that data sampled more rapidly than once every two integral scales do not contribute to the convergence of the estimator since they can not be considered independent. If is the actual number of samples acquired and is the time between samples, then the effective number of independent realizations is
It should be clear that if you sample faster than you are processing unnecessary data which does not help your statistics converge.
You may wonder why one would ever take data faster than absolutely necessary, since it simply it simply fills up your computer memory with lots of statistically redundant data. When we talk about measuring spectra you will learn that for spectral measurements it is necessary to sample much faster to avoid spactral aliasing. Many wrongly infer that they must sample at these higher rates even when measuring just moments. Obviously this is not the case if you are not measuring spectra.
Random fields of space and time
To this point only temporally varying random fields have been discussed. For turbulence however, random fields can be functions of both space and time. For example, the temperature could be a random scalar function of time and position , i.e.,
The velocity is another example of a random vector function of position and time, i.e.,
or in tensor notation,
In the general case, the ensemble averages of these quantities are functions of both positon and time; i.e.,
If only stationary random processes are considered, then the averages do not depend on time and are functions of only; i.e.,
Now the averages may not be position dependent either. For example, if the averages are independent of the origin in position, then the field is said to be homogeneous. Homogenity (the noun corresponding to the adjective homogeneous) is exactly analogous to stationarity except that position is now the variable, and not time.
It is, of course, possible (at least in concept) to have homogeneous fields which are either stationary or non stationary. Since position, unlike time, is a vector quantity it is also possible to have only partial homogeneity. For example, a field can be homogeneous in the and directions, but not in the direction so that only. In fact, it appears to be dynamically impossible to