An Adaptive Cartesian Mesh Flow Solver Based on the Tree-data with Anisotropic Mesh Refinement
An Adaptive Cartesian Mesh Flow Solver Based on the Tree-data with Anisotropic Mesh Refinement
复制标题
基于树数据的各向异性网格细化的自适应笛卡尔网格流求解器
DOI：
10.1007/978-3-642-59334-5_67
复制
发表时间：
2003
期刊：
影响因子：
2.5
通讯作者：
T. Ogawa
中科院分区：
文献类型：
--
作者：
T. Ogawa
提出了一种具有各向异性网格细化的自适应笛卡尔网格流求解器。采用树形数据结构组织自适应细化网格。结果表明，针对各向异性网格的精细化算法可以在稍加修改的情况下扩展到各向异性网格。该算法的并行化也在SPMD范例中完成。采用域分解技术，根据划分的域划分出树状数据结构。在PC集群上对并行效率进行了测试。
An adaptive Cartesian mesh flow solver with anisotropic mesh refinement is developed. The tree data structure is utilized to organize the adaptively refined meshes. It is found that the algorithm developed for isotropic mesh refinement can be extended for anisotropic case with little modification. Parallelization of the algorithm is also done in the SPMD paradigm. The domain decomposition technique is used and a tree data structure is split according to the partitioned domain. Parallel efficiency is examined on a PC cluster.