NANAMay 7, 2019

Rational spectral methods for PDEs involving fractional Laplacian in unbounded domains

arXiv:1905.0247661 citations
AI Analysis

Provides a novel numerical tool for solving fractional PDEs in unbounded domains where solutions decay slowly, addressing an under-explored area.

Developed accurate rational spectral methods for PDEs with fractional Laplacian in unbounded domains, achieving optimal convergence and outperforming Hermite function approaches in numerical tests.

Many PDEs involving fractional Laplacian are naturally set in unbounded domains with underlying solutions decay very slowly, subject to certain power laws. Their numerical solutions are under-explored. This paper aims at developing accurate spectral methods using rational basis (or modified mapped Gegenbauer functions) for such models in unbounded domains. The main building block of the spectral algorithms is the explicit representations for the Fourier transform and fractional Laplacian of the rational basis, derived from some useful integral identites related to modified Bessel functions. With these at our disposal, we can construct rational spectral-Galerkin and direct collocation schemes by pre-computing the associated fractional differentiation matrices. We obtain optimal error estimates of rational spectral approximation in the fractional Sobolev spaces, and analyze the optimal convergence of the proposed Galerkin scheme. We also provide ample numerical results to show that the rational method outperforms the Hermite function approach.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes