Discrete least-squares radial basis functions approximations
From MaRDI portal
Publication:2009407
DOI10.1016/j.amc.2019.03.007zbMath1429.65036OpenAlexW2927491829WikidataQ128190360 ScholiaQ128190360MaRDI QIDQ2009407
Siqing Li, Leevan Ling, Ka Chun Cheung
Publication date: 28 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.03.007
Multidimensional problems (41A63) Algorithms for approximation of functions (65D15) Approximation by other special function classes (41A30)
Related Items (3)
On variable and random shape Gaussian interpolations ⋮ A Kernel-Based Least-Squares Collocation Method for Surface Diffusion ⋮ A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sobolev error estimates and a Bernstein inequality for scattered data interpolation via radial basis functions
- Continuous and discrete least-squares approximation by radial basis functions on spheres
- Superconvergence of kernel-based interpolation
- The meshless kernel-based method of lines for parabolic equations
- An extension of a bound for functions in Sobolev spaces, with applications to \((m, s)\)-spline interpolation and smoothing
- Interpolation of spatial data – A stochastic or a deterministic problem?
- Radial Basis Functions
- $H^2$-Convergence of Least-Squares Kernel Collocation Methods
- Sobolev bounds on functions with scattered zeros, with applications to radial basis function surface fitting
- Regularization and Variable Selection Via the Elastic Net
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Scattered Data Approximation
- Approximation
- All well-posed problems have uniformly stable and convergent discretizations
This page was built for publication: Discrete least-squares radial basis functions approximations
