Finite Difference Method
|
|
- Eugene Wiggins
- 5 years ago
- Views:
Transcription
1 Capter 8 Finite Difference Metod 81 2nd order linear pde in two variables General 2nd order linear pde in two variables is given in te following form: L[u] = Au xx +2Bu xy +Cu yy +Du x +Eu y +Fu = G According to te relations between coefficients, te pdes are classified into 3 categories, namely, elliptic if AC B 2 > 0 ie, A, C as te same sign yperbolic if AC B 2 < 0 parabolic if AC B = 0 Furtermore, if te coefficients A,B and C are constant, it can be written as [ [ x, y ] A B B C Auxiliary condition BC Interface Cond IC ][ u x u y ] +Du x +Eu y +Fu = G wesay well posed ifasolutionexists Terearebasically twoclassofmetod to discretize it, 1
2 2 CHAPTER 8 FINITE DIFFERENCE METHOD (1) Finite Difference metod (2) Finite Element metod 82 Finite difference operator Let u(x) be a function defined on Ω R n Let U i,j be te function defined over discrete domain {(x i,y j )} suc tat U i,j = u(x i,y j ) Suc functions are called grid functions We introduce difference operators on te grid functions δ + U i = U i+1 U i, forward difference i+1 δ U i = U i U i 1, backward difference i δ 0 U i = U i+1 U i 1 i + i+1, central difference δ 2 U i = 2(δ+ δ ) i + i+1, central 2nd difference Example 821 Consider te following second order differential equation : u (x) = f(x),u(a) = c,u(b) = d Given a mes a = x 0 < x 1 < < x N = b, x i = x i+1 x i =, we ave U i 1 2U i +U i+1 2 = f i = f(x i ), i = 1, N 1,U 0 = c,u N = d wicdeterminesu i uniquely Weobtainan(N 1) (N 1) matrixequations U 1 U N 1 = 2 f 1 f N 1 c Above equation can be written as L U = F, called a difference equation for a given differential equation d
3 82 FINITE DIFFERENCE OPERATOR 3 Exercise 822 Write down a matrix equation for te same problem wit second boundary condition canged to te normal derivative condition at b, ie, u (b) = d If one uses first order difference for derivative, we lose accuracy We need an extra equation in tis case Tere are several coices: (1) Use first order backward difference sceme U 1 U n 1 = d and append tis to te last eq( first order) (2) Use central difference equation by assuming a fictitious point U N+1 and assume te DE olds at te end point: Use 1 2(U N 1 2U N +U N+1 ) = f(1) (81) Solve te last eq and substitute into first eq 1 2 (U N+1 U N 1 ) = b (82) 1 2 (U N U N 1 ) = b + 1 f(1) (83) 2 Eq 83 can beviewed as centered difference approximation to u (x n 2 ) and rs as te first two terms of Taylor expansion u (x n 2 ) = u (x n ) 2 u (x n )+ (3) Use so tat u u N u N 1 u N u N 1 = d u N u N 1 = d+f(1) = f(1) Tis is interpreted as using Taylor series of u (1 ) = u (1)+f(1) = u (1) u (1)Butlsiscentereddifferencetou(1 2 ) Sonotconsistent (4) Approximate u (1) by iger order sceme suc as u N 2 4u N 1 +3u N = b
4 4 CHAPTER 8 FINITE DIFFERENCE METHOD Example 823 (Heat equation) We consider u t = σu xx, for 0 < x < 1, 0 < t < T u(t,0) = u(t,1) = 0 u(0,x) = g(x), g(0) = g(1) = 0 Let x i = i,i = 0,,N, x = 1/N and t n = n t, t = T J Ten we ave te following difference sceme U n+1 i t U n i [ U n = σ i 1 2Ui n +Ui+1 n ] x 2, for i = 1,2,,N 1 and n = 1,2,,M 1 were U n i u(t i,x n ) From te boundary condition and initial condition we ave In vector notation U n+1 i U 0 i = g(x i ),U n 0 = 0,Un N = 0 = Ui n + σ t [ U n x 2 i 1 2Ui n +Ui+1 n ] U n+1 = U n σ t x 2AUn were A is te same matrix as in example 1 If n = 0, rigt and side is known Tus U n = (I σ t x 2A)n G, G = (g(x 1 ),,g(x N 1 )) T Tis is called forward Euler or explicit sceme If we cange te rigt and side to U n+1 i t U n i U n+1 i = σ [ ] U n+1 i 1 2Un+1 i +Ui+1 n+1 x 2 = Ui n + σ t [ U n+1 x 2 i 1 2Un+1 i +Ui+1 n+1 ] (I +σ t x 2A)n U n = G, G = (g(x 1),,g(x N 1 )) T Tis is called backward Euler or implicit sceme
5 82 FINITE DIFFERENCE OPERATOR Error of difference operator For u C 2, use te Taylor expansion about x i u i+1 u i i u i+1 = u(x i + i ) = u(x i )+ i u (x i )+ 2 i 2 u (ξ), ξ (x i,x i+1 ) u (x i ) = i 2 u (ξ) Expand about x i+1, u i = u i+1 i u (x i )+ i 2 u (θ) Tese are first order accurate To derive a second order sceme, expand about x i+1/2, u i+1 = u i+1/2 + i 2 u (x i+1/2 )+ 1 2 ( i 2 )2 u (x i+1/2 )+ 1 6 ( i 2 )3 u (3) (ξ) Subtracting, u i = u i+1/2 i 2 u (x i+1/2 )+ 1 2 ( i 2 )2 u (x i+1/2 ) 1 6 ( i 2 )3 u (3) (ξ) u i+1 u i i = u (x i+1/2 )+O( 2 i) Tus we obtain a second order approximation to u (x i+1/2 ) By translation, we ave u i+1 u i 1 2 i u (x i ) = O( 2 i /6) if i = i+1 Assume i = i+1 and we substitute te solution of differential equation into te difference equation Using u = f we obtain ( u i 1 +2u i u i+1 ) 2 f(x i ) = 1 2( u i +u i 2 2 u i u(3) 4 24 u(4) (θ 1 )+2u i ) + 1 2( u i u i 2 2 u i 3 6 u(3) 4 24 u(4) (θ 2 )) f(x i ) = u i f(x i) 2 24 (u(4) (θ 1 )+u (4) (θ 2 )) truncation error = 2 12 max u(4) We let τ = L u F and call it te truncation error(discretization
6 6 CHAPTER 8 FINITE DIFFERENCE METHOD error) Definition 824 We say a difference sceme is consistent if te truncation error approaces zero as approaces zero, in oter words, if L u f 0 in some norm Truncation error measures ow well te difference equation approximates te differential equation But it does not measure te actual error in te solution Use of different quadrature for f Instead of f(x i ) we can use 1 12 [f(x i 1)+10f(x i )+f(x i+1 )] = 5 6 f(x i)+ µ 0 6 f(x i) were µ 0 f(x i ) is te average of f wic is f(x i )+O( 2 ) HW Let u = f Sow te following for uniform grid u i 1 +2u i u i 1 2 = 1 12 [f(x i 1)+10f(x i )+f(x i+1 )]+C 4 max u (6) (x) Definition 825 L is said to be stable if U C L U C F for all > 0 were U is te solution of te difference equation, L U = F Also note tat L is stable if and only if L 1 is bounded Definition 826 A finite difference sceme is said to converge if U u 0 as 0 U u is called a discretization error Teorem 827 (P Lax) Given a consistent sceme, stability is equivalent to convergence Proof Assume stability From L u f = τ,l U F = 0, we ave L (u U ) = τ Tus, u U C L (u U ) = C τ 0 Hence te sceme converges Obviously a convergent sceme must be stable
7 83 ELLIPTIC EQUATION 7 From te teory of pde, we know u C f Hence U U u + u O(τ )+C f C f C F 83 Elliptic equation 831 Basic finite difference metod for elliptic equation In tis capter, we only consider finite difference metod First consider te following elliptic problem:(diriclet problem by Finite Difference Metod) u = f in Ω u = g on Ω (1) Approx DE (u xx +u yy ) = f at eac interior mes pt (2) Te unknown function is to be approximated by a grid function u (3) Replace te derivative by difference quotient u(x+) = u(x)+u x (x)+ 2 2 u xx(x)+ 3 6 u xxx(x)+o( 4 ) u(x ) = u(x+) 2u(x)+u(x ) 2 = u xx (x)+o( 2 ) u xx (x,y) = [u(x+,y) 2u(x,y)+u(x,y)]/ 2 u yy (x,y) = [u(x,y +) 2u(x,y)+u(x,y )]/ 2 Tis picture is called, Molecule, Stencil, Star, etc For eac point (interior mes pt), approx 2 u = u by 5-point stencil By Girsgorin disc teorem, te matrix is nonsingular L[u] is called differential operator wile L [u] is called finite difference operator, eg, L [u] = 1 2[ 4u(x,y)+u(x+,y)+u(x,y)+u(x,y +)+u(x,y )]
8 8 CHAPTER 8 FINITE DIFFERENCE METHOD (x,y +) (x,y) (x,y) (x+,y) (x,y ) Figure 81: 5-point Stencil or more generally, [ ] L[u] = [ x, u y ]Diag{a x 11,a 22 } +cu = (a u 11 u x ) x (a 22 u y ) y +cu y Uniform meses u x = u(x+) u(x ) 2 u x(x+ (u x ) x = 2 ) ux(x 2 ) Central difference u x (x+ 2 ) = u(x+) u(x) u x (x 2 ) = u(x) u(x ) (a 11 u x ) x = [(a 11 u x )(x+ 2 ) (a 11u x )(x 2 )]/ Assume te differential operator is of te form(wit c > 0) wose discretized form L[u] (u xx +u yy )+cu = f L [U] = a 0 U(x,y) a 1 U(x+,y)+ = F(x,y) c c c rc 2 U 1 U 2 U 3 U 4 = f
9 83 ELLIPTIC EQUATION 9 satisfies (1) L [u] = L[u]+O( 2 ) as 0 u is true solution (2) AU = F +BC, Au = [ u cu+o( 2 )]+BC A(U u) = O( 2 ) = ε Ten te discretization error U u = A as te form 1 ε(depends on ) and satisfies U u A 1 ε A 1 O( 2 ) More generally wen te unit square is divided by n = 1/ equal intervals along x-axis and y-axis, ten te corresponding matrix A(wit c = 0) is (n 1) (n 1) block-diagonal matrix of te form: B I 0 I B I 0 A = 1 2 I (84) B I 0 I B were B = is (n 1) (n 1) matrix If we put D = diaga = {a 11,,a nn }, ten D 1 A(U u) = D 1 ε Write D 1 A = I +B, were B is off diagonal Ten we know B = 4 4+c 2 < 1 if c > 0 Tus (D 1 A) 1 = (I +B) 1 exists and Hence (D 1 A) 1 = (I +B) B 4+c2 c 2 U u (D 1 A) 1 D 1 ε 4+c2 2 c 2 4+c 2O(2 ) = O( 2 ) 0
10 10 CHAPTER 8 FINITE DIFFERENCE METHOD Tus, we ave proved te following result Teorem 831 Let (1) u C 4 (Ω) (2) r > 0 (3) uniform mes Ten U u = O( 2 ) as 0 84 Parabolic pde s Consider a eat equation on a bar u t = u xx, 0 x 1, 0 < t T T g(t) Ω (t) f(x) 1 Figure 82: Domain Teorem 841 (Maximum principle) If u satisfies te above condition for t T, ten min{f,g,} = m Proof Put v = u+ex 2, E > 0 min u max u M = max{f,g,} 0 x 1,0 t T 0 x 1,0 t T v t 2 v x 2 = 2E < 0
11 84 PARABOLIC PDE S 11 If v attains a maximum at Q intω, ten v t (Q) = 0, v xx (Q) 0 Tus (v t v xx )(Q) 0, a contradiction Hence v as maximum at a boundary point of Ω u(x,t) v(x,t) maxv(x,t) M +E Since E was arbitrary, te proof is complete For minimum, use E instead of E More general parabolic pde u t = Au xx +Du x +Fu+G Explicit write down te values of grid function FDM Implicit variables implicitly representing te value Let te grid be given by 0 = x 0 < x 1 < x 2 < < x N+1 = 1, x i = i, uniform grid 0 = t 0 < t 1 <, t j = jk u = g 1 (y) u = g 2 (y) u = f(x) Figure 83:
12 12 CHAPTER 8 FINITE DIFFERENCE METHOD Explicit metod = u t U i,j+1 U i,j k U i+1,j 2U i,j +U i 1,j 2 = uxx U i,j+1 = λu i 1,j +(1 2λ)U i,j +λu i+1,j were λ = k/ 2 Stability: Error doesn t accumulate In tis case solution remains bounded as time goes on Teorem 842 If u is sufficiently smoot, ten u xx u(x+,t) 2u(x,t)+u(x,t) = O(2 ) as 0 2 and u t u(x,t+k) u(x,t) k = O(k) as k 0 Teorem 843 Suppose u is sufficiently smoot, and satisfies u t = u xx 0 < x < 1, t > 0 u(x,0) = f(x) u(0, t) = g(t) u(1,t) = (t) If U i,j is te solution of te explicit finite difference sceme, ten for 0 < λ 1 2, max u i,j U i,j = O( 2 +k) as,k 0, i,j ie, finite difference solution converges to te true solution Proof Put u ij u(x i,t j ) Ten from (1) u i,j+1 u i,j k = u t +O(k) (2) u i+1,j 2u i,j +u i,j 2 = u xx +O( 2 ) we get u i,j+1 = u i,j + k 2(u i+1,j 2u i,j +u i 1,j )+k(o(k)+o( 2 ))
13 84 PARABOLIC PDE S 13 Hence u i,j+1 = λu i 1,j +(1 2λ)u i,j +λu i+1,j +Ck(k+ 2 ) Let te discretization error be w i,j = u ij U ij so tat w i,j+1 = λw i 1,j +(1 2λ)w i,j +λw i+1,j +O(k 2 +k 2 ) Since 0 < λ 1 2, 0 1 2λ < 1, tree coefficient are positive and teir sum is 1 (convex combination) We see w i,j+1 λ w i 1,j +(1 2λ) w i,j +λ w i+1,j +M(k 2 +k 2 ) for some M > 0 If we define w j = max 1 i N w i,j, ten w j+1 w j +M(k 2 +k 2 ) Since w 0 = 0, w j 1 +2M(k 2 +k 2 ) w 0 +(j +1)M(k 2 +k 2 ) w j+1 (j +1)kM(k + 2 ) TM(k+ 2 ), (j +1)k T In fact, M = max (1 0 x 1,0 t T 2 u tt + k2 12 u xxxx ) Remark 844 If λ > 1 2, te solution may not converge 0 ǫ 0 Figure 84: Nonzero point
14 14 CHAPTER 8 FINITE DIFFERENCE METHOD Exercise 845 Prove te formula is unstable for λ > 1 2 Let ε, x = 1 2 u(x,0) = wit g = = 0 0, x 1 2 Hence U i,j+1 = λu i+1,j +(1 2λ)U i,j +λu i 1,j, λ = k/ 2 U i,j+1 = λ U i+1,j +(2λ 1) U i,j +λ U i 1,j, 1 i N 1 N 1 i=1 N 2 U i,j+1 = λ i=1 since U(x i,t) = 0, i = 1,N Let S(t j ) = N i=1 U(i,j) Ten N 1 U i+1,j +(2λ 1) i=1 U i,j +λ N U i 1,j, S(t j+1 ) = (4λ 1)S(t j ) = (4λ 1) 2 S(t j 1 ) = = (4λ 1) j+1 S(0) = (4λ 1) j+1 ε Since te number of nonzero U i,j for eac j is 2j + 1(Ceck te numerical sceme, you will see solution is alternating along x-direction dispersing bot direction) tere is a point (x p,t j ) suc tat i=2 U(x p,t j ) 1 2j +1 S(t j) = 1 2j +1 (4λ 1)j ε wic diverges as j since 4λ 1 > 1 Considering te alternating sign, one can see te solution alternates: For j = 1, we see U i,1 = (1 2λ)ǫ,U i 1,1 = λǫ,u i+1,1 = λǫ U i,2 = 2λ 2 ǫ+(1 2λ) 2 ǫ,u i 1,2 = (1 2λ)ǫ+(1 2λ)ǫ = 3λǫ(1 2λ) < 0 Stability of linear system U 1,j+1 U N 1,j+1 = 1 2λ λ 0 λ 1 2λ 0 λ λ 1 2λ U 1,j U N 1,j + g(t j ) 0 0 (t j )
15 84 PARABOLIC PDE S 15 In vector form, U j+1 = AU j +G j Assume G j = 0, j = 1,2, Let µ be an eigenvalue of A Ten by G-disk teorem, 1 2λ µ 2λ 2λ 1 2λ µ 2λ 2λ 1+2λ+µ 2λ 1 4λ µ 1 If 0 < λ 1 2, ten 1 µ 1, ence stable If λ > 1 2, ten µ > 1 is possible So te sceme may be unstable Te following example sow it is actually unstable Example 846 (Issacson, Keller) Try v(x,t) = Re(e iαx wt ) = cosαx e wt v t v xx v(x,t+ t) v(x,t) = v(x+ x,t) 2v(x,t)+v(x x,t) ( t x 2 e w t ) 1 = v(x,t) cos(αx+α x) 2cosαx+cos(αx α x) t x 2 ( e w t 1 = v(x,t) 2cosα x 2 ) t x 2 e wt = v(x,t) 1 t {e w t [(1 2λ)+2λcosα x]} = v(x,t) 1 [ ( e w t 1 4λsin 2 α x )] t 2 Tusv is asolution of tedifference equation provided w andαsatify e w t = 1 4λsin 2 α x 2 Wit IC v(x,0) = cosαx, solution becomes ( v(x,t) = cosαxe wt = cosαx 1 4λsin 2 α x ) t t 2 Clearly, for all λ 1 2, v(x,t) 1 However, if λ > 1 2, ten for some x, we ave 1 4λsin 2 α x 2 > 1 So v(x,t) becomes arbitrarily large for sufficiently large t/ t Since every even function as a cosine series, we may give any even function f(x) of te form f(x) = n α ncos(απx) to get an unstable problem
16 16 CHAPTER 8 FINITE DIFFERENCE METHOD Implicit Finite Difference Metod Given a eat equation u t = u xx u(0,t) = g(t), t > 0 u(1,t) = (t) u(x,0) = f(x), 0 x 1 We discretize it by implicit difference metod U i,j+1 U i,j t = U i+1,j+1 2U i,j+1 +U i 1,j+1 x 2 i = 1,,N 1 Multiply by t, ten wit λ = t/ x 2, we ave U i,j+1 U i,j = λu i+1,j+1 2λU i,j+1 +λu i 1,j+1 U i,j = λu i+1,j+1 (1+2λ)U i,j+1 +λu i 1,j+1 j = 1,,N 1 Tis yields a system of N 1 unknowns in {U i,j+1 } N 1 i=1 λu 0,j λu N,j+1 U 1,j U N 1,j (1+2λ) λ 0 λ (1+2λ) λ = 0 λ U 1,j+1 U N 1,j+1 0 λ (1+2λ) Teorem 847 Te implicit finite difference sceme is stable for all λ = t/ x 2 (solution remains bounded) Proof For eac j, let U k(j),j be cosen so tat U k(j),j U i,j, i = 1,,N 1 We coose i 0 = k(j +1) in te following relation U i,j+1 = U i,j +λ{u i+1,j+1 2U i,j+1 +U i 1,j+1 }
17 84 PARABOLIC PDE S 17 Ten (1+2λ)U i0,j+1 = U i0,j +λ{u i0 +1,j+1 +U i0 1,j+1} for 1 i N 1 Taking absolute values, (1+2λ) U i0,j+1 U i0,j +λ( U i0 +1,j+1 + U i0 1,j+1 ) U i0,j +2λ U i0,j+1 Tus U i0,j+1 U i0,j U k(j),j and ence U i,j+1 U i0,j+1 U k(j),j for 1 i N 1, and U i,j+1 M = max{f,g,}, for i = 0 or N, by boundary condition Repeat te same procedure until we it te boundary U i,j+1 U k(j),j U k(0),0 M = max(f,g,) Using te matrix formulation: We ceck te eigenvalues of te system AU j+1 = U j +G j Eigenvalue of A satisfies µ +(1 +2λ) 2λ by G-disk teorem From tis, we see µ 1 and ence te eigenvalues of A 1 is less tan one in absolute value Tus U j+1 A 1 (U j +G j ) = = A j 1 U 0 +A j 1 G 0 +A j 2 G 1 + +A 1 G j U j+1 A j 1 U 0 + A A 1 max G j remain bounded Note A does not ave 1 as eigenvalues and all te eigenvalues are positive real Teorem 848 For sufficiently smoot u, we ave u ij U ij = O( 2 +k) as and k 0 (for all λ) Proof Let u ij = u(x i,t j ) be te true solution Ten we ave u i,j+1 u i,j k = 1 2{u i+1,j+1 2u i,j+1 +u i 1,j+1 }+O( 2 +k)
18 18 CHAPTER 8 FINITE DIFFERENCE METHOD Let w i,j = u i,j U i,j be te discretization error Ten w i,j+1 = w i,j +λ{w i+1,j+1 2w i,j+1 +w i 1,j+1 }+O(k 2 +k 2 ) (1+2λ)w i,j+1 = w i,j +λw i+1,j+1 +λw i 1,j+1 +O(k 2 +k 2 ) Let w j = max i w i,j Ten (1+2λ) w i,j+1 w j +2λ w j+1 +O(k 2 +k 2 ) and so (1+2λ) w j+1 w j +2λ w j+1 +O(k 2 +k 2 ) Tus w j+1 w j +C(k 2 +k 2 ) w 0 +C(j +1)k(k + 2 ) w 0 +CT(k+ 2 ) = CT(k+ 2 ) for t = (j +1)k T
Finite Difference Methods Assignments
Finite Difference Metods Assignments Anders Söberg and Aay Saxena, Micael Tuné, and Maria Westermarck Revised: Jarmo Rantakokko June 6, 1999 Teknisk databeandling Assignment 1: A one-dimensional eat equation
More informationChapter 5 FINITE DIFFERENCE METHOD (FDM)
MEE7 Computer Modeling Tecniques in Engineering Capter 5 FINITE DIFFERENCE METHOD (FDM) 5. Introduction to FDM Te finite difference tecniques are based upon approximations wic permit replacing differential
More informationConsider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.
Capter 2 Integrals as sums and derivatives as differences We now switc to te simplest metods for integrating or differentiating a function from its function samples. A careful study of Taylor expansions
More informationNumerical PDE. DYKwak. September 6, 2007
Numerical PDE DYKwak September 6, 2007 ii Contents 1 Finite Difference Method 7 1.1 2nd order linear p.d.e. in two variables................ 7 1.2 Finite difference operator....................... 8 1.2.1
More information1 Upwind scheme for advection equation with variable. 2 Modified equations: numerical dissipation and dispersion
1 Upwind sceme for advection equation wit variable coefficient Consider te equation u t + a(x)u x Applying te upwind sceme, we ave u n 1 = a (un u n 1), a 0 u n 1 = a (un +1 u n ) a < 0. CFL condition
More information1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)
Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of
More informationNumerical Differentiation
Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function
More informationCombining functions: algebraic methods
Combining functions: algebraic metods Functions can be added, subtracted, multiplied, divided, and raised to a power, just like numbers or algebra expressions. If f(x) = x 2 and g(x) = x + 2, clearly f(x)
More information5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems
5 Ordinary Differential Equations: Finite Difference Metods for Boundary Problems Read sections 10.1, 10.2, 10.4 Review questions 10.1 10.4, 10.8 10.9, 10.13 5.1 Introduction In te previous capters we
More information3 Parabolic Differential Equations
3 Parabolic Differential Equations 3.1 Classical solutions We consider existence and uniqueness results for initial-boundary value problems for te linear eat equation in Q := Ω (, T ), were Ω is a bounded
More informationERROR BOUNDS FOR THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BRADLEY J. LUCIER*
EO BOUNDS FO THE METHODS OF GLIMM, GODUNOV AND LEVEQUE BADLEY J. LUCIE* Abstract. Te expected error in L ) attimet for Glimm s sceme wen applied to a scalar conservation law is bounded by + 2 ) ) /2 T
More informationMATH745 Fall MATH745 Fall
MATH745 Fall 5 MATH745 Fall 5 INTRODUCTION WELCOME TO MATH 745 TOPICS IN NUMERICAL ANALYSIS Instructor: Dr Bartosz Protas Department of Matematics & Statistics Email: bprotas@mcmasterca Office HH 36, Ext
More informationAMS 147 Computational Methods and Applications Lecture 09 Copyright by Hongyun Wang, UCSC. Exact value. Effect of round-off error.
Lecture 09 Copyrigt by Hongyun Wang, UCSC Recap: Te total error in numerical differentiation fl( f ( x + fl( f ( x E T ( = f ( x Numerical result from a computer Exact value = e + f x+ Discretization error
More informationDifferentiation in higher dimensions
Capter 2 Differentiation in iger dimensions 2.1 Te Total Derivative Recall tat if f : R R is a 1-variable function, and a R, we say tat f is differentiable at x = a if and only if te ratio f(a+) f(a) tends
More informationTutorial 2. Introduction to numerical schemes
236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes c 2012 Classifying PDEs Looking at the PDE Au xx + 2Bu xy + Cu yy + Du x + Eu y + Fu +.. = 0, and its discriminant, B 2
More informationPhysically Based Modeling: Principles and Practice Implicit Methods for Differential Equations
Pysically Based Modeling: Principles and Practice Implicit Metods for Differential Equations David Baraff Robotics Institute Carnegie Mellon University Please note: Tis document is 997 by David Baraff
More information4.2 - Richardson Extrapolation
. - Ricardson Extrapolation. Small-O Notation: Recall tat te big-o notation used to define te rate of convergence in Section.: Definition Let x n n converge to a number x. Suppose tat n n is a sequence
More informationPoisson Equation in Sobolev Spaces
Poisson Equation in Sobolev Spaces OcMountain Dayligt Time. 6, 011 Today we discuss te Poisson equation in Sobolev spaces. It s existence, uniqueness, and regularity. Weak Solution. u = f in, u = g on
More informationPolynomial Interpolation
Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc
More informationNUMERICAL DIFFERENTIATION
NUMERICAL IFFERENTIATION FIRST ERIVATIVES Te simplest difference formulas are based on using a straigt line to interpolate te given data; tey use two data pints to estimate te derivative. We assume tat
More informationOrder of Accuracy. ũ h u Ch p, (1)
Order of Accuracy 1 Terminology We consider a numerical approximation of an exact value u. Te approximation depends on a small parameter, wic can be for instance te grid size or time step in a numerical
More informationSolutions to the Multivariable Calculus and Linear Algebra problems on the Comprehensive Examination of January 31, 2014
Solutions to te Multivariable Calculus and Linear Algebra problems on te Compreensive Examination of January 3, 24 Tere are 9 problems ( points eac, totaling 9 points) on tis portion of te examination.
More informationDELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Mathematics and Computer Science
DELFT UNIVERSITY OF TECHNOLOGY Faculty of Electrical Engineering, Matematics and Computer Science. ANSWERS OF THE TEST NUMERICAL METHODS FOR DIFFERENTIAL EQUATIONS (WI3097 TU) Tuesday January 9 008, 9:00-:00
More informationConvexity and Smoothness
Capter 4 Convexity and Smootness 4.1 Strict Convexity, Smootness, and Gateaux Differentiablity Definition 4.1.1. Let X be a Banac space wit a norm denoted by. A map f : X \{0} X \{0}, f f x is called a
More informationContinuity and Differentiability of the Trigonometric Functions
[Te basis for te following work will be te definition of te trigonometric functions as ratios of te sides of a triangle inscribed in a circle; in particular, te sine of an angle will be defined to be te
More informationMath Spring 2013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, (1/z) 2 (1/z 1) 2 = lim
Mat 311 - Spring 013 Solutions to Assignment # 3 Completion Date: Wednesday May 15, 013 Question 1. [p 56, #10 (a)] 4z Use te teorem of Sec. 17 to sow tat z (z 1) = 4. We ave z 4z (z 1) = z 0 4 (1/z) (1/z
More informationNUMERICAL DIFFERENTIATION. James T. Smith San Francisco State University. In calculus classes, you compute derivatives algebraically: for example,
NUMERICAL DIFFERENTIATION James T Smit San Francisco State University In calculus classes, you compute derivatives algebraically: for example, f( x) = x + x f ( x) = x x Tis tecnique requires your knowing
More informationNew Streamfunction Approach for Magnetohydrodynamics
New Streamfunction Approac for Magnetoydrodynamics Kab Seo Kang Brooaven National Laboratory, Computational Science Center, Building 63, Room, Upton NY 973, USA. sang@bnl.gov Summary. We apply te finite
More informationRunge-Kutta methods. With orders of Taylor methods yet without derivatives of f (t, y(t))
Runge-Kutta metods Wit orders of Taylor metods yet witout derivatives of f (t, y(t)) First order Taylor expansion in two variables Teorem: Suppose tat f (t, y) and all its partial derivatives are continuous
More information(4.2) -Richardson Extrapolation
(.) -Ricardson Extrapolation. Small-O Notation: Recall tat te big-o notation used to define te rate of convergence in Section.: Suppose tat lim G 0 and lim F L. Te function F is said to converge to L as
More information5.1 introduction problem : Given a function f(x), find a polynomial approximation p n (x).
capter 5 : polynomial approximation and interpolation 5 introduction problem : Given a function f(x), find a polynomial approximation p n (x) Z b Z application : f(x)dx b p n(x)dx, a a one solution : Te
More informationMath 31A Discussion Notes Week 4 October 20 and October 22, 2015
Mat 3A Discussion Notes Week 4 October 20 and October 22, 205 To prepare for te first midterm, we ll spend tis week working eamples resembling te various problems you ve seen so far tis term. In tese notes
More informationAnalytic Functions. Differentiable Functions of a Complex Variable
Analytic Functions Differentiable Functions of a Complex Variable In tis capter, we sall generalize te ideas for polynomials power series of a complex variable we developed in te previous capter to general
More informationA method of Lagrange Galerkin of second order in time. Une méthode de Lagrange Galerkin d ordre deux en temps
A metod of Lagrange Galerkin of second order in time Une métode de Lagrange Galerkin d ordre deux en temps Jocelyn Étienne a a DAMTP, University of Cambridge, Wilberforce Road, Cambridge CB3 0WA, Great-Britain.
More informationPolynomial Interpolation
Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximating a function f(x, wose values at a set of distinct points x, x, x 2,,x n are known, by a polynomial P (x
More informationDedicated to the 70th birthday of Professor Lin Qun
Journal of Computational Matematics, Vol.4, No.3, 6, 4 44. ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS Guang-wei Yuan Xu-deng Hang Laboratory of Computational Pysics,
More informationA SHORT INTRODUCTION TO BANACH LATTICES AND
CHAPTER A SHORT INTRODUCTION TO BANACH LATTICES AND POSITIVE OPERATORS In tis capter we give a brief introduction to Banac lattices and positive operators. Most results of tis capter can be found, e.g.,
More information1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point
MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note
More information1. Questions (a) through (e) refer to the graph of the function f given below. (A) 0 (B) 1 (C) 2 (D) 4 (E) does not exist
Mat 1120 Calculus Test 2. October 18, 2001 Your name Te multiple coice problems count 4 points eac. In te multiple coice section, circle te correct coice (or coices). You must sow your work on te oter
More informationParabolic PDEs: time approximation Implicit Euler
Part IX, Capter 53 Parabolic PDEs: time approximation We are concerned in tis capter wit bot te time and te space approximation of te model problem (52.4). We adopt te metod of line introduced in 52.2.
More informationMath 212-Lecture 9. For a single-variable function z = f(x), the derivative is f (x) = lim h 0
3.4: Partial Derivatives Definition Mat 22-Lecture 9 For a single-variable function z = f(x), te derivative is f (x) = lim 0 f(x+) f(x). For a function z = f(x, y) of two variables, to define te derivatives,
More informationContinuity and Differentiability Worksheet
Continuity and Differentiability Workseet (Be sure tat you can also do te grapical eercises from te tet- Tese were not included below! Typical problems are like problems -3, p. 6; -3, p. 7; 33-34, p. 7;
More informationFunctions of the Complex Variable z
Capter 2 Functions of te Complex Variable z Introduction We wis to examine te notion of a function of z were z is a complex variable. To be sure, a complex variable can be viewed as noting but a pair of
More informationSECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY
(Section 3.2: Derivative Functions and Differentiability) 3.2.1 SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY LEARNING OBJECTIVES Know, understand, and apply te Limit Definition of te Derivative
More informationStability properties of a family of chock capturing methods for hyperbolic conservation laws
Proceedings of te 3rd IASME/WSEAS Int. Conf. on FLUID DYNAMICS & AERODYNAMICS, Corfu, Greece, August 0-, 005 (pp48-5) Stability properties of a family of cock capturing metods for yperbolic conservation
More informationCS522 - Partial Di erential Equations
CS5 - Partial Di erential Equations Tibor Jánosi April 5, 5 Numerical Di erentiation In principle, di erentiation is a simple operation. Indeed, given a function speci ed as a closed-form formula, its
More informationBob Brown Math 251 Calculus 1 Chapter 3, Section 1 Completed 1 CCBC Dundalk
Bob Brown Mat 251 Calculus 1 Capter 3, Section 1 Completed 1 Te Tangent Line Problem Te idea of a tangent line first arises in geometry in te context of a circle. But before we jump into a discussion of
More informationA Finite Element Primer
A Finite Element Primer David J. Silvester Scool of Matematics, University of Mancester d.silvester@mancester.ac.uk. Version.3 updated 4 October Contents A Model Diffusion Problem.................... x.
More information3.4 Worksheet: Proof of the Chain Rule NAME
Mat 1170 3.4 Workseet: Proof of te Cain Rule NAME Te Cain Rule So far we are able to differentiate all types of functions. For example: polynomials, rational, root, and trigonometric functions. We are
More informationHOMEWORK HELP 2 FOR MATH 151
HOMEWORK HELP 2 FOR MATH 151 Here we go; te second round of omework elp. If tere are oters you would like to see, let me know! 2.4, 43 and 44 At wat points are te functions f(x) and g(x) = xf(x)continuous,
More informationA h u h = f h. 4.1 The CoarseGrid SystemandtheResidual Equation
Capter Grid Transfer Remark. Contents of tis capter. Consider a grid wit grid size and te corresponding linear system of equations A u = f. Te summary given in Section 3. leads to te idea tat tere migt
More informationParameter Fitted Scheme for Singularly Perturbed Delay Differential Equations
International Journal of Applied Science and Engineering 2013. 11, 4: 361-373 Parameter Fitted Sceme for Singularly Perturbed Delay Differential Equations Awoke Andargiea* and Y. N. Reddyb a b Department
More informationFunction Composition and Chain Rules
Function Composition and s James K. Peterson Department of Biological Sciences and Department of Matematical Sciences Clemson University Marc 8, 2017 Outline 1 Function Composition and Continuity 2 Function
More information158 Calculus and Structures
58 Calculus and Structures CHAPTER PROPERTIES OF DERIVATIVES AND DIFFERENTIATION BY THE EASY WAY. Calculus and Structures 59 Copyrigt Capter PROPERTIES OF DERIVATIVES. INTRODUCTION In te last capter you
More informationNONNEGATIVITY OF EXACT AND NUMERICAL SOLUTIONS OF SOME CHEMOTACTIC MODELS
NONNEGATIVITY OF EXACT AND NUMERICAL SOLUTIONS OF SOME CHEMOTACTIC MODELS PATRICK DE LEENHEER, JAY GOPALAKRISHNAN, AND ERICA ZUHR Abstract. We investigate nonnegativity of exact and numerical solutions
More informationMANY scientific and engineering problems can be
A Domain Decomposition Metod using Elliptical Arc Artificial Boundary for Exterior Problems Yajun Cen, and Qikui Du Abstract In tis paper, a Diriclet-Neumann alternating metod using elliptical arc artificial
More information, meant to remind us of the definition of f (x) as the limit of difference quotients: = lim
Mat 132 Differentiation Formulas Stewart 2.3 So far, we ave seen ow various real-world problems rate of cange and geometric problems tangent lines lead to derivatives. In tis section, we will see ow to
More informationHow to Find the Derivative of a Function: Calculus 1
Introduction How to Find te Derivative of a Function: Calculus 1 Calculus is not an easy matematics course Te fact tat you ave enrolled in suc a difficult subject indicates tat you are interested in te
More informationConvexity and Smoothness
Capter 4 Convexity and Smootness 4. Strict Convexity, Smootness, and Gateaux Di erentiablity Definition 4... Let X be a Banac space wit a norm denoted by k k. A map f : X \{0}!X \{0}, f 7! f x is called
More information1. Introduction. Consider a semilinear parabolic equation in the form
A POSTERIORI ERROR ESTIMATION FOR PARABOLIC PROBLEMS USING ELLIPTIC RECONSTRUCTIONS. I: BACKWARD-EULER AND CRANK-NICOLSON METHODS NATALIA KOPTEVA AND TORSTEN LINSS Abstract. A semilinear second-order parabolic
More informationA Hybrid Mixed Discontinuous Galerkin Finite Element Method for Convection-Diffusion Problems
A Hybrid Mixed Discontinuous Galerkin Finite Element Metod for Convection-Diffusion Problems Herbert Egger Joacim Scöberl We propose and analyse a new finite element metod for convection diffusion problems
More informationSubdifferentials of convex functions
Subdifferentials of convex functions Jordan Bell jordan.bell@gmail.com Department of Matematics, University of Toronto April 21, 2014 Wenever we speak about a vector space in tis note we mean a vector
More informationFDM for parabolic equations
FDM for parabolic equations Consider the heat equation where Well-posed problem Existence & Uniqueness Mass & Energy decreasing FDM for parabolic equations CNFD Crank-Nicolson + 2 nd order finite difference
More informationClick here to see an animation of the derivative
Differentiation Massoud Malek Derivative Te concept of derivative is at te core of Calculus; It is a very powerful tool for understanding te beavior of matematical functions. It allows us to optimize functions,
More informationThe Laplace equation, cylindrically or spherically symmetric case
Numerisce Metoden II, 7 4, und Übungen, 7 5 Course Notes, Summer Term 7 Some material and exercises Te Laplace equation, cylindrically or sperically symmetric case Electric and gravitational potential,
More informationTHE IMPLICIT FUNCTION THEOREM
THE IMPLICIT FUNCTION THEOREM ALEXANDRU ALEMAN 1. Motivation and statement We want to understand a general situation wic occurs in almost any area wic uses matematics. Suppose we are given number of equations
More informationCopyright c 2008 Kevin Long
Lecture 4 Numerical solution of initial value problems Te metods you ve learned so far ave obtained closed-form solutions to initial value problems. A closedform solution is an explicit algebriac formula
More informationMA455 Manifolds Solutions 1 May 2008
MA455 Manifolds Solutions 1 May 2008 1. (i) Given real numbers a < b, find a diffeomorpism (a, b) R. Solution: For example first map (a, b) to (0, π/2) and ten map (0, π/2) diffeomorpically to R using
More informationDifferential equations. Differential equations
Differential equations A differential equation (DE) describes ow a quantity canges (as a function of time, position, ) d - A ball dropped from a building: t gt () dt d S qx - Uniformly loaded beam: wx
More informationScientific Computing: An Introductory Survey
Scientific Computing: An Introductory Survey Chapter 11 Partial Differential Equations Prof. Michael T. Heath Department of Computer Science University of Illinois at Urbana-Champaign Copyright c 2002.
More informationSolution. Solution. f (x) = (cos x)2 cos(2x) 2 sin(2x) 2 cos x ( sin x) (cos x) 4. f (π/4) = ( 2/2) ( 2/2) ( 2/2) ( 2/2) 4.
December 09, 20 Calculus PracticeTest s Name: (4 points) Find te absolute extrema of f(x) = x 3 0 on te interval [0, 4] Te derivative of f(x) is f (x) = 3x 2, wic is zero only at x = 0 Tus we only need
More informationSection 15.6 Directional Derivatives and the Gradient Vector
Section 15.6 Directional Derivatives and te Gradient Vector Finding rates of cange in different directions Recall tat wen we first started considering derivatives of functions of more tan one variable,
More informationSemigroups of Operators
Lecture 11 Semigroups of Operators In tis Lecture we gater a few notions on one-parameter semigroups of linear operators, confining to te essential tools tat are needed in te sequel. As usual, X is a real
More informationSuperconvergence of energy-conserving discontinuous Galerkin methods for. linear hyperbolic equations. Abstract
Superconvergence of energy-conserving discontinuous Galerkin metods for linear yperbolic equations Yong Liu, Ci-Wang Su and Mengping Zang 3 Abstract In tis paper, we study superconvergence properties of
More information(a) At what number x = a does f have a removable discontinuity? What value f(a) should be assigned to f at x = a in order to make f continuous at a?
Solutions to Test 1 Fall 016 1pt 1. Te grap of a function f(x) is sown at rigt below. Part I. State te value of eac limit. If a limit is infinite, state weter it is or. If a limit does not exist (but is
More informationWe name Functions f (x) or g(x) etc.
Section 2 1B: Function Notation Bot of te equations y 2x +1 and y 3x 2 are functions. It is common to ave two or more functions in terms of x in te same problem. If I ask you wat is te value for y if x
More informationExercises for numerical differentiation. Øyvind Ryan
Exercises for numerical differentiation Øyvind Ryan February 25, 2013 1. Mark eac of te following statements as true or false. a. Wen we use te approximation f (a) (f (a +) f (a))/ on a computer, we can
More informationcalled the homomorphism induced by the inductive limit. One verifies that the diagram
Inductive limits of C -algebras 51 sequences {a n } suc tat a n, and a n 0. If A = A i for all i I, ten A i = C b (I,A) and i I A i = C 0 (I,A). i I 1.10 Inductive limits of C -algebras Definition 1.10.1
More information= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c)
Paper 1: Pure Matematics 1 Mark Sceme 1(a) (i) (ii) d d y 3 1x 4x x M1 A1 d y dx 1.1b 1.1b 36x 48x A1ft 1.1b Substitutes x = into teir dx (3) 3 1 4 Sows d y 0 and states ''ence tere is a stationary point''
More informationIntroduction to Derivatives
Introduction to Derivatives 5-Minute Review: Instantaneous Rates and Tangent Slope Recall te analogy tat we developed earlier First we saw tat te secant slope of te line troug te two points (a, f (a))
More informationIntroduction to numerical schemes
236861 Numerical Geometry of Images Tutorial 2 Introduction to numerical schemes Heat equation The simple parabolic PDE with the initial values u t = K 2 u 2 x u(0, x) = u 0 (x) and some boundary conditions
More informationLECTURE 14 NUMERICAL INTEGRATION. Find
LECTURE 14 NUMERCAL NTEGRATON Find b a fxdx or b a vx ux fx ydy dx Often integration is required. However te form of fx may be suc tat analytical integration would be very difficult or impossible. Use
More informationLIMITS AND DERIVATIVES CONDITIONS FOR THE EXISTENCE OF A LIMIT
LIMITS AND DERIVATIVES Te limit of a function is defined as te value of y tat te curve approaces, as x approaces a particular value. Te limit of f (x) as x approaces a is written as f (x) approaces, as
More informationALGEBRA AND TRIGONOMETRY REVIEW by Dr TEBOU, FIU. A. Fundamental identities Throughout this section, a and b denotes arbitrary real numbers.
ALGEBRA AND TRIGONOMETRY REVIEW by Dr TEBOU, FIU A. Fundamental identities Trougout tis section, a and b denotes arbitrary real numbers. i) Square of a sum: (a+b) =a +ab+b ii) Square of a difference: (a-b)
More informationDerivatives of Exponentials
mat 0 more on derivatives: day 0 Derivatives of Eponentials Recall tat DEFINITION... An eponential function as te form f () =a, were te base is a real number a > 0. Te domain of an eponential function
More informationLecture 21. Numerical differentiation. f ( x+h) f ( x) h h
Lecture Numerical differentiation Introduction We can analytically calculate te derivative of any elementary function, so tere migt seem to be no motivation for calculating derivatives numerically. However
More informationMATH1151 Calculus Test S1 v2a
MATH5 Calculus Test 8 S va January 8, 5 Tese solutions were written and typed up by Brendan Trin Please be etical wit tis resource It is for te use of MatSOC members, so do not repost it on oter forums
More information2.3 Product and Quotient Rules
.3. PRODUCT AND QUOTIENT RULES 75.3 Product and Quotient Rules.3.1 Product rule Suppose tat f and g are two di erentiable functions. Ten ( g (x)) 0 = f 0 (x) g (x) + g 0 (x) See.3.5 on page 77 for a proof.
More informationExam 1 Review Solutions
Exam Review Solutions Please also review te old quizzes, and be sure tat you understand te omework problems. General notes: () Always give an algebraic reason for your answer (graps are not sufficient),
More informationLecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator.
Lecture XVII Abstract We introduce te concept of directional derivative of a scalar function and discuss its relation wit te gradient operator. Directional derivative and gradient Te directional derivative
More informationTest 2 Review. 1. Find the determinant of the matrix below using (a) cofactor expansion and (b) row reduction. A = 3 2 =
Test Review Find te determinant of te matrix below using (a cofactor expansion and (b row reduction Answer: (a det + = (b Observe R R R R R R R R R Ten det B = (((det Hence det Use Cramer s rule to solve:
More informationFall 2014 MAT 375 Numerical Methods. Numerical Differentiation (Chapter 9)
Fall 2014 MAT 375 Numerical Metods (Capter 9) Idea: Definition of te derivative at x Obviuos approximation: f (x) = lim 0 f (x + ) f (x) f (x) f (x + ) f (x) forward-difference formula? ow good is tis
More informationMAT 145. Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points
MAT 15 Test #2 Name Solution Guide Type of Calculator Used TI-89 Titanium 100 points Score 100 possible points Use te grap of a function sown ere as you respond to questions 1 to 8. 1. lim f (x) 0 2. lim
More information4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.
Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra
More information2.8 The Derivative as a Function
.8 Te Derivative as a Function Typically, we can find te derivative of a function f at many points of its domain: Definition. Suppose tat f is a function wic is differentiable at every point of an open
More informationMAT 1339-S14 Class 2
MAT 1339-S14 Class 2 July 07, 2014 Contents 1 Rate of Cange 1 1.5 Introduction to Derivatives....................... 1 2 Derivatives 5 2.1 Derivative of Polynomial function.................... 5 2.2 Te
More informationMATH 155A FALL 13 PRACTICE MIDTERM 1 SOLUTIONS. needs to be non-zero, thus x 1. Also 1 +
MATH 55A FALL 3 PRACTICE MIDTERM SOLUTIONS Question Find te domain of te following functions (a) f(x) = x3 5 x +x 6 (b) g(x) = x+ + x+ (c) f(x) = 5 x + x 0 (a) We need x + x 6 = (x + 3)(x ) 0 Hence Dom(f)
More informationA = h w (1) Error Analysis Physics 141
Introduction In all brances of pysical science and engineering one deals constantly wit numbers wic results more or less directly from experimental observations. Experimental observations always ave inaccuracies.
More informationMass Lumping for Constant Density Acoustics
Lumping 1 Mass Lumping for Constant Density Acoustics William W. Symes ABSTRACT Mass lumping provides an avenue for efficient time-stepping of time-dependent problems wit conforming finite element spatial
More informationLecture 10: Carnot theorem
ecture 0: Carnot teorem Feb 7, 005 Equivalence of Kelvin and Clausius formulations ast time we learned tat te Second aw can be formulated in two ways. e Kelvin formulation: No process is possible wose
More information