摘要
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods. This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection. This algorithm is used in PHG, Parallel Hierarchical Grid Chttp：//lsec. cc. ac. cn/phg/）, a toolbox under active development for parallel adaptive finite element solutions of partial differential equations. The algorithm proposed is characterized by allowing simukaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices. Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given, which is useful in better understanding the behaviour of the biseetioning refinement procedure.
Local mesh refinement is one of the key steps in the implementations of adaptive finite element methods.This paper presents a parallel algorithm for distributed memory parallel computers for adaptive local refinement of tetrahedral meshes using bisection.This algorithm is used in PHG,Parallel Hierarchical Grid (http://lsec.cc.ac.cn/phg/),a toolbox under active development for parallel adaptive finite element solutions of partial differential equations.The algorithm proposed is characterized by allowing simultaneous refinement of submeshes to arbitrary levels before synchronization between submeshes and without the need of a central coordinator process for managing new vertices.Using the concept of canonical refinement, a simple proof of the independence of the resulting mesh on the mesh partitioning is given,which is useful in better understanding the behaviour of the bisectioning refinement procedure.
基金
supported by the 973 Program of China 2005CB321702
China NSF 10531080.
