A Superconvergent Local Discontinuous Galerkin Method for Elliptic Problems

被引:0
|
作者
Slimane Adjerid
Mahboub Baccouch
机构
[1] Virginia Polytechnic Institute and State University,Department of Mathematics
[2] University of Nebraska at Omaha,Department of Mathematics
来源
关键词
Local discontinuous Galerkin method; Elliptic problems; Superconvergence;
D O I
暂无
中图分类号
学科分类号
摘要
In this manuscript we investigate the convergence properties of a minimal dissipation local discontinuous Galerkin(md-LDG) method for two-dimensional diffusion problems on Cartesian meshes. Numerical computations show O(hp+1) \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal{L}^{2}$\end{document} convergence rates for the solution and its gradient and O(hp+2) superconvergent solutions at Radau points on enriched p-degree polynomial spaces. More precisely, a local error analysis reveals that the leading term of the LDG error for a p-degree discontinuous finite element solution is spanned by two (p+1)-degree right Radau polynomials in the x and y directions. Thus, LDG solutions are superconvergent at right Radau points obtained as a tensor product of the shifted roots of the (p+1)-degree right Radau polynomial. For tensor product polynomial spaces, the first component of the solution’s gradient is O(hp+2) superconvergent at tensor product of the roots of left Radau polynomial in x and right Radau polynomial in y while the second component is O(hp+2) superconvergent at the tensor product of the roots of the right Radau polynomial in x and left Radau polynomial in y. Several numerical simulations are performed to validate the theory.
引用
收藏
页码:113 / 152
页数:39
相关论文
共 50 条
  • [31] Overlapping Schwarz domain decomposition preconditioners for the local discontinuous Galerkin method for elliptic problems
    Barker, A. T.
    Brenner, S. C.
    Sung, L. -Y.
    [J]. JOURNAL OF NUMERICAL MATHEMATICS, 2011, 19 (03) : 165 - 187
  • [32] A superconvergent hybridisable discontinuous Galerkin method for linear elasticity
    Sevilla, Ruben
    Giacomini, Matteo
    Karkoulias, Alexandros
    Huerta, Antonio
    [J]. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 2018, 116 (02) : 91 - 116
  • [33] A discontinuous Galerkin method for elliptic interface problems with application to electroporation
    Guyomarc'h, Gregory
    Lee, Chang-Ock
    Jeon, Kiwan
    [J]. COMMUNICATIONS IN NUMERICAL METHODS IN ENGINEERING, 2009, 25 (10): : 991 - 1008
  • [34] A staggered discontinuous Galerkin method for elliptic problems on rectangular grids
    Kim, H. H.
    Jung, C-Y
    Nguyen, T. B.
    [J]. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2021, 99 : 133 - 154
  • [35] Convergence of an adaptive discontinuous Galerkin method for elliptic interface problems
    Cangiani, Andrea
    Georgoulis, Emmanuil H.
    Sabawi, Younis A.
    [J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2020, 367
  • [36] Discontinuous Galerkin methods for elliptic problems
    Arnold, DN
    Brezzi, F
    Cockburn, B
    Marini, D
    [J]. DISCONTINUOUS GALERKIN METHODS: THEORY, COMPUTATION AND APPLICATIONS, 2000, 11 : 89 - 101
  • [37] AN UNFITTED DISCONTINUOUS GALERKIN METHOD APPLIED TO ELLIPTIC INTERFACE PROBLEMS
    Massjung, Ralf
    [J]. SIAM JOURNAL ON NUMERICAL ANALYSIS, 2012, 50 (06) : 3134 - 3162
  • [38] A selective immersed discontinuous Galerkin method for elliptic interface problems
    He, Xiaoming
    Lin, Tao
    Lin, Yanping
    [J]. MATHEMATICAL METHODS IN THE APPLIED SCIENCES, 2014, 37 (07) : 983 - 1002
  • [39] Very high order discontinuous Galerkin method in elliptic problems
    Jaskowiec, Jan
    [J]. COMPUTATIONAL MECHANICS, 2018, 62 (01) : 1 - 21
  • [40] A DISCONTINUOUS GALERKIN REDUCED BASIS ELEMENT METHOD FOR ELLIPTIC PROBLEMS
    Antonietti, Paola F.
    Pacciarini, Paolo
    Quarteroni, Alfio
    [J]. ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE, 2016, 50 (02): : 337 - 360