Key words. Finite element method; convection-diffusion-reaction; nonnegativity; boundedness
|
|
- Horatio Townsend
- 5 years ago
- Views:
Transcription
1 PRESERVING NONNEGATIVITY OF AN AFFINE FINITE ELEMENT APPROXIMATION FOR A CONVECTION-DIFFUSION-REACTION PROBLEM JAVIER RUIZ-RAMÍREZ Abstract. An affine finite element sceme approximation of a time dependent linear convectiondiffusion-reaction problem in D and 3D is presented. Specific conditions are given in terms of te coefficient functions, te computational grid and te discretization parameters to ensure tat te nonnegativity property of te true solution is also satisfied by its approximation. Numerical examples are given wic confirm te necessity and sufficiency of te discretization conditions to ensure te nonnegativity of te approximation. Key words. Finite element metod; convection-diffusion-reaction; nonnegativity; boundedness AMS subject classifications. 65L6. Introduction. In tis paper we consider te finite element approximation of te linear convection-diffusion-reaction problem: Determine u(x, t) satisfying u(x, t) t a(x, t) u(x, t) + b(x, t) u(x, t) + g(x, t)u(x, t) = f(x, t), (x, t) (, T ], (.) u(x, t) =, (x, t) (, T ], (.) u(x, ) = u (x), x. (.3) Suc equations arise in modeling many pysical penomena. Often te unknown quantity u in (.)-(.3) represents a nonnegative pysical quantity. In suc cases, it is igly desirable tat te numerical approximation to u also be nonnegative. Herein we derive sufficient conditions on te discretization parameters wic guarantee te approximation of a nonnegative solution of (.) is also nonnegative. Our interest in tis problem is motivated by te finite element approximation of te generalized (nonlinear) Burgers-Huxley equation [4], a model tat arises in several fields. For example, in electrodynamics, te Burgers-Huxley equation describes te motion of te domain wall of a ferroelectric material in an electric field [9], in biology it is used to model te nerve pulse propagation in nerve fibers [7], and it is also used as a prototype model in te study of interactions between diffusion transport, convection and reaction []. For te system of equations (.)-(.3) we assume R d, d =, 3, is a bounded domain, < a min a(x, t) a max, b(x, t) L ((, T ], H ()), g(x, t),f(x, t) L ((, T ], L ()) and u (x). It is straigt forward to sow tat under te additional assumption tat εg + f > in [, T ] for ε (, ε ), te solution u(x, t) is nonnegative [5]. Hence, it is important for pysical relevance, tat under suc conditions te numerical approximation also sould be nonnegative on. Over te years tere as been considerable work done on numerical approximation scemes for elliptic and parabolic differential equations tat inerit a maximum principle satisfied by te continuous equation being approximated. Here we refer to Department of Matematical Sciences, Clemson University, Clemson, SC 9634, USA. (javier@clemson.edu)
2 an equation as satisfying a maximum principle if te maximum of te solution (approximation) can be bounded by a constant multiple of te maximum of te initial data, te boundary data, or te rigt and side function. In suc cases te nonnegativity of te solution (approximation) typically follows from te nonnegativity of te data. Te equivalence of aving te (discrete) nonnegative property and a (discrete) maximum principle as been studied in [7]. Under tese assumptions (.)-(.3) does not satisfy a maximum principle. Following we give a brief summary of recent work on discrete maximum principles for te approximation of elliptic and parabolic differential equations. A detailed description of te development in tis area is given in [3, 9]. Farago, Horvat, Korotov and collaborators ave made significant contributions to te development of finite element approximation scemes for parabolic problems tat inerit a maximum principle from te continuous problem. In [8] tey establised sufficient conditions for te θ-metod time discretization of te linear finite element approximation to te time dependent diffusion-reaction problem to satisfy a discrete maximum principle. Discrete maximum principles for a nonlinear parabolic equation and a nonlinear system of equations were analyzed in [9] and [], respectively. Scatz, Tomée, and Walbin in [5] used a semi-group approac to investigate te positivity and maximum-norm contractivity in time stepping metods for parabolic equations. A discontinuous Galerkin metod, satisfying a strict maximum principle, was introduced by Zang, Zang, and Su in [8] for a nonlinear convection-diffusion equation. For te case of an anisotropic diffusion-convection-reaction problem, Lu, Huang and Qiu in [3] derived a sufficient condition suc tat te linear finite element approximation satisfied a discrete maximum principle. In [5], for a coupled system of nonlinear parabolic equations in R, De Leeneer, Gopalakrisnan and Zur proposed and analyzed a linear finite element approximation using a backward Euler time discretization. Tey establised sufficient conditions suc tat te numerical approximation to teir coupled system inerited te nonnegativity property of te continuous solution. In te next section we introduce our numerical approximation sceme and derive te sufficient conditions tat guarantee te nonnegativity of te approximations. In section 3 we develop te error analysis wic sows tat our metod is first order bot, in time and space. Te fourt section illustrates te validity of our results troug some numerical simulations. In particular, we include an example were one of our conditions is not met and te corresponding numerical approximation exibits negative values. Te concluding remarks are presented in section 5.. Nonnegativity of te approximation. In tis section we derive sufficiency conditions to guarantee tat te approximation of a time dependent convectiondiffusion-reaction equation remains nonnegative... Notation. Let T denote a regular triangulation of wit mes parameter. For Sobolev spaces we use te usual L p () and H p () notation []. Let P (T ) denote te set of affine functions on T. To describe te weak formulation of te problem we use X = H () = { f H () : f = }, and X = { f C () : f T P (T ), T T, f = }.
3 For f, g scalar functions, and f, g vector functions, (f, g) := fg d, and (f, g) := f g d. Te L () and L () norms will be denoted by and, respectively. Te vector norms corresponding to l and l will be denoted likewise. We will also use te following norm for q L ((, T ], L ()) q, = sup q(t). t (,T ] For te temporal discretization, we partition te interval [, T ] into M equally spaced subintervals of widt, wit t k = k, k =,..., M, and q k := q(x, t k )... Numerical approximation. Multiplying (.) troug by v X and rearranging we obtain te weak formulation of (.)-(.) as: Find u(x, t) X, t (, T ] suc tat for all v X subject to ( u, v) + (a(x, t) u, v) + (b(x, t) u, v) + (g(x, t)u, v) = (f, v), (.) t u(x, ) = u (x), x. (.) Using te backward Euler temporal discretization we obtain a fully discrete approximation to (.)-(.3) as: Determine u k (x) X, k =,,..., M, suc tat for all v X (uk, v) + (a k u k, v) + (b k u k, v) + (g k u, v) = (uk, v) + (f k, v), (.3) subject to u (x i ) = u (x i ), i =,..., N, (.4) were x i, i =,..., N denotes te vertices in te triangulation T. Let φ j (x) X be defined by {, x = xj φ j (x) =., x x j Ten {φ j (x)} N j= forms a Lagrangian basis for X. Wit u k (x) = N j= c jφ j (x), and v = φ i, i =,..., N, equation (.3) becomes a N N linear system of equations Ac = r (.5) were A ij = φ j φ i d + a k φ j φ i d + b k φ j φ i d + g k φ j φ i d, and (.6) r i = u k φ i d + f k φ i d. (.7) 3
4 For u k (x) and f(x, t k ), for all x, a sufficient condition to guarantee te nonnegativity of c, and ence of u k (x), is tat te matrix A represents an M-matrix, i.e. A ij, j i (nonpositive off diagonal entries), (.8) N A ij > (diagonally dominant). (.9) j= Properties (.8)-(.9) guarantee tat A exist wit A ij, i, j =,..., N, i.e., all te entries in A are nonnegative []. In order to establis properties (.8)-(.9) we must consider te computation of eac of te entries A ij of A..3. Computation of A ij..3.. D setting. In Finite Element Metod (FEM) computations, integration over is performed by first writing as te sum of te triangles T T, and ten performing te integration over eac T. Te integration over T is done by introducing a cange of variables ξ = (ξ, η) wic transforms te integral over T to an integral over te reference triangle : [ x y ] = J(ξ) = [ (x x ) (x 3 x ) (y y ) (y 3 y ) ] [ ξ η ] [ x + y ] = Jξ + x. (.) For notational simplicity, we let J = det(j) = (x x )(y 3 y ) (x 3 x )(y y ), and J t denote te inverse of te transpose of J. We consider a triangulation T of suc tat for every triangle T not adjacent to, tere are positive constants c, C, c θ, c J and C J under wic te following conditions are satisfied: A. For e i te edge opposite to te i-t vertex, c l(e i ) C, were l denotes te lengt. A. Te angle ϕ subtended at any vertex satisfies < c θ cos ϕ <. A3. c J J C J. We note tat A can be relaxed by requiring only tat te sum of te angles oposite to te common edge sared by two triangles be less tan π [6]. On we ave φ (ξ, η) = ξ η, φ (ξ, η) = ξ, φ3 (ξ, η) = η. (.) Note also for (x, y) T (equivalent to (ξ, η) ): (x,y) φ j (x, y) = J t (ξ,η) φj (ξ, η), j =,, 3 (.) φ j (ξ, η) = φ j (x, y) =, and φ j = J t (ξ,η) φj =. (.3) j= j= To establis tat A in (.6) is an M-matrix, we carefully consider its construction. In view of (.) and Figure., wit i = n, te n -t row of te coefficient matrix is obtained by mapping eac triangle T, wic as n as a vertex, to te reference triangle, and tere evaluating te integrals. Let A T n,n j denote te same computations as in (.6) wit te region of integration being T instead of. In tis setting, te diagonal contribution to te n -t row is A T n,n and te contributions to te 4 j= j=
5 φ = ξ η, φ = [ ] t φ = ξ, φ = [ ] t φ 3 = η, φ 3 = [ ] t (x 3,y 3 ) n 3 F y T η (,) n (x,y ) n (x,y ) ˆT (,) ξ x Fig... Transformation of te reference triangle to te triangle T. off-diagonal terms are A T n,n and A T n,n 3. Tus, to establis tat A is an M-matrix, it is sufficient to sow tat (see (.8) and (.9)) A T n,j, j = n, n 3 and (.4) A T n,n + A T n,n + A T n,n 3 >. (.5) In order to facilitate te analysis, we introduce te following quantities wic arise in A T n,n j a,j = φ j φ J dξ, (.6) a,j = â k (ξ) J t (ξ,η) φj J t (ξ,η) φ J dξ, (.7) 3 a,j = b(ξ) k J t (ξ,η) φj φ J dξ, (.8) 4 a,j = ĝ k (ξ) φ j φ J dξ, (.9) were f(ξ) = f(j (ξ)). Lemma.. For all T T a,j a min C J c c θ for j =, 3 (.) 5
6 Proof. Let a T = We first consider a,. Using (.) and Figure. we ave Consequently, â k (ξ) dξ a min. (.) J t (ξ,η) φ = J [(y 3 y ) (x x 3 )] t, J t (ξ,η) φ = J [(y y 3 ) (x 3 x )] t. a, = at ((x x 3 ) (x x 3 ) + (y y 3 ) (y y 3 )) J In a similar fasion we obtain (.) a,3 = at ((x x ) (x 3 x ) + (y y ) (y 3 y )). (.3) J In order to see tat a, and a,3 are negative and strictly bounded away from zero, we consider te polynomials in its numerator. Let P i denote te point (x i, y i ) and P i P j te vector from P i to P j. For a, we ave [ ] [ ] x x (x x 3 ) (x x 3 ) + (y y 3 ) (y y 3 ) = 3 x x 3 y y 3 y y 3 = P 3 P P 3 P = P 3 P P 3 P cos θ c c θ >, (.4) were in te last inequality we ave used A and A. Applying A3, te result now follows from (.), (.), (.3) and (.4). Lemma.. For T T, and j =, 3, Proof. As, for j =, 3, a,j C J 4, (.5) 3 a,j b k 6 C, (.6) 4 a,j C J g k. (.7) 4 φ φj dξ = 4, using A3 we establis (.5). From (.8), using A and 3 a b k (ξ) J t (ξ,η) φ φ J dξ = b k P 3 P φ dξ b k 6 C. 6 φ dξ = /6, [ b k y3 y (ξ) x x 3 ] φ dξ
7 Te bound for 3 a T 3 is obtained analogously. In a similar manner as was used to establis (.5), we obtain (.7). Teorem.3. For < C J 4 ( ) a min c C c θ b k J 6 C g k 4 C J te coefficient matrix A is an M-matrix. Proof. First note tat (.4) is equivalent to sowing tat 4 r a T,j <, j =, 3. r= Using Lemmas. and. we obtain 4 r= r a T,j a min c C c θ + C J J 4 Tus, for sufficiently small and C J g k b k C + g k 4 C J, j =, 3. (.8) ( ) a min c C c θ b k J 6 C g k 4 C J, we can guarantee tat te off-diagonal entries of A are nonpositive. 3 To sow (.5), observe tat from φ j = (see (.3)), it follows tat 3 j= T a k φ j φ i dx =, and 3 j= A T n,n j = j= 3 j= T b k φ j φ i dx =. Hence, for < g k, φ J dξ dη + ĝ k (ξ) φ J dξ dη >. (.9) We close tis subsection wit te following corollary. Corollary.4. For and satisfying Teorem.3, and for f k, u k, we ave tat u k. Proof. From (.5), noting tat r is nonnegative and A an M-matrix, te stated result follows D setting. Following te same structure as in te D case, we consider a triangulation T of suc tat for every tetraedron T not adjacent to, tere are positive constants c, C, c θ, c J and C J satisfying: A4. For e i te edges of te tetraedron, c l(e i ) C. A5. Te angle subtended between any two distinct faces F i and F j, denoted F i F j, satisfies < c θ cos( F i F j ) <. A6. c J 3 J C J 3. 7
8 φ = ξ η ζ, φ = [ ] t φ = ξ, φ = [ ] t φ 3 = η, φ 3 = [ ] t φ 4 = ζ, φ 4 = [ ] t P 3 (x 3,y 3,z 3 ) ζ (x 4,y 4,z 4 ) P 4 P (x,y,z ) F T ˆT η P (x,y,z ) ξ Fig... Transformation of te reference tetraedron to te tetraedron T. Te corresponding cange of variables ξ = (ξ, η, ζ) to compute te integrals on te reference tetraedron is: x y = (x x ) (x 3 x ) (x 4 x ) (y y ) (y 3 y ) (y 4 y ) ξ η + x y = Jξ + x (.3) z (z z ) (z 3 z ) (z 4 z ) ζ z 3 wit sape functions ˆφ = ξ η ζ ˆφ = ξ ˆφ3 = η ˆφ4 = ζ (.3) Keeping te same notation, we state parallel results to tose from te D setting. Lemma.5. For T T, a,j a min 3C J c 4 c θ for j =, 3, 4. (.3) Proof. Let a T = â(ξ) dξ a min 6. (.33) Note tat, from (.7) a T,j = â k (ξ)j t (ξ,η) φj J t (ξ,η) φ J dξ, 8
9 and note tat te matrix vector products J t (ξ,η) φj can be written as cross products between te vectors representing te edges of te tetraedron P k P l. For example, J t (ξ,η) φ = y z 3 y 3 z y z 4 + y 4 z + y 3 z 4 y 4 z 3 x 3 z x z 3 + x z 4 x 4 z x 3 z 4 + x 4 z 3 x y 3 x 3 y x y 4 + x 4 y + x 3 y 4 x 4 y 3 J t (ξ,η) φ = = P P 3 P P 4 y 3 z y z 3 + y z 4 y 4 z y 3 z 4 + y 4 z 3 x z 3 x 3 z x z 4 + x 4 z + x 3 z 4 x 4 z 3 x 3 y x y 3 + x y 4 x 4 y x 3 y 4 + x 4 y 3 = P 4 P 3 P 4 P. Moreover, we relate tose products to te area of te faces, F i, and te angle between tem, F i F j, using te geometrical interpretations of te cross and dot product, respectively. Tus, applying A4 -A6 we get a = a T J P P 3 P P 4 P 4 P 3 P 4 P = 4aT Area(F )Area(F ) cos ( F F ) J a min 3C J c 4 c θ. Similarly, we obtain te same bound for a 3 and a 4. Lemma.6. For T T and j =, 3, 4, a,j C J 3, 3 a,j b k 6 4 C, 4 a,j C J 3 g k. Proof. Te proof follows in an analogous manner as tat for Lemma.. Teorem.7. For sufficiently small and C J ( ) a min 6 c 4 6C c θ b k J 4 C C J g k < < g k te coefficient matrix A in (.6) is an M-matrix. Proof. Te proof is analogous to tat of Teoem.3. Corollary.8. For and satisfying Teorem.7, and for f k, u k, we ave tat u k. Proof. Te proof is analogous to tat of Corollary Boundedness of te approximation. In tis section we sow tat te numerical approximation u k obtained using (.5) remains bounded as te discretization parameters, and go to zero. 9
10 Teorem.9. For and satisfying te conditions of Teorem.3 (or Teorem.7), te discrete approximations u k remain bounded as,. Proof. Let c g = g, and let c be a vector wit nonnegative entries suc tat c = c l for some l. Observe tat for A te coefficient matrix in (.5) N N N (Ac) l = A lj c j = A ll c l + A lj c j (A ll + A lj )c l = c l j= j= j l Now recall from te discussion in Teorem.3 tat te contribution of eac triangle T in te support of φ l to N j= A lj is, (see (.9)) φ J dξ dη + j= j l N j= A lj. ĝ k (ξ) φ J dξ dη = φ l dt + g k φ l dt T T φ l ( c g) dt. Summing over all triangles T T, we obtain te following bound c l φ l ( c g) d c l N j= T A lj (Ac) l. (.34) Noting tat te l-t row of te system of equations (.7) resulting from our numerical sceme at time t k is (Ac k ) l = u k φ l dx + f k φ l dx, (.35) and using (.34) wit c = u k = c l, we obtain ( ) c g u k φ i dx u k φ l dx + Simplifying and solving for u k yields ( ) c g u k uk + f k, u k = c u k + g c g u k + c g f k f k φ l dx. c g f k. (.36) Wit k replaced by k in (.36) we obtain an expression for u k. Tus, ( ) ( u k u k + c g ( ) + f k. c g c g ) f k
11 Continuing, leads to te following expression ( ) k u k u c + g k ( i= c g ) k+ i f i. (.37) Now as M = T, and using te fact tat for any two positive numbers p and w, wit p < we ave tat lim M Also, observe tat Tus, ( c g ( )w p ( ) pw exp, p ) M ( ) lim exp cg M = exp (c g T ). (.38) M c g ( ) M k ( ) ( ) cg (M k) cg (T k) exp = exp. c g c g c g lim M k= M ( ) M+ k T f k e (T s)c g f(s) ds. (.39) c g Owing to (.38) and (.39), we obtain te bound T u k exp(c g T ) u + e (T s)cg f(s) ds. (.4) 3. Error analysis. In tis section we establis tat te numerical approximation is of first order, bot in space and time. Te following discrete norm ( M / v s = v k H ()) s, (3.) k= and te discrete version of Gronwall s lemma [] will be used in te analysis. Lemma 3.. Let, H, and a n, b n, c n, γ n (for integers n ), be nonnegative numbers suc tat a l + b n n= γ n a n + n= c n + H for l n= Suppose tat γ n <, for all n, and set σ n = ( γ n ). Ten a l + ( b n exp n= ) σ n γ n ( n= ) c n + H n= for l.
12 We will also use te following inequality, wic for completeness, we supply its simple proof. Lemma 3.. For u, u t, u tt in L ((, T ], L ()) Proof. From we obtain Now observe tat ( tk u k t uk u k 3 tk tk u k = u k u k t + u tt (t t k ) dt, t k u k t uk u k t k u tt (t t k ) dt = ) tk t k u tt dt. (3.) t k u tt (t t k ) dt. tk t k u tt dt tk t k (t t k ) dt Te inequality (3.) now follows. = ()3 3 tk t k u tt. Teorem 3.3. Let u(x, t) L ((, T ], H ()), u t (x, t) L ((, T ], H ()), u tt (x, t) L ((, T ], L ()), satisfy (.)-(.3) on te interval (, T ]. Ten, te finite element approximation u k converges to u as,. In addition, tere exists a constant C = C(), suc tat te approximation u k satisfies te following error estimate: ( ( ) ) T 5 + c g + b, u k u k exp ( ) 5 + c g + b, { ( ) a C max + 9 b, u a min + () 3 T ( u tt dt + C 4 T u t H () dt + c g u ) } + C 4 u k H (), k =,,..., M. (3.3) Proof. At t = t k, te weak formulation (.) becomes ( uk t, v) + (ak u k, v) + (b k u k, v) + (u k g k, v) = (f k, v), (3.4) and its fully discrete approximation is given by ( uk uk, v) + (a k u k, v) + (b k u k, v) + (u k g k, v) = (f k, v). (3.5)
13 Subtracting (3.5) from (3.4) we obtain ( uk t uk uk, v) + (a k (u k u k ), v) + (b k (u k u k ), v) (3.6) + ((u k u k )g k, v) =. Defining e k = u k u k and substituting in (3.6), we get ( uk t uk u k + ek e k, v) + (a k e k, v) + (b k e k, v) + (e k g k, v) =. (3.7) For U k X, let e k = Λ k + E k were Λ k = u k U k and E k = U k u k. Ten (3.7) becomes ( uk t uk u k, v) + ( Λk Λ k + E k E k, v) + ( (Λ k + E k ), a k v) +(b k (Λ k + E k ), v) + ((Λ k + E k )g k, v) =. Coosing v = E k, and multiplying by, from (3.8) we obtain (3.8) ( uk t uk u k, E k ) + (Λ k Λ k + E k E k, E k ) +( (Λ k + E k ), a k E k ) + (b k (Λ k + E k ), E k ) + ((Λ k + E k )g k, E k ) =, or, equivalently (E k E k, E k ) + ( E k, a k E k ) = ( uk t uk u k, E k ) (Λ k Λ k, E k ) (a k Λ k, E k ) (b k Λ k, E k ) (b k E k, E k ) (Λ k g k, E k ) (E k g k, E k ). Using Young s inequality and Caucy-Scwarz yields ( Ek E k ) + a min E k ( uk t uk u k + E k ) + 4 Λk Λ k + E k + ( a max Λ k + a min a min Ek ) + ( bk Λ k + E k ) + bk E k + (c g Λ k + E k ) + c g E k. (3.9) Summing (3.9) from k = up to k = l, regrouping and using (3.), we get ( E k E k ) + a min k= + ( 5 + c g + b k ) l E k + k= 3 k= k= E k () 3 k= tk t k u tt dt ( Λ k Λk + a max Λ k a min + b k Λ k + c g Λ k ). (3.)
14 Note tat (Λ k Λ k ) = ( tk t k Λ t dt ) tk (Λ t ) dt, t k implies Simplifying (3.) we obtain Λk Λ k tk Λ t dt. t k E l + a min + + () 3 E k ( 5 + c g + b k ) l E k n= ( a max Λ k + b k Λ k + c a g Λ k min k= T u tt. In view of Lemma 3., (3.) implies E l + a min K { + k= T E k k= k= ) + T ( a max a min Λ k + b k Λ k + c g Λ k Λ t dt + () 3 T u tt dt }, Λ t ) (3.) (3.) were ( ) T (5 + cg + b, ) K = exp (5 + c g + b, ) and te product l tat appears in te exponential as been replaced by T. From te teory of finite element interpolation [3, 4], we ave tat for I te interpolant of te exact solution u in te space of piecewise linear continuous polynomials, and Λ k = u k I u k, tere exist a constant C suc tat Observing tat in R d for d =, 3, and using (3.3) in (3.) we obtain Λ k + Λ k C u k H (). (3.3) b k Λ k 3 b, Λ k, a max Λ k + b k Λ k + c a g Λ k min ( ) a C max + 3 b, u k H a () + C c g 4 u k H (), min (3.4) 4
15 and T Λ t dt C 4 T u t H () dt. (3.5) Using (3.), (3.4) and (3.5) to simplify (3.) yields { ( ) a E l + a min E K C max + 3 b, u a min ( T ) } + () u tt + C 4 T u t H 3 () + c g u. Finally, noting tat we obtain (3.3). 4. Numerical simulations. u l u l E l + Λ l, Example. As a first example, we let = (, ) (, ) and consider te linear partial differential equation (PDE) [ ] u sin(x) t u + u u = f(x, t), (x, t) (, ]. (4.) cos(y) For, u(x, y, t) = ( + sin( π xy))et, (4.) we approximate (4.) wit te sceme (.3)-(.4), using =. and =.5. Note tat te true solution is nonnegative and tat and satisfy te conditions of Corollary.4. Computations were performed using two meses, illustrated in te bottom frame of Figure 4.. Note tat te mes on te rigt and side violates condition A. Te top frame of Figure 4. sows te computed approximation (on te respective meses) at t =. Presented in te middle frame of Figure 4. is te time evolution of te minimum value of te approximation over as a function of time. Observe tat te nonnegativity of te approximation is lost using te mes wic violates A. Example. For a second example, we consider te nonlinear PDE tat motivated tis work, te generalized Burgers-Huxley equation, for = ( 4, 8) ( 4, 8) were u t u + αup (u x + u y ) ug(u) =, (x, t) (, ], (4.3) g(u) = ( u p )(u p γ) for γ (, ). We use for te boundary data a traveling wave solution [6] of (4.3) given by u(x, t) = ( γ + γ tan (a (z a t))) /p, 5
16 5 5 u(x, ) 5 u(x, ) x.5 y.5.5 x.5 y.5 x minu(x,t) minu(x,t) t t y y x.5.5 x Fig. 4.. Comparison between te numerical approximation to u(x, t) at time t =, and te evolution troug time of te minimum of te approximation using a mes satisfying (.3.) (left column) v.s. a not conforming mes (rigt column). Note tat te mes on te rigt violates te angle condition A. were α = α, z = (x + y)/, a = αp + p α + 4( + p) γ, 4( + p) a = ( + p γ) α + 4( + p) + α( + p + γ). ( + p) 6
17 We approximate (4.3) using a simple sceme in wic all nonlinearities ave been lagged, wit pysical parameters α =, γ =.5, p = and computational parameters =.9375, =., wic satisfy te conditions of Corollary.4. Tis corresponds [ to] te approximation sceme (.3) wit a k = a(x, t k ) =, b k = b(x, t k ) = u k, g k = g(x, t k ) = ( u k )(u k.5). Figure 4. sows te numerical approximation at time t = and te evolution of its minimum troug time. We observe tat te nonnegativity property olds as expected. x 6. u(x, ) y 5 5 x 5 minu(x,t) t Fig. 4.. Approximation to u(x, t) for t = (left). Evolution of te minimum of te approximation for t [, ]. 5. Conclusion. In tis work, we considered a finite element sceme for a linear convection-diffusion-reaction problem in D and 3D. It was establised tat for a carefully constructed mes, assuming some boundedness conditions on te functions involved in te partial differential equation, and imposing certain restrictions on te computational parameters and, we can guarantee tat te coefficient matrix arising from te discretization is an M-matrix. As a consequence of tis, we sowed tat under nonnegative boundary and initial conditions, te numerical approximations remain nonnegative for all time. Moreover, we proved tat using te stated restrictions for and, te discrete approximations remain bounded as,. Convergence of te numerical approximations was establised in te error analysis, and terein it is sown tat te metod is O( + ). Our numerical results corroborate our findings and illustrate by means of an example ow te violation of one of te assumptions on te mes can lead to negative numerical approximations for nonnegative problems. REFERENCES [] M. Ablowitz and B. Fucssteiner. Topics in soliton teory and exactly solvable nonlinear equations. World Scientific Publising Co., Singapore, 987. [] R.A. Adams and J.F. Fournier. Sobolev Spaces, volume 4 of Pure and Applied Matematics. Elsevier, 3. [3] D. Braess. Finite Elements. Cambridge University Press, tird edition, 7. Cambridge Books Online. [4] P.G. Ciarlet. Finite Element Metod for Elliptic Problems. Society for Industrial and Applied Matematics, Piladelpia, PA, USA,. [5] P. De Leeneer, J. Gopalakrisnan, and E. Zur. Nonnegativity of exact and numerical solutions of some cemotactic models. Comput. Mat. Appl., 66(3): , 3. 7
18 [6] X. Deng. Travelling wave solutions for te generalized Burgers-Huxley equation. Applied Matematics & Computation, 4(): , 8. Special Issue on New Approaces in Dynamic Optimization to Assessment of Economic and Environmental Systems. [7] I. Faragó and R. Horvát. Discrete maximum principle and adequate discretizations of linear parabolic problems. SIAM J. Sci. Comput., 8(6):33 336, 6. [8] I. Faragó, R. Horvát, and S. Korotov. Discrete maximum principles for FE solutions of nonstationary diffusion-reaction problems wit mixed boundary conditions. Numer. Metods Partial Differential Equations, 7(3):7 7,. [9] I. Faragó, J. Karátson, and S. Korotov. Discrete maximum principles for te FEM solution of some nonlinear parabolic problems. Electron. Trans. Numer. Anal., 36:49 67, 9. [] I. Faragó, J. Karátson, and S. Korotov. Discrete maximum principles for nonlinear parabolic PDE systems. IMA J. Numer. Anal., 3(4):54 573,. [] T. Fujimoto and R.R. Ranade. Two caracterizations of inverse-positive matrices: te Hawkins- Simon condition and te Le Catelier-Braun principle. Electron. J. Linear Algebra, :59 65, 4. [] J.G. Heywood and R. Rannacer. Finite-element approximation of te nonstationary Navier- Stokes problem. IV. Error analysis for second-order time discretization. SIAM J. Numer. Anal., 7(): , 99. [3] C. Lu, W. Huang, and J. Qiu. Maximum principle in linear finite element approximations of anistropic diffusion-convection-reaction problems. Numer. Mat., 8(6): (electronic), 3. [4] J.E. Macías-Díaz, J. Ruiz-Ramírez, and J. Villa. Te numerical solution of a generalized Burgers-Huxley equation troug a conditionally bounded and symmetry-preserving metod. Comput. Mat. Appl., 6(): , June. [5] A.H. Scatz, V. Tomée, and L.B. Walbin. On positivity and maximum-norm contractivity in time stepping metods for parabolic equations. Comput. Metods Appl. Mat., (4):4 443,. [6] V. Tomée. Galerkin Finite Element Metods for Parabolic Problems (Springer Series in Computational Matematics). Springer-Verlag New York, Inc., Secaucus, NJ, USA, 6. [7] X.Y. Wang, Z.S. Zu, and Y.K. Lu. Solitary wave solutions of te generalised Burgers-Huxley equation. J. Pys. A, 3(3):7 74, 99. [8] Y. Zang, X. Zang, and C.W. Su. Maximum-principle-satisfying second order discontinuous Galerkin scemes for convection-diffusion equations on triangular meses. J. Comput. Pys., 34:95 36, 3. [9] S. Zou and X. Ceng. A linearly semi-implicit compact sceme for te Burgers-Huxley equation. International Journal of Computer Matematics, 88(4):795 84,. 8
1. Introduction. We consider the model problem: seeking an unknown function u satisfying
A DISCONTINUOUS LEAST-SQUARES FINITE ELEMENT METHOD FOR SECOND ORDER ELLIPTIC EQUATIONS XIU YE AND SHANGYOU ZHANG Abstract In tis paper, a discontinuous least-squares (DLS) finite element metod is introduced
More informationNumerical Experiments Using MATLAB: Superconvergence of Nonconforming Finite Element Approximation for Second-Order Elliptic Problems
Applied Matematics, 06, 7, 74-8 ttp://wwwscirporg/journal/am ISSN Online: 5-7393 ISSN Print: 5-7385 Numerical Experiments Using MATLAB: Superconvergence of Nonconforming Finite Element Approximation for
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 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 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 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 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 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 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 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 informationarxiv: v1 [math.na] 12 Mar 2018
ON PRESSURE ESTIMATES FOR THE NAVIER-STOKES EQUATIONS J A FIORDILINO arxiv:180304366v1 [matna 12 Mar 2018 Abstract Tis paper presents a simple, general tecnique to prove finite element metod (FEM) pressure
More informationOSCILLATION OF SOLUTIONS TO NON-LINEAR DIFFERENCE EQUATIONS WITH SEVERAL ADVANCED ARGUMENTS. Sandra Pinelas and Julio G. Dix
Opuscula Mat. 37, no. 6 (2017), 887 898 ttp://dx.doi.org/10.7494/opmat.2017.37.6.887 Opuscula Matematica OSCILLATION OF SOLUTIONS TO NON-LINEAR DIFFERENCE EQUATIONS WITH SEVERAL ADVANCED ARGUMENTS Sandra
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 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 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 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 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 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 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 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 informationOverlapping domain decomposition methods for elliptic quasi-variational inequalities related to impulse control problem with mixed boundary conditions
Proc. Indian Acad. Sci. (Mat. Sci.) Vol. 121, No. 4, November 2011, pp. 481 493. c Indian Academy of Sciences Overlapping domain decomposition metods for elliptic quasi-variational inequalities related
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 informationarxiv: v1 [math.na] 28 Apr 2017
THE SCOTT-VOGELIUS FINITE ELEMENTS REVISITED JOHNNY GUZMÁN AND L RIDGWAY SCOTT arxiv:170500020v1 [matna] 28 Apr 2017 Abstract We prove tat te Scott-Vogelius finite elements are inf-sup stable on sape-regular
More informationA New Class of Zienkiewicz-Type Nonconforming Element in Any Dimensions
Numerisce Matematik manuscript No. will be inserted by te editor A New Class of Zienkiewicz-Type Nonconforming Element in Any Dimensions Wang Ming 1, Zong-ci Si 2, Jincao Xu1,3 1 LMAM, Scool of Matematical
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 informationMore on generalized inverses of partitioned matrices with Banachiewicz-Schur forms
More on generalized inverses of partitioned matrices wit anaciewicz-scur forms Yongge Tian a,, Yosio Takane b a Cina Economics and Management cademy, Central University of Finance and Economics, eijing,
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 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 informationGeneric maximum nullity of a graph
Generic maximum nullity of a grap Leslie Hogben Bryan Sader Marc 5, 2008 Abstract For a grap G of order n, te maximum nullity of G is defined to be te largest possible nullity over all real symmetric n
More informationDifferent Approaches to a Posteriori Error Analysis of the Discontinuous Galerkin Method
WDS'10 Proceedings of Contributed Papers, Part I, 151 156, 2010. ISBN 978-80-7378-139-2 MATFYZPRESS Different Approaces to a Posteriori Error Analysis of te Discontinuous Galerkin Metod I. Šebestová Carles
More informationResearch Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic Spline Quasi Interpolation
Advances in Numerical Analysis Volume 204, Article ID 35394, 8 pages ttp://dx.doi.org/0.55/204/35394 Researc Article Error Analysis for a Noisy Lacunary Cubic Spline Interpolation and a Simple Noisy Cubic
More informationWYSE Academic Challenge 2004 Sectional Mathematics Solution Set
WYSE Academic Callenge 00 Sectional Matematics Solution Set. Answer: B. Since te equation can be written in te form x + y, we ave a major 5 semi-axis of lengt 5 and minor semi-axis of lengt. Tis means
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 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 informationarxiv: v1 [math.na] 17 Jul 2014
Div First-Order System LL* FOSLL* for Second-Order Elliptic Partial Differential Equations Ziqiang Cai Rob Falgout Sun Zang arxiv:1407.4558v1 [mat.na] 17 Jul 2014 February 13, 2018 Abstract. Te first-order
More informationCONVERGENCE ANALYSIS OF FINITE ELEMENT SOLUTION OF ONE-DIMENSIONAL SINGULARLY PERTURBED DIFFERENTIAL EQUATIONS ON EQUIDISTRIBUTING MESHES
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume, Number, Pages 57 74 c 5 Institute for Scientific Computing and Information CONVERGENCE ANALYSIS OF FINITE ELEMENT SOLUTION OF ONE-DIMENSIONAL
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 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 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 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 informationPreconditioning in H(div) and Applications
1 Preconditioning in H(div) and Applications Douglas N. Arnold 1, Ricard S. Falk 2 and Ragnar Winter 3 4 Abstract. Summarizing te work of [AFW97], we sow ow to construct preconditioners using domain decomposition
More informationFinite Difference Method
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
More informationPolynomial Functions. Linear Functions. Precalculus: Linear and Quadratic Functions
Concepts: definition of polynomial functions, linear functions tree representations), transformation of y = x to get y = mx + b, quadratic functions axis of symmetry, vertex, x-intercepts), transformations
More informationDepartment of Mathematical Sciences University of South Carolina Aiken Aiken, SC 29801
RESEARCH SUMMARY AND PERSPECTIVES KOFFI B. FADIMBA Department of Matematical Sciences University of Sout Carolina Aiken Aiken, SC 29801 Email: KoffiF@usca.edu 1. Introduction My researc program as focused
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 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 informationA Mixed-Hybrid-Discontinuous Galerkin Finite Element Method for Convection-Diffusion Problems
A Mixed-Hybrid-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 informationCLEMSON U N I V E R S I T Y
A Fractional Step θ-metod for Convection-Diffusion Equations Jon Crispell December, 006 Advisors: Dr. Lea Jenkins and Dr. Vincent Ervin Fractional Step θ-metod Outline Crispell,Ervin,Jenkins Motivation
More informationHigh-Order Energy and Linear Momentum Conserving Methods for the Klein-Gordon Equation
matematics Article Hig-Order Energy and Linear Momentum Conserving Metods for te Klein-Gordon Equation He Yang Department of Matematics, Augusta University, Augusta, GA 39, USA; yang@augusta.edu; Tel.:
More informationAN ANALYSIS OF THE EMBEDDED DISCONTINUOUS GALERKIN METHOD FOR SECOND ORDER ELLIPTIC PROBLEMS
AN ANALYSIS OF THE EMBEDDED DISCONTINUOUS GALERKIN METHOD FOR SECOND ORDER ELLIPTIC PROBLEMS BERNARDO COCKBURN, JOHNNY GUZMÁN, SEE-CHEW SOON, AND HENRYK K. STOLARSKI Abstract. Te embedded discontinuous
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 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 informationFinding and Using Derivative The shortcuts
Calculus 1 Lia Vas Finding and Using Derivative Te sortcuts We ave seen tat te formula f f(x+) f(x) (x) = lim 0 is manageable for relatively simple functions like a linear or quadratic. For more complex
More informationSmoothness of solutions with respect to multi-strip integral boundary conditions for nth order ordinary differential equations
396 Nonlinear Analysis: Modelling and Control, 2014, Vol. 19, No. 3, 396 412 ttp://dx.doi.org/10.15388/na.2014.3.6 Smootness of solutions wit respect to multi-strip integral boundary conditions for nt
More informationEfficient, unconditionally stable, and optimally accurate FE algorithms for approximate deconvolution models of fluid flow
Efficient, unconditionally stable, and optimally accurate FE algoritms for approximate deconvolution models of fluid flow Leo G. Rebolz Abstract Tis paper addresses an open question of ow to devise numerical
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 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 informationReflection Symmetries of q-bernoulli Polynomials
Journal of Nonlinear Matematical Pysics Volume 1, Supplement 1 005, 41 4 Birtday Issue Reflection Symmetries of q-bernoulli Polynomials Boris A KUPERSHMIDT Te University of Tennessee Space Institute Tullaoma,
More informationNew Fourth Order Quartic Spline Method for Solving Second Order Boundary Value Problems
MATEMATIKA, 2015, Volume 31, Number 2, 149 157 c UTM Centre for Industrial Applied Matematics New Fourt Order Quartic Spline Metod for Solving Second Order Boundary Value Problems 1 Osama Ala yed, 2 Te
More informationOn convergence of the immersed boundary method for elliptic interface problems
On convergence of te immersed boundary metod for elliptic interface problems Zilin Li January 26, 2012 Abstract Peskin s Immersed Boundary (IB) metod is one of te most popular numerical metods for many
More information1. Consider the trigonometric function f(t) whose graph is shown below. Write down a possible formula for f(t).
. Consider te trigonometric function f(t) wose grap is sown below. Write down a possible formula for f(t). Tis function appears to be an odd, periodic function tat as been sifted upwards, so we will use
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 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 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 informationQuaternion Dynamics, Part 1 Functions, Derivatives, and Integrals. Gary D. Simpson. rev 01 Aug 08, 2016.
Quaternion Dynamics, Part 1 Functions, Derivatives, and Integrals Gary D. Simpson gsim1887@aol.com rev 1 Aug 8, 216 Summary Definitions are presented for "quaternion functions" of a quaternion. Polynomial
More informationINTRODUCTION AND MATHEMATICAL CONCEPTS
Capter 1 INTRODUCTION ND MTHEMTICL CONCEPTS PREVIEW Tis capter introduces you to te basic matematical tools for doing pysics. You will study units and converting between units, te trigonometric relationsips
More informationComputers and Mathematics with Applications. A nonlinear weighted least-squares finite element method for Stokes equations
Computers Matematics wit Applications 59 () 5 4 Contents lists available at ScienceDirect Computers Matematics wit Applications journal omepage: www.elsevier.com/locate/camwa A nonlinear weigted least-squares
More informationPart VIII, Chapter 39. Fluctuation-based stabilization Model problem
Part VIII, Capter 39 Fluctuation-based stabilization Tis capter presents a unified analysis of recent stabilization tecniques for te standard Galerkin approximation of first-order PDEs using H 1 - conforming
More informationTaylor Series and the Mean Value Theorem of Derivatives
1 - Taylor Series and te Mean Value Teorem o Derivatives Te numerical solution o engineering and scientiic problems described by matematical models oten requires solving dierential equations. Dierential
More informationMIXED DISCONTINUOUS GALERKIN APPROXIMATION OF THE MAXWELL OPERATOR. SIAM J. Numer. Anal., Vol. 42 (2004), pp
MIXED DISCONTINUOUS GALERIN APPROXIMATION OF THE MAXWELL OPERATOR PAUL HOUSTON, ILARIA PERUGIA, AND DOMINI SCHÖTZAU SIAM J. Numer. Anal., Vol. 4 (004), pp. 434 459 Abstract. We introduce and analyze a
More informationMath 161 (33) - Final exam
Name: Id #: Mat 161 (33) - Final exam Fall Quarter 2015 Wednesday December 9, 2015-10:30am to 12:30am Instructions: Prob. Points Score possible 1 25 2 25 3 25 4 25 TOTAL 75 (BEST 3) Read eac problem carefully.
More information1 Lecture 13: The derivative as a function.
1 Lecture 13: Te erivative as a function. 1.1 Outline Definition of te erivative as a function. efinitions of ifferentiability. Power rule, erivative te exponential function Derivative of a sum an a multiple
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 informationMath 102 TEST CHAPTERS 3 & 4 Solutions & Comments Fall 2006
Mat 102 TEST CHAPTERS 3 & 4 Solutions & Comments Fall 2006 f(x+) f(x) 10 1. For f(x) = x 2 + 2x 5, find ))))))))) and simplify completely. NOTE: **f(x+) is NOT f(x)+! f(x+) f(x) (x+) 2 + 2(x+) 5 ( x 2
More informationTHE STURM-LIOUVILLE-TRANSFORMATION FOR THE SOLUTION OF VECTOR PARTIAL DIFFERENTIAL EQUATIONS. L. Trautmann, R. Rabenstein
Worksop on Transforms and Filter Banks (WTFB),Brandenburg, Germany, Marc 999 THE STURM-LIOUVILLE-TRANSFORMATION FOR THE SOLUTION OF VECTOR PARTIAL DIFFERENTIAL EQUATIONS L. Trautmann, R. Rabenstein Lerstul
More informationFourier Type Super Convergence Study on DDGIC and Symmetric DDG Methods
DOI 0.007/s095-07-048- Fourier Type Super Convergence Study on DDGIC and Symmetric DDG Metods Mengping Zang Jue Yan Received: 7 December 06 / Revised: 7 April 07 / Accepted: April 07 Springer Science+Business
More informationFEM solution of the ψ-ω equations with explicit viscous diffusion 1
FEM solution of te ψ-ω equations wit explicit viscous diffusion J.-L. Guermond and L. Quartapelle 3 Abstract. Tis paper describes a variational formulation for solving te D time-dependent incompressible
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 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 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 information2.3 Algebraic approach to limits
CHAPTER 2. LIMITS 32 2.3 Algebraic approac to its Now we start to learn ow to find its algebraically. Tis starts wit te simplest possible its, and ten builds tese up to more complicated examples. Fact.
More informationA finite element approximation for the quasi-static Maxwell Landau Lifshitz Gilbert equations
ANZIAM J. 54 (CTAC2012) pp.c681 C698, 2013 C681 A finite element approximation for te quasi-static Maxwell Landau Lifsitz Gilbert equations Kim-Ngan Le 1 T. Tran 2 (Received 31 October 2012; revised 29
More informationVariational Localizations of the Dual Weighted Residual Estimator
Publised in Journal for Computational and Applied Matematics, pp. 192-208, 2015 Variational Localizations of te Dual Weigted Residual Estimator Tomas Ricter Tomas Wick Te dual weigted residual metod (DWR)
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 informationA C 0 interior penalty discontinuous Galerkin method for fourth order total variation flow. II: Existence and uniqueness
Numerical nalysis and Scientific Computing Preprint Seria C 0 interior penalty discontinuous Galerkin metod for fourt order total variation flow. II: xistence and uniqueness C. andari R. H. W. Hoppe R.
More informationDecay of solutions of wave equations with memory
Proceedings of te 14t International Conference on Computational and Matematical Metods in Science and Engineering, CMMSE 14 3 7July, 14. Decay of solutions of wave equations wit memory J. A. Ferreira 1,
More informationMVT and Rolle s Theorem
AP Calculus CHAPTER 4 WORKSHEET APPLICATIONS OF DIFFERENTIATION MVT and Rolle s Teorem Name Seat # Date UNLESS INDICATED, DO NOT USE YOUR CALCULATOR FOR ANY OF THESE QUESTIONS In problems 1 and, state
More informationThe Derivative as a Function
Section 2.2 Te Derivative as a Function 200 Kiryl Tsiscanka Te Derivative as a Function DEFINITION: Te derivative of a function f at a number a, denoted by f (a), is if tis limit exists. f (a) f(a + )
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 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 informationThe Sinc-Collocation Method for Solving the Telegraph Equation
Te Sinc-Collocation Metod for Solving te Telegrap Equation E. Hesameddini *1, E. Asadolaifard Department of Matematics, Faculty of Basic Sciences, Siraz University of Tecnology, Siraz, Iran *1 esameddini@sutec.ac.ir;
More informationSome Error Estimates for the Finite Volume Element Method for a Parabolic Problem
Computational Metods in Applied Matematics Vol. 13 (213), No. 3, pp. 251 279 c 213 Institute of Matematics, NAS of Belarus Doi: 1.1515/cmam-212-6 Some Error Estimates for te Finite Volume Element Metod
More informationarxiv: v1 [math.dg] 4 Feb 2015
CENTROID OF TRIANGLES ASSOCIATED WITH A CURVE arxiv:1502.01205v1 [mat.dg] 4 Feb 2015 Dong-Soo Kim and Dong Seo Kim Abstract. Arcimedes sowed tat te area between a parabola and any cord AB on te parabola
More informationlim 1 lim 4 Precalculus Notes: Unit 10 Concepts of Calculus
Syllabus Objectives: 1.1 Te student will understand and apply te concept of te limit of a function at given values of te domain. 1. Te student will find te limit of a function at given values of te domain.
More informationAn approximation method using approximate approximations
Applicable Analysis: An International Journal Vol. 00, No. 00, September 2005, 1 13 An approximation metod using approximate approximations FRANK MÜLLER and WERNER VARNHORN, University of Kassel, Germany,
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 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 informationNumerical Solution of One Dimensional Nonlinear Longitudinal Oscillations in a Class of Generalized Functions
Proc. of te 8t WSEAS Int. Conf. on Matematical Metods and Computational Tecniques in Electrical Engineering, Bucarest, October 16-17, 2006 219 Numerical Solution of One Dimensional Nonlinear Longitudinal
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 informationPOLYNOMIAL AND SPLINE ESTIMATORS OF THE DISTRIBUTION FUNCTION WITH PRESCRIBED ACCURACY
APPLICATIONES MATHEMATICAE 36, (29), pp. 2 Zbigniew Ciesielski (Sopot) Ryszard Zieliński (Warszawa) POLYNOMIAL AND SPLINE ESTIMATORS OF THE DISTRIBUTION FUNCTION WITH PRESCRIBED ACCURACY Abstract. Dvoretzky
More information