Walsh函数有限体积法的多重网格特征研究

Walsh函数有限体积法(FVM-WBF)是一种能够在网格内部捕捉间断的新型数值方法. 持续增加Walsh基函数数目能够稳步提高FVM-WBF方法的求解分辨率, 但计算量暴发式增长和收敛速度下降的问题也会同步出现. 针对Walsh基函数数目增加而引起的计算效率问题, 本文分析了Walsh基函数及其系数所能影响的网格单元局部均值区域尺度, 发现其中隐含类似多重网格的尺度特征, 据此提出一种结合多重网格策略的FVM-WBF方法. 在定常流场计算中根据各级Walsh基函数影响尺度的不同, 对每级Walsh基函数设置满足其稳定性约束的时间步长, 在时间推进求解的过程中快速消除不同波长的数值误差, 实现多重网格的加速收敛效果. 选取NACA0012翼型和二维圆柱的定常无黏绕流问题作为算例, 对引入多重网格策略的FVM-WBF方法和不考虑多重网格策略的FVM-WBF方法进行对比测试. 数值结果证实: 新发展的FVM-WBF方法具备多重网格的关键特征, 在不增加任何特殊处理和计算量的情况下, 只需通过时间步长的调整, 就能够达到多重网格的加速效果, 显著提升计算效率.      

二维对流扩散方程的高精度全隐式多重网格方法

提出了数值求解二维非定常变系数对流扩散方程的一种时间二阶、空间四阶精度的三层全隐紧致差分格式。为了加快迭代求解隐格式时在每一个时间步上的收敛速度，采用多重网格加速技术，建立了适用于本文高精度金隐紧致格式的多重网格算法。数值实验结果验证了本文方法的精确性、稳定性和对高网格雷诺数问题的强适应性。     

三维对流扩散方程的高精度全隐式多重网格方法

提出了数值求解三维非定常变系数对流扩散方程的一种高精度全隐紧致差分格式,该格式在空间上具有四阶精度,时间具有二阶精度。为了克服传统迭代法在每一个时间步上迭代求解隐格式时收敛速度慢的缺点,采用多重网格加速技术,建立了适用于本文高精度全隐紧致格式的多重网格算法,从而大大加快了迭代收敛速度。数值实验结果验证了本文方法的精确性、稳定性和对高网格雷诺数问题的强适应性。     

基于高阶和高效格式的悬停旋翼可压缩无粘绕流的计算

发展了一种基于高精度和高效格式计算悬停旋翼复杂绕流的隐式有限体积方法。控制方程为Euler方程,其中对流项通量的左右状态量采用五阶加权基本无振荡(WENO)格式重构,时间推进应用隐式LU-SGS算法,为进一步加速收敛,采用三层V循环多重网格松弛方法。考虑到多重网格方法的思想以及五阶WENO格式涉及6个网格单元,建议仅在最细网格上使用WENO格式。计算结果表明本文方法能有效捕捉激波,对尾迹也有较高分辨率,基于隐式LU-SGS算法的多重网格方法能有效提高计算效率。     

非结构网格上p型多重网格法流场数值模拟

在二维、三维非结构网榕上,针对间断Galerkin方法计算量大、收敛慢的缺点将p型多重网格方法应用于该方法求解跨音速Euler方程,提高计算效率。p型多重网格方法是通过对不同阶次多项式近似解进行递归迭代求解,来达到加速收敛。文中对高阶近似(p＞0)使用显式格式,最低阶近似(p=0)采用隐式格式。NACA0012翼型和O...     

一种微机械有限元仿真的多重网格预处理方法

在微机械结构设计中常用有限元方法进行仿真,然而,通用的三维有限元仿真算法在进行有限元分析时耗时较长,影响了仿真效率。针对常规MEMS工艺仅有二维成形能力的特征,提出了将二维多重网格方法融入条件共轭梯度法的预处理的方法。并以一种三明治式微加速度计的ANSYS模态分析为具体算例,提出了用多重网格思想对网点分布进行插值以求在不太提高条件数的情况下提高对这类低频非局部振型的模态分析问题的求解精度的二维预处理算法。所提出的多重网络的网络划分预处理算法将预处理前后的同精度分析计算时间由206 min减少到38 min,但相对精度从0.018%降低到了0.038%。这种算法可用于二维成形结构的静力分析和模态分析并提高设计效率。     

