Directional H^2-matrix compression for high-frequency problems.

From MaRDI portal
Publication:4599029



Abstract: Standard numerical algorithms like the fast multipole method or mathcalH-matrix schemes rely on low-rank approximations of the underlying kernel function. For high-frequency problems, the ranks grow rapidly as the mesh is refined, and standard techniques are no longer attractive. Directional compression techniques solve this problem by using decompositions based on plane waves. Taking advantage of hierarchical relations between these waves' directions, an efficient approximation is obtained. This paper is dedicated to directional mathcalH2-matrices that employ local low-rank approximations to handle directional representations efficiently. The key result is an algorithm that takes an arbitrary matrix and finds a quasi-optimal approximation of this matrix as a directional mathcalH2-matrix using a prescribed block tree. The algorithm can reach any given accuracy, and the approximation requires only mathcalO(nk+kappa2k2logn) units of storage, where n is the matrix dimension, kappa is the wave number, and k is the local rank. In particular, we have a complexity of mathcalO(nk) if kappa is constant and mathcalO(nk2logn) for high-frequency problems characterized by kappa2simn. Since the algorithm can be applied to arbitrary matrices, it can serve as the foundation of fast techniques for constructing preconditioners.





Cited in
(22)








This page was built for publication: Directional \(\mathcal{H}^2\)-matrix compression for high-frequency problems.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599029)