15,543 research outputs found
Scattered Data Interpolation on Embedded Submanifolds with Restricted Positive Definite Kernels: Sobolev Error Estimates
In this paper we investigate the approximation properties of kernel
interpolants on manifolds. The kernels we consider will be obtained by the
restriction of positive definite kernels on , such as radial basis
functions (RBFs), to a smooth, compact embedded submanifold \M\subset \R^d.
For restricted kernels having finite smoothness, we provide a complete
characterization of the native space on \M. After this and some preliminary
setup, we present Sobolev-type error estimates for the interpolation problem.
Numerical results verifying the theory are also presented for a one-dimensional
curve embedded in and a two-dimensional torus
Image reconstruction from scattered Radon data by weighted positive definite kernel functions
We propose a novel kernel-based method for image reconstruction from scattered Radon data. To this end, we employ generalized Hermite–Birkhoff interpolation by positive definite kernel functions. For radial kernels, however, a straightforward application of the generalized Hermite–Birkhoff interpolation method fails to work, as we prove in this paper. To obtain a well-posed reconstruction scheme for scattered Radon data, we introduce a new class of weighted positive definite kernels, which are symmetric but not radially symmetric. By our construction, the resulting weighted kernels are combinations of radial positive definite kernels and positive weight functions. This yields very flexible image reconstruction methods, which work for arbitrary distributions of Radon lines. We develop suitable representations for the weighted basis functions and the symmetric positive definite kernel matrices that are resulting from the proposed reconstruction scheme. For the relevant special case, where Gaussian radial kernels are combined with Gaussian weights, explicit formulae for the weighted Gaussian basis functions and the kernel matrices are given. Supporting numerical examples are finally presented
Error estimates for interpolation of rough data using the scattered shifts of a radial basis function
The error between appropriately smooth functions and their radial basis
function interpolants, as the interpolation points fill out a bounded domain in
R^d, is a well studied artifact. In all of these cases, the analysis takes
place in a natural function space dictated by the choice of radial basis
function -- the native space. The native space contains functions possessing a
certain amount of smoothness. This paper establishes error estimates when the
function being interpolated is conspicuously rough.Comment: 12 page
Error bound for radial basis interpolation in terms of a growth function
We suggest an improvement of Wu-Schaback local error bound for radial basis interpolation by using a polynomial growth function. The new bound is valid without any assumptions about the density of the interpolation centers. It can be useful for the localized methods of scattered data fitting and for the meshless discretization of partial differential equation
Extending the range of error estimates for radial approximation in Euclidean space and on spheres
We adapt Schaback's error doubling trick [R. Schaback. Improved error bounds
for scattered data interpolation by radial basis functions. Math. Comp.,
68(225):201--216, 1999.] to give error estimates for radial interpolation of
functions with smoothness lying (in some sense) between that of the usual
native space and the subspace with double the smoothness. We do this for both
bounded subsets of R^d and spheres. As a step on the way to our ultimate goal
we also show convergence of pseudoderivatives of the interpolation error.Comment: 10 page
Two-dimensional interpolation using a cell-based searching procedure
In this paper we present an efficient algorithm for bivariate interpolation,
which is based on the use of the partition of unity method for constructing a
global interpolant. It is obtained by combining local radial basis function
interpolants with locally supported weight functions. In particular, this
interpolation scheme is characterized by the construction of a suitable
partition of the domain in cells so that the cell structure strictly depends on
the dimension of its subdomains. This fact allows us to construct an efficient
cell-based searching procedure, which provides a significant reduction of CPU
times. Complexity analysis and numerical results show such improvements on the
algorithm performances
A trivariate interpolation algorithm using a cube-partition searching procedure
In this paper we propose a fast algorithm for trivariate interpolation, which
is based on the partition of unity method for constructing a global interpolant
by blending local radial basis function interpolants and using locally
supported weight functions. The partition of unity algorithm is efficiently
implemented and optimized by connecting the method with an effective
cube-partition searching procedure. More precisely, we construct a cube
structure, which partitions the domain and strictly depends on the size of its
subdomains, so that the new searching procedure and, accordingly, the resulting
algorithm enable us to efficiently deal with a large number of nodes.
Complexity analysis and numerical experiments show high efficiency and accuracy
of the proposed interpolation algorithm
- …