arXiv · 2611.10466
The Fast Tree Transform
Abstract
The Fast Tree Transform is a locally-aggregated transform defined for arbitrary graph geometries that generalizes both the Hadamard frequency transform and the Haar wavelet transform on the circle. The pure frequency part of the transform approximately diagonalizes the graph Laplacian; this fact makes it useful as a preconditioner in geometric optimization problems. The full transform provides an only slightly-redundant representation of signals on the graph that allows sparse representation of signals that include both edges and textures.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Paul Burchard. 2026-11-07. The Fast Tree Transform. https://searcharxiv.com/abs/2611.10466
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.