476 research outputs found
Approximation of Eigenfunctions in Kernel-based Spaces
Kernel-based methods in Numerical Analysis have the advantage of yielding
optimal recovery processes in the "native" Hilbert space \calh in which they
are reproducing. Continuous kernels on compact domains have an expansion into
eigenfunctions that are both -orthonormal and orthogonal in \calh
(Mercer expansion). This paper examines the corresponding eigenspaces and
proves that they have optimality properties among all other subspaces of
\calh. These results have strong connections to -widths in Approximation
Theory, and they establish that errors of optimal approximations are closely
related to the decay of the eigenvalues.
Though the eigenspaces and eigenvalues are not readily available, they can be
well approximated using the standard -dimensional subspaces spanned by
translates of the kernel with respect to nodes or centers. We give error
bounds for the numerical approximation of the eigensystem via such subspaces. A
series of examples shows that our numerical technique via a greedy point
selection strategy allows to calculate the eigensystems with good accuracy
Local RBF approximation for scattered data fitting with bivariate splines
In this paper we continue our earlier research [4] aimed at developing effcient methods of local approximation suitable for the first stage of a spline based two-stage scattered data fitting algorithm. As an improvement to the pure polynomial local approximation method used in [5], a hybrid polynomial/radial basis scheme was considered in [4], where the local knot locations for the RBF terms were selected using a greedy knot insertion algorithm. In this paper standard radial local approximations based on interpolation or least squares are considered and a faster procedure is used for knot selection, signicantly reducing the computational cost of the method. Error analysis of the method and numerical results illustrating its performance are given
- …