Error estimates for harmonic and biharmonic interpolation splines with annular geometry

preprint2022arXivOpen access

Abstract

The main result in this paper is an error estimate for interpolation biharmonic polysplines in an annulus A(r1,rN)A\left( r_{1},r_{N}\right) , with respect to a partition by concentric annular domains A(r1,r2),A\left( r_{1} ,r_{2}\right) , ...., A(rN−1,rN),A\left( r_{N-1},r_{N}\right) , for radii 0<r1<....<rN.0<r_{1}<....<r_{N}. The biharmonic polysplines interpolate a smooth function on the spheres ∣x∣=rj\left\vert x\right\vert =r_{j} for j=1,...,Nj=1,...,N and satisfy natural boundary conditions for ∣x∣=r1\left\vert x\right\vert =r_{1} and ∣x∣=rN.\left\vert x\right\vert =r_{N}. By analogy with a technique in one-dimensional spline theory established by C. de Boor, we base our proof on error estimates for harmonic interpolation splines with respect to the partition by the annuli A(rj−1,rj)A\left( r_{j-1},r_{j}\right) . For these estimates it is important to determine the smallest constant c(Ω),c\left( Ω\right) , where Ω=A(rj−1,rj),Ω=A\left( r_{j-1},r_{j}\right) , among all constants cc satisfying sup⁡x∈Ω∣f(x)∣≤csup⁡x∈Ω∣Δf(x)∣ \sup_{x\inΩ}\left\vert f\left( x\right) \right\vert \leq c\sup _{x\inΩ}\left\vert Δf\left( x\right) \right\vert for all f∈C2(Ω)∩C(Ω‾)f\in C^{2}\left( Ω\right) \cap C\left( \overline{Ω}\right) vanishing on the boundary of the bounded domain ΩΩ . In this paper we describe c(Ω)c\left( Ω\right) for an annulus Ω=A(r,R)Ω=A\left( r,R\right) and we will give the estimate min⁡{12d,18}(R−r)2≤c(A(r,R))≤max⁡{12d,18}(R−r)2 \min\{\frac{1}{2d},\frac{1}{8}\}\left( R-r\right) ^{2}\leq c\left( A\left( r,R\right) \right) \leq\max\{\frac{1}{2d},\frac{1}{8}\}\left( R-r\right) ^{2}% where dd is the dimension of the underlying space.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.