Ada 009261
Ada 009261
K. M. Case, et al
Stanford Research Institute
Prepa , for:
Defense Advanced Research Projects Agency
April 1975
DISTRIBUTED BY:
Knr
National Technical Information Service
U. S. DEPAHTMENT OF COMMERCE
afe*^
■riMBüMM H*.
•^—^
135124
April 1975
Technical Report JSR-74-2
01
05
O
^ PROBLEMS IN IAMINAR FLOW-TURBULENT
«£ FLOW
M/W 12 1975
Approved for public release; distribution unlimited.
iisisnTrEi
D
Sponsored by
77TVV
I Ä Ä
STANFORD RESEARCH INSTITUTE
Menlo Park, California 94025 ■ U.S.A.
Raproduead by
NATIONAL TECHNICAL
INFORMATION SERVICE
US Otpirtintnl o* Comm«fc«
„ A,
Copy No
8
* ,
/
Sptin»ti«l<(. VA. M1S1
The views and conclusions contained in this document are those of the authors and should not be
interpreted as necessarily representing the official policies, either expressed or implied, of the
Defense Advanced Research Projects Agency or the U.S. Government.
tf)
-t MBB
h-T^TTTrTZ^IF.CA-nON OF THIS PAGE (When Dg Entered)
READ INSTRUCTIONS
BEFORE COMPLETING FORM
REPORT DOCL'MENTATION PAGE
3 RECIPIENTS CATALOG NUMBER
2. GOVT ACCESSION NO
[I REPORT NUMBER
J3R-74-2 JJ2A^£3J2Al.
■ TYPE
5. „.- REPORT
'.TTT. OF occ^DT ii, PERIOD
PFRIOD cov(
COVERED
j 4. TITLE '.ard Subtitle)
Technical Report JSR-74-2
PROBLEMS IN LAMINAR FLOW-TURBULENT FIOW
6. PERFORMING ORG. REPORT NUMBER
SRI Project 3000
r? AUTHORi») 8 CONTRACT OR GRANT NUMBERS)
K. M. Case A. M, Despain E. A, Frieman Contract ÜAHC15-73-C-0370
F, W, Perkins J. F. Vesecky
'10 PROGRAM ELEMENT, PROJECT TASK
9. PERFORMING DHGANl/A I ION NAME ANU ADDRESS AREA 8i WORK UNIT NUMBERS
^TTSiTSACT (Continue on rev. d. ,f nece.-ry and ident.tv by COCK number) transition from
A program is suggested for the numerical simulation of the transition fro
F0RM
nn
LrU 1 JAN 73 1473 IFJriON OF THIS PAGE (When Data Entered)
FSiTION OF 1 NOV 66 IS OBSOLETE NATIONAL T:(.HNICAL
INFORMATION SERVICE
ggyäS r, äüäSJäS f'F THIS PA
^ (Wh 1
'" ^ ^2S^L
19 KEY WORDS (Continued)
20 ABSTRACT (Continued)
ffW\
ijW\
F0RM
JAN 73 ,1473
(BACK)
SEC
TjBITY CLASSIFICATION OF THIS PAGE (When Data Entered)
EDITION OF 1 NOV 65 IS OBSOLtTE KK
' '■"*
I ■ ■
CONTEXTS
v
IlLLSTRATIONS
v11
TABLES
1
I INTRODUCTION
5
II THE FLAT PLATE
lD
A. Boundary Conditions
18
B. Calculations at Breakdown
19
III COMPUTER REQUIREMENTS
A. Introduction 19
20
B. Finite-Difference Method
20
C. Spectral Method
D. Comparison of Computing Time Estimates 25
29
IV WAKE OF A FLAT PLATE
31
V WEDGE FLOWS
33
VI POSSIBLE FUTURE PROBLEMS
33
A. Couette Flow
C. Poiseuille Flow
D. Modifications of the Flat-Plate Problem 36
41
IX RECOMMENDATIONS
iii
*m
APPENDICES
D BOUNDARY CONDITIONS
65
IV
/
*a
ILLUSTRATIONS
i
/
rtMi
w mm "
TABLES
vil
Jl — ^■M
i INTRODUCTION
estimates, see Case et al., 1973). Since time steps are restricted by
3
space steps, the number of needed calculations then grows as R (Case
computers.
and ask what can be done in the way of a numerical investigation of the
2V 2
.1^: + v . Vv = -VP + vV v (1)
at ~ ~
V . v = 0 (2)
M
Knowledge of such transitions also has considerable significance for
practical designs. The hope is that we will be able to treat such prob-
lems with presently available computers, since:
Indeed, for a given practical situation more than one mechanism may be
that become turbulent rapidly and those that become turbulent gradually.
the initial calculations are successful, we then indicate others that can
/
*H
Our program is then as follows. First we consider various situations
—■—
■CM
II THE FLAT PLATE
tion in the boundary layer in the flow over a flat plate. The advantages
of this are:
(1) Codes ior this have been developed and some calculations
have been performed (Grosch, 1974; Orszag, 1974).
velocity Uoo in the x direction toward the plate. The pressure gradient
*■
is adjusted to be zero. A ribbon is located above the plate in a span-
wise (z) direction perpendicular to the flow at some distance downstream
from the leading edge. Under the ribbon there are strips uniform in
length and uniformly separated. With the ribbon staMonary the x component
(u) of the velocity is, fo.- any x and z, as shown in Figure 1.
mtm j
At a larger amplitude of oscillation the picture changes. As we
proceed downstream from the ribbon the situation Is first as above.
Further down, however, there develops * pronounced three-dimensional
structure characterized by large spanwl.e variations in wave amplitude
with "peaks" and "valleys" occupy ng fixed spanwlse positions. Associated
with this variation in amplitude there is also a spanwlse variation in
local mean velocity such that there is a defect at a peak and an excess
at a valley. Further downstream there occurs an abrupt increase in
amplitude at a peak that is characterized by a series of intense low-
velocity pulses-evidenced by "spikes" i„ an oscillogram of streamwise
fluctuating velocity. At first a single spike appears for each cycle of
the primary oscillation. The spikes increase in number as we go down-
stream and ultimately blend into fully developed turbulence.
"öu vdu d u
dx V
dy " ~~2 (3a)
dy
du äv
dx dy (3b)
u=v=0aty=0 lim u = U
U00 v
u = U00 f(Tl) V =
(4)
\
^^"^
where
Ti = y.
With
we have
subject to
Remarks;
(6)
— F
(b) 6
••fKh—^
=
M
the variations described above occurred within 40 cm
of the ribbon. At this point 6 has changed by only
~20%.
(b) After but a few 6 from the plate (^1 cm for the
experiment) the flow is essentially arbitrarily
close to the free-stream velocity.
u = u + 6u (7)
~ ~o ~
where u is the original laminar flow, and we retain only terms linear
that the profile (y dependence) is such that the one at a given position
Xo really extends from -oo < x < oo, (Since in the problems considered
here the true x variation of the profile is very slow, this is a readily
solutions of the eigenvalue problem were obtained for this case]. With
Figure 2 gives the results for an old calculation of the curve for
*m _j
1
K- y
tt> 6
max
* 0.19
10
^m tt*
^ -*»
t ~ 300 c/s
max
«he rlBht-ha,d „eutral curve hefore the a.p,„tuaes are large e„„ugh to
»of. the lluear assunptfou. As m eo tarther d„„stream ^ ^^^^^
-iU theu he dampea out. Ou the other haut,, if the iui.i.i dlstllr|)ante
11
mm
1
16 ■ —^
N
1 1
HP
i» A ■;
nmyScMchhng
MemnrnmrScfiubam
and SkramstM
1 1
0.8
1
Q.S
a* f+ 1
|
02 %
0 MI —' •
-02
Yl
ir *^-
-0*
0 0* cu» h? ;/f ;> 7 ?> . ^/I
I
FIGURE 4 VARIATION OF AMPLITUDE OF THE u'-FLUCTUATION FOR
TWO NEUTRAL DISTURBANCES IN A LAMINAR BOUNDARY
LAYER ON FLAT PLATE AT ZERO INCIDENCE. The curves
labeled I and 11 correspond to the two neutral disturbances I and
I. m Figure 2. Source: Schlichting (1960).
*m J
1
13
w*—ä
the plate ,„ assure the lnm.1 establish.»,« „t the laM„,r no. hut
upstream ,„. the rlhhou to dln,ln.sh spurious .tt.ct. due to incorrect
boundary conditions. A reasonable .uess .„uid he to st.rt at a p<sltl„n
<a 5>
- ^. "»st""" '«. the ribbon (.here X^ Is the n,l„lmu. „„stahle
•.oUMen-Scbllchtln, .a.elengtb,. ^„strea« tro. the ribbon .o „uld
lik. to include all positions tin the onset o. turbumnce. EXperlTOnt.ny
14
/
guess is 16 points in this direction (N = 16). In the 6-direction we
have a total distance 26, but as we have seen in the region 0 i y < 0.26,
there are very rapid variations. Hence, with finite-difference method»
one would use either some coordinate mapping or a varying grid size.
Assuming ehe latter, one might use of the order of 20 points for the
first 0.36 and 20 irore for the remainder—i .e. , of the order of 40 grid
points. The sizes of the time steps are essentially determined by
stability requirements—i.e.,
vAt < Ar
0.375 -4
At < • 2.5 X 10
~ 3
1.5 X 10
-3
For T = 1/150 c/s = 6.7 X io~ , this implies of the order of 30 time
steps per cycle and ♦hexefore a number of time steps Nt ~ 300 to 500.
A. Boundary Conditions
A well posed problem for solutions of Eqs. (1) and (2) would be
one in which the initial velocity is prescribed everywhere within the
region described and the velocity is given everywhere on the boundary
15
^M*
for all time (subject to j^n • u ds = 0). Unfortunately we do not know
is of the Blasius form plus whatever p-M turbation one might want to put
Two somewhat ad hoc suggestions have been made. Grosch (1974) suggests
L
du
ua.y.z.t) - j u(x,y,z,t) g(x) dx ♦ |H (x.y.z.t) h(x]
0 dx
I Ok
0
which might indeed be reasonable. How well the actual choice made of
g(x) and h(x) approximates such a condition is not clear. Also, there
16
/
MM M
suggested s. me modified boundary conditions about which
we have insafficient information to permit making an
evaluation.)
V P = 0
? ~ P e '
o
/
17
■rt^
compared to the free-stream velocity. This suggests that any such
disturbance will be convected downstream and have little effect upstream.
B. Calculations at Breukdown
fraction (~ 1/10) of the primary period. The scheme described above will
However, even this may not occur—the large space and time differences
space-time mesh and then integrate the Navier-Stokes equation with initial
18
MM
Ill COMPUTER REQUIREMENTS
A. Introduction
V (NORMAL TO PLATE),
M= 32-64
FLOW
x (FLOW OIRECTIONI,
L- 128-256
19
X »». rt*
comparison of the two methods (as we discuss below), but rather as an
indication of the computer run time and therefore cost that one can
B. Finite-Difference Method
The finite-difference method for flow over a flat plate in two di-
for each of the M values of y in the mesh. Me then solve (LN) tri-
diagonal equation systems—i.e., one system for each mesh point in the
(x,z) plane. This solution yields the Fourier components of P for each
operations required and the total number of operations per time step.
yields the total compute: time (AT ) per calculation time step:
fd
C. Spectral Method
20
(0
u
>> V
0 X
11 M m 0) x
M
M
s :
5
c
0
C
U
c
+
X
•H
w X
c
n
w
u
w
E ■ ■0
N
-
—
Q
I O CO
A
B o +
II in
5 <y
05
«
i
■c
CO
a.
N
l-l
CO c
bfi o
c
■H a
I o
pH
>
t §
E
E
o
PH
3
>i
■
IB U —
u
e
o
1 in
c
1 §
0)
3
?
§ 0
in
C "—•
••-)
rH
■
U
0
in
I
■~ •H 0 10) •H U
+J •(-> «i
r-t a Ü 0) U
I a I
^ s ^s h '—' e e
3 4) S SH
2 4) o
u
O ■H 1—1 0 0 •H C
l-l t, ••-1 b£ >-^ h fl 0) E in o
eg
U l
K cx
•rt
•o
1
0)
T3
0
a a m <H
<H
■H
Q
U
e
o
u
!fl rH>
0) 1 +J 0 -H Q J
E a •H Q ^ I 0) a
3
t/l
tn
M
«H
0 E >.
n
0
«1
1
N -M
0
-
S
0) ~ u
0)
a
CJ
0) I o
0)
u
E
3
N 5
21
noticed that no detailed discussion is given about the solution technique,
but "Runge-Kutta" is used in the actual code. Since the computer code
still contains "bugs," it is not clear just how valuable the results of
the study were. Although it is not evident from the report, it is abso-
lutely true that Orszag has made significant contributions to the field.
required for each plane normal ,o the flow per time step, and the time
spent in FFTs is 60% of the total computer run time. Also, he stated
that it took 9 seconds per time step for L = 128, M = 8, and N = 64.
Thus, a general formula for estimating the run time on a CDC-7600 can
be derived as follows.
22
log N multiplications and
N log,
(1)-]-"
(?) log N additions.
followed by
or
|4 multiplication
NM log2 (MN) X |6 addition
l 4 log.
(5) + i butterflies followed by
or
MN log« MN multiplies
— log„ MN additions
Orszag has estimated that the (20L) two-dimensional real FfTs and
(St) one-dimensional FFTs require about 60% of his computing time. For
the 7600. multiplication is about twice the time of an addition. Define
one operation as an addition; hence, multiplication is equivalent to two
23 i
^^m^
^^■•-
l0e M +
2L (ID FFTs) m 14L
[(?) 2 (5) l0SN operations
The total run time (ATg) per computation time step on the 7600 Is then
AT
(0.6/
(14L) 5 MN log2(MN) ♦ (5j log2M . (Hj ,^1
AT •K'L [ll7 MN log2(MN) 4. 5.8 M log M + 5.8 N log
'I
where K' Is a calibration factor (equal to the add xlme In seconds).
run time to the 20L two-dimensional FFTs-l.e., neglecting the two one-
dimensional FFTs, we allow 30% of the run time to the solution of tri-
diagonal equation systems, and 10% of the run time to i4 memory accesses
mate formula giving A*, the computing time required for a single time
step in the Navier-Stokes calculation:
24
*m
D. Comparison of Computing Time Estimates
The computing-time estimates (per time step) for the finite difference
and spectral methods discussed above are given by Eqs. (8) and (9). The
several points. First, the estimaces are intended only as a very rough
gui.de to the sort of computing times one might expect on rather highly
optimized "production runs." We have used effective values of t^, t^,
and t derived from the experience of Dr. Steve Orszag on the CDC 7600
s
computer where he has taken care to reduce the run time by optimization
difference method of . Chester Grosch has never been optimized for the
7600, so the figures below are in a sense a rough projection of what the
accuracy, the number of mesh points required could be less for the spectral
25
■ " "■'
ri^
•m^^
method. Finally, the algorithm for the finite-difference method has been
examined in more detail than has that for the spectral method. Given
these uncertainties, one should regard the estimates below as only rough
32-64, and N - 8-16. In Table 2 we have estimated the run times for
problems. AT, the computer time per calculation time step is calculated
from Eqs. (8) and (9) using "effective" values of t ~ 130 ns, t - 260 ns
am'
and ts - 1 us. These effective values are derived from the experience
of Dr. Steve Orszag on the CDC 7600 computer, but we have used them for
estimating both AT^ and AT^. Typically, 300 to 500 time steps are re-
Table 2
Problem L AT AT T T
M N LMN fd s fd s
26
^MM
^
rough ne main ,olnt here Is that for suitably optimized codes the run
times are not unacceptably lor*. Given a typical cost of ~ $700 per hour
lor a 7600. the production run cost for the "typlcl" problem Is about
runs."
27
' , IIIIPIW»
^m -
mm^
layer of a flat plate is that o.'' transition in the wake of a flat plate.
growth rate is not the predicted exponential, and harmonics of the in-
dimensional pattern appears and the flow becomes more and more irregular.
/
Preceding page blank
ri^ ^i J
^
30
/
MM
^^ wmm
V WEDGE FLOWS
■
U(x) = U x (10)
o
wnere
m = ß/{2 - S)
m + 1 " m^ I m - 1 ,
u = U x f'(T])
o ■ "M—^— vU x f + f'
V 2 o m + 1 '
(11)
U
. m + n1 o m -
M = y A\— x (12)
V 2 v 2
in /x2.
+ ff" + ß[l - (f') = 0 (13)
31
mtm mi^s^m
(2) By varying the parameter ß we can study the effects of
pressure gradient. Thus, with ß > 0 we have accelerated
flow (and therefore greater stability), while for ß < 0
we have deceleration (and more instability).
flat-plate case.
I
32
^m
VI POSSIBLE FUTURE PROBLEMS
they should be done at some later date. Accordingly, we have not made
A. Couette Flow
is a reasonable requirement.
When the inner cylinder rotates more rapidly, there is seen experi-
mentally a rich set of phenomena (Coles, 1965). When the rotation rates
are changed we pass from the original laminar state through a multitude
33
^M«*ii
Lin's calculation
Lock's calculation
ffe,/J
2. In Pipes
35
flat-plate boundaryy layer.
laver T+ -«-—- . L„„
„ should po8slble to calculate ^
the m, to transition to mil, „evo^pod turbu.onoo.
D
- """"""tlons g the Fl.t.p,... o„..,.n
36
m^^^
J J
VII ON CONTROLLING THE TRANSITION TO TURBULENCE
(e.g., adding heat, polymers, etc.), (3) suction, and (4) control of the
wide use, the optimum ways to use Methods 1 through 3 remain to be devised.
there are important nonlinear effects in the ways the laminar boundary
layer and potential flow patterns are altered by the measures used to
delay the transition. For example, adding heat changes the viscosity,
and the viscosity gradient in turn alters the laminar boundary layer in
surface of a body will diffuse across the boundary layer and have a much
37
-—
MM
The second-class methods to alter the transition involve nonlinear
changes in the flow within the boundary layer—e.g., nonparallel flows,
surface roughness, and abrupt changes in the body shape. As examples
we can cite the early transition to turbulence that occurs on some rough,
blunt bodies and the use of small span-wise or flow-wise grooves to
stabilize the Tollmein-Schlichtlng waves. Also, swept-wing airfoils
have boundary layers with nonparallel flow. The numerical simulation
approach gives us a single technique that can handle this wide variety
of problems.
/
38
*M J
VIII THE IMPACT OF NUMERICAL SIMULATION OF TURBULENCE
plate flows. What comprises the next generation of problems both in the
problems will require the development of a more flexible code that can
the scale of the boundary layer) and heat transport. Fortunately, almost
be a single technique that will handle many problems not only of a linear-
turbulence may not occur in the correct frequency range. On the other
as drag, heat transport, etc.) may be quite well represented since they
39
\,
depend much more on the larger, energy-containing eddies. Therefore,
there exists a strong possibility that numerical bimulation may produce
a useful enough representation of the turbulent boundary layer so that
the effect of body shape, etc., on the transport properties of the layer
can be calculated—at least in a semi-quantitative manner. Such a pro-
gram would require codes with flexible boundary conditions and carefully
thought out sub-grid closure schemes. Its impact would be to produce a
first-principles calculation of the arbitrary coefficients that occur in
turbulent-boundary-ltyer theory, and, more importantly, to see if there
are circumstances in which these coefficients vary by a significant
amount.
/
40
«rtM
IX RECOMMENDATIONS
41
M
Appendix A
MM^M -
Appendix A
But Smith's method has not received wide use because the spatial
amplification rates are derived from the solution to an eigenvalue problem
involving 4th-order differential equations. The solution to these equa-
tions, which must be done by computer for an arbitrary laminar boundary
layer, are conceptually straightforward but quite laborious In practict.
A well documented and widely available computer program is called for.
^MMM
The wide availability of such a program would allow body designers
to test proposed bodies against Smith's criterion on an in-house basis,
hopefully allowing a more rapid convergence to optimum designs.
46
WA
Appendix B
47
^H^MB
Appendix B
1. Introduction
special computer that could greatly exceed the capabilities of the current
a. An Interesting Calculation
represent the velocity and pressure fields so that three velocities and
one pressure term are required at least for the present Instant in time
and the immediate past. The past values are needed in order to mirch
Q
forward in time with a numerical integration procedure. Thus 8 X 10
scalar variables are required, and about (10 ) in 10 == 101 arithmetic
operations are required. A more detailed count of arithmetic operat-ons
of an efficient finite differencing scheme for 10 grid points Indicated
that 5 X io additions and 3 X 10 multiplications are needed ^er time
12
step. A rough guess ID that about 10 instructions would be required
49
Preceding page blank
am Mn^^^^m
12
to implement these operations so that about 2 X 10 read accesses from
storage are required for each simulated time step. These parameters are
Table B-l
Three-Dimensional Geometry
Arithmetic operations
(finite-difference method)
be required Just to update each grid point for each simulated time step.
Parallel access to the secondary storage will reduce this time, however.
50
*mm
Table ß-2
MAXIMUM-PERFORMANCE PARAMETERS
FOR A IODERN SINGLE, PIPELINED AND CACHE CPU COMPUTER
usual von Neumann computer architecture cannot be used, and other choices
should be considered.
c, ILLIAC IV
ble B-3. The most limiting facto, is the limited secondary storage of
only 109 bits as compared to the 10 bits that are required. Even If
the ILLIAC should be suprlemented with large disc drives, the bandwidth
9 10
to secondary storage would be less than 10 bits/s as compared to 60 X 10
bits needed for one simulated time step,. It would take more thar 60 X
10'9 = 600 S just to read In data fo- one simulated time step. Calcula-
M
mmm
Table B-3
ILLIAC IV PARAMETERS
64 processing elements
a. Solution Methods
and Monte Carlo methods. A special computer designed for any one of these
methods will not be optimal for any of the others. Also, while it appea-s
complexity, etc., the pseudospectral methods are much better when regular
emerge in the near future. Thus, only very flexible and general computer
structures should be considered.
52
^^■"
b. Computing Requirements
points. The spectral techniques on the other hand need global informa-
implemented through the fast Fourier transform (FFT). Thus the archi-
tecture of the computer should be such that grid points can interchange
equations, for a large number of grid points, about ten variables per
grid and 1000 operations per grid point are required for each simulated
point should be selected and 2000 to 4000 operations per grid point per
about a second, then about 3200/32 = 100 operations per second are needed
53
^m
c. Performance Tradeoffs
perform about 2 X IQ7 operations per second while a slow serial processor
3
might only be able to do about 3 X 10 operations per second.
handle the 109 grid-point problems. This approach seems to be far beyond
the calculation time were increased considerably and the logic speeds
(or array processors for ILLIAC IV), it appears that little can be gained
by a special computer architecture using high-performance operations.
cessor were "devoted" to one grid cell and hence 32 variables, the re-
per cell).
54 /
riMM J
lowest-speed serial processor, this could require as long as ten seconds
to simulate one time step. This may very well be an optimal arrangement
for a special-purpose computer devoted to solving hydrodynamic equations.
more instructions per cell are required for individual grid-point selec-
tion within a given cell. Table 3-4 illustrates the possibilities for
3. Conclusions
mrtm J
1
1 1 <H
0
2
1
ta 3
ij
2
a
■
10
B
O
- Ä 1
in
a 2 8
■H
*-•
0)
■o
ration and
L y •H
I
i
eg
i
hnology
0
10 -
0
0
i
«->
i
<H
1
x:
a
■o
Z
•o
IH
0
• ? 0 u 0
B 2
1974 state- § 2CO
Ü (1 in ai B
B +J -H •H
a! Q (i
11
W
no logy 8 N
0
«1
0)
<H
0
1 Q
i §
Is »
0)
■H
+J
U
o)
0>
rH
-H
*>
<H -
0 0 -o o o
co (H U
<0
-.
o
to
o
ir>
o
•o pH
1 u in u X
1 0> o X
1» X
o o X X X (0
1s
CM
fH in o
1 1 in CO CM (0 rH
u 0 E- .M
CO
■
s■
IA B rH 00
■a
CHE
c cj (0
in
CM
(0 CO CM
CM
§
0 4-> i-l CM CO m t* o
11 o U 3 Ei rt
rH o 0 u
a 1 m o u
to
& w a
in
J
i <H B
0 O PH
•H »H
Number
Connect
per Ce
i eg CO
CM
00
CM
o
CO
i-H
CO
CM
CO
CO
eo
M
CO
<H
0 in i-t
RAM Bit
per Cel
.
Number
| O o
8
CM
§
eo
1
rH
<H m
■in
0 h rn
0 i-l
o
CO §
o
§ | | § §
O
gj
E
in
bo
O
h
§ o 8
l-( CM Tf (0 o (fi o"
1 S SL CM R
k
in o
o B in
in (0 eo • CM 0> CO
•H o> i-( 00 CM rH
fH CM o
h o J Iß CJ CO m C»
^^ 2
5 -a a.
II H II II II II n n II n
CO CO
3 H IN
CO
CO
CO CO CO eo eo n
10 (0 oo O) o
o | rH
56
«■
^^w
57
mum J
1
Appendix C
- MMfc g
Appendix C
affects the flow upstream and downstream from that point. Writing
a«,"1 a» 1 au
' o
+ u + v
at o OX i ay ay
av au
—i + u — = -apyay
at o ax i
ax ay
■M
u = *£ ,,--*■
i öy i ax
/a_ + U
u S_\ (iLi +h ^2) , 0
\ öt o ax/ \dx2 ^yz/ "
(Note thnt ä2cp/ax2 + äVöy2 is just the vorticity of the perturbed flow.)
ones in time—i.e.,
iojt
cp(x,y,(i;) = I e cp(x,y,t) dt ,
and
cp(k,y,uü) =
1 e
ikx
cp(x,y,u)) dx
2»
d cp 2 « _ W(k,y,0)
05 -
(C-l)
2 i(ku -w)
dy o
the vorticity.
Explicitly,
W(k,y,0) =1
1 e
-ikx
Acp{x,y,0) dk
62
JL
sin ky sin k(6 - y)
G(y,y/,k) = - y s y'
k sin k 6
cp(k,y,(ü) = G(y
üly y
y, K;k) nKy',o) y
,
' • l(ku (y')-^)
/ o
f1 -ihu (y')t
©(k.y.t) = I e GCy.y', k) W(k,y'pO) dy'
and then
lk[x-u (y')t]
cpCx.y.t) = dy' |
./'../ e G(y,y',k) W(k,y'0) dk
0
(C-2)
y = y . Thus,
o
lk[x-u (y )t]
V(x,y,t) = e G(y,y ,k) dk
2n J o
63
^^MMBMM
n
Appendix D
BOUNDARY CONDITIONS
"
/
65
*m
I ■ I
Appendix D
BOUNDARY CONDITIONS
^1.8 0 2
-Tr+Zlt2 • ^1,2 ^ -VP1,2 +
^1,2
V • v =0
-1,2
Defining
= V
^ ^1 " 2
P = P - P
1 2
We find
^ 2
it * 2l * ^1 " i ' 7*2 = -VI + vy v
—mm
7 • v = 0
* ä ~ä ~ä ^x ~ ~ ~2
Thus,
öv
rr + v • yv + v • yv = -yp + w v
n i- ~i ~ ~ ~^ ~
V • v = 0
■/i'
dt
is governed by
ÖE (I v2 irr
ät j v ' ~i r+ -^ • v
^2 * y)dt ■ -Jv • py + vj 7 • vv. v
äv av
as. _ f/
i (v • yv . v + v
i i\
at
- | dslPn .v-vn.7^-+n v —|
M = max(vv )
SB
■ I^^I^
Then
p ^ 2M(t)E
ot
2/ M(t')dt'
0 ^ E(t) ^ E(0)e
öv dv ^2 V
. 0 A 2
O V
X z d? / X X
v -— + v —
x dx z dz
dx dz
ÖV
I
dv
2
h2
+ V
x dx Z ÖZ
BOUNDARY
LAYER
V
/
/ SPACE
/
y/ S FLOW
- MM
MM
dv äv
X z
ox dz
tion that the flow is more slowly varying in the x direction than in the
z direction. Thus we may write
— = E — € « 1
dx äex
and find
dv dv ,ov „ d v
.e+v .^_€+v/ ^e2 + _x
x dcx z öz äex j 2 2
d(ex) äz
2 2
dv äv A
O V A
O V
ÖP Z z
v -— e+v -— = - -— + v e +
z o€x z dz az 2 2
d(€x) hz.
öv äv
X z
r— € + -— = 0
dex öz
v = ev
z z
which yields
dv dv / d2v , d''v \
x —
v -— + V V € +
x dex r dz dex 1 i/ 2 e 2 /
\d(ex) dz /
2 2
dv —
dv ^
o - v dA "
v
z z dP 2_ + v z 1 z
v -— + v r— e +
x dex z dz dz 2 2 e 2
e ^ s
^(ex) ^
dz
70
^^^M^^l^
In order to balance the viscous and inertial forces we then must have
v = v«
dP
dv dv a2v
x _x dP X
+
x ox z äz ' dx 2~
dz
öv dv ?> v
» _Z z
x ix z dz 2~
dz
hv dv
X _z
öx äz
dv d2v
x äx x 2
A
oz
or
v ~ —
x 2
z
z z
71
_i
v ■ Uf(Tl)
x
with
Tl = z/Jvx/U
v =-g(1fl)
z z
f f " + 2f "' = 0
f = 0 f' = 0 z = C
f ' = 1 z -» a»
Since these solutions are only approximate, part of thr^ flow lield that
develops in time in the computation will result from the equation trying
by the vanishing of the perturbed flow at the bottom and top, and two more
72 /
riM i^fe J
h(uj,ß,a,R) ■ 0
thickness
6' -Jvx/U
U6'
R6 =
Xds curves of th. I.« given in Flgnre 0-.. The n.tu.l experiment of
yie
at point C.
A su^ry of a physically reasonable set of boundary conditions that
/
73
(3) Top of region, vx = UC»), free stream.
(4) Span-vise, the flow is symmetric. Th-is, vy = 0 at the
sides, and öv /M and övz/öy both vanish. Although the
original uniqueness proof was carried out for specified
v, the surface terms vanish except for
J ds n VVT =Jdx dz ^x ^ + vy ^ + vz ~)
v = U(z) + 6v
x x
v = 6v
y y
v = 6v
z z
^M
From the Navier-Stokes equations and V • v = 0, it follows that
V P = -V (v • Vvj
V G = -6(x - x')
guaranteed then that G exists. From the normal component of the Navier-
— v-n + v'Vv'ns -n • VP + vV v • n
at ~ ~ ~ ~ ~
2
ff
P=lGvVv*n-— v.n - v • Vv • n ds - J G(V . v • Vv) dt
dv
— = -VP + vV v - v • Vv
dt » «. ~
75
Appendix E
*,^m -
Appendix F
B = F[A]
Stone (1970) has shown how a one-dimensional FFT on an array of cells can
cells. Only two inputs and two outputs per cell are required. Despain
(1974) has shown now FFT operations such as those used within the cells
^m
dimensions and parallel data transfer (and calculations too if desired)
E-l and E-2 illustrate these patterns for one and two dimensions.
(
80
mtma^mm J
FIGURE E-1 PERFECT SHUFFLE CONNECTIONS
FOF 1-D FFT, N = 16
81
^M^^MM
REFERENCES
Coles, D., Transition in Circular Couette Flow," J. Fluid Mech., Vol. 21,
p. 385 (1965).
DeMetz, F., "Low Speed Boundary-Layer Transition Workshop," July 16, 17,
1974, The Rauu Corporation, Santa Monica, Calif.
Ml
Kovasznay, L.S.G., H. Komoda, and B, R. Vasudeva, "Detailed Flow Field
In Transition," in Proceedings of the 1962 Heat Transfer and Fluid
Mechanics Institute. F. E. Ehlers, J. J. Kauzlarich, C. A. Sleicher,
Jr., and E, Street, eds. (Stanford U. Press, Stanford, Calif., 1962).
Schlichting, H,, Boundary Layer Theory. Chapt. XVI (McGraw-Hill Book Co.,
Inc., N.Y., N.Y,, 1960).
Stone, H, S., "Parallel Processing with the Perfect Shuffle," IEEE Trans,
on Computers. Vol, C-20, No, 2, pp. 153-161 (1971).
84
/
tfM