Abstract
In this article, a staggered discontinuous Galerkin (SDG) approximation on rectangular meshes for elliptic problems in two dimensions is constructed and analyzed. The optimal convergence results with respect to discrete L2 and H1 norms are theoretically proved. Some numerical evidences to verify the optimal convergence rates are presented. Several numerical examples to the elliptic singularly perturbed problems with sharp boundary or interior layers are presented to show that the proposed SDG method is very effective, stable and accurate. Thanks to the simple structure of rectangular meshes, the discrete gradients across the boundaries of rectangular elements are easily defined, making numerical implementation much easier. The idea of using the rectangular meshes will be extended to more practical problems on a curved domain in future works.
| Original language | English |
|---|---|
| Pages (from-to) | 133-154 |
| Number of pages | 22 |
| Journal | Computers and Mathematics with Applications |
| Volume | 99 |
| DOIs | |
| Publication status | Published - Oct 2021 |
Bibliographical note
Publisher Copyright:© 2021 Elsevier Ltd
Keywords
- Boundary and interior layers
- Convergence analysis
- Elliptic problems
- Finite volume methods
- Rectangular meshes
- Staggered discontinuous Galerkin methods
Fingerprint
Dive into the research topics of 'A staggered discontinuous Galerkin method for elliptic problems on rectangular grids'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver