arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2108.06101math.NAcs.NA
收藏

不带正则性假设的变阶时间分数阶扩散方程的鲁棒快速算法

Robust fast method for variable-order time-fractional diffusion equations without regularity assumptions

Jia-Li Zhang, Zhi-Wei Fang, Hai-Wei Sun

摘要:

在本文中,我们发展了一个强大的快速方法移动-固定的可变阶(VO)时间分数阶扩散方程(tFDES),优越地处理的情况下,小或消失的VO函数的下限。利用分部积分法和指数和逼近法,得到了VO Caputo分数阶导数的有效快速逼近.与一般的直接法相比,该算法($RF$公式)将作用记忆从$\mathcal{O}(n)$减少到$\mathcal{O}(\log^2 n)$,将计算量从$\mathcal{O}(n^2)$减少到$\mathcal{O}(n \log^2 n)$,其中$n$为时间层数.然后利用$RF$ - $L1$公式构造了VOtFDE的快速差分格式,大大降低了存储量和计算复杂性.仅在VO函数、系数和源项的某些假设下,而不对真解的正则性作任何假设,研究了该格式的误差估计。数值实验验证了该方法的有效性。

英文摘要:

In this paper, we develop a robust fast method for mobile-immobile variable-order (VO) time-fractional diffusion equations (tFDEs), superiorly handling the cases of small or vanishing lower bound of the VO function. The valid fast approximation of the VO Caputo fractional derivative is obtained using integration by parts and the exponential-sum-approximation method. Compared with the general direct method, the proposed algorithm ($RF$-$L1$ formula) reduces the acting memory from $\mathcal{O}(n)$ to $\mathcal{O}(\log^2 n)$ and computational cost from $\mathcal{O}(n^2)$ to $\mathcal{O}(n \log^2 n)$, respectively, where $n$ is the number of time levels. Then $RF$-$L1$ formula is applied to construct the fast finite difference scheme for the VO tFDEs, which sharp decreases the memory requirement and computational complexity. The error estimate for the proposed scheme is studied only under some assumptions of the VO function, coefficients, and the source term, but without any regularity assumption of the true solutions. Numerical experiments are presented to verify the effectiveness of the proposed method.

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

↑