Difei Hu , Kaiyi Liang , Linjie Ying , Sen Li , Qinghai Zhang
{"title":"ARMS: Adding and removing markers on splines for high-order general interface tracking under the MARS framework","authors":"Difei Hu , Kaiyi Liang , Linjie Ying , Sen Li , 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}
引用次数: 0
Abstract
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 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.