Papers › Adaptive Cross Approximation with a Geometrical Pivot Choice: ACA-GP Method
Adaptive Cross Approximation with a Geometrical Pivot Choice: ACA-GP Method
Vladislav A. Yastrebov, Camille Noûs
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The Adaptive Cross Approximation (ACA) method is widely used to approximate admissible blocks of hierarchical matrices, or H-matrices, from discretized operators in the boundary integral method. These matrices are fully populated, making their storage and manipulation resource-intensive. ACA constructs a low-rank approximation by evaluating only a few rows and columns of the original operator, significantly reducing computational costs. A key aspect of ACA's effectiveness is the selection of pivots, which are entries common to the evaluated row and column of the original matrix. This paper proposes combining the classical, purely algebraic ACA method with a geometrical pivot selection based on the central subsets and extreme property subsets. The method is named ACA-GP, GP stands for Geometrical Pivots. The superiority of the ACA-GP compared to the classical ACA is demonstrated using a classical Green operator for two clouds of interacting points.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections