Interpolating splines on graphs for data science applications
From MaRDI portal
Publication:778025
DOI10.1016/j.acha.2020.06.001zbMath1442.41001arXiv1806.10695OpenAlexW3033695162MaRDI QIDQ778025
Francis J. Narcowich, Joseph D. Ward, John Paul Ward
Publication date: 30 June 2020
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.10695
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Interpolation in approximation theory (41A05) Spline approximation (41A15)
Related Items
Sobolev orthogonal polynomials on the Sierpinski gasket, Graph signal sampling and interpolation based on clusters and averages, Graph signal interpolation with positive definite graph basis functions, Numerical integration on graphs: Where to sample and how to weigh, Partition of unity methods for signal processing on graphs, Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling, filtering and sparse approximations on combinatorial graphs
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
- Polyharmonic and related kernels on manifolds: interpolation and approximation
- Localized Bases for Kernel Spaces on the Unit Sphere
- Kernel Approximation on Manifolds I: Bounding the Lebesgue Constant
- Wiener’s lemma for infinite matrices
- Sampling in Paley-Wiener spaces on combinatorial graphs
- A sampling theorem on homogeneous manifolds
- Introduction to Analysis on Graphs
- Learning Theory and Kernel Machines
- The penalized Lebesgue constant for surface spline interpolation
- Poincaré and Plancherel--Polya Inequalities in Harmonic Analysis on Weighted Combinatorial Graphs
- Scattered Data Approximation