求解一类网格结构模型的代数多重网格法

针对网格结构离散模型的特点,设计了一类适用于求解大规模二维网格结构数值计算的代数多重网格方法,详细描述了代数多重网格方法中粗化策略与插值算子的构造,并在此基础上得到了一类以该代数多重网格为预条件子的预处理方法。数值试验表明,本文建立的代数多重网格方法及相应的预处理方法是健壮的,具有较好的数值效率,非常适合于大规模网格结构材料的数值计算。近似连续模型的建立为代数多重网格方法的可靠性和计算的准确性提供了有效的理论基础。     

基于二重网格的动网格松弛法改进

相比传统的弹簧法等方法,基于球松弛算法的动网格松弛法在复杂边界大变形条件下可以得到质量更高的边界网格以及更大的极限变形量,但该方法在时间效率上还有提升的空间.引入二重网格,采用动网格松弛法进行稀疏网格的网格变形,将边界位移传递到整个网格计算域;再利用二重网格映射,将稀疏网格位移映射到原有计算网格的节点上.算例表明,改进...     

一种基于双前沿推进的边界层网格生成算法

高雷诺数粘性流动模拟对边界层内的网格正交性有特殊要求.对于复杂外形,这类问题的网格自动化生成十分困难.面向该问题,提出一种双前沿推进思想,并形成一种面向复杂几何外形的边界层网格全自动生成算法.结合多种网格技术处理局部几何特征以保证边界层网格的质量.双前沿推进思想同时适用于多块结构网格和混合网格的边界层网格生成.多个模型...     

含活塞的管内湍流的数值模拟

应用两方程模式和 SIMPLER 算法对含活塞的管内复杂湍流进行了数值模拟.活塞直径和外管内径之比为0.8,雷诺数为6.05×10~4.数值模拟得到了三个回流区.下游回流的分离-再附长度是活塞直径的1.5倍.间隙段存在流速超越现象,但不存在后台阶流动计算中的核心区现象.文中给出了数值模拟的详细成果.     

Multigrid flow solutions in complex two-dimensional geometries

A finite difference solution algorithm is described for use on two-dimensional curvilinear meshes generated by the solution of the transformed Laplace equation. The efficiency of the algorithm is improved through the use of a full approximation scheme (FAS) multigrid algorithm using an extended pressure correction scheme as smoother. The multigrid algorithm is implemented as a fixed V-cycle through the grid levels with a constant number of sweeps being performed at each grid level. The accuracy and efficiency of the numerical code are validated using comparisons of the flow over two backward step configurations. Results show close agreement with previous numerical predictions and experimental data. Using a standard Cartesian co-ordinate flow solver, the multigrid efficiency obtainable in a rectangular system is shown to be reproducible in two-dimensional body-fitted curvilinear co-ordinates. Comparisons with a standard one-grid method show the multigrid method, on curvilinear meshes, to give reductions in CPU time of up to 93%.     

A multigrid procedure for three-dimensional flows on non-orthogonal collocated grids

The development of a multigrid solution algorithm for the computation of three-dimensional laminar fully-elliptic incompressible flows is presented. The procedure utilizes a non-orthogonal collocated arrangement of the primitive variables in generalized curvilinear co-ordinates. The momentum and continuity equations are solved in a decoupled manner and a pressure-correction equation is used to update the pressures such that the fluxes at the cell faces satisfy local mass continuity. The convergence of the numerical solution is accelerated by the use of a Full Approximation Storage (FAS) multigrid technique. Numerical computations of the laminar flow in a 90° strongly curved pipe are performed for several finite-volume grids and Reynolds numbers to demonstrate the efficiency of the present numerical scheme. The rates of convergence, computational times, and multigrid performance indicators are reported for each case. Despite the additional computational overhead required in the restriction and prolongation phases of the multigrid cycling, the superior convergence of the present algorithm is shown to result in significantly reduced overall CPU times.     

两方程湍流模型混合隐式迭代/解析算法研究

