Metraipolis › archive › dc_b35d2f43983c
A Geometric View of Adaptive Cross Approximation via Exterior Algebra — arXiv:2609.17947
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.17947
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T15:48:50.787Z
- SHA-256 of the archived text
df6cf2c616d4bab15574531f34f30eb267af3f3e74238ff24f297eedb8a5eee6- Stable URL of this page
https://metraipolis.com/documento/dc_b35d2f43983c
How to cite
A Geometric View of Adaptive Cross Approximation via Exterior Algebra — arXiv:2609.17947 — arXiv (en), https://arxiv.org/abs/2609.17947 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b35d2f43983c (Metraipolis archive dc_b35d2f43983c, sha256 df6cf2c616d4bab15574531f34f30eb267af3f3e74238ff24f297eedb8a5eee6)
BibTeX
@misc{dcb35d2f43983c,
title = {A Geometric View of Adaptive Cross Approximation via Exterior Algebra — arXiv:2609.17947},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.17947},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b35d2f43983c; sha256 df6cf2c616d4bab15574531f34f30eb267af3f3e74238ff24f297eedb8a5eee6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.17947. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Adaptive cross approximation (ACA) constructs low-rank CUR approximations from selected rows and columns of a matrix, making it attractive when individual entries are inexpensive to query but forming or repeatedly multiplying by the full matrix is not. Its practical performance, however, is not well explained by existing worst-case bounds, which can be exponentially large and often fail to predict when greedy largest-entry pivoting performs poorly. By viewing the matrix as a cross-gram matrix, we reinterpret the classical determinantal formula for the CUR residual through the lens of exterior algebra. In this representation, each residual entry is a weighted inner product between two $(k+1)$-blades divided by the normalized volume of the pivot block. The formula separates three effects: the weighted magnitudes of singular-vector rows, their angular geometry, and the conditioning of the selected pivots. From this we recover a classical $\sigma_{k+1}$-type estimate, characterize when one pivot annihilates or nearly annihilates additional rows and columns, obtain a quasi-optimality estimate for positive-semidefinite matrices, and bound the rank-one update through an explicit angle-based formula. We use this framework to explain the failure of greedy ACA on an asymmetric spiral-kernel example and to motivate a geometry-aware weighted-mass pivoting rule for radial-basis Galerkin stiffness matrices. In the reported experiments, weighted-mass pivoting often reduces the Frobenius residual relative to greedy pivoting and randomly pivoted Cholesky while retaining comparable runtime on parallel hardware.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2609.17947 — 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-15T15:09:07.954Z dalla pagina https://arxiv.org/catchup/math.NA/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).