Complexity Analysis of a Fast Directional Matrix-Vector Multiplication

04/29/2020
by   Günther Of, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2020

Sparse Approximate Multifrontal Factorization with Butterfly Compression for High Frequency Wave Equations

We present a fast and approximate multifrontal solver for large-scale sp...
research
11/15/2020

Efficient construction of an HSS preconditioner for symmetric positive definite ℋ^2 matrices

In an iterative approach for solving linear systems with ill-conditioned...
research
03/07/2023

A nearly optimal explicitly-sparse representation for oscillatory kernels with curvelet-like functions

A nearly optimal explicitly-sparse representation for oscillatory kernel...
research
12/31/2021

Fast ultrametric matrix-vector multiplication

We study the properties of ultrametric matrices aiming to design methods...
research
03/06/2019

PBBFMM3D: a parallel black-box algorithm for kernel matrix-vector multiplication

We introduce PBBFMM3D, a parallel black-box method for computing kernel ...
research
04/30/2023

Multi-directional Sobel operator kernel on GPUs

Sobel is one of the most popular edge detection operators used in image ...
research
02/10/2022

A Directional Equispaced interpolation-based Fast Multipole Method for oscillatory kernels

Fast Multipole Methods (FMMs) based on the oscillatory Helmholtz kernel ...

Please sign up or login with your details

Forgot password? Click here to reset