The spectral radius of iterative methods for the Cahn–Hilliard equation and its relation to the splitting technique

IF 2.6 2区 数学 Q1 MATHEMATICS, APPLIED Journal of Computational and Applied Mathematics Pub Date : 2025-12-15 Epub Date: 2025-04-12 DOI:10.1016/j.cam.2025.116673
Sergei Prokopev , Alexander Nepomnyashchy , Tatyana Lyubimova
{"title":"The spectral radius of iterative methods for the Cahn–Hilliard equation and its relation to the splitting technique","authors":"Sergei Prokopev ,&nbsp;Alexander Nepomnyashchy ,&nbsp;Tatyana Lyubimova","doi":"10.1016/j.cam.2025.116673","DOIUrl":null,"url":null,"abstract":"<div><div>We numerically study the stability of implicit schemes for the Cahn–Hilliard equation. The Cahn–Hilliard equation has an extra limitation for numerical schemes: the total free energy has to be non-increasing with time. One of the most popular remedies for this problem is the splitting technique, when the specific free energy is divided into two parts, one of them is treated explicitly and other one is treated implicitly. We analyse this approach in relation to the spectral radius in the case of Jacobi and Gauss–Seidel methods and show that the linear splitting can lead to the deterioration of a numerical algorithm. We also point out the difference between considering the Cahn–Hilliard equation straightforwardly as the single equation of the 4th order or as the system of two equations of the 2nd order. We propose a simple method to control the spectral radius and increase the stability of iterative methods by adding a stabilizing term, equivalent to adding the artificial time derivative of the chemical potential.</div></div>","PeriodicalId":50226,"journal":{"name":"Journal of Computational and Applied Mathematics","volume":"470 ","pages":"Article 116673"},"PeriodicalIF":2.6000,"publicationDate":"2025-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational and Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0377042725001876","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/4/12 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

We numerically study the stability of implicit schemes for the Cahn–Hilliard equation. The Cahn–Hilliard equation has an extra limitation for numerical schemes: the total free energy has to be non-increasing with time. One of the most popular remedies for this problem is the splitting technique, when the specific free energy is divided into two parts, one of them is treated explicitly and other one is treated implicitly. We analyse this approach in relation to the spectral radius in the case of Jacobi and Gauss–Seidel methods and show that the linear splitting can lead to the deterioration of a numerical algorithm. We also point out the difference between considering the Cahn–Hilliard equation straightforwardly as the single equation of the 4th order or as the system of two equations of the 2nd order. We propose a simple method to control the spectral radius and increase the stability of iterative methods by adding a stabilizing term, equivalent to adding the artificial time derivative of the chemical potential.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Cahn-Hilliard方程迭代法的谱半径及其与分裂技术的关系
本文对Cahn-Hilliard方程隐式格式的稳定性进行了数值研究。Cahn-Hilliard方程对于数值格式有一个额外的限制:总自由能必须不随时间增加。对于这个问题,最流行的补救方法之一是分裂技术,将比自由能分成两部分,其中一部分是显式处理,另一部分是隐式处理。我们分析了这种方法与Jacobi和Gauss-Seidel方法的谱半径的关系,并表明线性分裂会导致数值算法的恶化。我们还指出将Cahn-Hilliard方程直接视为单个四阶方程或将其视为两个二阶方程的系统之间的区别。我们提出了一种简单的方法,通过增加稳定项来控制谱半径并增加迭代方法的稳定性,相当于增加化学势的人工时间导数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
5.40
自引率
4.20%
发文量
437
审稿时长
3.0 months
期刊介绍: The Journal of Computational and Applied Mathematics publishes original papers of high scientific value in all areas of computational and applied mathematics. The main interest of the Journal is in papers that describe and analyze new computational techniques for solving scientific or engineering problems. Also the improved analysis, including the effectiveness and applicability, of existing methods and algorithms is of importance. The computational efficiency (e.g. the convergence, stability, accuracy, ...) should be proved and illustrated by nontrivial numerical examples. Papers describing only variants of existing methods, without adding significant new computational properties are not of interest. The audience consists of: applied mathematicians, numerical analysts, computational scientists and engineers.
期刊最新文献
New relaxation modulus-based iterative method for large and sparse implicit complementarity problem Enhancing efficiency of proximal gradient method with predicted and corrected step sizes Optimal alignment of Lorentz orientation and generalization to matrix Lie groups A novel twin extreme learning machine for regression problems The alternating Halpern-Mann iteration for families of maps
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1