Chp 3: Scalar Advection and Linear Hyperbolic Systems. By Prof. Dinshaw S. Balsara

Size: px
Start display at page:

Download "Chp 3: Scalar Advection and Linear Hyperbolic Systems. By Prof. Dinshaw S. Balsara"

Transcription

1 Chp 3: Scalar Advecton and Lnear Hyperbolc Systems By Prof. Dnshaw S. Balsara

2 3.) Introducton We have seen the need for consstency and stablty n FDAs of PDEs. However, for the advecton equaton, whch s lnear, the approach faled badly for square pulses. We study why n ths chapter. Our analyss s based on a pctoral approach for advecton. Concept of total varaton dmnshng (TVD) schemes that s later formalzed. Need two nsghts for treatng systems: ) How to treat lnear hyperbolc systems w/o oscllatons (ths chapter). 2) How to deal wth non-lneartes n the hyperbolc system (next 3 chapters). Wll also dscuss the Remann problem for lnear hyperbolc systems. These topcs are mportant buldng blocks that wll be used over and over agan later n scheme desgn. Also address boundary condtons. 2

3 3.2) Qualtatve Introducton to Non-Lnear Hybrdzaton for Scalar Advecton The Dlemma: Godunov s theorem : There are no lnear, second order schemes for treatng lnear advecton whch would always reman postvty preservng. Free of oscllatons monotncty preservng. The Way Out: van Leer desgned nherently non-lnear schemes for treatng the lnear advecton problem, thereby escapng the clutches of Godunov s theorem! We follow Godunov s orgnal dea of lterally movng slabs of flud n order to show the evoluton of flud from tme t n to t n+ = t n + t. We focus on what happens to the dscontnuty n the th zone when we do that. Consder x = and t = 0.4,.e. CFL of 0.4. The blue represents the flud (.e. flux) that flows nto zone. The pnk represents the flux flowng out of the same zone. 3

4 a b u n 2 u n u n + 2 u n + a t u n + u n u n + u n + 2 u n + + u n Questons: Can we develop a noton of monotoncty preservng advecton? Can we vsually show that ths advecton s monotoncty preservng? 4

5 a b u n 2 u n u n + 2 u n + a t u n + u n u n + u n + 2 u n + + u n Tme average of left flux : t f = (a t) u n+ /2 n /2 Tme average of rght flux : t f = (a t) u n+ /2 + /2 Conservaton law n ntegral form : x u = x u + t f t f n n+ n n+ /2 n+ /2 /2 + /2 ( ) ( ) n+ n n n n n u = u µ u u = µ u + µ u Queston: What can you say about postvty for the above scheme? 5

6 Tme average of left flux : t f = (a t) u n+ /2 n /2 Tme average of rght flux : t f = (a t) u n+ /2 + /2 n Conservaton law n ntegral form : + x u = x u + t f t f u = u µ ( u u ) = ( µ ) u + µ u n+ n n+ /2 n+ /2 /2 + /2 n n n n n n 6

7 We see by sheer constructon that the frst order upwnd scheme wll produce no new extrema because each mesh pont at t n+ s a convex combnaton of two neghborng mesh ponts at tme t n. A scheme wth such a property of not generatng any new extrema n the soluton that were not present ntally s called a monotoncty preservng scheme. We wsh to explore monotoncty preservng schemes whch are second order accurate extensons of the frst order upwnd scheme. To get to second order accuracy, endow slabs wth slopes. 3 choces: ) Left-based 2) Central dfference 3) Rght-based Formally, ths s called reconstructon. We are carryng out pecewse lnear reconstructon. Reconstructon s an mportant buldng block n scheme desgn. We have: n n n u n u ( x) = u + ( x x) u s called a " slope" or undvded dfference 7 x

8 a b u n 2 u n u n + 2 u n + a t u n + u n u n u n u n + + u n Questons: Can we vsually show that ths second order advecton s not monotoncty preservng? 8

9 a b u n 2 u n u n + 2 u n + a t u n + u n u n u n u n + + u n n+ /2 n Tme average of left flux : t f /2 = (a t) u + ( µ ) u 2 n+ /2 n Tme average of rght flux : t f + /2 = (a t) u + ( µ ) u 2 n+ n n+ /2 n+ /2 Conservaton law n ntegral form : x u = x u + t f /2 t f + /2 n n µ n n ( ) ( ) = 2 Queston: What can you say about postvy t for the above scheme? n+ n n n u u µ u u µ u u 9

10 a b u b a t u n 2 u n u n + 2 u n + u c A = a t u b u 2 ( ) ( + ) c a t u n + u n u n u n u n + + u n

11 n+ /2 n Tme average of left flux : t f /2 = (a t) u + ( µ ) u 2 n+ /2 n Tme average of rght flux : t f + /2 = (a t) u + ( µ ) u 2 n+ n n+ /2 n+ /2 Conservaton law n ntegral form : x u = x u + t f /2 t f + /2 µ = 2 n n ( n n ) n+ n n n u u µ u u µ u u

12 We see that we have generated a new extremum. Rght slopes yeld Lax-Wendroff scheme; central slopes yeld Fromm scheme; left slopes yeld Beam-Warmng scheme. All choces are ll! The only soluton les n restrctng,.e. lmtng, the pecewse lnear profle wthn each zone so that t does not produce any new extrema n the advected profle that were not ntally present n the orgnal slabs of flud. Such lmters are called slope lmters. A smple example the MnMod lmter (.e. choose between the left and rght slopes based on whch one s smaller; 0 f opposte slopes) : n n n n n n n n ( ( + ) ( ) ) ( + ) n u = sgn u u + sgn u u mn u u, u u 2 There are several other/better lmters n the text. All lmters are nonlnear. Thus success on lnear advecton came at the cost of non-lnear hybrdzaton. 2

13 a b u n 2 u n u n + 2 u n + a t u n + u n u n u n u n + + u n Queston: Based on the mnmod lmter, justfy the slopes n the profle to the left. Wth lmter, the spurous extrema are gone! Ths does come at a prce: The order of the method s locally reduced by a lmter n those zones where t s actvated. The lmter acheves ts salutary effect by provdng strong dsspaton (and order reducton) where t s needed to prevent dspersve rpples that would otherwse form n a second order scheme. 3

