- Journal Home
- Volume 22 - 2025
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Cited by
- BibTex
- RIS
- TXT
We develop a multiscale discontinuous Galerkin (DG) method for solving a class of second order elliptic problems with rough coefficients. The main ingredient of this method is to use a non-polynomial multiscale approximation space in the DG method to capture the multiscale solutions using coarse meshes without resolving the fine scale structure of the solution. Theoretical proofs and numerical examples are presented in both one and two dimensions. For one-dimensional problems, optimal error estimates and numerical examples are shown for arbitrary order approximations. For two-dimensional problems, numerical results are presented by the high order multiscale DG method, but the error estimate is proven only for the second order method.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/672.html} }We develop a multiscale discontinuous Galerkin (DG) method for solving a class of second order elliptic problems with rough coefficients. The main ingredient of this method is to use a non-polynomial multiscale approximation space in the DG method to capture the multiscale solutions using coarse meshes without resolving the fine scale structure of the solution. Theoretical proofs and numerical examples are presented in both one and two dimensions. For one-dimensional problems, optimal error estimates and numerical examples are shown for arbitrary order approximations. For two-dimensional problems, numerical results are presented by the high order multiscale DG method, but the error estimate is proven only for the second order method.