Data-sparse approximation of non-local operators by \(\mathcal H^2\)-matrices
\(\mathcal{H}^{2}\)-matrices employ nested local expansion systems in order to approximate matrices in optimal order of complexity. This paper presents a criterion for the approximability of general matrices in the \(\mathcal{H}^{2}\)-matrix format and an algorithm for finding good nested expansion systems and constructing the approximation efficiently.
scientific article; zbMATH DE number 5141621