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

03/07/2023
by   Yanchuang Cao, et al.
0

A nearly optimal explicitly-sparse representation for oscillatory kernels is presented in this work by developing a curvelet based method. Multilevel curvelet-like functions are constructed as the transform of the original nodal basis. Then the system matrix in a new non-standard form is derived with respect to the curvelet basis, which would be nearly optimally sparse due to the directional low rank property of the oscillatory kernel. Its sparsity is further enhanced via a-posteriori compression. Finally its nearly optimial log-linear computational complexity with controllable accuracy is demonstrated with numerical results. This explicitly-sparse representation is expected to lay ground to future work related to fast direct solvers and effective preconditioners for high frequency problems. It may also be viewed as the generalization of wavelet based methods to high frequency cases, and used as a new wideband fast algorithm for wave problems.

READ FULL TEXT
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
04/29/2020

Complexity Analysis of a Fast Directional Matrix-Vector Multiplication

We consider a fast, data-sparse directional method to realize matrix-vec...
research
07/27/2021

Discrete Lehmann representation of imaginary time Green's functions

We present an efficient basis for imaginary time Green's functions based...
research
06/09/2020

An extended Filon–Clenshaw–Curtis method for high-frequency wave scattering problems in two dimensions

We study the efficient approximation of integrals involving Hankel funct...
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 ...
research
06/14/2023

Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression

The trade-off between regret and computational cost is a fundamental pro...
research
02/27/2016

Single-Image Superresolution Through Directional Representations

We develop a mathematically-motivated algorithm for image superresolutio...

Please sign up or login with your details

Forgot password? Click here to reset