Interpolation error estimates in terms of geometric quality measures are established for harmonic coordinates on polytopes in two and three dimensions. First we derive interpolation error estimates over convex polygons that depend on the geometric quality of the triangles in the constrained Delaunay triangulation of the polygon. This characterization is sharp in the sense that families of polygons with poor quality triangles in their constrained Delaunay triangulations are shown to produce large error when interpolating a basic quadratic function. Non-convex polygons exhibit a similar limitation: large constrained Delaunay triangles caused by vertices approaching a non-adjacent edge also lead to large interpolation error. While this relationship is generalized to convex polyhedra in three dimensions, the possibility of sliver tetrahedra in the constrained Delaunay triangulation prevent the analogous estimate from sharply reflecting the actual interpolation error. Non-convex polyhedra are shown to be fundamentally different through an example of a family of polyhedra containing vertices which are arbitrarily close to non-adjacent faces yet the interpolation error remains bounded.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/621355 |
| Date | 06 1900 |
| Creators | Gillette, Andrew, Rand, Alexander |
| Contributors | Univ Arizona, Dept Math |
| Publisher | EDP SCIENCES S A |
| Source Sets | University of Arizona |
| Language | English |
| Detected Language | English |
| Type | Article |
| Rights | © EDP Sciences, SMAI 2016 |
| Relation | http://www.esaim-m2an.org/articles/m2an/abs/2016/03/m2an150060/m2an150060.html |
Page generated in 0.0017 seconds