arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.03658math.NAcs.NAnlin.CD
收藏

分数阶Laplacian的高精度算子分解方法及其推广

Highly accurate operator factorization methods for the integral fractional Laplacian and its generalization

Yixuan Wu, Yanzhi Zhang

摘要:

本文提出了一类新的算子分解方法来离散积分分数Laplacian $(-Δ)^\fracα{2}$为$α\in (0, 2)$。我们的方法的主要优点是很容易提高数值精度,通过使用高次拉格朗日基函数,但保持格式结构和计算机实现不变。此外,我们的分数拉普拉斯离散化的结果在一个对称的(多级)Toeplitz微分矩阵,这不仅节省了模拟的内存成本,但通过快速傅立叶变换,使有效的计算。我们的方法在逼近分数拉普拉斯和解决分数泊松问题的性能进行了详细的检查。结果表明,对于常数或线性基函数,我们的方法具有最佳精度${\mathcal O}(h^2)$,而对于二次基函数,我们的方法具有最佳精度${\mathcal O}(h^4)$,其中$h$具有较小的网格尺寸。注意,该精度适用于任何$α\in (0, 2)$,并且如果使用更高阶的基函数,则可以进一步增加。如果分数Poisson问题的解满足$u \in C^{m, l}(\barΩ)$($m \in {\mathbb N}$和$0 < l < 1$),则我们的方法对常数和线性基函数具有${\mathcal O}\big(h^{\min\{m+l,\, 2\}}\big)$的精度,而对二次基函数具有${\mathcal O}\big(h^{\min\{m+l,\, 4\}}\big)$的精度.此外,我们的方法可以很容易地应用于研究广义分数拉普拉斯与对称核函数,和数值研究的回火分数泊松问题证明了它的有效性。

英文摘要:

In this paper, we propose a new class of operator factorization methods to discretize the integral fractional Laplacian $(-Δ)^\fracα{2}$ for $α\in (0, 2)$. The main advantage of our method is to easily increase numerical accuracy by using high-degree Lagrange basis functions, but remain the scheme structure and computer implementation unchanged. Moreover, our discretization of the fractional Laplacian results in a symmetric (multilevel) Toeplitz differentiation matrix, which not only saves memory cost in simulations but enables efficient computations via the fast Fourier transforms. The performance of our method in both approximating the fractional Laplacian and solving the fractional Poisson problems was detailedly examined. It shows that our method has an optimal accuracy of ${\mathcal O}(h^2)$ for constant or linear basis functions, while ${\mathcal O}(h^4)$ if quadratic basis functions are used, with $h$ a small mesh size. Note that this accuracy holds for any $α\in (0, 2)$ and can be further increased if higher-degree basis functions are used. If the solution of fractional Poisson problem satisfies $u \in C^{m, l}(\barΩ)$ for $m \in {\mathbb N}$ and $0 < l < 1$, then our method has an accuracy of ${\mathcal O}\big(h^{\min\{m+l,\, 2\}}\big)$ for constant and linear basis functions, while ${\mathcal O}\big(h^{\min\{m+l,\, 4\}}\big)$ for quadratic basis functions. Additionally, our method can be readily applied to study generalized fractional Laplacians with a symmetric kernel function, and numerical study on the tempered fractional Poisson problem demonstrates its efficiency.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