10 The Finite Element Method for a Parabolic Problem
|
|
- Clement Webster
- 6 years ago
- Views:
Transcription
1 1 The Finite Element Method for a Parabolic Problem In this chapter we consider the approximation of solutions of the model heat equation in two space dimensions by means of Galerkin s method, using piecewise linear trial functions. In Sect. 1.1 we consider the discretization with respect to the space variables only, and in the following Sect. 1.2 we study some completely discrete schemes. 1.1 The Semidiscrete Galerkin Finite Element Method Let Ω R 2 be a bounded convex domain with smooth boundary Γ,and consider the initial-boundary value problem, (1.1) u t u = f, in Ω R +, u =, on Γ R +, u(, ) = v, in Ω, where u t denotes u/ t and the Laplacian 2 / x / x 2 2. In the first step we shall approximate the solution u(x, t) by means of a function u h (x, t) which, for each fixed t, is a piecewise linear function of x over a triangulation T h of Ω, thus depending on a finite number of parameters. Thus, let T h = {K} denote a triangulation of Ω of the type considered in Sect. 5.2 and let {P j } M h be the interior nodes of T h.further,lets h denote the continuous piecewise linear functions on T h which vanish on Ω and let {Φ j } M h be the standard basis of S h corresponding to the nodes {P j } M h. Recall the definition (5.28) of the interpolant I h : C ( Ω) S h, and the error bounds (5.34) with r =2. For the purpose of defining thus an approximate solution to the initial boundary value problem (1.1) we first write this in weak form as in Sect. 8.3, i.e., with the definitions there, (1.2) (u t,ϕ)+a(u, ϕ) =(f,ϕ), ϕ H 1,t>. We then pose the approximate problem to find u h (t) =u h (,t), belonging to S h for each t, such that
2 15 1 The Finite Element Method for a Parabolic Problem (1.3) (u h,t,χ)+a(u h,χ)=(f,χ), χ S h, t >, u h () = v h, where v h S h is some approximation of v. Since we have discretized only in the space variables, this is referred to as a spatially semidiscrete problem. In the next section, we shall discretize also in the time variable to produce completely discrete schemes. In terms of the basis {Φ j } M h our semidiscrete problem may be stated: Find the coefficients α j (t) in such that M h u h (x, t) = α j (t)φ j (x), M h M h α j(t)(φ j,φ k )+ α j (t)a(φ j,φ k )=(f(t),φ k ), k =1,...,M h, and, with γ j denoting the nodal values of the given initial approximation v h, α j () = γ j, j =1,...,M h. In matrix notation this may be expressed as (1.4) Bα (t)+aα(t) =b(t), for t>, with α() = γ, where B =(b kj ) is the mass matrix with elements b kj =(Φ j,φ k ), A =(a kj ) the stiffness matrix with a kj = a(φ j,φ k ), b =(b k ) the vector with entries b k =(f,φ k ), α(t) the vector of unknowns α j (t), and γ =(γ j ). The dimension of all these items equals M h, the number of interior nodes of T h. We recall from Sect. 5.2 that the stiffness matrix A is symmetric positive definite, and this holds also for the mass matrix B since M h k, M h 2 ξ j ξ k (Φ j,φ k )= ξ j Φ j, and since equality can only occur if the vector ξ =.Inparticular,B is invertible, and therefore the above system of ordinary differential equations may be written α (t)+b 1 Aα(t) =B 1 b(t), for t>, with α() = γ, and hence obviously has a unique solution for t positive. We begin our analysis by considering the stability of the semidiscrete method. Since U n S h we may choose χ = u in (1.3) to obtain
3 1.1 The Semidiscrete Galerkin Finite Element Method 151 (u h,t,u h )+a(u h,u h )=(f,u h ), for t>, d or, since the first term equals 1 2 dt u h 2 and the second is non-negative, 1 d 2 dt u h 2 = u h d dt u h f u h. This yields d dt u h f, which after integration shows the stability estimate (1.5) u h (t) v h + t f ds. For the purpose of writing equation in (1.3) in operator form, we introduce a discrete Laplacian h, which we think of as an operator from S h into itself, defined by (1.6) ( h ψ, χ) =a(ψ, χ), ψ, χ S h. This discrete analogue of Green s formula clearly defines h ψ = M h d jφ j from M h d j (Φ j,φ k )= a(ψ, Φ k ), k =1,...,M h, since the matrix of this system is the positive definite mass matrix encountered above. The operator h is easily seen to be selfadjoint and h is positive definite in S h with respect to the L 2 -inner product, see Problem 1.3. With P h denoting the L 2 -projection onto S h, the equation in (1.3) may now be written (u h,t h u h P h f,χ) =, χ S h, or, noting that the first factor is in S h,sothatχ may be chosen equal to it, it follows that (1.7) u h,t h u h = P h f, for t>, with u h () = v h, We denote by E h (t) the solution operator of the homogeneous case of the semidiscrete equation in (1.7), with f =. Hence E h (t) is the operator which takes the initial data u h () = v h into the solution u h (t) attimet, so that u h (t) =E h (t)v h. It is then easy to show (cf. Duhamel s principle (8.22)) that the solution of the initial value problem (1.7) is (1.8) u h (t) =E h (t)v h + t E h (t s)p h f(s)ds.
4 152 1 The Finite Element Method for a Parabolic Problem We now note that it follows from (1.5) that E h (t) isstableinl 2,or (1.9) E h (t)v h v h, v h S h. Since also P h has unit norm in L 2 this, together with (1.8), re-establishes the stability estimate (1.5) for the inhomogeneous equation, so that, in fact, it suffices to show stability for the homogeneous equation. We shall prove the following estimate for the error between the solutions of the semidiscrete and continuous problems. Theorem 1.1. Let u h and u be the solutions of (1.3) and (1.1). Then u h (t) u(t) v h v + Ch 2( t ) v 2 + u t 2 ds, for t. Here we require, as usual, that the solution of the continuous problem has the regularity implicitly assumed by the presence of the norms on the right. Note also that for v h = I h v, (5.31) shows that (1.1) v h v Ch 2 v 2, in which case the first term on the right is dominated by the second. The same holds true if v h = P h v,wherep h denotes the orthogonal projection of L 2 onto S h, since this choice is the best approximation of v in S h with respect to the L 2 -norm, see (5.39). Another choice of optimal order is v h = R h v,wherer h is the elliptic (or Ritz) projection onto S h defined in (5.49) by (1.11) a(r h v, χ) =a(v, χ), χ S h. Thus R h v is the finite element approximation of the solution of the elliptic problem whose exact solution is v. We recall the error estimates of Theorem 5.5, (1.12) R h v v + h R h v v 1 Ch s v s, for s =1, 2. We now turn to the Proof of Theorem 1.1. In the main step of the proof we shall compare the solution of the semidiscrete problem to the elliptic projection of the exact solution. We write (1.13) u h u =(u h R h u)+(r h u u) =θ + ρ. The second term is easily bounded using (1.12) and obvious estimates by t ρ(t) Ch 2 u(t) 2 = Ch 2 v + u t ds Ch 2( t ) v 2 + u t 2 ds. 2 In order to bound θ, wenotethat
5 (1.14) or 1.1 The Semidiscrete Galerkin Finite Element Method 153 (θ t,χ)+a(θ, χ) =(u h,t,χ)+a(u h,χ) (R h u t,χ) a(r h u, χ) =(f,χ) (R h u t,χ) a(u, χ) =(u t R h u t,χ), (1.15) (θ t,χ)+a(θ, χ) = (ρ t,χ), χ S h. In this derivation we have used (1.3), (1.2), the definition of R h in (1.11), and the easily established fact that this operator commutes with time differentiation, i.e., R h u t =(R h u) t. We may now apply the stability estimate (1.5) to (1.15) to obtain Here θ(t) θ() + t ρ t ds. θ() = v h R h v v h v + R h v v v h v + Ch 2 v 2, and further ρ t = R h u t u t Ch 2 u t 2. Together these estimates prove the theorem. We see from the proof of Theorem 1.1 that the error estimate for the semidiscrete parabolic problem is thus a consequence of the stability for this problem combined with the error estimate for the elliptic problem, expressed in terms of ρ =(R h I)u. Recalling the maximum principle for parabolic equations, Theorem 8.7, we find at once that, for the solution operator E(t) of the homogeneous case of the initial boundary value problem (1.1), we have E(t)v C v C for t. The corresponding maximum principle does not hold for the finite element problem, but it may be shown that, if the family {T h } of triangulations is quasi-uniform, cf. (5.52), then for some C>1, E h (t)v h C C v h C, for t. This may be combined with the error estimate (5.53) for the stationary problem to show a maximum-norm error estimate for the parabolic problem. In this regard we mention a variant of the semidiscrete problem (1.2) for which a maximum principle sometimes holds, namely the lumped mass method. To define this we replace the matrix B in (1.4) by a diagonal matrix B, in which the diagonal elements are the row sums of B. One can show that this method can also be defined by (1.16) (u h,t,χ) h + a(u h,χ)=(f,χ), χ S h, for t>, where the inner product in the first term has been obtained by computing the first term in (1.2) by using the nodal quadrature rule (5.64). For this
6 154 1 The Finite Element Method for a Parabolic Problem method one may derive a O(h 2 ) error estimate similar to that of Theorem 1.1. If we now assume that all angles of the triangulations are π/2, then the off-diagonal elements of the stiffness matrix A are nonpositive, and as a result of this one may show that, if Ē h (t) denotes the solution operator of the modified problem, then Ēh(t)v h C v h C, for t. Returning to the standard Galerkin method (1.1) we now prove the following estimate for the error in the gradient. Theorem 1.2. Under the assumptions of Theorem 1.1, we have for t, { ( t ) 1/2 u h (t) u(t) 1 v h v 1 + Ch v 2 + u(t) 2 + u t 2 1 }. ds Proof. As before we write the error in the form (1.13). Here by (1.12), ρ(t) 1 = R h u(t) u(t) 1 Ch u(t) 2. In order to estimate θ we use again (1.15), now with χ = θ t.weobtain θ t d 2 dt θ 2 1 = (ρ t,θ t ) 1 2 ( ρ t 2 + θ t 2 ), so that d dt θ 2 1 ρ t 2, or t θ(t) 2 1 θ() ρ t 2 ds ( ) t 2 v h v 1 + R h v v 1 + ρ t 2 ds. Hence, since a 2 + b 2 ( a + b ) 2 and in view of (1.12), we conclude { ( t ) 1/2 (1.17) θ(t) 1 v h v 1 + Ch v 2 + u t 2 1 }, ds which completes the proof. Note that if v h = I h v or R h v,then v h v 1 Ch v 2, so that the first term on the right in Theorem 1.2 is dominated by the second. We make the following observation concerning θ = u h R h u: Assume that we choose v h = R h v,sothatθ() =. Then in addition to (1.17) we have
7 1.1 The Semidiscrete Galerkin Finite Element Method 155 ( t ) ( 1/2 t ) θ(t) 1 ρ t 2 ds Ch 2 1/2. u t 2 2 ds Hence the gradient of θ is of second order O(h 2 ), whereas the gradient of the total error is only of order O(h)ash. Thus u h is a better approximation to R h u than is possible to u. This is an example of a phenomenon which is sometimes referred to as superconvergence. The discrete solution operator E h (t) introduced above also has smoothing properties analogous to the corresponding results in Sect. 8.2 for the continuous problem, such as, for instance E h (t)v h 1 Ct 1/2 v h, for t>, v h S h, and (1.18) D k t E h(t)v h = k h E h (t)v h C k t k v h, for t>, v h S h. Such results may be used to show, e.g., the following non-smooth data error estimate for the homogeneous equation. Theorem 1.3. Assume that f =and let u h and u be the solutions of (1.3) and (1.1), respectively, where now the initial data for (1.3) are chosen as v h = P h v.then u h (t) u(t) Ch 2 t 1 v, for t>. The proof is left as an exercise (Problem 1.4). This result shows that the convergence rate is O(h 2 )fort bounded away from zero, even when v is only assumed to belong to L 2. The above theory easily extends to finite elements of higher order, under the appropriate regularity assumptions on the solution. Thus, if the finite element subspace is such that (1.19) R h v v Ch r v r, v H r H 1, then we may show the following theorem. Theorem 1.4. Let u h and u be the solutions of (1.3) and (1.1), respectively, and assume that (1.19) holds. Then, for v h suitably chosen, we have u h (t) u(t) Ch r( t ) v r + u t r ds, for t. Recall from (5.5) that for r>2 the estimate (1.19) holds for piecewise polynomials of degree r 1, but that the regularity assumption v H r H 1 is then somewhat unrealistic. For a domain Ω with a smooth boundary Γ special considerations are needed in the boundary layer Ω \ Ω h.
8 156 1 The Finite Element Method for a Parabolic Problem 1.2 Some Completely Discrete Schemes We shall now turn our attention to some simple schemes for discretization also with respect to the time variable, and let S h be the space of piecewise linear finite element functions as before. We begin with the backward Euler- Galerkin method. Withk the time step and U n S h the approximation of u(t) att = t n = nk, this method is defined by replacing the time derivative in (1.3) by a backward difference quotient, or with t U n = k 1 (U n U n 1 ), (1.2) ( t U n,χ)+a(u n,χ)=(f(t n ),χ), χ S h, n 1, U = v h. Given U n 1 this defines U n implicitly from the discrete elliptic problem (U n,χ)+ka(u n,χ)=(u n 1 + kf(t n ),χ), χ S h. Expressing U n in terms of the basis {Φ} M h as U n (x) = M h αn j Φ j(x), we may write this equation in the matrix notation introduced in Sect. 1.1 as Bα n + kaα n = Bα n 1 + kb n, for n 1, where α n is the vector with components α n j,or α n =(B + ka) 1 Bα n 1 + k(b + ka) 1 b n, for n 1, with α = γ. We begin our analysis of the backward Euler method by showing that it is unconditionally stable, i.e., that it is stable independently of the relation between h and k. Choosingχ = U n in (1.2) we have, since a(u n,u n ), ( t U n,u n ) f n U n, where f n = f(t n ), or U n 2 (U n 1,U n ) k f n U n. Since (U n 1,U n ) U n 1 U n, this shows and hence, by repeated application, U n U n 1 + k f n, for n 1, (1.21) U n U + k n f j. We shall now prove the following error estimate. Theorem 1.5. With U n and u the solutions of (1.2) and (1.1), respectively, and with v h chosen so that (1.1) holds, we have, for n, U n u(t n ) Ch 2( v 2 + tn ) u t 2 ds + Ck tn u tt ds.
9 Proof. In analogy with (1.13) we write 1.2 Some Completely Discrete Schemes 157 U n u(t n )= ( U n R h u(t n ) ) + ( R h u(t n ) u(t n ) ) = θ n + ρ n. As before, by (1.12), ρ n Ch 2 u(t n ) 2 Ch 2( tn ) v 2 + u t 2 ds. This time, a calculation corresponding to (1.14) yields (1.22) ( t θ n,χ)+a(θ n,χ)= (ω n,χ), where ω n = R h t u(t n ) u t (t n )=(R h I) t u(t n )+( t u(t n ) u t (t n )) = ω n 1 + ωn 2. By application of the stability estimate (1.21) to (1.22) we obtain θ n θ + k n n ω j 1 + k ω j 2. Here, as before, by (1.1) and (1.12), Note now that θ = v h R h v v h v + v R h v Ch 2 v 2. ω j 1 =(R h I)k 1 tj t j 1 u t ds = k 1 tj t j 1 (R h I)u t ds, whence n k ω j 1 n tj t j 1 Ch 2 u t 2 ds = Ch 2 tn u t 2 ds. Further, by Taylor s formula, so that ω j 2 = k 1 (u(t j ) u(t j 1 )) u t (t j )= k 1 tj k n ω j 2 n tj (s t j 1 )u tt (s)ds k t j 1 t j 1 (s t j 1 )u tt (s)ds, tn u tt ds. Together our estimates complete the proof of the theorem.
10 158 1 The Finite Element Method for a Parabolic Problem Replacing the backward difference quotient with respect to time in (1.2) by a forward difference quotient we arrive at the forward Euler-Galerkin method, orwith t U n =(U n+1 U n )/k, ( t U n,χ)+a(u n,χ)=(f(t n ),χ), χ S h, n 1, U = v h. In matrix form this may be expressed as Bα n+1 =(B ka)α n + kb n, for n, Since B is not a diagonal matrix this method is not explicit. However, if this time discretization method is applied to the lumped mass semidiscrete equation (1.16), and thus B replaced by the diagonal matrix B, then the corresponding forward Euler method becomes an explicit one. Using the discrete Laplacian defined in (1.6), the forward Euler method may also be defined by (1.23) U n+1 =(I + k h )U n + kp h f(t n ), for n, with U = v h. This method is not unconditionally stable as the backward Euler method, but considering for simplicity only the homogeneous equation, we shall show stability under the condition that the family {S h } is such that (1.24) λ Mh,h k 2, where λ Mh,h is the largest eigenvalue of h. Recalling (6.37), we note that this holds, e.g., if the S h satisfy the inverse inequality (6.36) and if k 2C 1 h 2,whereC is the constant in (6.37), which thus shows conditional stability. It is clear that (1.23) is stable if and only if (I + k h )χ χ for all χ S h, and since h is symmetric positive definite, this holds if and only if all eigenvalues of I + k h belong to [ 1, 1]. By the positivity of h this is the same as requiring the smallest eigenvalue of I + k h to be 1, or that the largest eigenvalue of h is 2/k, which is (1.24). See also Problem 1.3. Note that because of the non-symmetric choice of the discretization in time, the backward Euler-Galerkin method is only first order accurate in time. We therefore now turn to the Crank-Nicolson-Galerkin method, inwhichthe semidiscrete equation is discretized in a symmetric fashion around the point t n 1/2 =(n 1 2 )k, which yields method which is second order accurate in time.moreprecisely,wedefineu n S h recursively for n 1by (1.25) ( t U n,χ)+a( 1 2 (U n + U n 1 ),χ)=(f(t n 1/2 ),χ), χ S h, U = v h.
11
Springer Series in Computational Mathematics
Springer Series in Computational Mathematics 25 Editorial Board R. Bank R.L. Graham J. Stoer R. Varga H. Yserentant Vidar Thomée Galerkin Finite Element Methods for Parabolic Problems Second Edition ABC
More informationChapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs
Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u
More informationA POSTERIORI ERROR ESTIMATES BY RECOVERED GRADIENTS IN PARABOLIC FINITE ELEMENT EQUATIONS
A POSTERIORI ERROR ESTIMATES BY RECOVERED GRADIENTS IN PARABOLIC FINITE ELEMENT EQUATIONS D. LEYKEKHMAN AND L. B. WAHLBIN Abstract. This paper considers a posteriori error estimates by averaged gradients
More information1. Introduction. We consider the model initial boundary value problem for the fractional order parabolic differential equation (FPDE) for u(x, t):
ERROR ESTIMATES FOR A SEMIDISCRETE FINITE ELEMENT METHOD FOR FRACTIONAL ORDER PARABOLIC EQUATIONS BANGTI JIN, RAYTCHO LAZAROV, AND ZHI ZHOU Abstract. We consider the initial boundary value problem for
More informationError estimates for a finite volume element method for parabolic equations in convex polygonal domains
Error estimates for a finite volume element method for parabolic equations in convex polygonal domains P Chatzipantelidis, R D Lazarov Department of Mathematics, Texas A&M University, College Station,
More informationSOME ERROR ESTIMATES FOR THE LUMPED MASS FINITE ELEMENT METHOD FOR A PARABOLIC PROBLEM
MATHEMATICS OF COMPUTATION Volume 81, Number 277, January 212, Pages 1 2 S 25-5718(211)253-2 Article electronically published on May 23, 211 SOME ERROR ESTIMATES FOR THE LUMPED MASS FINITE ELEMENT METHOD
More informationWEAK GALERKIN FINITE ELEMENT METHOD FOR SECOND ORDER PARABOLIC EQUATIONS
INERNAIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 13, Number 4, Pages 525 544 c 216 Institute for Scientific Computing and Information WEAK GALERKIN FINIE ELEMEN MEHOD FOR SECOND ORDER PARABOLIC
More informationELLIPTIC RECONSTRUCTION AND A POSTERIORI ERROR ESTIMATES FOR PARABOLIC PROBLEMS
ELLIPTIC RECONSTRUCTION AND A POSTERIORI ERROR ESTIMATES FOR PARABOLIC PROBLEMS CHARALAMBOS MAKRIDAKIS AND RICARDO H. NOCHETTO Abstract. It is known that the energy technique for a posteriori error analysis
More informationGALERKIN TIME STEPPING METHODS FOR NONLINEAR PARABOLIC EQUATIONS
GALERKIN TIME STEPPING METHODS FOR NONLINEAR PARABOLIC EQUATIONS GEORGIOS AKRIVIS AND CHARALAMBOS MAKRIDAKIS Abstract. We consider discontinuous as well as continuous Galerkin methods for the time discretization
More informationCONVERGENCE OF FINITE DIFFERENCE METHOD FOR THE GENERALIZED SOLUTIONS OF SOBOLEV EQUATIONS
J. Korean Math. Soc. 34 (1997), No. 3, pp. 515 531 CONVERGENCE OF FINITE DIFFERENCE METHOD FOR THE GENERALIZED SOLUTIONS OF SOBOLEV EQUATIONS S. K. CHUNG, A.K.PANI AND M. G. PARK ABSTRACT. In this paper,
More informationIterative methods for positive definite linear systems with a complex shift
Iterative methods for positive definite linear systems with a complex shift William McLean, University of New South Wales Vidar Thomée, Chalmers University November 4, 2011 Outline 1. Numerical solution
More informationChapter 1: The Finite Element Method
Chapter 1: The Finite Element Method Michael Hanke Read: Strang, p 428 436 A Model Problem Mathematical Models, Analysis and Simulation, Part Applications: u = fx), < x < 1 u) = u1) = D) axial deformation
More informationTime-dependent variational forms
Time-dependent variational forms Hans Petter Langtangen 1,2 1 Center for Biomedical Computing, Simula Research Laboratory 2 Department of Informatics, University of Oslo Oct 30, 2015 PRELIMINARY VERSION
More informationA POSTERIORI ERROR ESTIMATES FOR THE BDF2 METHOD FOR PARABOLIC EQUATIONS
A POSTERIORI ERROR ESTIMATES FOR THE BDF METHOD FOR PARABOLIC EQUATIONS GEORGIOS AKRIVIS AND PANAGIOTIS CHATZIPANTELIDIS Abstract. We derive optimal order, residual-based a posteriori error estimates for
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 informationSubdiffusion in a nonconvex polygon
Subdiffusion in a nonconvex polygon Kim Ngan Le and William McLean The University of New South Wales Bishnu Lamichhane University of Newcastle Monash Workshop on Numerical PDEs, February 2016 Outline Time-fractional
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More information1 Discretizing BVP with Finite Element Methods.
1 Discretizing BVP with Finite Element Methods In this section, we will discuss a process for solving boundary value problems numerically, the Finite Element Method (FEM) We note that such method is a
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University The Implicit Schemes for the Model Problem The Crank-Nicolson scheme and θ-scheme
More informationResearch Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations
Abstract and Applied Analysis Volume 212, Article ID 391918, 11 pages doi:1.1155/212/391918 Research Article A Two-Grid Method for Finite Element Solutions of Nonlinear Parabolic Equations Chuanjun Chen
More information1. Let a(x) > 0, and assume that u and u h are the solutions of the Dirichlet problem:
Mathematics Chalmers & GU TMA37/MMG800: Partial Differential Equations, 011 08 4; kl 8.30-13.30. Telephone: Ida Säfström: 0703-088304 Calculators, formula notes and other subject related material are not
More informationChapter 12. Partial di erential equations Di erential operators in R n. The gradient and Jacobian. Divergence and rotation
Chapter 12 Partial di erential equations 12.1 Di erential operators in R n The gradient and Jacobian We recall the definition of the gradient of a scalar function f : R n! R, as @f grad f = rf =,..., @f
More informationITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS
ITERATIVE METHODS FOR NONLINEAR ELLIPTIC EQUATIONS LONG CHEN In this chapter we discuss iterative methods for solving the finite element discretization of semi-linear elliptic equations of the form: find
More informationINTRODUCTION TO FINITE ELEMENT METHODS ON ELLIPTIC EQUATIONS LONG CHEN
INTROUCTION TO FINITE ELEMENT METHOS ON ELLIPTIC EQUATIONS LONG CHEN CONTENTS 1. Poisson Equation 1 2. Outline of Topics 3 2.1. Finite ifference Method 3 2.2. Finite Element Method 3 2.3. Finite Volume
More informationLECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)
LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,
More informationA very short introduction to the Finite Element Method
A very short introduction to the Finite Element Method Till Mathis Wagner Technical University of Munich JASS 2004, St Petersburg May 4, 2004 1 Introduction This is a short introduction to the finite element
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 informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
More informationCOMBINING MAXIMAL REGULARITY AND ENERGY ESTIMATES FOR TIME DISCRETIZATIONS OF QUASILINEAR PARABOLIC EQUATIONS
COMBINING MAXIMAL REGULARITY AND ENERGY ESTIMATES FOR TIME DISCRETIZATIONS OF QUASILINEAR PARABOLIC EQUATIONS GEORGIOS AKRIVIS, BUYANG LI, AND CHRISTIAN LUBICH Abstract. We analyze fully implicit and linearly
More informationChapter 1 Foundations of Elliptic Boundary Value Problems 1.1 Euler equations of variational problems
Chapter 1 Foundations of Elliptic Boundary Value Problems 1.1 Euler equations of variational problems Elliptic boundary value problems often occur as the Euler equations of variational problems the latter
More informationDiscontinuous Galerkin methods for fractional diffusion problems
Discontinuous Galerkin methods for fractional diffusion problems Bill McLean Kassem Mustapha School of Maths and Stats, University of NSW KFUPM, Dhahran Leipzig, 7 October, 2010 Outline Sub-diffusion Equation
More informationASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR THE POINTWISE GRADIENT ERROR ON EACH ELEMENT IN IRREGULAR MESHES. PART II: THE PIECEWISE LINEAR CASE
MATEMATICS OF COMPUTATION Volume 73, Number 246, Pages 517 523 S 0025-5718(0301570-9 Article electronically published on June 17, 2003 ASYMPTOTICALLY EXACT A POSTERIORI ESTIMATORS FOR TE POINTWISE GRADIENT
More informationAMS subject classifications. Primary, 65N15, 65N30, 76D07; Secondary, 35B45, 35J50
A SIMPLE FINITE ELEMENT METHOD FOR THE STOKES EQUATIONS LIN MU AND XIU YE Abstract. The goal of this paper is to introduce a simple finite element method to solve the Stokes equations. This method is in
More informationLecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.
Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference
More informationPREPRINT 2009:20. Finite Element Approximation of the Linearized Cahn-Hilliard-Cook Equation STIG LARSSON ALI MESFORUSH
PREPRINT 9: Finite Element Approximation of the Linearized Cahn-Hilliard-Coo Equation STIG LARSSON ALI MESFORUSH Department of Mathematical Sciences Division of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY
More informationFinite element approximation of the stochastic heat equation with additive noise
p. 1/32 Finite element approximation of the stochastic heat equation with additive noise Stig Larsson p. 2/32 Outline Stochastic heat equation with additive noise du u dt = dw, x D, t > u =, x D, t > u()
More informationScientific Computing WS 2017/2018. Lecture 18. Jürgen Fuhrmann Lecture 18 Slide 1
Scientific Computing WS 2017/2018 Lecture 18 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 18 Slide 1 Lecture 18 Slide 2 Weak formulation of homogeneous Dirichlet problem Search u H0 1 (Ω) (here,
More informationLecture 4: Numerical solution of ordinary differential equations
Lecture 4: Numerical solution of ordinary differential equations Department of Mathematics, ETH Zürich General explicit one-step method: Consistency; Stability; Convergence. High-order methods: Taylor
More informationChapter 3 Conforming Finite Element Methods 3.1 Foundations Ritz-Galerkin Method
Chapter 3 Conforming Finite Element Methods 3.1 Foundations 3.1.1 Ritz-Galerkin Method Let V be a Hilbert space, a(, ) : V V lr a bounded, V-elliptic bilinear form and l : V lr a bounded linear functional.
More informationTong Sun Department of Mathematics and Statistics Bowling Green State University, Bowling Green, OH
Consistency & Numerical Smoothing Error Estimation An Alternative of the Lax-Richtmyer Theorem Tong Sun Department of Mathematics and Statistics Bowling Green State University, Bowling Green, OH 43403
More informationIntroduction to the Numerical Solution of IVP for ODE
Introduction to the Numerical Solution of IVP for ODE 45 Introduction to the Numerical Solution of IVP for ODE Consider the IVP: DE x = f(t, x), IC x(a) = x a. For simplicity, we will assume here that
More informationScientific Computing WS 2018/2019. Lecture 15. Jürgen Fuhrmann Lecture 15 Slide 1
Scientific Computing WS 2018/2019 Lecture 15 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 15 Slide 1 Lecture 15 Slide 2 Problems with strong formulation Writing the PDE with divergence and gradient
More informationOptimal order a posteriori error estimates for a class of Runge Kutta and Galerkin methods
Numerische Mathematik manuscript No. (will be inserted by the editor) Optimal order a posteriori error estimates for a class of Runge Kutta and Galerkin methods Georgios Akrivis 1, Charalambos Makridakis
More informationFinite Differences for Differential Equations 28 PART II. Finite Difference Methods for Differential Equations
Finite Differences for Differential Equations 28 PART II Finite Difference Methods for Differential Equations Finite Differences for Differential Equations 29 BOUNDARY VALUE PROBLEMS (I) Solving a TWO
More informationA note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations
A note on accurate and efficient higher order Galerkin time stepping schemes for the nonstationary Stokes equations S. Hussain, F. Schieweck, S. Turek Abstract In this note, we extend our recent work for
More informationOn an Approximation Result for Piecewise Polynomial Functions. O. Karakashian
BULLETIN OF THE GREE MATHEMATICAL SOCIETY Volume 57, 010 (1 7) On an Approximation Result for Piecewise Polynomial Functions O. arakashian Abstract We provide a new approach for proving approximation results
More informationDiscontinuous Galerkin Time Discretization Methods for Parabolic Problems with Linear Constraints
J A N U A R Y 0 1 8 P R E P R N T 4 7 4 Discontinuous Galerkin Time Discretization Methods for Parabolic Problems with Linear Constraints gor Voulis * and Arnold Reusken nstitut für Geometrie und Praktische
More informationMATRICES ARE SIMILAR TO TRIANGULAR MATRICES
MATRICES ARE SIMILAR TO TRIANGULAR MATRICES 1 Complex matrices Recall that the complex numbers are given by a + ib where a and b are real and i is the imaginary unity, ie, i 2 = 1 In what we describe below,
More informationn 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes
Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and
More informationNumerical Methods for Two Point Boundary Value Problems
Numerical Methods for Two Point Boundary Value Problems Graeme Fairweather and Ian Gladwell 1 Finite Difference Methods 1.1 Introduction Consider the second order linear two point boundary value problem
More informationarxiv: v1 [math.na] 29 Feb 2016
EFFECTIVE IMPLEMENTATION OF THE WEAK GALERKIN FINITE ELEMENT METHODS FOR THE BIHARMONIC EQUATION LIN MU, JUNPING WANG, AND XIU YE Abstract. arxiv:1602.08817v1 [math.na] 29 Feb 2016 The weak Galerkin (WG)
More informationPIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED
PIECEWISE LINEAR FINITE ELEMENT METHODS ARE NOT LOCALIZED ALAN DEMLOW Abstract. Recent results of Schatz show that standard Galerkin finite element methods employing piecewise polynomial elements of degree
More informationJuan Vicente Gutiérrez Santacreu Rafael Rodríguez Galván. Departamento de Matemática Aplicada I Universidad de Sevilla
Doc-Course: Partial Differential Equations: Analysis, Numerics and Control Research Unit 3: Numerical Methods for PDEs Part I: Finite Element Method: Elliptic and Parabolic Equations Juan Vicente Gutiérrez
More informationSECOND ORDER TIME DISCONTINUOUS GALERKIN METHOD FOR NONLINEAR CONVECTION-DIFFUSION PROBLEMS
Proceedings of ALGORITMY 2009 pp. 1 10 SECOND ORDER TIME DISCONTINUOUS GALERKIN METHOD FOR NONLINEAR CONVECTION-DIFFUSION PROBLEMS MILOSLAV VLASÁK Abstract. We deal with a numerical solution of a scalar
More informationBasic Concepts of Adaptive Finite Element Methods for Elliptic Boundary Value Problems
Basic Concepts of Adaptive Finite lement Methods for lliptic Boundary Value Problems Ronald H.W. Hoppe 1,2 1 Department of Mathematics, University of Houston 2 Institute of Mathematics, University of Augsburg
More informationCOMBINING MAXIMAL REGULARITY AND ENERGY ESTIMATES FOR TIME DISCRETIZATIONS OF QUASILINEAR PARABOLIC EQUATIONS
COMBINING MAXIMAL REGULARITY AND ENERGY ESTIMATES FOR TIME DISCRETIZATIONS OF QUASILINEAR PARABOLIC EQUATIONS GEORGIOS AKRIVIS, BUYANG LI, AND CHRISTIAN LUBICH Abstract. We analyze fully implicit and linearly
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
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 informationPART IV Spectral Methods
PART IV Spectral Methods Additional References: R. Peyret, Spectral methods for incompressible viscous flow, Springer (2002), B. Mercier, An introduction to the numerical analysis of spectral methods,
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Variational Problems of the Dirichlet BVP of the Poisson Equation 1 For the homogeneous
More informationAdaptive Finite Element Methods Lecture Notes Winter Term 2017/18. R. Verfürth. Fakultät für Mathematik, Ruhr-Universität Bochum
Adaptive Finite Element Methods Lecture Notes Winter Term 2017/18 R. Verfürth Fakultät für Mathematik, Ruhr-Universität Bochum Contents Chapter I. Introduction 7 I.1. Motivation 7 I.2. Sobolev and finite
More informationThe effect of mesh modification in time on the error control of fully discrete approximations for parabolic equations
The effect of mesh modification in time on the error control of fully discrete approximations for parabolic equations E. BÄNSCH, F. KARAKATSANI, AND CH. MAKRIDAKIS Abstract. We consider fully discrete
More informationarxiv: v5 [math.na] 1 Sep 2018
High-Order Adaptive Extended Stencil FEM (AES-FEM) Part I: Convergence and Superconvergence Xiangmin Jiao Rebecca Conley Tristan J. Delaney arxiv:1603.09325v5 [math.na] 1 Sep 2018 Abstract Finite elements
More informationScientific Computing I
Scientific Computing I Module 8: An Introduction to Finite Element Methods Tobias Neckel Winter 2013/2014 Module 8: An Introduction to Finite Element Methods, Winter 2013/2014 1 Part I: Introduction to
More informationPlatzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Introduction to PDEs and Numerical Methods Lecture 6: Numerical solution of the heat equation with FD method: method of lines, Euler
More informationA brief introduction to finite element methods
CHAPTER A brief introduction to finite element methods 1. Two-point boundary value problem and the variational formulation 1.1. The model problem. Consider the two-point boundary value problem: Given a
More informationLECTURE 5: THE METHOD OF STATIONARY PHASE
LECTURE 5: THE METHOD OF STATIONARY PHASE Some notions.. A crash course on Fourier transform For j =,, n, j = x j. D j = i j. For any multi-index α = (α,, α n ) N n. α = α + + α n. α! = α! α n!. x α =
More informationLECTURE 3: DISCRETE GRADIENT FLOWS
LECTURE 3: DISCRETE GRADIENT FLOWS Department of Mathematics and Institute for Physical Science and Technology University of Maryland, USA Tutorial: Numerical Methods for FBPs Free Boundary Problems and
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationNumerical Analysis of Differential Equations Numerical Solution of Parabolic Equations
Numerical Analysis of Differential Equations 215 6 Numerical Solution of Parabolic Equations 6 Numerical Solution of Parabolic Equations TU Bergakademie Freiberg, SS 2012 Numerical Analysis of Differential
More informationPreconditioned space-time boundary element methods for the heat equation
W I S S E N T E C H N I K L E I D E N S C H A F T Preconditioned space-time boundary element methods for the heat equation S. Dohr and O. Steinbach Institut für Numerische Mathematik Space-Time Methods
More informationA posteriori error estimation for elliptic problems
A posteriori error estimation for elliptic problems Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in
More information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Numerical Methods for Partial Differential Equations Finite Difference Methods
More informationMODULE 8 Topics: Null space, range, column space, row space and rank of a matrix
MODULE 8 Topics: Null space, range, column space, row space and rank of a matrix Definition: Let L : V 1 V 2 be a linear operator. The null space N (L) of L is the subspace of V 1 defined by N (L) = {x
More informationConvergence analysis of a discontinuous Galerkin method for a sub-diffusion equation
Numer Algor (29 52:69 88 DOI 1.17/s1175-8-9258-8 ORIGINAL PAPER Convergence analysis of a discontinuous Galerkin method for a sub-diffusion equation William McLean Kassem Mustapha Received: 16 September
More informationWELL-POSEDNESS FOR HYPERBOLIC PROBLEMS (0.2)
WELL-POSEDNESS FOR HYPERBOLIC PROBLEMS We will use the familiar Hilbert spaces H = L 2 (Ω) and V = H 1 (Ω). We consider the Cauchy problem (.1) c u = ( 2 t c )u = f L 2 ((, T ) Ω) on [, T ] Ω u() = u H
More informationFinite Element Method for Ordinary Differential Equations
52 Chapter 4 Finite Element Method for Ordinary Differential Equations In this chapter we consider some simple examples of the finite element method for the approximate solution of ordinary differential
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Nonconformity and the Consistency Error First Strang Lemma Abstract Error Estimate
More informationMaximum norm estimates for energy-corrected finite element method
Maximum norm estimates for energy-corrected finite element method Piotr Swierczynski 1 and Barbara Wohlmuth 1 Technical University of Munich, Institute for Numerical Mathematics, piotr.swierczynski@ma.tum.de,
More informationChapter 5 A priori error estimates for nonconforming finite element approximations 5.1 Strang s first lemma
Chapter 5 A priori error estimates for nonconforming finite element approximations 51 Strang s first lemma We consider the variational equation (51 a(u, v = l(v, v V H 1 (Ω, and assume that the conditions
More informationR T (u H )v + (2.1) J S (u H )v v V, T (2.2) (2.3) H S J S (u H ) 2 L 2 (S). S T
2 R.H. NOCHETTO 2. Lecture 2. Adaptivity I: Design and Convergence of AFEM tarting with a conforming mesh T H, the adaptive procedure AFEM consists of loops of the form OLVE ETIMATE MARK REFINE to produce
More informationRecovery Techniques in Finite Element Methods
Chapter 8 Recovery Techniques in Finite Element Methods Zhimin Zhang Department of Mathematics Wayne State University Detroit, MI 48202 USA zhang@math.wayne.edu Contents 8. Introduction and preliminary.............................
More informationBasic Principles of Weak Galerkin Finite Element Methods for PDEs
Basic Principles of Weak Galerkin Finite Element Methods for PDEs Junping Wang Computational Mathematics Division of Mathematical Sciences National Science Foundation Arlington, VA 22230 Polytopal Element
More informationA space-time Trefftz method for the second order wave equation
A space-time Trefftz method for the second order wave equation Lehel Banjai The Maxwell Institute for Mathematical Sciences Heriot-Watt University, Edinburgh Rome, 10th Apr 2017 Joint work with: Emmanuil
More informationPARTIAL DIFFERENTIAL EQUATIONS. Lecturer: D.M.A. Stuart MT 2007
PARTIAL DIFFERENTIAL EQUATIONS Lecturer: D.M.A. Stuart MT 2007 In addition to the sets of lecture notes written by previous lecturers ([1, 2]) the books [4, 7] are very good for the PDE topics in the course.
More informationNumerical Solution I
Numerical Solution I Stationary Flow R. Kornhuber (FU Berlin) Summerschool Modelling of mass and energy transport in porous media with practical applications October 8-12, 2018 Schedule Classical Solutions
More informationOn Pressure Stabilization Method and Projection Method for Unsteady Navier-Stokes Equations 1
On Pressure Stabilization Method and Projection Method for Unsteady Navier-Stokes Equations 1 Jie Shen Department of Mathematics, Penn State University University Park, PA 1682 Abstract. We present some
More informationIndex. C 2 ( ), 447 C k [a,b], 37 C0 ( ), 618 ( ), 447 CD 2 CN 2
Index advection equation, 29 in three dimensions, 446 advection-diffusion equation, 31 aluminum, 200 angle between two vectors, 58 area integral, 439 automatic step control, 119 back substitution, 604
More informationNOTES ON CALCULUS OF VARIATIONS. September 13, 2012
NOTES ON CALCULUS OF VARIATIONS JON JOHNSEN September 13, 212 1. The basic problem In Calculus of Variations one is given a fixed C 2 -function F (t, x, u), where F is defined for t [, t 1 ] and x, u R,
More informationProjection Methods. Michal Kejak CERGE CERGE-EI ( ) 1 / 29
Projection Methods Michal Kejak CERGE CERGE-EI ( ) 1 / 29 Introduction numerical methods for dynamic economies nite-di erence methods initial value problems (Euler method) two-point boundary value problems
More informationTHE METHOD OF LINES FOR PARABOLIC PARTIAL INTEGRO-DIFFERENTIAL EQUATIONS
JOURNAL OF INTEGRAL EQUATIONS AND APPLICATIONS Volume 4, Number 1, Winter 1992 THE METHOD OF LINES FOR PARABOLIC PARTIAL INTEGRO-DIFFERENTIAL EQUATIONS J.-P. KAUTHEN ABSTRACT. We present a method of lines
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University A Model Problem and Its Difference Approximations 1-D Initial Boundary Value
More informationNumerische Mathematik
Numer. Math. (997) 76: 479 488 Numerische Mathematik c Springer-Verlag 997 Electronic Edition Exponential decay of C cubic splines vanishing at two symmetric points in each knot interval Sang Dong Kim,,
More informationFinite Difference Methods for Boundary Value Problems
Finite Difference Methods for Boundary Value Problems October 2, 2013 () Finite Differences October 2, 2013 1 / 52 Goals Learn steps to approximate BVPs using the Finite Difference Method Start with two-point
More informationUne méthode de pénalisation par face pour l approximation des équations de Navier-Stokes à nombre de Reynolds élevé
Une méthode de pénalisation par face pour l approximation des équations de Navier-Stokes à nombre de Reynolds élevé CMCS/IACS Ecole Polytechnique Federale de Lausanne Erik.Burman@epfl.ch Méthodes Numériques
More informationA space-time Trefftz method for the second order wave equation
A space-time Trefftz method for the second order wave equation Lehel Banjai The Maxwell Institute for Mathematical Sciences Heriot-Watt University, Edinburgh & Department of Mathematics, University of
More informationNumerical Approximation of Phase Field Models
Numerical Approximation of Phase Field Models Lecture 2: Allen Cahn and Cahn Hilliard Equations with Smooth Potentials Robert Nürnberg Department of Mathematics Imperial College London TUM Summer School
More informationLecture 1. Finite difference and finite element methods. Partial differential equations (PDEs) Solving the heat equation numerically
Finite difference and finite element methods Lecture 1 Scope of the course Analysis and implementation of numerical methods for pricing options. Models: Black-Scholes, stochastic volatility, exponential
More informationFinite difference method for elliptic problems: I
Finite difference method for elliptic problems: I Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen
More information