- 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
In the natural element method (NEM), the Laplace interpolation error estimate on
convex planar polygons is proved in this study. The proof is based on bounding gradients of the
Laplace interpolation for convex polygons which satisfy certain geometric requirements, and has
been divided into several parts that each part is bounded by a constant. Under the given geometric
assumptions, the optimal convergence estimate is obtained. This work provides the mathematical
analysis theory of the NEM. Some numerical examples are selected to verify our theoretical result.
In the natural element method (NEM), the Laplace interpolation error estimate on
convex planar polygons is proved in this study. The proof is based on bounding gradients of the
Laplace interpolation for convex polygons which satisfy certain geometric requirements, and has
been divided into several parts that each part is bounded by a constant. Under the given geometric
assumptions, the optimal convergence estimate is obtained. This work provides the mathematical
analysis theory of the NEM. Some numerical examples are selected to verify our theoretical result.