Complexity Analysis of a Fast Directional Matrix-Vector Multiplication
Numerical Analysis
2021-01-08 v2 Numerical Analysis
Abstract
We consider a fast, data-sparse directional method to realize matrix-vector products related to point evaluations of the Helmholtz kernel. The method is based on a hierarchical partitioning of the point sets and the matrix. The considered directional multi-level approximation of the Helmholtz kernel can be applied even on high-frequency levels efficiently. We provide a detailed analysis of the almost linear asymptotic complexity of the presented method. Our numerical experiments are in good agreement with the provided theory.
Cite
@article{arxiv.2004.14229,
title = {Complexity Analysis of a Fast Directional Matrix-Vector Multiplication},
author = {Günther Of and Raphael Watschinger},
journal= {arXiv preprint arXiv:2004.14229},
year = {2021}
}
Comments
20 pages, 2 figures, 1 table