On the optimality of target-data-dependent kernel greedy interpolation in Sobolev reproducing kernel Hilbert spaces
DOI10.1137/23M1587956MaRDI QIDQ6622686FDOQ6622686
Authors: Gabriele Santin, Tizian Wenzel, B. Haasdonk 
Publication date: 22 October 2024
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Recommendations
- On the convergence of generalized kernel-based interpolation by greedy data selection algorithms
- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- Refined error estimates for Green kernel-based interpolation
- Linearly constrained reconstruction of functions by kernels with applications to machine learning
Numerical interpolation (65D05) Hilbert spaces with reproducing kernels (= (proper) functional Hilbert spaces, including de Branges-Rovnyak and other structured spaces) (46E22) Algorithms for approximation of functions (65D15) Applications of functional analysis in numerical analysis (46N40)
Cites Work
- Scattered Data Approximation
- Adaptive greedy techniques for approximate solution of large RBF systems
- Title not available (Why is that?)
- Some remarks on greedy algorithms
- Greedy approximation
- Title not available (Why is that?)
- Convergence rates for greedy algorithms in reduced basis methods
- Near-optimal data-independent point locations for radial basis function interpolation
- Polynomial interpolation and approximation in \(\mathbb C^d\)
- Title not available (Why is that?)
- Sampling inequalities for infinitely smooth functions, with applications to interpolation and machine learning
- Entropy numbers, s-numbers, and eigenvalue problems
- A Newton basis for kernel spaces
- Error estimates and condition numbers for radial basis function interpolation
- Approximation of eigenfunctions in kernel-based spaces
- Bases for kernel-based spaces
- Greedy algorithms for reduced bases in Banach spaces
- Metric entropy of convex hulls
- Polynomial interpolation of holomorphic functions in \(\mathbb{C}\) and \(\mathbb{C}^ n\)
- A short note on the comparison of interpolation widths, entropy numbers, and Kolmogorov widths
- Theory of reproducing kernels and applications
- Kernel-based interpolation at approximate Fekete points
- Approximation theory and algorithms for data analysis
- Convergence rate of the data-independent \(P\)-greedy algorithm in kernel-based approximation
- Recovering missing CFD data for high-order discretizations using deep neural networks and dynamics learning
- Comparison of data-driven uncertainty quantification methods for a carbon dioxide storage benchmark scenario
- A novel class of stabilized greedy kernel approximation algorithms: convergence, stability and uniform point distribution
- A greedy non-intrusive reduced order model for shallow water equations
- Equally spaced points are optimal for Brownian Bridge kernel interpolation
- A full order, reduced order and machine learning model pipeline for efficient prediction of reactive flows
- Analysis of target data-dependent greedy kernel algorithms: convergence rates for \(f\)-, \(f \cdot P\)- and \(f/P\)-greedy
- Small errors imply large evaluation instabilities
- A New Certified Hierarchical and Adaptive RB-ML-ROM Surrogate Model for Parametrized PDEs
- Sharp Bounds on the Approximation Rates, Metric Entropy, and n-Widths of Shallow Neural Networks
- Entropy-based convergence rates of greedy algorithms
This page was built for publication: On the optimality of target-data-dependent kernel greedy interpolation in Sobolev reproducing kernel Hilbert spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622686)
