Partition of unity methods for signal processing on graphs
From MaRDI portal
Publication:2048685
DOI10.1007/s00041-021-09871-wzbMath1473.65054arXiv2012.10636OpenAlexW3185406869MaRDI QIDQ2048685
Wolfgang Erb, Alessandra De Rossi, Roberto Cavoretto
Publication date: 23 August 2021
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.10636
partition of unity methodspectral graph theorygraph signal processinggraph basis functionskernel-based approximation and interpolation
Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical linear algebra (65F99)
Related Items
Overview of the topical collection: harmonic analysis on combinatorial graphs ⋮ A locally stabilized radial basis function partition of unity technique for the sine-Gordon system in nonlinear optics ⋮ An efficient localized meshless collocation method for the two-dimensional Burgers-type equation arising in fluid turbulent flows ⋮ Adaptive residual Refinement in an RBF Finite difference scheme for 2D time-dependent problems ⋮ An RBF-PUM finite difference scheme for forward-backward heat equation ⋮ Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Interpolating splines on graphs for data science applications
- Graph signal sampling and interpolation based on clusters and averages
- Vertex-frequency analysis on graphs
- Clustering to minimize the maximum intercluster distance
- The partition of unity finite element method: basic theory and applications
- Optimal selection of local approximants in RBF-PU interpolation
- Adaptive meshless refinement schemes for RBF-PUM collocation
- On the search of the shape parameter in radial basis functions using univariate global optimization methods
- Error indicators and refinement strategies for solving Poisson problems through a RBF partition of unity collocation scheme
- Local smoothness of graph signals
- Spatially distributed sampling and reconstruction
- Sampling in Paley-Wiener spaces on combinatorial graphs
- A Best Possible Heuristic for the k-Center Problem
- Matrix Analysis
- A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
- A Least Squares Radial Basis Function Partition of Unity Method for Solving PDEs
- Kernel-Based Reconstruction of Graph Signals
- Shapes of Uncertainty in Spectral Graph Theory
- Sampling by Averages and Average Splines on Dirichlet Spaces and on Combinatorial Graphs
- Learning Theory and Kernel Machines
- Theory of Reproducing Kernels
- Scattered Data Approximation