Metraipolis › archive › dc_e3280bba0bb8
$hp$-adaptive trees for graph signal approximation — arXiv:2609.11701
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11701
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:10:14.725Z
- SHA-256 of the archived text
b9d82b7f6403c190cf464d8b1b7cf89310422c82757e981ef7203f0c57ec2af4- Stable URL of this page
https://metraipolis.com/documento/dc_e3280bba0bb8
How to cite
$hp$-adaptive trees for graph signal approximation — arXiv:2609.11701 — arXiv (en), https://arxiv.org/abs/2609.11701 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e3280bba0bb8 (Metraipolis archive dc_e3280bba0bb8, sha256 b9d82b7f6403c190cf464d8b1b7cf89310422c82757e981ef7203f0c57ec2af4)
BibTeX
@misc{dce3280bba0bb8,
title = {$hp$-adaptive trees for graph signal approximation — arXiv:2609.11701},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11701},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e3280bba0bb8; sha256 b9d82b7f6403c190cf464d8b1b7cf89310422c82757e981ef7203f0c57ec2af4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11701. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Tree-encoded partitionings of graphs are fundamental tools for the decomposition and approximation of graph signals. For the efficient approximation of such graph signals, we develop strategies based on $hp$-refinement by combining domain decomposition with an improved local approximation using polynomials of higher degree. In this way, from a given graph partitioning tree, a more efficient subtree is extracted in which the cost of the signal approximation is considerably reduced by still maintaining the same total error. To this end, we interpret the refinement process as a binary knapsack problem to determine an enhanced partitioning tree. We further study an a-posteriori strategy which prunes the partitioning tree by optimizing the polynomial degrees over the subdomains. To make polynomial basis systems accessible for general graphs or high-dimensional data, we propose local embeddings of graphs into low dimensional Euclidean spaces. We underpin the efficiency of our algorithms with extensive numerical tests which carefully assess the impact of the applied refinements and optimization strategies. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.NA). Categorie arXiv: Signal Processing (eess.SP) ; Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2609.11701 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T05:55:33.354Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).