ARMS:在 MARS 框架下为高阶一般界面跟踪添加和删除样条上的标记

IF 3.8 2区 物理与天体物理 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Difei Hu , Kaiyi Liang , Linjie Ying , Sen Li , Qinghai Zhang
{"title":"ARMS:在 MARS 框架下为高阶一般界面跟踪添加和删除样条上的标记","authors":"Difei Hu ,&nbsp;Kaiyi Liang ,&nbsp;Linjie Ying ,&nbsp;Sen Li ,&nbsp;Qinghai Zhang","doi":"10.1016/j.jcp.2024.113574","DOIUrl":null,"url":null,"abstract":"<div><div>Based on the MARS framework for interface tracking (IT) (Zhang and Fogelson (2016) <span><span>[33]</span></span>) (Zhang and Li (2020) <span><span>[35]</span></span>), we propose ARMS (adding and removing markers on splines as a strategy for regularizing distances between adjacent markers in simulating moving boundary problems. In ARMS, we represent the interface by cubic/quintic splines and add/remove interface markers at each time step to maintain a roughly uniform distribution of chordal lengths. To demonstrate the utility of ARMS, we apply it to two-dimensional mean curvature flows to develop ARMS-MCF2D, where spatial derivatives are approximated by finite difference formulas and the resulting nonlinear system of ordinary differential equations is solved by explicit, semi-implicit, and implicit Runge–Kutta methods. As such, the semi-implicit and implicit ARMS-MCF2D methods are unconditionally stable. Error analysis indicates that the order of accuracy of ARMS-MCF2D can be 2, 4, or 6. Results of numerical experiments confirm the analysis, show the effectiveness of ARMS in maintaining the regularity of interface markers, and demonstrate the superior accuracy of ARMS-MCF2D over other existing methods. A one-phase Stefan problem is also simulated by coupling ARMS to a finite difference method, exhibiting its potential utility to general IT in moving boundary problems. The generality and flexibility of ARMS partially lie in the fact that, by specifying a discrete time integrator for her own moving boundary problem, an application scientist immediately obtains a MARS method for the problem without worrying about curve fitting and marker distributions.</div></div>","PeriodicalId":352,"journal":{"name":"Journal of Computational Physics","volume":"521 ","pages":"Article 113574"},"PeriodicalIF":3.8000,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ARMS: Adding and removing markers on splines for high-order general interface tracking under the MARS framework\",\"authors\":\"Difei Hu ,&nbsp;Kaiyi Liang ,&nbsp;Linjie Ying ,&nbsp;Sen Li ,&nbsp;Qinghai Zhang\",\"doi\":\"10.1016/j.jcp.2024.113574\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Based on the MARS framework for interface tracking (IT) (Zhang and Fogelson (2016) <span><span>[33]</span></span>) (Zhang and Li (2020) <span><span>[35]</span></span>), we propose ARMS (adding and removing markers on splines as a strategy for regularizing distances between adjacent markers in simulating moving boundary problems. In ARMS, we represent the interface by cubic/quintic splines and add/remove interface markers at each time step to maintain a roughly uniform distribution of chordal lengths. To demonstrate the utility of ARMS, we apply it to two-dimensional mean curvature flows to develop ARMS-MCF2D, where spatial derivatives are approximated by finite difference formulas and the resulting nonlinear system of ordinary differential equations is solved by explicit, semi-implicit, and implicit Runge–Kutta methods. As such, the semi-implicit and implicit ARMS-MCF2D methods are unconditionally stable. Error analysis indicates that the order of accuracy of ARMS-MCF2D can be 2, 4, or 6. Results of numerical experiments confirm the analysis, show the effectiveness of ARMS in maintaining the regularity of interface markers, and demonstrate the superior accuracy of ARMS-MCF2D over other existing methods. A one-phase Stefan problem is also simulated by coupling ARMS to a finite difference method, exhibiting its potential utility to general IT in moving boundary problems. The generality and flexibility of ARMS partially lie in the fact that, by specifying a discrete time integrator for her own moving boundary problem, an application scientist immediately obtains a MARS method for the problem without worrying about curve fitting and marker distributions.</div></div>\",\"PeriodicalId\":352,\"journal\":{\"name\":\"Journal of Computational Physics\",\"volume\":\"521 \",\"pages\":\"Article 113574\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2024-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computational Physics\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0021999124008222\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computational Physics","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0021999124008222","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

基于用于界面跟踪(IT)的 MARS 框架(Zhang 和 Fogelson (2016) [33])(Zhang 和 Li (2020) [35]),我们提出了 ARMS(在样条上添加和移除标记,作为在模拟移动边界问题时规整相邻标记间距离的策略)。在 ARMS 中,我们用三次/五次样条表示界面,并在每个时间步添加/移除界面标记,以保持弦长的大致均匀分布。为了证明 ARMS 的实用性,我们将其应用于二维平均曲率流,开发了 ARMS-MCF2D,其中空间导数由有限差分公式近似表示,由此产生的非线性常微分方程系统由显式、半隐式和隐式 Runge-Kutta 方法求解。因此,半隐式和隐式 ARMS-MCF2D 方法是无条件稳定的。误差分析表明,ARMS-MCF2D 的精度阶数可以是 2、4 或 6。数值实验结果证实了上述分析,显示了 ARMS 在保持界面标记规则性方面的有效性,并证明 ARMS-MCF2D 的精度优于其他现有方法。通过将 ARMS 与有限差分法耦合,还模拟了单相斯特凡问题,展示了 ARMS 在移动边界问题中对一般 IT 的潜在实用性。ARMS的通用性和灵活性部分在于,应用科学家只需为自己的移动边界问题指定一个离散时间积分器,就能立即获得该问题的MARS方法,而无需担心曲线拟合和标记分布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ARMS: Adding and removing markers on splines for high-order general interface tracking under the MARS framework
Based on the MARS framework for interface tracking (IT) (Zhang and Fogelson (2016) [33]) (Zhang and Li (2020) [35]), we propose ARMS (adding and removing markers on splines as a strategy for regularizing distances between adjacent markers in simulating moving boundary problems. In ARMS, we represent the interface by cubic/quintic splines and add/remove interface markers at each time step to maintain a roughly uniform distribution of chordal lengths. To demonstrate the utility of ARMS, we apply it to two-dimensional mean curvature flows to develop ARMS-MCF2D, where spatial derivatives are approximated by finite difference formulas and the resulting nonlinear system of ordinary differential equations is solved by explicit, semi-implicit, and implicit Runge–Kutta methods. As such, the semi-implicit and implicit ARMS-MCF2D methods are unconditionally stable. Error analysis indicates that the order of accuracy of ARMS-MCF2D can be 2, 4, or 6. Results of numerical experiments confirm the analysis, show the effectiveness of ARMS in maintaining the regularity of interface markers, and demonstrate the superior accuracy of ARMS-MCF2D over other existing methods. A one-phase Stefan problem is also simulated by coupling ARMS to a finite difference method, exhibiting its potential utility to general IT in moving boundary problems. The generality and flexibility of ARMS partially lie in the fact that, by specifying a discrete time integrator for her own moving boundary problem, an application scientist immediately obtains a MARS method for the problem without worrying about curve fitting and marker distributions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Computational Physics
Journal of Computational Physics 物理-计算机:跨学科应用
CiteScore
7.60
自引率
14.60%
发文量
763
审稿时长
5.8 months
期刊介绍: Journal of Computational Physics thoroughly treats the computational aspects of physical problems, presenting techniques for the numerical solution of mathematical equations arising in all areas of physics. The journal seeks to emphasize methods that cross disciplinary boundaries. The Journal of Computational Physics also publishes short notes of 4 pages or less (including figures, tables, and references but excluding title pages). Letters to the Editor commenting on articles already published in this Journal will also be considered. Neither notes nor letters should have an abstract.
×
引用
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学术官方微信