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

一种求解具有Caputo-Prabhakar导数的分数阶Burgers方程的高效数值格式

An Efficient Numerical Scheme for a Time-Fractional Burgers Equation with Caputo-Prabhakar Derivative

Deeksha Singh, Swati Yadav, Rajesh K. Pandey

AI总结:

本文针对具有Caputo-Prabhakar导数的时间分数阶Burgers方程,提出一种结合有限差分与Newton迭代的数值格式,证明其在$L_{\infty}$范数下稳定收敛且时间精度为$(2-α)$阶,并用两个算例验证。

摘要:

本文提出了一种求解时间分数阶Burgers方程的数值方法,在时间上达到$(2-α)$阶收敛,其中$α$表示时间导数的阶数。分数阶导数采用Caputo-Prabhakar(CP)公式建模,该公式包含由三参数Mittag-Leffler函数定义的核。采用有限差分方法对导数进行离散化。为处理非线性项,使用了Newton迭代法。所提出的数值格式被证明在$L_{\infty}$范数下是稳定且收敛的。通过两个数值算例验证了理论的有效性。

英文摘要:

This paper presents a numerical method to solve a time-fractional Burgers equation, achieving order of convergence $(2-α)$ in time, here $α$ represents the order of the time derivative. The fractional derivative is modeled by Caputo-Prabhakar (CP) formulation, which incorporates a kernel defined by the three-parameter Mittag-Leffler function. Finite difference methods are employed for the discretization of the derivatives. To handle the non-linear term, the Newton iteration method is used. The proposed numerical scheme is proven to be stable and convergent in the $L_{\infty}$ norm. The validity of the theory is supported by two numerical examples.

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

↑