- Journal Home
- 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
Numerical solution of one-dimensional elliptic problems is investigated using an averaged discontinuous discretization. The corresponding numerical method can be performed using the favorable properties of the discontinuous Galerkin (dG) approach, while for the average an error estimation is obtained in the $H^1$-seminorm. We point out that this average can be regarded as a lower order modification of the average of a well-known overpenalized symmetric interior penalty (IP) method. This allows a natural derivation of the overpenalized IP methods.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/542.html} }Numerical solution of one-dimensional elliptic problems is investigated using an averaged discontinuous discretization. The corresponding numerical method can be performed using the favorable properties of the discontinuous Galerkin (dG) approach, while for the average an error estimation is obtained in the $H^1$-seminorm. We point out that this average can be regarded as a lower order modification of the average of a well-known overpenalized symmetric interior penalty (IP) method. This allows a natural derivation of the overpenalized IP methods.