𝓗² Trees

The H2Trees package provides a Julia implementation of tree data structures and algorithms for efficient computation in the context of 𝓗² methods.

H2Trees builds upon ideas from ClusterTrees and provides a range of tree data structures, including:

• TwoNTree: A 2ⁿ-tree data structure for organizing points in ℝⁿ.
• SimpleHybridTree: A tree data structure that splits a tree
• BoundingBallTree: A tree data structure using bounding balls.

The H2Trees package provides a range of features, including

• Aggregation and disaggregation: Plans for implementing aggregation and disaggregation algorithms for efficient computation.
• Computation of translations: Algorithms for computing translations between different tree levels.
• Plotting: An interface to PlotlyJS.jl for visualizing tree data structures.
• Interface to BEAST: An interface to the BEAST package for clustering of basis functions.

Goals

The primary goal of the H2Trees package is to provide an efficient and flexible framework for computing 𝓗² methods, and related quantities. The package aims to provide a range of features and tools for working with tree data structures, including aggregation, disaggregation, and plotting.

Related Packages

The H2Trees package is related to the following packages:

• ClusterTrees
• BEAST
• H2Factory
• MLFMA
• iFMM
• HybridFMM

Documentation

This documentation provides an overview of the H2Trees package, including its features, goals, and related packages. For more information, please see the individual documentation pages for each module and function.