...
首页> 外文期刊>Computer physics communications >On solving the 3-D phase field equations by employing a parallel-adaptive mesh refinement (Para-AMR) algorithm
【24h】

On solving the 3-D phase field equations by employing a parallel-adaptive mesh refinement (Para-AMR) algorithm

机译:通过使用并行自适应网格细化(Para-AMR)算法求解3-D相场方程

获取原文
获取原文并翻译 | 示例
           

摘要

An algorithm comprising adaptive mesh refinement (AMR) and parallel (Para-) computing capabilities was developed to efficiently solve the coupled phase field equations in 3-D. The AMR was achieved based on a gradient criterion and the point clustering algorithm introduced by Berger (1991). To reduce the time for mesh generation, a dynamic regridding approach was developed based on the magnitude of the maximum phase advancing velocity. Local data at each computing process was then constructed and parallel computation was realized based on the hierarchical grid structure created during the AMR. Numerical tests and simulations on single and multi-dendrite growth were performed and results show that the proposed algorithm could shorten the computing time for 3-D phase field simulation for about two orders of magnitude and enable one to gain much more insight in understanding the underlying physics during dendrite growth in solidification. (C) 2015 Elsevier B.V. All rights reserved.
机译:开发了一种包含自适应网格细化(AMR)和并行(Para-)计算能力的算法,以有效地求解3-D耦合相场方程。 AMR是基于梯度准则和Berger(1991)引入的点聚类算法实现的。为了减少生成网格的时间,基于最大相位前进速度的大小,开发了一种动态重新网格化方法。然后在每个计算过程中构造本地数据,并基于AMR期间创建的分层网格结构实现并行计算。对单枝晶和多枝晶生长进行了数值测试和仿真,结果表明,所提出的算法可以将3-D相场仿真的计算时间缩短大约两个数量级,并使人们可以更深入地了解底层结构。凝固过程中枝晶生长的物理过程。 (C)2015 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号