采用通量修正二阶TVD格式和混合隐式时间推进/解析算法求解k-ε湍流模型的输运方程以克服其计算刚性. 通过过膨胀状态下轴对称喷管内流场、带圆转方型面二元喷管内外流场两个算例, 验证了其配合改进的多重网格算法对计算效率的提高. 计算结果与试验数据进行了对比.      

Symmetric Gauss-Seidel multigrid solution of the Euler equations on structured and unstructured grids

The efficient symmetric Gauss-Seidel (SGS) algorithm for solving the Euler equations of inviscid, compressible flow on structured grids, developed in collaboration with Jameson of Stanford University, is extended to unstructured grids. The algorithm uses a nonlinear formulation of an SGS solver, implemented within the framework of multigrid. The earlier form of the algorithm used the natural (lexicographic) ordering of the mesh cells available on structured grids for the SGS sweeps, but a number of features of the method that are believed to contribute to its success can also be implemented for computations on unstructured grids. The present paper reviews, the features of the SGS multigrid solver for structured gr0ids, including its nonlinear implementation, its use of “absolute” Jacobian matrix preconditioning, and its incorporation of multigrid, and then describes the incorporation of these features into an algorithm suitable for computations on unstructured grids. The implementation on unstructured grids is based on the agglomerated multigrid method developed by Sørensen, which uses an explicit Runge-Kutta smoothing algorithm. Results of computations for steady, transonic flows past two-dimensional airfoils are presented, and the efficiency of the method is evaluated for computations on both structured and unstructured meshes.     

Two‐dimensional implicit time‐dependent calculations on adaptive unstructured meshes with time evolving boundaries

An implicit multigrid‐driven algorithm for two‐dimensional incompressible laminar viscous flows has been coupled with a solution adaptation method and a mesh movement method for boundary movement. Time‐dependent calculations are performed implicitly by regarding each time step as a steady‐state problem in pseudo‐time. The method of artificial compressibility is used to solve the flow equations. The solution mesh adaptation method performs local mesh refinement using an incremental Delaunay algorithm and mesh coarsening by means of edge collapse. Mesh movement is achieved by modeling the computational domain as an elastic solid and solving the equilibrium equations for the stress field. The solution adaptation method has been validated by comparison with experimental results and other computational results for low Reynolds number flow over a shedding circular cylinder. Preliminary validation of the mesh movement method has been demonstrated by a comparison with experimental results of an oscillating airfoil and with computational results for an oscillating cylinder. Copyright © 2005 John Wiley & Sons, Ltd.     

Efficient Large-eddy Simulations of Low Mach Number Flows Using Preconditioning and Multigrid

In the present paper, an implicit time accurate approach combined with multigrid, preconditioning and residual smoothing is used for the large-eddy simulation (LES) of low Mach number flow. In general, due to the restriction imposed on the time step by the physics of the flow, the advantage of an implicit method over an explicit one for LES is not obvious. It is shown that for the test cases considered in this paper, the present approach allows an efficiency gain of a factor 4–7 compared to the use of a purely explicit approach. The efficiency varies according to the test case, grid clustering, physical time step and requested residual drop. Numerical difficulties are catalogued and mitigatory procedures are introduced. Several problems with available experimental and DNS data are employed to verify the efficiency of the method.     

Computation of fluid flow with a parallel multigrid solver

A finite volume numerical method for the prediction of fluid flow and heat transfer in simple geometries was parallelized using a domain decomposition approach. The method is implicit, uses a colocated arrangement of variables and is based on the SIMPLE algorithm for pressure-velocity coupling. Discretization is based on second-order central difference approximations. The algebraic equation systems are solved by the ILU method of Stone.¹ To accelerate the convergence, a multigrid technique was used. The efficiency was examined on three different parallel computers for laminar flow in a pipe with an orifice and natural convection in a closed cavity. It is shown that the total efficiency is made up of three major factors: numerical efficiency, parallel efficiency and load-balancing efficiency. The first two factors were thoroughly investigated, and a model for predicting the parallel efficiency on various computers is presented. Test calculations indicate reasonable total efficiency and favourable dependence on grid size and the number of processors.