Efficient Computation of Highly Oscillatory Fourier Transforms with Nearly Singular Amplitudes over Rectangle Domains

In this paper, we consider fast and high-order algorithms for calculation of highly oscillatory and nearly singular integrals. Based on operators with regard to Chebyshev polynomials, we propose a class of spectral efficient Levin quadrature for oscillatory integrals over rectangle domains, and give...

Full description

Bibliographic Details
Main Authors: Zhen Yang, Junjie Ma
Format: Article
Language:English
Published: MDPI AG 2020-11-01
Series:Mathematics
Subjects:
Online Access:https://www.mdpi.com/2227-7390/8/11/1930
Description
Summary:In this paper, we consider fast and high-order algorithms for calculation of highly oscillatory and nearly singular integrals. Based on operators with regard to Chebyshev polynomials, we propose a class of spectral efficient Levin quadrature for oscillatory integrals over rectangle domains, and give detailed convergence analysis. Furthermore, with the help of adaptive mesh refinement, we are able to develop an efficient algorithm to compute highly oscillatory and nearly singular integrals. In contrast to existing methods, approximations derived from the new approach do not suffer from high oscillatory and singularity. Finally, several numerical experiments are included to illustrate the performance of given quadrature rules.
ISSN:2227-7390