hp-adaptive trees for graph signal approximation

DOI10.48550/arXiv.2609.11701MaRDI QIDQ7345528arXivFDO

Authors Giacomo Elefante, Michael Peters, Wolfgang Erb, Michael Multerer

Publication date 10 September 2026

Published in arXiv

Tldr We develop $hp$-refinement strategies for tree-encoded partitionings of graphs to achieve efficient approximation of graph signals, where we interpret the refinement process as a binary knapsack problem and propose an a-posteriori strategy that optimizes polynomial degrees over subdomains.

Full work available at URL https://doi.org/10.48550/arXiv.2609.11701

arXiv classification

eess.SPmath.NA

Cites work

• A comparison of hp-adaptive strategies for elliptic partial differential equations
• Adaptive Multivariate Approximation Using Binary Space Partitions and Geometric Wavelets
• Classification And Regression Trees
• Convergence of quasi-optimal sparse-grid approximation of Hilbert-space-valued functions: Application to random elliptic PDEs
• Diffusion wavelets
• Efficient Moment Computation over Polygonal Domains with an Application to Rapid Wedgelet Approximation
• Fast computation in adaptive tree approximation
• Fast high-dimensional approximation with sparse occupancy trees
• Generalized Tree-Based Wavelet Transform
• Graph Signal Processing: Overview, Challenges, and Applications
• Graph Wedgelets: Adaptive Data Compression on Graphs based on Binary Wedge Partitioning Trees and Geometric Wavelets
• Hierarchical graph Laplacian eigen transforms
• Introduction to graph signal processing
• Nonlinear Dimensionality Reduction
• Nonlinear piecewise polynomial approximation beyond Besov spaces
• On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods
• Optimising linear key recovery attacks with affine Walsh transform pruning
• Perfect Reconstruction Two-Channel Wavelet Filter Banks for Graph Structured Data
• Samplets: construction and scattered data compression
• The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
• Thepandh-pVersions of the Finite Element Method, Basic Principles and Properties
• Tree approximation for hp-adaptivity
• UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
• Visualizing data using t-SNE
• Wavelets on graphs via spectral graph theory
• Wedgelets: Nearly minimax estimation of edges

This page was built for publication: $hp$-adaptive trees for graph signal approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7345528)