Adaptive Local Refinement with Octree Load Balancing for the Parallel Solution of Three-Dimensional Conservation Laws
Adaptive Local Refinement with Octree Load Balancing for the Parallel Solution of Three-Dimensional Conservation Laws
复制标题
DOI：
10.1006/jpdc.1997.1412
复制
发表时间：
1997-12
期刊：
影响因子：
--
通讯作者：
J. Flaherty;R. Loy;M. Shephard;B. Szymański;J. D. Teresco;Louis H. Ziantz
中科院分区：
文献类型：
--
作者：
J. Flaherty;R. Loy;M. Shephard;B. Szymański;J. D. Teresco;Louis H. Ziantz
守恒律求解的局部伽辽金有限元程序与自适应时空网格细化和显式时间积分。柯朗稳定性条件用于在网格的较小元素上选择较小的时间步长，从而相对于具有单个全局时间步长的方法大大提高了效率。在自适应富集步骤中引入的处理器负载不平衡通过使用表示域的空间分解的八叉树的遍历来校正。为了适应可变的时间步长，八叉树划分扩展到使用从元素大小导出的权重。分区边界平滑以适度的成本减少了分区过程的通信量。本文给出了在IBM SP2计算机上求解三维可压缩流欧拉方程的并行八叉树和惯性分割方法的比较计算结果。
Conservation laws are solved by a local Galerkin finite element procedure with adaptive space-time mesh refinement and explicit time integration. The Courant stability condition is used to select smaller time steps on smaller elements of the mesh, thereby greatly increasing efficiency relative to methods having a single global time step. Processor load imbalances, introduced at adaptive enrichment steps, are corrected by using traversals of an octree representing a spatial decomposition of the domain. To accommodate the variable time steps, octree partitioning is extended to use weights derived from element size. Partition boundary smoothing reduces the communications volume of partitioning procedures for a modest cost. Computational results comparing parallel octree and inertial partitioning procedures are presented for the three-dimensional Euler equations of compressible flow solved on an IBM SP2 computer.