{"title":"分数科特韦格-德-弗里斯方程的完全离散有限差分方案","authors":"Mukul Dwivedi, Tanmay Sarkar","doi":"10.1007/s10915-024-02672-5","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we present and analyze fully discrete finite difference schemes designed for solving the initial value problem associated with the fractional Korteweg-de Vries (KdV) equation involving the fractional Laplacian. We design the scheme by introducing the discrete fractional Laplacian operator which is consistent with the continuous operator, and possesses certain properties which are instrumental for the convergence analysis. Assuming the initial data <span>\\(u_0 \\in H^{1+\\alpha }(\\mathbb {R})\\)</span>, where <span>\\(\\alpha \\in [1,2)\\)</span>, our study establishes the convergence of the approximate solutions obtained by the fully discrete finite difference schemes to a classical solution of the fractional KdV equation. Theoretical results are validated through several numerical illustrations for various values of fractional exponent <span>\\(\\alpha \\)</span>. Furthermore, we demonstrate that the Crank–Nicolson finite difference scheme preserves the inherent conserved quantities along with the improved convergence rates.</p>","PeriodicalId":50055,"journal":{"name":"Journal of Scientific Computing","volume":null,"pages":null},"PeriodicalIF":2.8000,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fully Discrete Finite Difference Schemes for the Fractional Korteweg-de Vries Equation\",\"authors\":\"Mukul Dwivedi, Tanmay Sarkar\",\"doi\":\"10.1007/s10915-024-02672-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this paper, we present and analyze fully discrete finite difference schemes designed for solving the initial value problem associated with the fractional Korteweg-de Vries (KdV) equation involving the fractional Laplacian. We design the scheme by introducing the discrete fractional Laplacian operator which is consistent with the continuous operator, and possesses certain properties which are instrumental for the convergence analysis. Assuming the initial data <span>\\\\(u_0 \\\\in H^{1+\\\\alpha }(\\\\mathbb {R})\\\\)</span>, where <span>\\\\(\\\\alpha \\\\in [1,2)\\\\)</span>, our study establishes the convergence of the approximate solutions obtained by the fully discrete finite difference schemes to a classical solution of the fractional KdV equation. Theoretical results are validated through several numerical illustrations for various values of fractional exponent <span>\\\\(\\\\alpha \\\\)</span>. Furthermore, we demonstrate that the Crank–Nicolson finite difference scheme preserves the inherent conserved quantities along with the improved convergence rates.</p>\",\"PeriodicalId\":50055,\"journal\":{\"name\":\"Journal of Scientific Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.8000,\"publicationDate\":\"2024-09-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Scientific Computing\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10915-024-02672-5\",\"RegionNum\":2,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Scientific Computing","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10915-024-02672-5","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
Fully Discrete Finite Difference Schemes for the Fractional Korteweg-de Vries Equation
In this paper, we present and analyze fully discrete finite difference schemes designed for solving the initial value problem associated with the fractional Korteweg-de Vries (KdV) equation involving the fractional Laplacian. We design the scheme by introducing the discrete fractional Laplacian operator which is consistent with the continuous operator, and possesses certain properties which are instrumental for the convergence analysis. Assuming the initial data \(u_0 \in H^{1+\alpha }(\mathbb {R})\), where \(\alpha \in [1,2)\), our study establishes the convergence of the approximate solutions obtained by the fully discrete finite difference schemes to a classical solution of the fractional KdV equation. Theoretical results are validated through several numerical illustrations for various values of fractional exponent \(\alpha \). Furthermore, we demonstrate that the Crank–Nicolson finite difference scheme preserves the inherent conserved quantities along with the improved convergence rates.
期刊介绍:
Journal of Scientific Computing is an international interdisciplinary forum for the publication of papers on state-of-the-art developments in scientific computing and its applications in science and engineering.
The journal publishes high-quality, peer-reviewed original papers, review papers and short communications on scientific computing.