14 a b Notce that the square pulse s oscllaton free. However, the top of the Gaussan has been clpped! Even the Lax-Wendroff scheme dd better than the non-lnearly hybrdzed schemes. The reason : n n u u left slope Lmter only examnes the rato : θ = = n n u u rght slope + physcal extremum and a spurous oscllaton. When θ, the lmter reduces to central dfference, whch s good and stable. When θ or θ, slopes are truncated, whether that s good or not. Can't tell the dfference between a 4

15 a b All lmters clp extrema. The better ones, lke the MC lmter shown above, fare better. However, even the MC lmter clps the top of the Gaussan. Only recourse les n schemes lke WENO or PPM wth larger stencls. We call the MC lmter a compressve lmter because t allows the scheme to use larger slopes. As a result, t yelds a sharper profle. 5

16 Comparng reconstucton by MnMod lmter to MC lmter. Latter produces steeper slopes sharper profles. Questons: Can you justfy the slopes to the left and rght based on the form of the lmters? Dsspaton α jumps. Whch lmter dsspates less? n n n n n n n n n n n n n u = mnmod ( u+ u, u u ) = sgn ( u + u ) + sgn ( u u ) mn u + u, u u 2 u = MC ( u u, u u ) = ( sgn ( u u ) + sgn ( u u )) mn u u, 2 u u, 2 u u 2 2 n n n n n n n n n n n n n n n

17 3.3) The Total Varaton Dmnshng Property and Understandng the Lmters Monotoncty preservng property s hard to formulate mathematcally; total varaton dmnshng (TVD) s much easer to formulate. A TVD scheme s monotoncty preservng Harten. Helps wth postvty. n n n + = n+ n TV( u ) { + } n n n n n For a mesh functon u..., u, u, u,... at tme t we defne the total varaton as: TV u = u u We say that the scheme s total varaton dmnshng (TVD) f we have: TV u Check out the graph to see that the scheme s not TVD. If t were TVD, could the wggles arse? Queston: Can you evaluate TV for the plot to the rght? 7

18 Harten realzed that many update schemes can be wrtten as: C n+ n n n n n u = u C, /2 u u + +, + /2 u+ u If the scheme s non - lnearly stablzed, C and C may have strongly non-lnear dependence on the mesh functon., /2 +, + /2 Harten ' s Theorem : When C 0, C 0 and C + C for all zones "", the scheme s TVD., /2 +, + /2, /2 +, + /2 Proof: By shftng ndces n the above equaton we get u n+ + n = ( n n) ( n n u ) + C, + /2 u+ u + C+, + 3/2 u+ 2 u+ subtractng one from the other we wrte: u u = C u u + C C u u n+ n+ n n n n +, /2, + /2 +, + /2 + ( n n ) + C u u +, + 3/

19 Now apply the Schwartz nequalty (.e ( C C ) n n n n n +, + /2 +, + /2 + = = n n, /2 ) to get: TV u u u u u + C u u = a+ b a + b Now shftng the summaton ndces n the last two sums gves: ( C C ) + C u u = TV u u u u u n n n n n +, + /2 +, + /2 + = = n n +, + 3/ n n n n, + /2 + C+, + /2 + = + C u u + u u = = u u TV u = n n n + Ths completes our proof! The TVD property s a very mportant buldng block for numercal schemes for hyperbolc systems. It ensures a postvty & monotoncty preservng propertes n the resultng scheme. Postvty for systems s much harder. 9

20 Studyng our schemes n the context of Harten s theorem: The scheme wll be TVD f the fluxes have a specal form. The frst order upwnd scheme s monotone but has dffusve fluxes. The fluxes for the second order schemes have extra terms. We call these extra underlned terms the antdffusve fluxes. (Queston:Why ant?) They reduce dffuson n the 2 nd order scheme. But reduce dsspaton carefully, or else oscllatons appear. The ncluson of the antdffusve terms n red (underlned), turn the donor cell fluxes nto the Lax-Wendroff fluxes Frst order fluxes (Donor cell): f = a u ; n+ /2 n /2 f = a u n+ /2 + /2 Second order fluxes (Lax-Wendroff): f f n = a u + 2 n µ u u + /2 /2 = a u n u n + + µ + u 2 n+ /2 n /2 n ( n ) ( n) 20 ;

21 The prevous second order Lax-Wendroff fluxes, wth ther ant-dffusve parts, are not TVD! Snce the Lmter only depends on the rato θ ( n n µ φ θ ) + u u u n n = n n u + u we wrte the ( n n ) ( n n ) φ θ TVD fluxes wth lmter as (Use u u u u ): n+ /2 n f /2 = a u u n u n + µ φ θ ; 2 n+ /2 f + /2 = a u n + u 2 We seek a lmter φ ) φ θ 2) φ θ ( θ ) wth the followng attrbutes: = 0 for θ < 0,.e. to avod extrema. > 0 for θ > 0,.e. slope has correct sgn. 3) φ θ = for θ =,.e. to be second order accurate for smooth flow. 2

22 The second order accurate scheme becomes: (Questons: Can you demonstrate that the eqn below retreves the Donor Cell and Lax-Wendroff schemes? For what functonal choce of φ θ t retreve the Beam-Warmng scheme?) wll n+ n t ( n+ /2 n+ /2 u u f ) = + /2 f /2 x µ = µ µ φ θ φ θ 2 + n+ n n n n n n n u u u u u u u u 22

23 n+ n t n+ /2 n+ /2 u = u ( f+ /2 f /2 ) x µ = µ µ φ θ φ θ 2 n n ( + ) ( + ) ( ) ( ) n+ n n n n n n n u u u u u u u u n n ( u u ) Use u u = to rewrte t as: θ µ φ θ = µ + ( µ ) φ θ ( ) ( ) n+ n n n u u u u 2 θ µ φ θ C, /2 = µ + ( µ ) φ( θ ) and C+, + /2 = 0 2 θ Harten's Theorem requres 0 C, /2 23

24 Harten's Theorem requres φ θ 2 φ( θ ) 2 θ ( ), /2 Snce θ and θ are ndependent, and φ θ and φ θ 0 C whch for 0 µ mples : are +ve, the only way out s to take: φ θ 0 2 and 0 φ( θ) 2 θ Ths gves us the TVD regon φ (θ) Questons: Where does the Donor 2 Cell scheme ft n the TVD regon? What about Lax-Wendroff scheme? What about Beam-Warmng scheme? What about Fromm scheme? θ

