基于 Saul'yev 方法的艾伦-卡恩方程的能量稳定和最大边界原则保留方案

IF 1.7 3区 数学 Q2 MATHEMATICS, APPLIED Advances in Computational Mathematics Pub Date : 2024-04-29 DOI:10.1007/s10444-024-10142-7
Xuelong Gu, Yushun Wang, Wenjun Cai
{"title":"基于 Saul'yev 方法的艾伦-卡恩方程的能量稳定和最大边界原则保留方案","authors":"Xuelong Gu, Yushun Wang, Wenjun Cai","doi":"10.1007/s10444-024-10142-7","DOIUrl":null,"url":null,"abstract":"<p>The energy dissipation law and maximum bound principle are significant characteristics of the Allen-Chan equation. To preserve discrete counterpart of these properties, the linear part of the target system is usually discretized implicitly, resulting in a large linear or nonlinear system of equations. The fast Fourier transform is commonly used to solve the resulting linear or nonlinear systems with computational costs of <span>\\(\\varvec{\\mathcal {O}(M^d \\text {log} M)}\\)</span> at each time step, where <span>\\(\\varvec{M}\\)</span> is the number of spatial grid points in each direction, and <span>\\(\\varvec{d}\\)</span> is the dimension of the problem. Combining the Saul’yev methods and the stabilization techniques, we propose and analyze novel first- and second-order numerical schemes for the Allen-Cahn equation in this paper. In contrast to the traditional methods, the proposed methods can be solved by components, requiring only <span>\\(\\varvec{\\mathcal {O}(M^d)}\\)</span> computational costs per time step. Additionally, they preserve the maximum bound principle and original energy dissipation law at the discrete level. We also propose rigorous analysis of their consistency and convergence. Numerical experiments are conducted to confirm the theoretical analysis and demonstrate the efficiency of the proposed methods.</p>","PeriodicalId":50869,"journal":{"name":"Advances in Computational Mathematics","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Energy stable and maximum bound principle preserving schemes for the Allen-Cahn equation based on the Saul’yev methods\",\"authors\":\"Xuelong Gu, Yushun Wang, Wenjun Cai\",\"doi\":\"10.1007/s10444-024-10142-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The energy dissipation law and maximum bound principle are significant characteristics of the Allen-Chan equation. To preserve discrete counterpart of these properties, the linear part of the target system is usually discretized implicitly, resulting in a large linear or nonlinear system of equations. The fast Fourier transform is commonly used to solve the resulting linear or nonlinear systems with computational costs of <span>\\\\(\\\\varvec{\\\\mathcal {O}(M^d \\\\text {log} M)}\\\\)</span> at each time step, where <span>\\\\(\\\\varvec{M}\\\\)</span> is the number of spatial grid points in each direction, and <span>\\\\(\\\\varvec{d}\\\\)</span> is the dimension of the problem. Combining the Saul’yev methods and the stabilization techniques, we propose and analyze novel first- and second-order numerical schemes for the Allen-Cahn equation in this paper. In contrast to the traditional methods, the proposed methods can be solved by components, requiring only <span>\\\\(\\\\varvec{\\\\mathcal {O}(M^d)}\\\\)</span> computational costs per time step. Additionally, they preserve the maximum bound principle and original energy dissipation law at the discrete level. We also propose rigorous analysis of their consistency and convergence. Numerical experiments are conducted to confirm the theoretical analysis and demonstrate the efficiency of the proposed methods.</p>\",\"PeriodicalId\":50869,\"journal\":{\"name\":\"Advances in Computational Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.7000,\"publicationDate\":\"2024-04-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Computational Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s10444-024-10142-7\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS, APPLIED\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Computational Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10444-024-10142-7","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

摘要

能量耗散定律和最大约束原理是艾伦-陈方程的重要特征。为了保持这些特性的离散对应关系,通常会对目标系统的线性部分进行隐式离散,从而形成一个庞大的线性或非线性方程组。快速傅立叶变换通常用于求解由此产生的线性或非线性系统,每个时间步的计算成本为 \(\varvec{\mathcal {O}(M^d \text {log} M)}\) ,其中 \(\varvec{M}\) 是每个方向上空间网格点的数量,而 \(\varvec{d}\) 是问题的维度。结合 Saul'yev 方法和稳定技术,我们在本文中提出并分析了 Allen-Cahn 方程的新型一阶和二阶数值方案。与传统方法相比,所提出的方法可以通过分量求解,每个时间步仅需要 \(\varvec{mathcal {O}(M^d)}\) 计算成本。此外,它们在离散水平上保留了最大约束原理和原始能量耗散规律。我们还对它们的一致性和收敛性提出了严格的分析。我们还进行了数值实验,以证实理论分析并证明所提方法的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Energy stable and maximum bound principle preserving schemes for the Allen-Cahn equation based on the Saul’yev methods

The energy dissipation law and maximum bound principle are significant characteristics of the Allen-Chan equation. To preserve discrete counterpart of these properties, the linear part of the target system is usually discretized implicitly, resulting in a large linear or nonlinear system of equations. The fast Fourier transform is commonly used to solve the resulting linear or nonlinear systems with computational costs of \(\varvec{\mathcal {O}(M^d \text {log} M)}\) at each time step, where \(\varvec{M}\) is the number of spatial grid points in each direction, and \(\varvec{d}\) is the dimension of the problem. Combining the Saul’yev methods and the stabilization techniques, we propose and analyze novel first- and second-order numerical schemes for the Allen-Cahn equation in this paper. In contrast to the traditional methods, the proposed methods can be solved by components, requiring only \(\varvec{\mathcal {O}(M^d)}\) computational costs per time step. Additionally, they preserve the maximum bound principle and original energy dissipation law at the discrete level. We also propose rigorous analysis of their consistency and convergence. Numerical experiments are conducted to confirm the theoretical analysis and demonstrate the efficiency of the proposed methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.00
自引率
5.90%
发文量
68
审稿时长
3 months
期刊介绍: Advances in Computational Mathematics publishes high quality, accessible and original articles at the forefront of computational and applied mathematics, with a clear potential for impact across the sciences. The journal emphasizes three core areas: approximation theory and computational geometry; numerical analysis, modelling and simulation; imaging, signal processing and data analysis. This journal welcomes papers that are accessible to a broad audience in the mathematical sciences and that show either an advance in computational methodology or a novel scientific application area, or both. Methods papers should rely on rigorous analysis and/or convincing numerical studies.
期刊最新文献
Maximal volume matrix cross approximation for image compression and least squares solution Multilevel approximation of Gaussian random fields: Covariance compression, estimation, and spatial prediction Improved a posteriori error bounds for reduced port-Hamiltonian systems Interpolating refinable functions and $$n_s$$ -step interpolatory subdivision schemes SVD-based algorithms for tensor wheel decomposition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1