Complexity Analysis of a Fast Directional Matrix-Vector Multiplication

@inproceedings{Of2019ComplexityAO,
  title={Complexity Analysis of a Fast Directional Matrix-Vector Multiplication},
  author={G. Of and R. Watschinger},
  booktitle={HPCSE},
  year={2019}
}
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… Expand
1 Citations

References

SHOWING 1-10 OF 17 REFERENCES
Approximation of the high-frequency Helmholtz kernel by nested directional interpolation: error analysis
Adaptive Low-Rank Approximation of Collocation Matrices
Hybrid matrix compression for high-frequency problems
Efficient fast multipole method for low-frequency scattering
Fast directional multilevel summation for oscillatory kernels based on Chebyshev interpolation
Directional H2-matrix compression for high-frequency problems
  • S. Börm
  • Mathematics, Computer Science
  • Numer. Linear Algebra Appl.
  • 2017
Wideband nested cross approximation for Helmholtz problems
A wideband fast multipole method for the Helmholtz equation in three dimensions
Fast Directional Multilevel Algorithms for Oscillatory Kernels
...
1
2
...