25 4) The scheme should also be second order. Thus φ θ should le wthn the lmts blocked out by : a) the Lax-Wendroff scheme wth ts rght-based slopes ( φ θ = ) b) the Beam-Warmng scheme wth ts left-based slopes ( φ θ = θ) Ths further restrcts the TVD regon ( Sweby regon) 5) The lmter should also symmetrcal: φ ( / θ) φ θ = θ be 2 φ (θ) Beam- Warmng, φ (θ)=θ Lax- Wendroff, φ (θ)= θ 25

26 a φ (θ) 2 Mnmod b 2 φ (θ) van Leer θ θ c φ (θ) 2 MC d 2 φ (θ) Superbee θ Queston: Identfy the least and most compressve lmter. What are the consequences? 26 θ

27 Mathematcally, t means that we have lnearly ndependent egenvectors. 27 Sensble soluton methods wthn reach. 3.4) Lnear Hyperbolc Systems and the Remann Problem (Revew.5) 3.4.) Soluton of Lnear Hyperbolc PDEs for Contnuous Intal Data We wll need to learn how to classfy dfferent hyperbolc PDEs. We take only a frst step here. We have seen that any conservaton law U t + F x = 0 can be lnearzed as U t + A U x = 0. For lnear hyperbolc PDEs we lterally have F = A U. We focus on such PDEs. A s an M M matrx wth constant entres. The M M hyperbolc system U t + A U x = 0 s strctly hyperbolc f we have real dsjont egenvalues : λ < λ 2 < < λ M. Physcally, t means that the waves are well-separated.

28 Several very mportant hyperbolc systems are non-strctly hyperbolc,.e. we stll have real egenvalues but : λ λ 2 λ M. Queston: Gve an example of such a system. Physcally, under favorable crcumstances (.e. when we have lnearly degenerate egenvalues), waves may stll reman well-separated. Mathematcally, we have to examne egenstructure more closely. Need to work on solutons for each specfc case. 28

29 We consder the smple case where A s a constant M M matrx and has well-separated egenvalues. m m m m m m A r = λ r ; l A = λ l m=,..., M We can buld the matrx of rght egenvectors and left egenvectors as before to get: A R = R Λ ; L A = Λ L ; L A R=Λ ; A = R Λ L R L Recall: R l λ M 2 2 r r r l 0 λ 0 ; L ; = = = Λ M M l 0 0 λ m m m m Left-multply U + A U = 0 by l to get : w + λ w = 0 for m=,.., M t x m m where w l U s called the egenweght or characterstc varable. t x m m m th Notce from w + λ w = 0 that the m characterstc varable moves t x m th wth speed λ along the m characterstc of the hyperbolc system. 29

30 The characterstc decomposton descrbed above s one of the standard buldng blocks used n desgnng numercal schemes. Physcally, It tells us that the characterstc varables undergo smple m m m advecton wth a speed that s gven by the egenvalue. w + λ w = 0 It helps us solve the Cauchy problem for hyperbolc systems: Gven dfferentable ntal condtons on non-characterstc surfaces n spacetme, the system can be evolved further n tme at least for a small tme. 0 ( x) = = Thus gven ntal condtons U m m m 0 0 0, we form the characterstc varables w x l U x for m,..., M.e. w x are known functons of x. Then to evolve the system n tme, advect the profles to get : m 0 = 0 λ The soluton at a later tme s gven by : U xt, w x t r M m= t m m m x ( m λ ) w x t 30

31 3.4.2) Soluton of Lnear Hyperbolc PDEs for Dscontnuous Intal Data: Smple waves and the Remann Problem Lnear hyperbolc PDEs also admt dscontnuous solutons (weak solutons). For frst order conservaton laws, one can have dscontnuous solutons even though the dfferental form of the PDE does not admt them. Reason: The ntegral form of the PDE admts such weak solutons. Study weak solutons n two stages: a) Smple waves b) Remann Problem 3

32 0 ( x) t= 0 x= 0 Integral form U + A U dx dt = 0 gves: X U X U X + A U T U T = 0 A U U = U U T X must match up wth an egenvalue of A : A ( U U m R L) = λ ( U R U L) T Thus wth ntal condtons: U = The t= Tx= X t x L R R L R L R L m th m m U for x<0 ; U x = U = U + α r for x 0 L 0 R L smple wave s gven by: ( xt) x t ( x ) m m m m U, = U for < λ ; U, t = U = U + α r for x λ t 32 L R L

33 (0,T) t Dscontnuty (X,T) t= Tx= X Integral form U + A U dx dt = 0 t= 0 x= 0 t x U L U R (0,0) (X,0) x X A ( UR U L) = ( UR U L) match up wth A r =λ r T m m m 33

34 Notce: A smple wave s a very specal wave structure where the jump U R U L s restrcted to le parallel to the m th rght egenvector. Queston: What f we have a very general jump U R U L wth no partcular arrangement between left and rght state? Answer: Then we have to solve the Remann problem! As long as the space of rght egenvectors s complete (whch s guaranteed for a strctly hyperbolc lnear system) we can always make the projecton: M U U = α r where α l U U m m m m R L R L m= α m s an egenweght of r m.but what does t mean physcally? It means that we have a set of M constant states between U L and U R where the m th constant state U (m) les between x=λ m t and x=λ m+ t 34

35 Physcally: We have a smlarty soluton wth m smple waves. The Remann problem s a super-mportant buldng block for numercal schemes. ( xt) U, = U for m M ( m) p p p p m m = U U L + α r = U R α r for λ < < λ +, m=,..., M p= p= m+ t = U L R x t < λ M for λ < x t x 35

36 x t m = λ 0 m 0 t x = λ + t x = λ 2 t x = λ t x = λ 3 t U (2) U () U m 0 U (M ) x = λ M t x = λ M t U L U R U () = x U (2) = U (3) = 36

37 x t m = λ 0 m 0 t x = λ + t x = λ 2 t x = λ t x = λ 3 t U (2) U () U m 0 U (M ) x = λ M t x = λ M t U L U R U ( M ) = x U ( M 2) = U ( M 3) = 37

