Eberlein integral and polynomial interpolation
We present a new method for generating a d-dimensional simplicial mesh that minimizes the Lp-norm, p > 0, of the interpolation error or its gradient. The method uses edge-based error estimates to build a tensor metric. We describe and analyze the basic steps of our method
In an error estimation of finite element solutions to the Poisson equation, we usually impose the shape regularity assumption on the meshes to be used. In this paper, we show that even if the shape regularity condition is violated, the standard error estimation can be obtained if ``bad'' elements that violate the shape regularity or maximum angle condition are covered virtually by simplices that satisfy the minimum angle condition. A numerical experiment illustrates the theoretical result.
We consider the error analysis of Lagrange interpolation on triangles and tetrahedrons. For Lagrange interpolation of order one, Babuška and Aziz showed that squeezing a right isosceles triangle perpendicularly does not deteriorate the optimal approximation order. We extend their technique and result to higher-order Lagrange interpolation on both triangles and tetrahedrons. To this end, we make use of difference quotients of functions with two or three variables. Then, the error estimates on squeezed...