Efficient Algorithms for Adaptive Multiplication of Rank-Structured Matrices

This article presents new algorithms for efficiently approximating the product of two H2-matrices, which can represent densely populated matrices using local low-rank approximations. The key idea is to first construct an intermediate representation of the exact product using induced cluster bases, and then compress this representation into a final H2-matrix form while preserving the given accuracy.