38 3.4.3) The Remann Problem as a Buldng Block for the Numercal Soluton of Hyperbolc Systems Here we focus on formulatng a frst order (Godunov) scheme for lnear hyperbolc systems that can handle dscontnutes. Hgher order monotoncty preservng schemes wll also produce jumps at zone boundares, albet the jumps wll be smaller. Ether way, we have to learn how to handle such jumps for the case of hyperbolc systems. The Remann problem from the prevous secton s well-suted for dong that and comes to our rescue. The Remann solver s a very mportant buldng block for schemes that solve lnear and non-lnear hyperbolc problems. 38

39 u x u x t t n+ t n x 39

40 n { } Let us start wth a d mesh functon U on a mesh wth zone sze x. For Godunov's method, we wsh to evolve the soluton from n n tme t to t + t : t x ( + /2 /2 ) n+ n n n U = U F F n The goal s to fnd properly upwnded F + /2 at the zone boundares,.e. fluxes that buld n the realzaton that there are dscontnutes n the soluton and ncorporate the fact that the dscontnuty at each boundary wll splt nto a Remann fan of smple waves that move n dfferent drectons.. Shft coordnate system so that the orgn les at the zone boundary of nterest. 40

41 x t m = λ 0 m 0 t x= λ + t x = λ 2 t x = λ t x = λ 3 t U (2) U () U m 0 U (M ) x = λ M t x = λ M t U L U R x 4

42 We seek the resolved state,.e. the soluton of the Remann problem that overles the zone boundary x=0 of nterest. It wll then be easy to average that state n ( m ) RS 0 space and tme to get the numercal orresolved flux. I.e. we want state U U m0 m0 wth the property that λ < 0 λ + See prevous fg. Fnd state that overles tme axs. U ( RS ) ( m ) U 0 = U L m M p p p p r R r p= p= m f 0 < λ m = U + α = U α f λ < 0 λ L M = U f λ 0 R 0 0 m + m0 m0 Notce that the resolved state s bounded by the characterstcs x = λ t and x= λ + t. Obtanng the resolved flx u requres us to dstngush between waves that move to the rght and those that move to the left. F ( RS ) ( RS ) A U Because the resolved flux s of great mportance to us, we obtan compact, computatonally effcent expressons for t. 42

43 Dstngushng between waves that move to the rght and those that move to the left s most easly done by defnng: +, m m max,0 ;, m m λ λ λ mn λ,0 The left and rght fluxes are also best wrtten as: F A U ; F A U L L R R Automatc expressons for evaluatng the resolved flux are then obtaned as: F M RS, m m m = F L + λ α r m= = F R M m= λ α +, m m m = ( F R + F L) 2 2 r M m= λ α r m m m Queston: What makes the eqns. above so desrable for computer mplementaton? m m Set α l U U n the above formulae to obtan even more compact expressons. R L 43

44 ( m ) 0 0 p p 0 0 RS m m U U = U + α r f λ < 0 λ + To fnd the flux, do F L m p= ( RS ) ( RS ) A U M ( RS ), m m m, m ( m ) L λ α r λ λ F = F + wth mn,0 m= 44

45 ( m ) RS 0 p p m0 m0 U U = U α r f λ < 0 λ + To fnd the flux, do F R M p= m + 0 ( RS ) ( RS ) A U M ( RS ), m m m, m ( m ) R λ + α r λ + λ F = F wth max,0 m= 45

46 RS M m L + λ m α m r m=, F = F = F R M m= λ α r +, m m m M F = ( F R + F L) 2 2 RS m m m m= λ α r 46

47 Our fnal computer-frendly expressons for the resolved flux are: ( RS ) F = F + A U U + = F A U U = F F A U U 2 2 wth the defntons: ( + ) ( ) { } { } + +, +,2 +,M,,2,M Λ dag λ, λ,..., λ ; Λ dag λ, λ,..., λ ; + + A Λ ; L R L R R L R L R L { 2 M } Λ dag λ, λ,..., λ ; R L A RΛ L ; A R Λ L + The matrces A, A and A are evaluated once and for all for a gven lnear hyperbolc system! 47

48 M ( RS ), m m m m m F = F L + λ α r wth α = l UR UL m= ( RS ) F = F + A U U wth A = Λ L R L R L 48

49 M ( RS ) +, m m m m m F = F R λ α r wth α = l UR UL m= ( RS ) F = F A U U wth A Λ R R L = R L 49

50 Notce that we can now show consstency of our scheme. ( RS ) F F U s guaranteed when U U and U U. + /2 /2 n+ n n n As a result, the FDA U = U F F wll converge to the PDE U + A U = 0. t x t x The present Remann solver goes through wth small modfcatons for non-lnear hyperbolc systems, hence ts great mportance. L R 50

51 Example: The lnearzed Euler system vx0 ρ0 0 ρ ρ v x + 0 v x0 v x = 0 t ρ 0 x P P 2 0 ρ0c0 v x0 Recall the characterstc analyss λ = v c ; λ = v ; λ = v + c 2 3 x0 0 x0 x0 0 ρ0 ρ0 2 3 r = c 0 ; r = 0 ; r = c0 2 2 ρ0 c 0 0 ρ0 c l = 0 ; l = 0 ; l = c0 2 ρ0 c0 c0 2 c0 2 ρ0 c0 Now consder the Remann egenweghts T ( ρ ) ( ρ ) problem wth U =, v,p and U =, v, P. L L xl L R R xr R Our are gven by: α vxr vxl + P P ; 2 R L 2 c0 2 ρ0 c0 α ρ ρ α + 5 ( P P ) ; ( v v ) ( P P ) 2 3 R L 2 R L xr xl 2 R L c0 2 c0 2 ρ0 c0 T

52 2 3 l = 0 ; = 0 ; = 0 2 l 2 l 2 2 c0 2 ρ0 c0 c0 2 c0 2 ρ0 c0 ρl ρr Now consder the Remann problem wth UL = v xl and UR = v xr. P L P R Our egenweghts are gven by: α vxr vxl + P P ; 2 R L 2 c0 2 ρ0 c0 α ρ ρ α + ( P P ) ; ( v v ) ( P P ) 2 3 R L 2 R L xr xl 2 R L c0 2 c0 2 ρ0 c0 52

