Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
From MaRDI portal
Publication:6635261
DOI10.1016/J.LAA.2024.09.011MaRDI QIDQ6635261FDOQ6635261
Authors: Edward Fuselier, Joseph P. Ward 
Publication date: 9 November 2024
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
- Interpolating splines on graphs for data science applications
- Approximation theorems on graphs
- Graph signal interpolation with positive definite graph basis functions
- Sampling, filtering and sparse approximations on combinatorial graphs
- Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
Lagrange functionsgraph Laplaciangraph basis functionsapproximation on graphsvariational splines on graphs
Applications of graph theory (05C90) Numerical computation using splines (65D07) Spline approximation (41A15)
Cites Work
- Kernels and regularization on graphs.
- Title not available (Why is that?)
- Scattered Data Approximation
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
- Decay estimates of discretized Green's functions for Schrödinger type operators
- Wiener’s lemma for infinite matrices
- Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
- On the effectiveness of Laplacian normalization for graph semi-supervised learning
- A combinatorial Laplacian with vertex weights
- Localized bases for kernel spaces on the unit sphere
- Kernel Approximation on Manifolds I: Bounding the Lebesgue Constant
- An inverse theorem for compact Lipschitz regions in \(\mathbb {R}^d\) using localized kernel bases
- Discrete Green's functions
- Introduction to analysis on graphs
- Interpolating splines on graphs for data science applications
- On the pseudo-inverse of the Laplacian of a bipartite graph
- A Multiscale Pyramid Transform for Graph Signals
- The Moore-Penrose inverse of the normalized graph Laplacian
- On fast computation of directed graph Laplacian pseudo-inverse
- Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
- Nonsubsampled Graph Filter Banks: Theory and Distributed Algorithms
- Splines and wavelets on circulant graphs
This page was built for publication: Locally supported, quasi-interpolatory bases for the approximation of functions on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635261)
