Scattered data approximation by positive definite kernel functions
conditioningconvergenceconvolutionsFourier transformleast squares approximationmultivariate approximationmultivariate interpolationnative spacepositive definite kernelreproducing kernelscattered data approximationscattered data fittingstabilityVandermonde matrix
Interpolation in approximation theory (41A05) Approximation by polynomials (41A10) Multidimensional problems (41A63) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Numerical interpolation (65D05) Algorithms for approximation of functions (65D15)
The author presents selected aspects of kernel-based scattered data approximation.NEWLINENEWLINEConcerning Lagrange interpolation, since for any distinct points \(X=\{x_1,\ldots,x_n\}\) the Vandermonde matrix is non singular only in the univariate case, in general for the multivariate case this is not assured. This means that the basis of the \(n\)-dimensional linear function space, where the interpolant of an unknown function \(f\) is looked for, must necessarily depend on the interpolation points \(X\), i.e., it is of the kind \(\{s_j=K(\cdot,x_j),\;1\leq j\leq n\}\). The condition for the Vandermonde matrix to be non singular for all choices of \(X\) is satisfied if \(K(x,y)\) is a symmetric and positive definite function. Then the author describes how to contruct positive definite functions by using the Fourier transform and by convolutions, listing properties and some examples. This ideas have led to the construction of compactly supported positive definite (radial) functions.NEWLINENEWLINESuch a positive definite function \(K\) is also the unique reproducing kernel of its associated Hilbert space, also known as native space of \(K\). Properties of the native space and some examples are discussed.NEWLINENEWLINEThen some approximation properties of this scattered data reconstruction method are presented, showing the optimality of the positive definite kernel-based interpolation scheme with respect to energy minimization, to best approximation and to norm minimization of the pointwise error functionals.NEWLINENEWLINEMoreover, the conditioning of the interpolation problem and the stability of the recovery method are analyzed, providing also some bounds for the associated Lebesgue constant.NEWLINENEWLINEThe last part of the paper is devoted to penalized least squares approximation, an alternative approach for scattered data fitting other than Lagrange interpolation. This kind of approximation is useful for either very large data sets or for data contamined with noise. The well-posedness and the sensitivity of the problem, the unicity and the characterization of the solution and its convergence to the solution of the classical least squares approximation are discussed.
- Conditionally positive definite kernels and Pontryagin spaces
- On interpolation with products of positive definite functions
- Positive definite multi-kernels for scattered data interpolations
- Scattered Data Approximation
- A trade-off principle in connection with the approximation by positive definite kernels
- Optimal selection of local approximants in RBF-PU interpolation
- Image reconstruction from scattered Radon data by weighted positive definite kernel functions
- Generalized regularized least-squares approximation of noisy data with application to stochastic PDEs
- Efficient computation of partition of unity interpolants through a block-based searching technique
- Stabilizing radial basis function methods for conservation laws using weakly enforced boundary conditions
- Positive definite multi-kernels for scattered data interpolations
- Refined error estimates for Green kernel-based interpolation
- A reproducing kernel Hilbert space approach in meshless collocation method
- A numerical algorithm for multidimensional modeling of scattered data points
- Robust approximation algorithms for the detection of attraction basins in dynamical systems
- Towards stability results for global radial basis function based quadrature formulas
- Optimal designs of positive definite kernels for scattered data approximation
- A meshless interpolation algorithm using a cell-based searching procedure
- Conditionally positive definite kernels and Pontryagin spaces
- A trade-off principle in connection with the approximation by positive definite kernels
- scientific article; zbMATH DE number 1284027 (Why is no real title available?)
- scientific article; zbMATH DE number 1303674 (Why is no real title available?)
- scientific article; zbMATH DE number 2015493 (Why is no real title available?)
- scientific article; zbMATH DE number 2020198 (Why is no real title available?)
- Graphical representation of separatrices of attraction basins in two and three-dimensional dynamical systems
- A trivariate interpolation algorithm using a cube-partition searching procedure
- Hierarchical regularization networks for sparsification based learning on noisy datasets
- Kernel Interpolation of High Dimensional Scattered Data
- Reconstruction of volatility surfaces: a first computational study
- Parameter tuning in the radial kernel-based partition of unity method by Bayesian optimization
This page was built for publication: Scattered data approximation by positive definite kernel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898489)
