An adaptive Cartesian mesh flow solver based on the tree-data with anisotropic mesh refinement

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 SPAM 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.