Adaptive-mesh algorithms for computational fluid dynamics
Adaptive-mesh algorithms for computational fluid dynamics
复制标题
DOI：
10.1007/978-1-4612-2708-3_18
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
K. Powell;P. Roe;J. Quirk
中科院分区：
文献类型：
--
作者：
K. Powell;P. Roe;J. Quirk
自适应网格算法的基本目标是通过增加流动的“重要”区域的分辨率并降低不太重要的区域的分辨率来明智地分配计算资源。虽然这个目标往往是值得的，但实施具有这种复杂程度的计划仍然更像是一门艺术而不是科学。在本文中，自适应网格算法的基本件进行了描述，并讨论和比较了一些可能的方式来实现它们。这些基本部分是：要使用的数据结构;初始网格的生成;用于使网格适应解的标准;以及在所得到的网格上的流解算器算法。每一个都进行了讨论，特别强调适用于可压缩流计算的方法。
The basic goal of adaptive-mesh algorithms is to distribute computational resources wisely, by increasing the resolution of “important” regions of the flow, and decreasing the resolution of regions that are less important. While this goal is one that is, more often than not, worthwhile, implementing schemes that have this degree of sophistication remains more of an art than a science. In this paper, the basic pieces of adaptive-mesh algorithms are described, and some of the possible ways to implement them are discussed and compared. These basic pieces are: the data structure to be used; the generation of an initial mesh; the criterion to be used to adapt the mesh to the solution; and the flow-solver algorithm on the resulting mesh. Each of these is discussed, with particular emphasis on methods suitable for the computation of compressible flows.