时间分数费雪方程的精确数值方法及其分析

IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Pradip Roul, Vikas Rohil
{"title":"时间分数费雪方程的精确数值方法及其分析","authors":"Pradip Roul, Vikas Rohil","doi":"10.1007/s00500-024-09885-8","DOIUrl":null,"url":null,"abstract":"<p>This article aims to develop an optimal superconvergent numerical method for approximating the solution of the nonlinear time-fractional generalized Fisher’s (TFGF) equation. The time-fractional derivative in the model problem is considered in the sense of Caputo and is approximated using the <span>\\(L2-1_{\\sigma }\\)</span> scheme. Spatial discretization is performed using an optimal superconvergent quintic B-spline (OSQB) technique. To derive the method, a high-order perturbation of the semi-discretized equation of the original problem is generated using spline alternate relations. Convergence and stability of the method are analyzed, demonstrating that the method converges with <span>\\(O(\\Delta t^{2}+\\Delta x^6)\\)</span>, where <span>\\(\\Delta x\\)</span> and <span>\\(\\Delta t\\)</span> are step sizes in space and time, respectively. Three numerical examples are provided to demonstrate the robustness of the proposed method. Our method is compared with an existing method in the literature and the elapsed computational time for the present scheme is provided.</p>","PeriodicalId":22039,"journal":{"name":"Soft Computing","volume":"16 1","pages":""},"PeriodicalIF":3.1000,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An accurate numerical method and its analysis for time-fractional Fisher’s equation\",\"authors\":\"Pradip Roul, Vikas Rohil\",\"doi\":\"10.1007/s00500-024-09885-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>This article aims to develop an optimal superconvergent numerical method for approximating the solution of the nonlinear time-fractional generalized Fisher’s (TFGF) equation. The time-fractional derivative in the model problem is considered in the sense of Caputo and is approximated using the <span>\\\\(L2-1_{\\\\sigma }\\\\)</span> scheme. Spatial discretization is performed using an optimal superconvergent quintic B-spline (OSQB) technique. To derive the method, a high-order perturbation of the semi-discretized equation of the original problem is generated using spline alternate relations. Convergence and stability of the method are analyzed, demonstrating that the method converges with <span>\\\\(O(\\\\Delta t^{2}+\\\\Delta x^6)\\\\)</span>, where <span>\\\\(\\\\Delta x\\\\)</span> and <span>\\\\(\\\\Delta t\\\\)</span> are step sizes in space and time, respectively. Three numerical examples are provided to demonstrate the robustness of the proposed method. Our method is compared with an existing method in the literature and the elapsed computational time for the present scheme is provided.</p>\",\"PeriodicalId\":22039,\"journal\":{\"name\":\"Soft Computing\",\"volume\":\"16 1\",\"pages\":\"\"},\"PeriodicalIF\":3.1000,\"publicationDate\":\"2024-07-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Soft Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00500-024-09885-8\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00500-024-09885-8","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

摘要

本文旨在开发一种近似非线性时间分数广义费雪方程(TFGF)解的最优超融合数值方法。模型问题中的时间分数导数是在 Caputo 的意义上考虑的,并使用 \(L2-1_{\sigma }\) 方案进行近似。空间离散化采用最优超收敛五次 B 样条(OSQB)技术。为了推导该方法,利用样条交替关系生成了原始问题半离散方程的高阶扰动。分析了该方法的收敛性和稳定性,证明该方法的收敛速度为 \(O(\Delta t^{2}+\Delta x^6)\),其中 \(\Delta x\) 和 \(\Delta t\) 分别是空间和时间上的步长。我们提供了三个数值示例来证明所提方法的鲁棒性。我们的方法与文献中的现有方法进行了比较,并提供了本方案的计算时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

An accurate numerical method and its analysis for time-fractional Fisher’s equation

An accurate numerical method and its analysis for time-fractional Fisher’s equation

This article aims to develop an optimal superconvergent numerical method for approximating the solution of the nonlinear time-fractional generalized Fisher’s (TFGF) equation. The time-fractional derivative in the model problem is considered in the sense of Caputo and is approximated using the \(L2-1_{\sigma }\) scheme. Spatial discretization is performed using an optimal superconvergent quintic B-spline (OSQB) technique. To derive the method, a high-order perturbation of the semi-discretized equation of the original problem is generated using spline alternate relations. Convergence and stability of the method are analyzed, demonstrating that the method converges with \(O(\Delta t^{2}+\Delta x^6)\), where \(\Delta x\) and \(\Delta t\) are step sizes in space and time, respectively. Three numerical examples are provided to demonstrate the robustness of the proposed method. Our method is compared with an existing method in the literature and the elapsed computational time for the present scheme is provided.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Soft Computing
Soft Computing 工程技术-计算机:跨学科应用
CiteScore
8.10
自引率
9.80%
发文量
927
审稿时长
7.3 months
期刊介绍: Soft Computing is dedicated to system solutions based on soft computing techniques. It provides rapid dissemination of important results in soft computing technologies, a fusion of research in evolutionary algorithms and genetic programming, neural science and neural net systems, fuzzy set theory and fuzzy systems, and chaos theory and chaotic systems. Soft Computing encourages the integration of soft computing techniques and tools into both everyday and advanced applications. By linking the ideas and techniques of soft computing with other disciplines, the journal serves as a unifying platform that fosters comparisons, extensions, and new applications. As a result, the journal is an international forum for all scientists and engineers engaged in research and development in this fast growing field.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信