53 The soluton to the Remann Problem s then gven by: x U ( xt, ) = U L for < vx0 c0 t () x = U U L + α r = U R α r α r for vx0 c0 < < vx0 t (2) x = U U L + α r + α r = U R α r for vx < < vx + c t x = U R for v x0+c0 < t Takng the transonc case 0 < v < c we get m =. x The Resolved Flux s now gven by: ( RS ) F = A U = A U () L = A U R + λ α r λ α r λ α = A U R A U L + + r ( + ) ( λ α r λ α r λ α r )

54 3.5) Numercal Boundary Condtons for Lnear Hyperbolc Systems Recall that for scalar advecton u t + a u x = 0 wth a>0, we only need to specfy the boundary condtons at the left boundary. Specfyng them at the rght boundary would overspecfy the problem. We want to understand how t goes for the M component lnear hyperbolc system U t + A U x = 0. 54

55 Because we apply lmters to obtan the slopes, we wll need two zones out from each physcal boundary. Called ghost zones. Queston: Why two? 55

56 x t m = λ 0 m 0 t x= λ + t x = λ 2 t x = λ t x = λ 3 t U (2) U () U m 0 U (M ) x = λ M t x = λ M t U L U R x Say we have m 0 left-gong waves and M m 0 rght gong waves: At left boundary: m 0 waves leave and M m 0 enter the doman. At rght boundary: M-m 0 waves leave and m 0 enter the doman. 56

57 We classfy boundary condtons as follows: Boundary condtons that permt a wave to leave the computatonal doman wthout generatng a back-reacton are called radatve or nonreflectve boundary condtons. Boundary condtons that specfy the ampltude of a wave that should flow nto a computatonal doman are called nflow boundary condtons. Our phlosophy n developng the boundary condtons s that we should apply the same numercal algorthm, f ths s at all possble, to all the zones of the mesh. 57

58 m m m The ndvdual waves obey : w + λ w = 0 Consder the left boundary: t x We may want the frst back reacton. I.e. we want : 0 waves to leave the doman wthout generatng any m w 0 for m m we should contrve to have 0 for. t m m = < 0 wx = m< m0 Soluton: Do ths by settng : w = w = w for m< m. m m m 0 0 For m> m, the waves are comng nto the doman from the left. We are free 0 to specfy them as we wsh n accordance wth the physcs of our problem. Soluton: For m> m, you are free to set w and w n accordance wth your needs. m m 0 0 The Result: We have all the characterstc weghts determned for zones M M n m m n m m and 0. So we can set : U 0 = w0 r and U = w r m= m= 58

59 For perodc boundary condtons we set : U = U, U = U, U = U, U = U n n n n n n n n 0 N N N+ N+ 2 2 For outflow boundary condtons at left boundary we set : U = U = U n n n 0 59

60 3.6) Second Order Upwnd Schemes for Lnear Hyperbolc Systems Three Schemes: A) Lax-Wendroff B) Two-stage Runge-Kutta C) Predctor-Corrector Each of the three schemes descrbed here can be extended to non-lnear hyperbolc systems. The latter two are also relatvely easy to extend to hgher orders. Consder the same mesh that we used for descrbng boundary condtons. 60

61 Recap Lax-Wendroff for scalar advecton:- u + a u = 0 t x ) { } 2 I I n n n n n Start wth mesh functon at tme t : u, u,..., u, u, 2) Usng a lmter, construct lmted undvded dfferences n u n each zone. 3) Construct fluxes at zone boundares: n+ /2 n t n f + /2 = a u + a u for a 0 2 x t 2 x n n = a u+ a u + for a < 0 t 4) Update: u u f x = ( f ) n+ n n+ / n+ /2 + /2 /2 6

62 3.6.) Second Order Accurate Extenson of the Lax-Wendroff Scheme wth Lmters ) Envson the computatonal problem n characterstc varables : m m n m m m w = l U for m=,..., M wth w + λ w = 0 t x 2) In words, we should form the characterstc varables of the mesh functon and advect them around wth second order accuracy. To do that, we frst reconstruct the undvded dfferences n each zone: + m m m m m w = Lmter w w, w w for m =,..., M 3) Usng these, we could of course construct the fluxes boundares, f, for the characterstc varables. m + /2 at the zone Small problem: Now some waves can be left-gong whle other waves may be rght-gong. We need an upgrade forour flux formula. 62

63 m +, m m t m m, m m t m m f+ /2 = λ w + λ w+ /2 + λ w+ λ w+ /2 2 x 2 x wth w = w for λ 0 m m m + /2 m = w for λ < 0 (Notce, only one of λ m + +, m or, m λ s non-zero) M n+ /2 m m + /2 = + / 2 r m= The resultng flux for the whole system can be wrtten as : F f The flux can be wrtten n a more elegant form that s more nstructve as: F n+ /2 + / 2 = A + U n M n F /2 F m m m / 2 = λ λ w+ /2 2 m= x + A U + where t r m Queston: Interpret the terms n the above flux formula. 4) Fnally the Update : t U = U F x + + ( + / 2 F / 2 ) n+ n n /2 n /2 63

64 m +, m m t m m, m m t m m f+ /2 = λ w + λ w+ /2 + λ w+ λ w+ /2 2 x 2 x M n+ /2 m m + /2 = + /2 r m= F f F A U + A U + F where F M n+ /2 + n n m m m m + /2 = + + /2 + /2 = λ λ w+ /2 r 2 m= x 64 t

65 3.6.2) Second Order Accurate, Two-Stage Runge-Kutta Scheme wth Lmters The methods descrbed here are amongst the most popular ones. Reason: They have a very appealng plug-and-chug qualty. Each stage of a Runge-Kutta method looks exactly lke the other. Whle each stage only needs to attan the desred spatal accuracy, the whole scheme wll have the desred spatal and temporal accuracy. Thus RK schemes are called method of lnes or sem-dscrete methods. U t = F x It s possble, though, to obtan schemes that are more effcent than Runge-Kutta. Two possble second order accurate Runge Kutta schemes: Modfed Euler Approxmaton: ( F+ /2 ( U ) F /2 ( U )) t U = U 2 x t U = U F U F x n+ /2 n n n n n ( + /2 /2 ( U )) n+ n n+ /2 n+ /2 n+ /2 n+ /2 Improved Euler Approxmaton: ( + /2 ( U ) F /2 ( U )) () n t n n n n U = U F x t U = U + U F U F U 2 2 x 65 n + /2 /2 n+ () () () () ()

66 66

67 We only need to descrbe one stage, snce they all look alke: Step : We have to obtan the undvded dfferences of the conserved varables. Ths can be done usng two dfferent styles of lmtng: Lmtng on the Characterstc Varables: m m a) Obtan characterstc varables : w = l U ( + ) b) Lmt characterstc varables : w = Lmter w w, w w c) Project back to obtan undvded dfferences n conserved varables : U = w M m= Lmtng on the Conserved Varables: m m m m m 2 M a) Wrte conserved varables as vector : U u, u,..., u b) Lmt each of the components of the vector: m m r m ( 2 M ) m m m m u = Lmter u+ u, u u gves U u, u,..., u T T Queston: What are the strengths and weaknesses of each lmtng strategy? 67

68 Step 2: Obtan the left and rght states at the zone boundary: (.e. snce we know the varaton wthn the zone, we can obtan the values of the soluton at any pont n the zone, ncludng the facecenters.) U U + ΔU ; U U ΔU 2 2 L; + /2 R; + /2 + + Step 3: Treat the Remann solver as a machne that accepts two states and spts out a flux. Feed the above left and rght states nto the Remann solver and obtan a properly upwnded flux. F = F U, U + /2 RS L; + /2 R; + /2 Step 4: These fluxes can be used n each of the two stages, as needed, to obtan the full update. 68

69 It s very nterestng and mportant to show that the mproved Euler Runge -Kutta scheme s strong stablty preservng;.e. f each stage s TVD n a certan sense, then the whole scheme s TVD. Queston: But n whch varables s t TVD? To see ths, make the mn, m n w l U do ths for all m=,..., M transformaton: m,() mn, t () n t n n n n U = U F+ /2 ( U ) F /2 ( U ) ( m mn, m mn, w f ) = w + /2 w f /2 w x U = U t x F U F U n+ n (2) U = ( U + U ) 2 n+ n ( + /2 /2 ) (2) () /2 () () Convex combnaton Snce the frst stage s TVD, we have : TV Snce the second stage s TVD, we have: TV x w = w t x w w mn, + mn, m,(2) w = ( w + w ) 2 U f ( f ) + /2 /2 m,(2) m,() m m,() m m,() M n+ mn, + m w r m= m,() mn, ( w ) TV( w ) m,(2) m,() ( w ) TV( w ) So m=,.., M we can wrte: TV TV TV TV TV TV 2 2 ( w ) ( w ) + ( w ) ( w ) + ( w ) ( w ) mn, + m,(2) mn, m,() mn, mn, 69

70 () n t n n n n u = u f u f u x t u = u f u f u x n+ ( n (2) u u u ) = + 2 ( ) + /2 /2 ( n+ n ) + /2 /2 (2) () /2 () () 70

71 3.6.3) Predctor-Corrector Formulaton It s based on the dea that f we have the pecewse lnear slopes wthn a zone, we can also predct the tme-evoluton of the hyperbolc system for at least a small tme nterval wthn that zone. u(x) u n n u x n ( x) = u + ( x x ) /2 u n + R ; /2 /2 u n + L ; + /2 u n + u(x) u n + u /2 u n + R ; /2 n n u x n ( x) = u + ( x x ) /2 u n + L ; + /2 u n u n u n - + x - + The panel to the left shows a mesh functon that s not decreasng wth x. The panel to the rght shows a mesh functon that s not ncreasng wth x. We solve the advecton equaton u t + a u x = 0 wth a>0. In each case the dashed lne shows the pecewse lnear reconstructed profle n x at tme t n whle the dotted lne shows the same profle 7 at tme t n + t / 2. u n x

72 Step : We have to obtan the undvded dfferences of the conserved varables; same as before. Step 2: Realze that we can obtan the tme evoluton wthn a zone n because: U U + A = 0 t x Use ths to drectly obtan tme-centered left and rght states at the zone boundares. Ths tme-centerng makes the scheme second order. n+ /2 n n U U L ; + /2 U + ΔU + t 2 2 t n n t n = U + ΔU A ΔU 2 2 x n+ /2 n n U+ U R ; + /2 U + ΔU + + t 2 2 t n t = U + ΔU A ΔU 2 2 x Ths s the predctor step. n n

73 Step 3: Treat the Remann solver as a machne that accepts two states and spts out a flux. Feed the above left and rght states nto the Remann solver and obtan a properly upwnded flux. n+ /2 n+ /2 F = F U, U + /2 RS L; + /2 R; + /2 Step 4: Use the fluxes to obtan the update step: t U = U F U, U F U, U x Ths s the corrector step. ( ) ; + /2 ; + /2 ; /2 ; /2 n+ n n+ /2 n+ /2 n+ /2 n+ /2 RS L R RS L R Questons: How would the speed of ths method compare to that of the Runge-Kutta method? Whch steps are repeated n the Runge-Kutta method? Whch steps domnate the cost? 73

74 3.6.4) Numercal Results from the Prevous Three Schemes Queston: Compare and contrast the results of the three schemes: 74

Appendix B. The Finite Difference Scheme

Appendix B. The Finite Difference Scheme 140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton

More information

Numerical Heat and Mass Transfer

Numerical Heat and Mass Transfer Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

High resolution entropy stable scheme for shallow water equations

High resolution entropy stable scheme for shallow water equations Internatonal Symposum on Computers & Informatcs (ISCI 05) Hgh resoluton entropy stable scheme for shallow water equatons Xaohan Cheng,a, Yufeng Ne,b, Department of Appled Mathematcs, Northwestern Polytechncal

More information

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

More information

Lecture 5.8 Flux Vector Splitting

Lecture 5.8 Flux Vector Splitting Lecture 5.8 Flux Vector Splttng 1 Flux Vector Splttng The vector E n (5.7.) can be rewrtten as E = AU (5.8.1) (wth A as gven n (5.7.4) or (5.7.6) ) whenever, the equaton of state s of the separable form

