Related papers: On thin plate spline interpolation
Adaptive approximation (or interpolation) takes into account local variations in the behavior of the given function, adjusts the approximant depending on it, and hence yields the smaller error of approximation. The question of constructing…
The joint bidiagonalization process of a matrix pair $\{A,L\}$ can be used to develop iterative regularization algorithms for large scale ill-posed problems in general-form Tikhonov regularization…
We give a solution to Pick's interpolation problem on the unit polydisc in $\mathbb{C}^n$, $n\geq 2$, by characterizing all interpolation data that admit a $\mathbb{D}$-valued interpolant, in terms of a family of positive-definite kernels…
Spline interpolation has been used in several applications due to its favorable properties regarding smoothness and accuracy of the interpolant. However, when there exists a discontinuity or a steep gradient in the data, some artifacts can…
In this paper we investigate the problem of interpolating a B-spline curve network, in order to create a surface satisfying such a constraint and defined by blending functions spanning the space of bivariate $C^1$ quadratic splines on…
Thin-plate spline (TPS) is a principal warp that allows for representing elastic, nonlinear transformation with control point motions. With the increase of control points, the warp becomes increasingly flexible but usually encounters a…
In our earlier work [8], we approximated solutions of a general class of scalar parabolic semilinear PDEs by an interpolatory hybridizable discontinuous Galerkin (Interpolatory HDG) method. This method reduces the computational cost…
In the present paper, using S.L. Sobolev's method, interpolation spline that minimizes the expression $\int_0^1(\varphi^{(m)}(x)+\omega^2\varphi^{(m-2)}(x))^2dx$ in the $K_2(P_m)$ space are constructed. Explicit formulas for the…
We investigate the problem of approximating the matrix function $f(A)$ by $r(A)$, with $f$ a Markov function, $r$ a rational interpolant of $f$, and $A$ a symmetric Toeplitz matrix. In a first step, we obtain a new upper bound for the…
We study in this paper the function approximation error of linear interpolation and extrapolation. Several upper bounds are presented along with the conditions under which they are sharp. All results are under the assumptions that the…
We present a new Monte Carlo algorithm for the interpolation of a straight-line program as a sparse polynomial $f$ over an arbitrary finite field of size $q$. We assume a priori bounds $D$ and $T$ are given on the degree and number of terms…
A thin plate spline surface for interpolation of smooth transfinite data prescribed along concentric circles was recently proposed by Bejancu, using Kounchev's polyspline method. The construction of the new `Beppo Levi polyspline' surface…
Singular and oscillatory functions feature in numerous applications. The high-accuracy approximation of such functions shall greatly help us develop high-order methods for solving applied mathematics problems. This paper demonstrates that…
We consider a wide class of semi linear Hamiltonian partial differential equa- tions and their approximation by time splitting methods. We assume that the nonlinearity is polynomial, and that the numerical tra jectory remains at least uni-…
A general theory for obtaining anisotropic interpolation error estimates for macro-element interpolation is developed revealing general construction principles. We apply this theory to interpolation operators on a macro type of biquadratic…
In the error analysis of finite element methods, the shape regularity assumption on triangulations is typically imposed to obtain a priori error estimations. In practical computations, however, very thin or degenerated elements that violate…
Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For…
This paper proposes an image interpolation algorithm exploiting sparse representation for natural images. It involves three main steps: (a) obtaining an initial estimate of the high resolution image using linear methods like FIR filtering,…
The paper proposes a general quasi-interpolation scheme for high-dimensional function approximation. To facilitate error analysis, we view our quasi-interpolation as a two-step procedure. In the first step, we approximate a target function…
In the article the formulas for the modeling of conservative fields in piecewise infinite plate with a thin inclusion found. The accuracy of the found formulas is of order equal to the thickness of the outer layer. The problem for higher…