Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs
From MaRDI portal
Publication:982550
DOI10.1016/j.acha.2009.08.008zbMath1283.42054OpenAlexW2034303971MaRDI QIDQ982550
Publication date: 7 July 2010
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2009.08.008
eigenvalueeigenfunctionRayleigh-Ritz methodvariational splinescombinatorial graphcombinatorial Laplace operator
Related Items (6)
Approximation theorems on graphs ⋮ Half sampling on bipartite graphs ⋮ Sampling, filtering and sparse approximations on combinatorial graphs ⋮ Eigenmaps and minimal and bandlimited immersions of graphs into Euclidean spaces ⋮ A Sheaf-Theoretic Perspective on Sampling ⋮ Interpolating splines on graphs for data science applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling, filtering and sparse approximations on combinatorial graphs
- An approach to spectral problems on Riemannian manifolds
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Discrete tomography. Foundations, algorithms, and applications
- Eigenmaps and minimal and bandlimited immersions of graphs into Euclidean spaces
- Diffusion wavelets
- Diffusion wavelet packets
- Polynomial splines and eigenvalue approximations on quantum graphs
- Sampling in Paley-Wiener spaces on combinatorial graphs
- Learning Theory
- Learning Theory
- Rayleigh-Ritz Approximation by Piecewise Cubic Polynomials
- Smooth Surface Interpolation
This page was built for publication: Removable sets and approximation of eigenvalues and eigenfunctions on combinatorial graphs