18.06.2013 Views

Boundary Lyer Theory

Boundary Lyer Theory

Boundary Lyer Theory

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

192<br />

JX. 1Cxact sol~tLion~ of tho stmdy-state l~ountlary-layer equat,iona i. Tho method of finite diffcfcrrnoes 103<br />

R, and G',, for sucoessive values of n startling wit,h ?z = 2 for all grid point,s between<br />

the wall and the edge of the 1)onndary layer.<br />

Sinco 17,,.,l for 12 = N-1 is known from rqnat,ion (!).70), it lmx~mcs possible to<br />

evaluate all nnlznowns F, by means of equation (9.77) whilc t,mversing td~o boundary<br />

layer from t,ho edge t,o t,he wall tJlrongll (Icrreasing va111cs of n, i. c. for 17. -- N-l ,<br />

N--2, . . ., 2. '1'11is cornplr1,rs lhr cdc1lln1,ion of Il',, (7.- F,, ll.n) in ono it.c~.nl,ion. On(:(:<br />

I{',,,, 1111s I)c~w tlr~r~~nii~~r(l. thr cot.~.c.sj)ondi~ig solntion for /0141,n ca.n be found by<br />

rlireot. nun~wirnl inhcgrxt,ion of equat'ion (9.05). The t,rapezoidal rule snfficcs for t,his<br />

purpose.<br />

The calculat.et1 vniues P7n4.1,n a.nd /,,+l,. are used t,o dntmnline new and improved<br />

,.<br />

valrtcs of t,he coc,fficients A,,, I?,,, C,, which in t,urn leads t,o new and improved values<br />

of F,+I,,, antl f,, , I,,. 111~ ~WOCCSS is t.~rmin:~tcd when t,hc rcsnlt,~ of two s~~cccssivc<br />

it,rrnt,ions ngrco t,o within a specified tdcrancc, typically of order 10-5. 'l'ho convergrnce<br />

is nsnallp rapid, t01ree t,o four iterations being adequate in most cases with<br />

st,rp sizrs A.r in l,he range 0.01 t,o 0.05.<br />

In crrt,t~in pro11lc:nis it, I~ecomrs n~ccssnr~ t,o nllow for bonnda.ry-li~y(~ growt,l~<br />

1)y inrrc,asing N (or ve) as t,hr calcnlatrions proceed tlownst,reant. The houndarylayer<br />

edge is rlcfinctl by thr rcquircmcnt t,hat tho difference FN-Fnr~l should be<br />

Iws t,lian a sprrificd value, t,.vpically of ordrr 10-4. 7'hc growth, in t,crrns of the presrnt<br />

variablcs, is usually very modest even for cases involving separation.<br />

A vnrial~lc of primary intcrcst. in the calcnlat,ion is the s1.rrs.s at t,hc wall; it,s<br />

vnluo can bc tl~t~erminetl with good accuracy from the five point formula<br />

Iuirinl vnlr~cs: \Vlic~n using hnl111lrr1.c.tl similar solrrl.ions as s1,arling vdrlcs, ext,c:nsivc<br />

int~c~t,j)olat,ioti is rcclnirecl whrncver variable step sizes Ay,, are nsctl. It is<br />

rnorcx convcnirnt, antl efficient also t,tr gcnerate t,hc sin~ilarit~y solut.ion by finite<br />

tlifi~rr-rcs t.hroupl1 surcrssivc iterat,ions. The equat,ion t>o be solved is oht,aincd from<br />

cclna,li~m (!).64). and can I)c writtam in 1inoar.ized form as<br />

guessing a so la ti or^ which salisfics the boundary condit,ions), whereas those wit,ll<br />

index i arc to be found in the 1:-th or cnrrcnt itcmt,ion. 'L'lte tlifTcrc:nc:c quol,irnf,s<br />

(9.69) and (0.70) are now snl)stitut,cd ink) equa0ion (!).84). 'I'hc rrsult. is a tlilli~~~~ncc<br />

equat,ion which can be writt,en in the standard form of eqnat,ion (9.74), with coeffi -<br />

A linear variation in F suffices as an initid guess, Fo, and the corrcspontling value<br />

off is detmmincd from equation (9.86). The coefficients A,, /I,,, C,, and I),, nro (XIoulntcd<br />

next, and tltc corresponcling vnlncs of /?,, and (r,, arc tlct~errninctl ~~eross thtbonntlary<br />

layer. The recurrence rclnlion (9.77) and t,he bountlnrg contlit,iorls (!).78)<br />

are then used to determine the new it,crat.e, FI, across thr bounclnry lager. 'Yhr<br />

process is repeated until the difference bct,wcen successive it,eratrs becomes smaller<br />

than the specified t,olerance. The number of it.emtions required is typically of order<br />

8 to 12. The method is simpler t,llan t,he usl~al W~ooting'' ~ncthod used for two-point<br />

lmnntlary-vnlnc problem$ arid it converges in many rases WIICIT t,lrc In,t.ter mct,l~otl<br />

fails, for inst,ance for very large blowing mt.cs.<br />

Applications: The finite-difference method prescnt.ctl hrrc is in1,cntlctl as n prnctical<br />

engineering t,ool. Great,rr accuracy cnn be achicvcrl with a more clalwrntr procedure,<br />

1,111, t,his in turn leads t,o greater cotnplexit,y in fornlnlat,ion mtl progrnmrning<br />

and to an increased demnlid for computm t,ime and cnpacit.y. The conipnting time<br />

nnd accnmey tlrpcnd for all tlifTcrcncc ntet,lrotls on the skp sizr nsrtl in thr rnlrw<br />

Iations. It, is of int.crest, to exa,mine the accuracy of the present, mct,hotl in a few<br />

cases for which very accurat3e solut,ions are known. The cases considrretl are 11owa1~t.h'~<br />

linrnrly retarded flow (cf. Scc. IXd) a,nd the circular cylinder with a pressure clistrihut.ion<br />

ncrortling 1,o pot.cnt,inl 1.hrory and nccotding t,o t.hc cspcriments of I[ic.n~r~lz<br />

(c/. See. X c). '1'11~ rrsult,s for n "normnl" step sizc and a "srnnll" step size arc tabnlntcd<br />

11clow. lhtn t.11~ C:IICIII:L~~ rcs1111~s only the locat.ion of the scl~n.rt~.l.ion 11oin1s IIII!<br />

sl~own.<br />

Case ('o~kIerrd 1 Present redts 1Sxnct<br />

1,inenrly set.artlrtl Ilow<br />

Circular ryli~~tlcr<br />

(l'okntinl flow)<br />

-.<br />

Circular cylit)tlrr<br />

(Ilic~ncne prms. tlntn)<br />

I<br />

(1) x,' = 0.1227<br />

(2) x,* = 0.1210<br />

(1) 4, = 106.13"<br />

(2) 4, = 105.01 O<br />

r8* = 0.1 I!)!) (Ilownrtli)<br />

or r,* = 0.1 198 (l,eig11)[44]<br />

I or T,* - 0.1203 (Sc4~ortinr~~)<br />

4a - 104.5' (Srl~ocnni~er)<br />

(rf. Scc. Xc)<br />

--<br />

(I) $, = 80.98"<br />

(2) 4, = 80.08"<br />

#. -= 80WC (.lnlli: nnd Stnitl1)(.42/<br />

(interl)olntrd)<br />

.-

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!