TY - JOUR
T1 - Discontinuous galerkin method in time combined with a stabilized finite element method in space for linear first-order PDEs
AU - Ern, Alexandre
AU - Schieweck, Friedhelm
N1 - Publisher Copyright:
© 2016 American Mathematical Society.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - We analyze the discontinuous Galerkin method in time combined with a finite element method with symmetric stabilization in space to approximate evolution problems with a linear, first-order differential operator. A unified analysis is presented for space discretization, including the discontinuous Galerkin method and H1-conforming finite elements with interior penalty on gradient jumps. Our main results are error estimates in various norms for smooth solutions. Two key ingredients are the post-processing of the fully discrete solution by lifting its jumps in time and a new time-interpolate of the exact solution. We first analyze the L∞(L2) (at discrete time nodes) and L2(L2) errors and derive a superconvergent bound of order (τk+2 + hr+1/2) for static meshes for k ≥ 1. Here, τ is the time step, k the polynomial order in time, h the size of the space mesh, and r the polynomial order in space. For the case of dynamically changing meshes, we derive a novel bound on the resulting projection error. Finally, we prove new optimal bounds on static meshes for the error in the time-derivative and in the discrete graph norm.
AB - We analyze the discontinuous Galerkin method in time combined with a finite element method with symmetric stabilization in space to approximate evolution problems with a linear, first-order differential operator. A unified analysis is presented for space discretization, including the discontinuous Galerkin method and H1-conforming finite elements with interior penalty on gradient jumps. Our main results are error estimates in various norms for smooth solutions. Two key ingredients are the post-processing of the fully discrete solution by lifting its jumps in time and a new time-interpolate of the exact solution. We first analyze the L∞(L2) (at discrete time nodes) and L2(L2) errors and derive a superconvergent bound of order (τk+2 + hr+1/2) for static meshes for k ≥ 1. Here, τ is the time step, k the polynomial order in time, h the size of the space mesh, and r the polynomial order in space. For the case of dynamically changing meshes, we derive a novel bound on the resulting projection error. Finally, we prove new optimal bounds on static meshes for the error in the time-derivative and in the discrete graph norm.
KW - Discontinuous galerkin in time
KW - Dynamic meshes
KW - First-order PDEs
KW - Graph norm error estimates
KW - Stabilized FEM
KW - Superconvergence
UR - https://www.scopus.com/pages/publications/84976340179
U2 - 10.1090/mcom/3073
DO - 10.1090/mcom/3073
M3 - Article
AN - SCOPUS:84976340179
SN - 0025-5718
VL - 85
SP - 2099
EP - 2129
JO - Mathematics of Computation
JF - Mathematics of Computation
IS - 301
ER -