首页> 外文期刊>Journal of Computational Physics >A predicted-Newton's method for solving the interface positioning equation in the MoF method on general polyhedrons
【24h】

A predicted-Newton's method for solving the interface positioning equation in the MoF method on general polyhedrons

机译:一种预测 - 牛顿求解通用多面体MOF方法中的界面定位方程的方法

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

摘要

Solving the interface positioning equation is the key procedure of the PLIC-VoF methods. Most of previous research only focused on the planar constant calculation and paid less attention to the relationship between the planar constant and the approximate interface orientation. The latter issue is important especially for the second order iteration based PLIC-VoF method, such as the MoF and LVIRA method. In these methods, the most accurate interface orientation is calculated through an iterative procedure, so the interface positioning equation has to be solved multiple times for the given volume fraction with different interface orientations. In this situation, if the incremental relation between the planar constant and the interface orientation is known, a predicted planar constant can be estimated. In this paper, we deduce the analytical partial derivatives of the planar constant with respect to the interface orientation and use them to predict the planar constant. A predicted-Newton's method is proposed to solve the interface positioning equation which takes the predicted planar constant as the initial guess. A great deal of numerical tests are also presented in this paper to verify the robustness of the new scheme. The efficiency of the proposed predicted-Newton's method is compared with the commonly used secant/bisection method by Ahn and Shashkov, and the numerical results indicate that the new method can reduce the iteration steps by 60% similar to 66% in solving the interface positioning equation and reduce the CPU time by 32% similar to 39% when implemented in the MoF method. (C) 2019 Elsevier Inc. All rights reserved.
机译:求解接口定位方程是PLIC-VOF方法的关键过程。以前的大多数研究仅重点关注平面常数计算,并对平面常数和近似接口方向之间的关系进行了关注。后一种问题很重要,特别是对于基于二阶迭代的PLIC-VOF方法,例如MOF和LVIRA方法。在这些方法中,通过迭代过程计算最精确的界面方向,因此界面定位方程必须多次解决具有不同接口方向的给定体积分数。在这种情况下,如果已知平面常数和接口方向之间的增量关系,则可以估计预测的平面常数。在本文中,我们相对于界面方向的平面恒定的分析部分导数,并使用它们来预测平面常数。提出了一种预测 - 牛顿的方法来解决接口定位方程,其将预测的平面常数作为初始猜测。本文还提出了大量数值测试,以验证新方案的鲁棒性。将预测 - 牛顿方法的效率与AHN和Shashkov的常用的SENANT / Bisection方法进行了比较,数值结果表明,新方法可以将迭代步骤减少60%,同样求解接口定位的66%在MOF方法中实施时,等式并将CPU时间降低32%,与39%相似。 (c)2019 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号