Locally supported, quasi-interpolatory bases for the approximation of functions on graphs

DOI10.1016/J.LAA.2024.09.011MaRDI QIDQ6635261zbMATH OpenFDO

Authors Edward Fuselier, Joseph P. Ward

Publication date 9 November 2024

Published in Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

Lagrange functionsgraph Laplaciangraph basis functionsapproximation on graphsvariational splines on graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Numerical computation using splines (65D07) Spline approximation (41A15)

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

Cites work

• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• A Multiscale Pyramid Transform for Graph Signals
• A combinatorial Laplacian with vertex weights
• An inverse theorem for compact Lipschitz regions in \(\mathbb {R}^d\) using localized kernel bases
• Decay estimates of discretized Green's functions for Schrödinger type operators
• Discrete Green's functions
• Interpolating splines on graphs for data science applications
• Introduction to analysis on graphs
• Kernel Approximation on Manifolds I: Bounding the Lebesgue Constant
• Kernels and regularization on graphs.
• Laplacian eigenvectors of graphs. Perron-Frobenius and Faber-Krahn type theorems
• Laplacian preconditioning of elliptic PDEs: localization of the eigenvalues of the discretized operator
• Localized bases for kernel spaces on the unit sphere
• Nonsubsampled Graph Filter Banks: Theory and Distributed Algorithms
• On fast computation of directed graph Laplacian pseudo-inverse
• On the effectiveness of Laplacian normalization for graph semi-supervised learning
• On the pseudo-inverse of the Laplacian of a bipartite graph
• Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
• Sampling in Paley-Wiener spaces on combinatorial graphs
• Scattered Data Approximation
• Splines and wavelets on circulant graphs
• The Moore-Penrose inverse of the normalized graph Laplacian
• Variational splines and Paley-Wiener spaces on Combinatorial graphs
• Wiener’s lemma for infinite matrices

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)