{"title":"High-resolution numerical method for the time-fractional fourth-order diffusion problems via improved quintic B-spline function","authors":"Mohammad Prawesh Alam, Arshad Khan, Pradip Roul","doi":"10.1007/s12190-024-02229-7","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we design and analyse a high-order numerical algorithm based on the improvised quintic B-spline collocation method for solving the fourth-order fractional diffusion equation. The time-fractional derivative is approximated by Caputo’s time derivative. The space derivative is approximated by the collocation method based on improvised quintic B-spline functions. It is shown that the proposed algorithm is unconditionally stable. Through rigorous convergence analysis, the method is shown <span>\\((2-\\beta )\\)</span> order convergent in time and almost sixth-order convergent in space direction. It is also shown that the theoretical rate of convergence is the same as that acquired experimentally. To confirm the theoretical results and to test the efficiency and robustness, the method is tested on three problems. The main contribution of the developed algorithm is that the order of convergence and numerical results obtained are better than the existing methods, like the sextic B-spline collocation method (Roul and Goura in Appl Math Comput 366:124727, 2020), the quintic B-spline method (Siddiqi and Arshed in Int J Comput Math 92(7):1496–1518, 2015), and the quintic spline method (Tariq and Akram in Numer Methods Part Differ Equ 33(2):445–466, 2017). It has been proved that the order of convergence of the proposed method is six, which is two orders of magnitude higher than the other spline collocation methods.</p>","PeriodicalId":15034,"journal":{"name":"Journal of Applied Mathematics and Computing","volume":"17 1","pages":""},"PeriodicalIF":2.4000,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Mathematics and Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s12190-024-02229-7","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we design and analyse a high-order numerical algorithm based on the improvised quintic B-spline collocation method for solving the fourth-order fractional diffusion equation. The time-fractional derivative is approximated by Caputo’s time derivative. The space derivative is approximated by the collocation method based on improvised quintic B-spline functions. It is shown that the proposed algorithm is unconditionally stable. Through rigorous convergence analysis, the method is shown \((2-\beta )\) order convergent in time and almost sixth-order convergent in space direction. It is also shown that the theoretical rate of convergence is the same as that acquired experimentally. To confirm the theoretical results and to test the efficiency and robustness, the method is tested on three problems. The main contribution of the developed algorithm is that the order of convergence and numerical results obtained are better than the existing methods, like the sextic B-spline collocation method (Roul and Goura in Appl Math Comput 366:124727, 2020), the quintic B-spline method (Siddiqi and Arshed in Int J Comput Math 92(7):1496–1518, 2015), and the quintic spline method (Tariq and Akram in Numer Methods Part Differ Equ 33(2):445–466, 2017). It has been proved that the order of convergence of the proposed method is six, which is two orders of magnitude higher than the other spline collocation methods.
在本文中,我们设计并分析了一种基于简易五次B-样条配位法的高阶数值算法,用于求解四阶分数扩散方程。时间分数导数用 Caputo 时间导数近似。空间导数用基于即兴五次 B 样条函数的配位法近似。结果表明,所提出的算法是无条件稳定的。通过严格的收敛性分析,该方法在时间方向上具有((2-\beta)\)阶收敛性,在空间方向上几乎具有六阶收敛性。理论收敛速率与实验收敛速率相同。为了证实理论结果并检验该方法的效率和鲁棒性,对三个问题进行了测试。所开发算法的主要贡献在于其收敛阶次和数值结果优于现有方法,如六次 B-样条拼合法(Roul 和 Goura 在 Appl Math Comput 366:124727, 2020)、五次 B 样条法(Siddiqi 和 Arshed,载于 Int J Comput Math 92(7):1496-1518, 2015)和五次样条法(Tariq 和 Akram,载于 Numer Methods Part Differ Equ 33(2):445-466, 2017)。研究证明,所提方法的收敛阶数为六阶,比其他样条拼合法高两个数量级。
期刊介绍:
JAMC is a broad based journal covering all branches of computational or applied mathematics with special encouragement to researchers in theoretical computer science and mathematical computing. Major areas, such as numerical analysis, discrete optimization, linear and nonlinear programming, theory of computation, control theory, theory of algorithms, computational logic, applied combinatorics, coding theory, cryptograhics, fuzzy theory with applications, differential equations with applications are all included. A large variety of scientific problems also necessarily involve Algebra, Analysis, Geometry, Probability and Statistics and so on. The journal welcomes research papers in all branches of mathematics which have some bearing on the application to scientific problems, including papers in the areas of Actuarial Science, Mathematical Biology, Mathematical Economics and Finance.