A novel class of stabilized greedy kernel approximation algorithms: Convergence, stability and uniform point distribution
Authors:
- Tizian WenzelTWTizian Wenzel
- Gabriele SantinGSGabriele Santin
- Bernard HaasdonkBHBernard Haasdonk
- 1 February 2021
- journal article
- research article
- Published by Elsevier in Journal of Approximation Theory
- Vol. 262
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (EXC 2075 - 390740016)
This publication has 23 references indexed in Scilit:
- Greedy Algorithms for Reduced Bases in Banach SpacesConstructive Approximation, 2013
- Stable calculation of Gaussian-based RBF-FD stencilsComputers & Mathematics with Applications, 2013
- A prioriconvergence of the Greedy algorithm for the parametrized reduced basis methodESAIM: Mathematical Modelling and Numerical Analysis, 2012
- Stable Evaluation of Gaussian Radial Basis Function InterpolantsSIAM Journal on Scientific Computing, 2012
- Convergence Rates for Greedy Algorithms in Reduced Basis MethodsSIAM Journal on Mathematical Analysis, 2011
- Stable Computations with Gaussian Radial Basis FunctionsSIAM Journal on Scientific Computing, 2011
- Stability of kernel-based interpolationAdvances in Computational Mathematics, 2008
- A Stable Algorithm for Flat Radial Basis Functions on a SphereSIAM Journal on Scientific Computing, 2008
- Near-optimal data-independent point locations for radial basis function interpolationAdvances in Computational Mathematics, 2005
- Stable computation of multiquadric interpolants for all values of the shape parameterComputers & Mathematics with Applications, 2004