三角形网格上与网格尺寸有关的界面参数的修正艾伦-卡恩方程

IF 7.2 2区 物理与天体物理 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computer Physics Communications Pub Date : 2024-07-02 DOI:10.1016/j.cpc.2024.109301
Junxiang Yang , Jian Wang , Soobin Kwak , Seokjun Ham , Junseok Kim
{"title":"三角形网格上与网格尺寸有关的界面参数的修正艾伦-卡恩方程","authors":"Junxiang Yang ,&nbsp;Jian Wang ,&nbsp;Soobin Kwak ,&nbsp;Seokjun Ham ,&nbsp;Junseok Kim","doi":"10.1016/j.cpc.2024.109301","DOIUrl":null,"url":null,"abstract":"<div><p>In this article, we propose a modified Allen–Cahn (AC) equation with a space-dependent interfacial parameter. When numerically solving the AC equation with a constant interfacial parameter over large domains, a substantial number of grid points are essential, which leads to significant computational costs. To effectively resolve this problem, numerous adaptive mesh techniques have been developed and implemented. These methods use locally refined meshes that adaptively track the interfacial positions of the phase field throughout the simulation. However, the data structures for adaptive algorithms are generally complex, and the problems to be solved may involve challenges at multiple scales. In this article, we present a modified AC equation with a mesh size-dependent interfacial parameter on a triangular mesh to efficiently solve multi-scale problems. In the proposed method, a triangular mesh is used, and the interfacial parameter value at a node point is defined as a function of the average length of the edges connected to the node point. The proposed algorithm effectively uses large and small values of the interfacial parameter on coarse and fine meshes, respectively. To demonstrate the efficiency and superior performance of the proposed method, we conduct several representative numerical experiments. The computational results indicate that the proposed interfacial function can adequately evolve the multi-scale phase interfaces without excessive relaxation or freezing of the interfaces. Finally, we provide the main source code for the methodology, including mesh generation as described in this paper, so that interested readers can use it.</p></div>","PeriodicalId":285,"journal":{"name":"Computer Physics Communications","volume":null,"pages":null},"PeriodicalIF":7.2000,"publicationDate":"2024-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A modified Allen–Cahn equation with a mesh size-dependent interfacial parameter on a triangular mesh\",\"authors\":\"Junxiang Yang ,&nbsp;Jian Wang ,&nbsp;Soobin Kwak ,&nbsp;Seokjun Ham ,&nbsp;Junseok Kim\",\"doi\":\"10.1016/j.cpc.2024.109301\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this article, we propose a modified Allen–Cahn (AC) equation with a space-dependent interfacial parameter. When numerically solving the AC equation with a constant interfacial parameter over large domains, a substantial number of grid points are essential, which leads to significant computational costs. To effectively resolve this problem, numerous adaptive mesh techniques have been developed and implemented. These methods use locally refined meshes that adaptively track the interfacial positions of the phase field throughout the simulation. However, the data structures for adaptive algorithms are generally complex, and the problems to be solved may involve challenges at multiple scales. In this article, we present a modified AC equation with a mesh size-dependent interfacial parameter on a triangular mesh to efficiently solve multi-scale problems. In the proposed method, a triangular mesh is used, and the interfacial parameter value at a node point is defined as a function of the average length of the edges connected to the node point. The proposed algorithm effectively uses large and small values of the interfacial parameter on coarse and fine meshes, respectively. To demonstrate the efficiency and superior performance of the proposed method, we conduct several representative numerical experiments. The computational results indicate that the proposed interfacial function can adequately evolve the multi-scale phase interfaces without excessive relaxation or freezing of the interfaces. Finally, we provide the main source code for the methodology, including mesh generation as described in this paper, so that interested readers can use it.</p></div>\",\"PeriodicalId\":285,\"journal\":{\"name\":\"Computer Physics Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2024-07-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Physics Communications\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0010465524002248\",\"RegionNum\":2,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Physics Communications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010465524002248","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

在这篇文章中,我们提出了一个修正的艾伦-卡恩(AC)方程,该方程的界面参数与空间有关。在大域范围内对具有恒定界面参数的 AC 方程进行数值求解时,必须使用大量网格点,这将导致巨大的计算成本。为有效解决这一问题,人们开发并实施了大量自适应网格技术。这些方法使用局部细化网格,在整个模拟过程中自适应地跟踪相场的界面位置。然而,自适应算法的数据结构通常比较复杂,要解决的问题可能涉及多个尺度的挑战。在本文中,我们提出了一种修改后的交流方程,该方程在三角形网格上具有与网格尺寸相关的界面参数,可高效解决多尺度问题。在所提出的方法中,使用了三角形网格,节点点上的界面参数值被定义为与节点点相连的边的平均长度的函数。所提出的算法在粗网格和细网格上分别有效地使用了界面参数的大值和小值。为了证明所提方法的效率和优越性能,我们进行了几个有代表性的数值实验。计算结果表明,所提出的界面函数可以充分演化多尺度相界面,而不会造成界面过度松弛或冻结。最后,我们提供了该方法的主要源代码,包括本文所述的网格生成,以便感兴趣的读者使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A modified Allen–Cahn equation with a mesh size-dependent interfacial parameter on a triangular mesh

In this article, we propose a modified Allen–Cahn (AC) equation with a space-dependent interfacial parameter. When numerically solving the AC equation with a constant interfacial parameter over large domains, a substantial number of grid points are essential, which leads to significant computational costs. To effectively resolve this problem, numerous adaptive mesh techniques have been developed and implemented. These methods use locally refined meshes that adaptively track the interfacial positions of the phase field throughout the simulation. However, the data structures for adaptive algorithms are generally complex, and the problems to be solved may involve challenges at multiple scales. In this article, we present a modified AC equation with a mesh size-dependent interfacial parameter on a triangular mesh to efficiently solve multi-scale problems. In the proposed method, a triangular mesh is used, and the interfacial parameter value at a node point is defined as a function of the average length of the edges connected to the node point. The proposed algorithm effectively uses large and small values of the interfacial parameter on coarse and fine meshes, respectively. To demonstrate the efficiency and superior performance of the proposed method, we conduct several representative numerical experiments. The computational results indicate that the proposed interfacial function can adequately evolve the multi-scale phase interfaces without excessive relaxation or freezing of the interfaces. Finally, we provide the main source code for the methodology, including mesh generation as described in this paper, so that interested readers can use it.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Physics Communications
Computer Physics Communications 物理-计算机:跨学科应用
CiteScore
12.10
自引率
3.20%
发文量
287
审稿时长
5.3 months
期刊介绍: The focus of CPC is on contemporary computational methods and techniques and their implementation, the effectiveness of which will normally be evidenced by the author(s) within the context of a substantive problem in physics. Within this setting CPC publishes two types of paper. Computer Programs in Physics (CPiP) These papers describe significant computer programs to be archived in the CPC Program Library which is held in the Mendeley Data repository. The submitted software must be covered by an approved open source licence. Papers and associated computer programs that address a problem of contemporary interest in physics that cannot be solved by current software are particularly encouraged. Computational Physics Papers (CP) These are research papers in, but are not limited to, the following themes across computational physics and related disciplines. mathematical and numerical methods and algorithms; computational models including those associated with the design, control and analysis of experiments; and algebraic computation. Each will normally include software implementation and performance details. The software implementation should, ideally, be available via GitHub, Zenodo or an institutional repository.In addition, research papers on the impact of advanced computer architecture and special purpose computers on computing in the physical sciences and software topics related to, and of importance in, the physical sciences may be considered.
期刊最新文献
Computing the QRPA level density with the finite amplitude method An analysis and successful benchmarking of the Chapman-Enskog-like (CEL) continuum kinetic closure approach algorithm in NIMROD TROPIC: A program for calculating reduced transition probabilities ftint: Calculating gradient-flow integrals with pySecDec Analytic continuations and numerical evaluation of the Appell F1, F3, Lauricella FD(3) and Lauricella-Saran FS(3) and their application to Feynman integrals
×
引用
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