On interpolation by generalized planar splines. I: The polynomial case (Q1825386)

Let G be a polygonally bounded region of the complex plane and \(\Delta\) a proper polyangulation of G, i.e. a finite partition \(\{\delta_ j\}\) of closed subregions of G, such that the boundary of each \(\delta_ j\) is a polygon with k vertices (k\(\geq 3)\) and for \(i\neq j\), \(\delta_ i\cap \delta_ j\) is either empty or consists of precisely one point or is the whole lateral edge of both \(\delta_ j\) and \(\delta_ i\). Let \(\{v_ 1,...,v_ n\}\) be a set of linearly independent functions defined on G and on \(\{\) \(z\in C\); \(\bar z\in G\}\). A planar spline of degree n on G with respect to the mesh \(\Delta\) is a function \(s\in C(G)\) which on each element of \(\Delta\) is of the form \(\sum^{n}_{\nu,\mu =0,\nu +\mu \leq n}\alpha_{\nu,\mu}v_{\nu}(z)v_{\mu}(\bar z),\) \(\alpha_{\nu,\mu}\in C.\) The author proves that the problem of interpolation of a function by polynomial planar splines of degree n on the boundaries of the polyangulation has solutions if \(n\geq 3\) and \(k\leq (n+1)(n+2)/2n\) and a unique solution iff \(k=3\) and \(n=1\) or \(k=3\) and \(n=2\). He also proves that the interpolating planar spline converge to the original function as the width of the mesh \(\Delta\) tends to zero. A computational procedure for interpolation on triangles is included.