$hp$-adaptive trees for graph signal approximation (Q7345528)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | $hp$-adaptive trees for graph signal approximation |
No description defined |
Statements
$hp$-adaptive trees for graph signal approximation (English)
0 references
10 September 2026
0 references
eess.SP
0 references
math.NA
0 references
Giacomo Elefante
0 references
Wolfgang Erb
0 references
Michael Multerer
0 references
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.
0 references
Graph Signal
0 references
hp-adaptive Trees
0 references
Polynomial Approximation
0 references
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
1 reference