More information

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2 Salmon: Lectures on partal dfferental equatons 5. Classfcaton of second-order equatons There are general methods for classfyng hgher-order partal dfferental equatons. One s very general (applyng even to

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

Lecture 10 Support Vector Machines II

Lecture 10 Support Vector Machines II Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed

More information

Lecture 21: Numerical methods for pricing American type derivatives

Lecture 21: Numerical methods for pricing American type derivatives Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)

More information

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE

CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Physics 5153 Classical Mechanics. Principle of Virtual Work-1

Physics 5153 Classical Mechanics. Principle of Virtual Work-1 P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal

More information

AA214B: NUMERICAL METHODS FOR COMPRESSIBLE FLOWS

AA214B: NUMERICAL METHODS FOR COMPRESSIBLE FLOWS AA214B: NUMERICAL METHODS FOR COMPRESSIBLE FLOWS 1 / 74 AA214B: NUMERICAL METHODS FOR COMPRESSIBLE FLOWS The Fnte Dfference Method These sldes are based on the recommended textbook: Culbert B. Laney. Computatonal

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

Economics 101. Lecture 4 - Equilibrium and Efficiency

Economics 101. Lecture 4 - Equilibrium and Efficiency Economcs 0 Lecture 4 - Equlbrum and Effcency Intro As dscussed n the prevous lecture, we wll now move from an envronment where we looed at consumers mang decsons n solaton to analyzng economes full of

More information

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

More information

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS

NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS IJRRAS 8 (3 September 011 www.arpapress.com/volumes/vol8issue3/ijrras_8_3_08.pdf NON-CENTRAL 7-POINT FORMULA IN THE METHOD OF LINES FOR PARABOLIC AND BURGERS' EQUATIONS H.O. Bakodah Dept. of Mathematc

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Formal solvers of the RT equation

Formal solvers of the RT equation Formal solvers of the RT equaton Formal RT solvers Runge- Kutta (reference solver) Pskunov N.: 979, Master Thess Long characterstcs (Feautrer scheme) Cannon C.J.: 970, ApJ 6, 55 Short characterstcs (Hermtan

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body Secton.. Moton.. The Materal Body and Moton hyscal materals n the real world are modeled usng an abstract mathematcal entty called a body. Ths body conssts of an nfnte number of materal partcles. Shown

More information

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng

More information

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018 MATH 5630: Dscrete Tme-Space Model Hung Phan, UMass Lowell March, 08 Newton s Law of Coolng Consder the coolng of a well strred coffee so that the temperature does not depend on space Newton s law of collng

More information

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (Spring 2009) Prelim 3 - Solutions Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.

More information

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0 Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the

More information

Numerical methods for hyperbolic balance laws with discontinuous flux functions and applications in radiotherapy

Numerical methods for hyperbolic balance laws with discontinuous flux functions and applications in radiotherapy Numercal methods for hyperbolc balance laws wth dscontnuous flux functons and applcatons n radotherapy Numersche Verfahren für hyperbolsche Blanzglechungen mt unstetger Flussfunkton und Anwendungen n der

More information

Inductance Calculation for Conductors of Arbitrary Shape

Inductance Calculation for Conductors of Arbitrary Shape CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

Module 1 : The equation of continuity. Lecture 1: Equation of Continuity

Module 1 : The equation of continuity. Lecture 1: Equation of Continuity 1 Module 1 : The equaton of contnuty Lecture 1: Equaton of Contnuty 2 Advanced Heat and Mass Transfer: Modules 1. THE EQUATION OF CONTINUITY : Lectures 1-6 () () () (v) (v) Overall Mass Balance Momentum

More information

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011

Stanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011 Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

Chapter 4 The Wave Equation

Chapter 4 The Wave Equation Chapter 4 The Wave Equaton Another classcal example of a hyperbolc PDE s a wave equaton. The wave equaton s a second-order lnear hyperbolc PDE that descrbes the propagaton of a varety of waves, such as

More information

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16 STAT 39: MATHEMATICAL COMPUTATIONS I FALL 218 LECTURE 16 1 why teratve methods f we have a lnear system Ax = b where A s very, very large but s ether sparse or structured (eg, banded, Toepltz, banded plus

More information

FTCS Solution to the Heat Equation

FTCS Solution to the Heat Equation FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use

More information

PHYS 705: Classical Mechanics. Calculus of Variations II

PHYS 705: Classical Mechanics. Calculus of Variations II 1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary

More information

Canonical transformations

Canonical transformations Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,

More information

Consistency & Convergence

Consistency & Convergence /9/007 CHE 374 Computatonal Methods n Engneerng Ordnary Dfferental Equatons Consstency, Convergence, Stablty, Stffness and Adaptve and Implct Methods ODE s n MATLAB, etc Consstency & Convergence Consstency

More information

The equation of motion of a dynamical system is given by a set of differential equations. That is (1)

The equation of motion of a dynamical system is given by a set of differential equations. That is (1) Dynamcal Systems Many engneerng and natural systems are dynamcal systems. For example a pendulum s a dynamcal system. State l The state of the dynamcal system specfes t condtons. For a pendulum n the absence

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructions

THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructions THE VIBRATIONS OF MOLECULES II THE CARBON DIOXIDE MOLECULE Student Instructons by George Hardgrove Chemstry Department St. Olaf College Northfeld, MN 55057 hardgrov@lars.acc.stolaf.edu Copyrght George

More information

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

More information

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017

U.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017 U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that

More information

On a direct solver for linear least squares problems

On a direct solver for linear least squares problems ISSN 2066-6594 Ann. Acad. Rom. Sc. Ser. Math. Appl. Vol. 8, No. 2/2016 On a drect solver for lnear least squares problems Constantn Popa Abstract The Null Space (NS) algorthm s a drect solver for lnear

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

Modified Mass Matrices and Positivity Preservation for Hyperbolic and Parabolic PDEs

Modified Mass Matrices and Positivity Preservation for Hyperbolic and Parabolic PDEs COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING Commun. Numer. Meth. Engng 2000; 00:6 Prepared usng cnmauth.cls [Verson: 2000/03/22 v.0] Modfed Mass Matrces and Postvty Preservaton for Hyperbolc and

More information

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION

ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION

More information

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1

Physics 5153 Classical Mechanics. D Alembert s Principle and The Lagrangian-1 P. Guterrez Physcs 5153 Classcal Mechancs D Alembert s Prncple and The Lagrangan 1 Introducton The prncple of vrtual work provdes a method of solvng problems of statc equlbrum wthout havng to consder the

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 13 GENE H GOLUB 1 Iteratve Methods Very large problems (naturally sparse, from applcatons): teratve methods Structured matrces (even sometmes dense,

More information

Ballot Paths Avoiding Depth Zero Patterns

Ballot Paths Avoiding Depth Zero Patterns Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

Chapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D

Chapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D Chapter Twelve Integraton 12.1 Introducton We now turn our attenton to the dea of an ntegral n dmensons hgher than one. Consder a real-valued functon f : R, where the doman s a nce closed subset of Eucldean

More information

Digital Signal Processing

Digital Signal Processing Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

One-sided finite-difference approximations suitable for use with Richardson extrapolation

One-sided finite-difference approximations suitable for use with Richardson extrapolation Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,

More information

EPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski

EPR Paradox and the Physical Meaning of an Experiment in Quantum Mechanics. Vesselin C. Noninski EPR Paradox and the Physcal Meanng of an Experment n Quantum Mechancs Vesseln C Nonnsk vesselnnonnsk@verzonnet Abstract It s shown that there s one purely determnstc outcome when measurement s made on

More information

NUMERICAL DIFFERENTIATION

NUMERICAL DIFFERENTIATION NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:

Introduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law: CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

Integrals and Invariants of Euler-Lagrange Equations

Integrals and Invariants of Euler-Lagrange Equations Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

Generalized Linear Methods

Generalized Linear Methods Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set

More information

Mathematical Preparations

Mathematical Preparations 1 Introducton Mathematcal Preparatons The theory of relatvty was developed to explan experments whch studed the propagaton of electromagnetc radaton n movng coordnate systems. Wthn expermental error the

More information

Advanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017)

Advanced Circuits Topics - Part 1 by Dr. Colton (Fall 2017) Advanced rcuts Topcs - Part by Dr. olton (Fall 07) Part : Some thngs you should already know from Physcs 0 and 45 These are all thngs that you should have learned n Physcs 0 and/or 45. Ths secton s organzed

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Another converse of Jensen s inequality

Another converse of Jensen s inequality Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout

More information

CHAPTER 14 GENERAL PERTURBATION THEORY

CHAPTER 14 GENERAL PERTURBATION THEORY CHAPTER 4 GENERAL PERTURBATION THEORY 4 Introducton A partcle n orbt around a pont mass or a sphercally symmetrc mass dstrbuton s movng n a gravtatonal potental of the form GM / r In ths potental t moves

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

The Finite Element Method

The Finite Element Method The Fnte Element Method GENERAL INTRODUCTION Read: Chapters 1 and 2 CONTENTS Engneerng and analyss Smulaton of a physcal process Examples mathematcal model development Approxmate solutons and methods of

More information

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations

1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys

More information

Feature Selection: Part 1

Feature Selection: Part 1 CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

4DVAR, according to the name, is a four-dimensional variational method.

4DVAR, according to the name, is a four-dimensional variational method. 4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The

More information

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0 Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

A new Approach for Solving Linear Ordinary Differential Equations

A new Approach for Solving Linear Ordinary Differential Equations , ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of

More information

PHYS 705: Classical Mechanics. Newtonian Mechanics

PHYS 705: Classical Mechanics. Newtonian Mechanics 1 PHYS 705: Classcal Mechancs Newtonan Mechancs Quck Revew of Newtonan Mechancs Basc Descrpton: -An dealzed pont partcle or a system of pont partcles n an nertal reference frame [Rgd bodes (ch. 5 later)]

More information

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.

For now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results. Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson

More information

2 Finite difference basics

2 Finite difference basics Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T

More information

PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY

PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY POZNAN UNIVE RSITY OF TE CHNOLOGY ACADE MIC JOURNALS No 86 Electrcal Engneerng 6 Volodymyr KONOVAL* Roman PRYTULA** PARTICIPATION FACTOR IN MODAL ANALYSIS OF POWER SYSTEMS STABILITY Ths paper provdes a

More information

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980

Chat eld, C. and A.J.Collins, Introduction to multivariate analysis. Chapman & Hall, 1980 MT07: Multvarate Statstcal Methods Mke Tso: emal mke.tso@manchester.ac.uk Webpage for notes: http://www.maths.manchester.ac.uk/~mkt/new_teachng.htm. Introducton to multvarate data. Books Chat eld, C. and

More information

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification

2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton

More information

Norms, Condition Numbers, Eigenvalues and Eigenvectors

Norms, Condition Numbers, Eigenvalues and Eigenvectors Norms, Condton Numbers, Egenvalues and Egenvectors 1 Norms A norm s a measure of the sze of a matrx or a vector For vectors the common norms are: N a 2 = ( x 2 1/2 the Eucldean Norm (1a b 1 = =1 N x (1b

More information

12. The Hamilton-Jacobi Equation Michael Fowler

12. The Hamilton-Jacobi Equation Michael Fowler 1. The Hamlton-Jacob Equaton Mchael Fowler Back to Confguraton Space We ve establshed that the acton, regarded as a functon of ts coordnate endponts and tme, satsfes ( ) ( ) S q, t / t+ H qpt,, = 0, and

More information

[7] R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Clis, New Jersey, (1962).

[7] R.S. Varga, Matrix Iterative Analysis, Prentice-Hall, Englewood Clis, New Jersey, (1962). [7] R.S. Varga, Matrx Iteratve Analyss, Prentce-Hall, Englewood ls, New Jersey, (962). [8] J. Zhang, Multgrd soluton of the convecton-duson equaton wth large Reynolds number, n Prelmnary Proceedngs of

More information

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model

Prof. Dr. I. Nasser Phys 630, T Aug-15 One_dimensional_Ising_Model EXACT OE-DIMESIOAL ISIG MODEL The one-dmensonal Isng model conssts of a chan of spns, each spn nteractng only wth ts two nearest neghbors. The smple Isng problem n one dmenson can be solved drectly n several

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information