Die Interpolation durch Bernoulli'sche Funktionen
We consider the classical Interpolating Moving Least Squares (IMLS) interpolant as defined by Lancaster and Šalkauskas [Math. Comp. 37 (1981) 141–158] and compute the first and second derivative of this interpolant at the nodes of a given grid with the help of a basic lemma on Shepard interpolants. We compare the difference formulae with those defining optimal finite difference methods and discuss their deviation from optimality.
We consider the classical Interpolating Moving Least Squares (IMLS) interpolant as defined by Lancaster and Šalkauskas [Math. Comp.37 (1981) 141–158] and compute the first and second derivative of this interpolant at the nodes of a given grid with the help of a basic lemma on Shepard interpolants. We compare the difference formulae with those defining optimal finite difference methods and discuss their deviation from optimality.
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
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...