论文标题
快速定向矩阵矢量乘法的复杂性分析
Complexity Analysis of a Fast Directional Matrix-Vector Multiplication
论文作者
论文摘要
我们考虑了一种快速的，数据帕斯的方向方法，以实现与Helmholtz内核的点评估相关的矩阵矢量产物。该方法基于点集和矩阵的分层分区。即使在高频水平上，也可以在高频水平上应用所考虑的方向多级近似。我们提供了详细的分析所介绍方法的几乎线性渐近复杂性。我们的数值实验与所提供的理论非常吻合。
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.
