谱元法和高阶时间分裂法求解方腔顶盖驱动流

详细推导了谱元方法的具体计算公式和时间分裂法的具体计算过程 ;对一般的时间分裂法进行了改进 ,即对非线性步分别用 3阶 Adams-Bashforth方法和 4阶显式 Runge-Kutta法 ,粘性步采用 3阶隐式 Adams-Moulton形式 ,提高了时间方向的离散精度 ,同时还改进了压力边界条件 ,采用 3阶的压力边界条件 ;利用改进的时间分裂方法分解不可压缩 Navier-Stokes方程 ,并结合谱元法计算了移动顶盖方腔驱动流 ,提高了方法可以计算的 Re数 ,缩短了达到收敛的时间 ,并将结果与基准解进行比较 ;分析了移动顶盖方腔驱动流中 Re数对流场分布的影响。     

谱元方法求解二维不可压缩Navier-Stokes方程

利用有限元的思想并结合谱方法的精度提出求解偏微分方程的谱元方法,在元素内插值函数使用伪谱Chebyshev逼近,并将此方法应用于求解不可压Navier-Stokes方程,具体求解了二维方腔顶盖驱动流,与公认基准解对比获得了较好的结果。     

非稳态流动的隐式最小二乘等几何方法

对非稳态粘性不可压流动问题提出了一种隐式最小二乘等几何计算方法。该方法先用隐式的向后多步差分格式对Navier-Stokes方程进行时间离散,再用Newton法线性化对流项,最后在每个时间步上用最小二乘等几何方法进行求解。根据该算法编制了计算程序,通过构造解析解的方法验证了程序的正确性,用该程序求解了雷诺数为5000时的非稳态二维顶盖驱动流问题,计算结果捕捉到了流动过程中涡的演化过程,表明本文方法可用于非稳态流动的求解。     

二维定常不可压缩粘性流动N-S方程的数值流形方法

将流形方法应用于定常不可压缩粘性流动N-S方程的直接数值求解,建立基于Galerkin加权余量法的N-S方程数值流形格式,有限覆盖系统采用混合覆盖形式,即速度分量取1阶和压力取0阶多项式覆盖函数,非线性流形方程组采用直接线性化交替迭代方法和Nowton-Raphson迭代方法进行求解.将混合覆盖的四节点矩形流形单元用于阶梯流和方腔驱动流动的数值算例,以较少单元获得的数值解与经典数值解十分吻合.数值实验证明,流形方法是求解定常不可压缩粘性流动N-S方程有效的高精度数值方法.     

一种基于块雅可比迭代的高阶FR格式隐式方法

最近, 基于非结构网格的高阶通量重构格式(flux reconstruction, FR)因其构造简单且通用性强而受到越来越多人的关注. 但将FR格式应用于大规模复杂流动的模拟时仍面临计算开销大、求解时间长等问题. 因此, 亟需发展与之相适应的高效隐式求解方法和并行计算技术. 本文提出了一种基于块Jacobi迭代的高阶FR格式求解定常二维欧拉方程的单GPU隐式时间推进方法. 由于直接求解FR格式空间和隐式时间离散后的全局线性方程组效率低下并且内存占用很大. 而通过块雅可比迭代的方式, 能够改变全局线性方程组左端矩阵的特征, 克服影响求解并行性的相邻单元依赖问题, 使得只需要存储和计算对角块矩阵. 最终将求解全局线性方程组转化为求解一系列局部单元线性方程组, 进而又可利用LU分解法在GPU上并行求解这些小型局部线性方程组. 通过二维无黏Bump流动和NACA0012无黏绕流两个数值实验表明, 该隐式方法计算收敛所用的迭代步数和计算时间均远小于使用多重网格加速的显式Runge-Kutta格式, 且在计算效率方面至少有一个量级的提升.      

不可压缩粘性流动的CBS有限元解法

对于二维不可压缩粘性流动,首先通过坐标变换的方式得到了的不含对流项的NS方程,并给出了CBS有限元方法求解的一般过程。结合一类同时含有压力和速度的出口边界条件,对方腔顶盖驱动流、后向台阶绕流和圆柱绕流进行了计算。所得结果与基准解符合良好,验证了CBS算法对于定常、非定常粘性不可压缩流动问题的可行性和所用出口边界条件的无反射特性。特别的,对于圆柱绕流,Re=100时非定常升、阻力系数及漩涡脱落等非定常都得到了较好地模拟,为一进步研究自激振动等更加复杂的非定常流动问题奠定了基础。     

不同网格扭曲率下压力修正全隐算法——IDEAL求解性能研究

2008年,本文作者和陶文铨等提出了一种用于速度和压力耦合求解的高效稳定压力修正全隐算法IDEAL,该算法通过在每个迭代层次上对压力方程进行两次内迭代计算,完全克服了SIMPLE算法的两个假设,充分满足了速度和压力之间的耦合,从而大大提高了计算的收敛性和健壮性.为了进一步实现IDEAL算法的推广应用,本文基于三维倾斜方腔顶盖驱动流动,研究了IDEAL算法在不同网格扭曲率下的求解特性.研究发现,在不同网格扭曲率下,IDEAL算法的健壮性和收敛性均优于SIMPLE算法,特别在高网格扭曲率情况下,IDEAL算法求解性能更加优于SIMPLE算法.在不同网格扭曲率下,IDEAL算法健壮性保持不变,几乎可以在任意速度亚松弛因子下获得收敛的解,同时IDEAL算法最短计算耗时较SIMPLE算法减少了56%~89%,验证了IDEAL算法的优越性.     

基于Newton/Gauss-Seidel迭代的DGM隐式方法

在Newton迭代方法的基础上,对高阶精度间断Galerkin有限元方法(DGM)的时间隐式格式进行了研究. Newton迭代 法的优势在于收敛效率高效,并且定常和非定常问题能够统一处理,对于非定常问题无需引入双时间步策略. 为了避免大型矩阵的求逆,采用一步Gauss-Seidel迭代和Matrix-free技术消去残值Jacobi矩阵的上、下三角矩阵,从而只需计算和存储对角(块)矩阵. 对角(块)矩阵采用数值方法计算. 空间离散采用Taylor基,其优势在于对于任意形状的网格,基函数的形式是一致的,有利于在混合网格上推广. 利用该方法,数值模拟了Bump绕流和NACA0012翼型绕流. 计算结果表明,与显式的Runge-Kutta时间格式相比,隐式格式所需的迭代步数和CPU时间均在很大程度上得到减少,计算效率能够提高1～ 2个量级.     

AN APPLICATION OF THE CBS SCHEME IN THE FLUID-MEMBRANE INTERACTION

提出了一种不可压缩流体与弹性薄膜耦合问题的特征线分裂有限元解法. 首先, 给出了流场和结构的控制方程. 然后, 对流场、结构以及流固耦合的具体求解过程进行了描述. 其中, 流场求解采用改进特征线分裂方法和双时间步方法相结合的隐式求解方式, 并利用艾特肯加速法对每个时间步的迭代收敛过程进行了加速处理;结构部分的空间离散和时间积分分别采用伽辽金有限元方法和广义方法, 并通过牛顿迭代法对所得非线性代数方程组进行了求解;流场网格的更新采用弹簧近似法;流场、结构两求解模块之间采用松耦合方式.最后, 采用该方法对具有弹性底面的方腔顶盖驱动流问题进行了求解, 验证了算法的准确性和稳定性.此外, 计算结果表明艾特肯加速法可以显著地提高双时间步方法迭代求解过程的收敛速度.     

配置点谱方法-人工压缩法(SCM-ACM)求解不可压缩流体流动

开发了配置点谱方法SCM(spectral collocation method)与人工压缩法ACM(artificial compressibility method)相结合的方法 SCM-ACM,用于求解不可压缩粘性流动问题。选取典型的方腔顶盖驱动流为研究测试对象,首先建立人工压缩格式的控制方程,其次采用SCM离散控制方程的空间偏微分项,推导出矩阵形式的代数方程,最后测试了SCM-ACM代码的有效性。结果显示,SCM-ACM能够有效求解不可压缩流动问题,并继承了谱方法的指数收敛特性,且具有ACM求解过程简单及易于实施的特点。     

SIMPLE‐type preconditioners for the Oseen problem

In this paper, the steady incompressible Navier–Stokes equations are discretized by the finite element method. The resulting systems of equations are solved by preconditioned Krylov subspace methods. Some new preconditioning strategies, both algebraic and problem dependent are discussed. We emphasize on the approximation of the Schur complement as used in semi implicit method for pressure‐linked equations‐type preconditioners. In the usual formulation, the Schur complement matrix and updates use scaling with the diagonal of the convection–diffusion matrix. We propose a variant of the SIMPLER preconditioner. Instead of using the diagonal of the convection–diffusion matrix, we scale the Schur complement and updates with the diagonal of the velocity mass matrix. This variant is called modified SIMPLER (MSIMPLER). With the new approximation, we observe a drastic improvement in convergence for large problems. MSIMPLER shows better convergence than the well‐known least‐squares commutator preconditioner which is also based on the diagonal of the velocity mass matrix. Copyright © 2008 John Wiley & Sons, Ltd.     

A Mach‐uniform preconditioner for incompressible and subsonic flows

In this study, a novel Mach‐uniform preconditioning method is developed for the solution of Euler equations at low subsonic and incompressible flow conditions. In contrast to the methods developed earlier in which the conservation of mass equation is preconditioned, in the present method, the conservation of energy equation is preconditioned, which enforces the divergence free constraint on the velocity field even at the limiting case of incompressible, zero Mach number flows. Despite most preconditioners, the proposed Mach‐uniform preconditioning method does not have a singularity point at zero Mach number. The preconditioned system of equations preserves the strong conservation form of Euler equations for compressible flows and recovers the artificial compressibility equations in the case of zero Mach number. A two‐dimensional Euler solver is developed for validation and performance evaluation of the present formulation for a wide range of Mach number flows. The validation cases studied show the convergence acceleration, stability, and accuracy of the present Mach‐uniform preconditioner in comparison to the non‐preconditioned compressible flow solutions. The convergence acceleration obtained with the present formulation is similar to those of the well‐known preconditioned system of equations for low subsonic flows and to those of the artificial compressibility method for incompressible flows. Copyright © 2013 John Wiley & Sons, Ltd.     

Local pressure preconditioning method for steady incompressible flows

The convergence and accuracy characteristics of the preconditioned incompressible Euler and Navier–Stokes equations are studied. An object-oriented C++ numerical code has been developed for solving the inviscid and viscous, steady, incompressible flows problems. The code is based on the cell-centred finite volume method. In this scheme, two-dimensional incompressible Euler and Navier–Stokes equations are modified by a robust artificial compressibility (AC) and a local preconditioning matrix of pressure-sensor type. The preconditioned equations are solved with the Jameson's numerical approach, i.e. artificial dissipation and artificial viscosity terms under the form of a fourth- and second-order derivative, respectively. An explicit four-stage Runge–Kutta integration algorithm is applied to obtain the steady-state condition. The computed results include the steady-state solution of flow past the NACA-hydrofoils and a circular cylinder in free stream, for which the numerical results are compared with numerical works of other researchers. Good agreement is observed. The effects of AC parameter, artificial viscosity and dissipation factor, and local preconditioning coefficient on convergence rate and solution accuracy are tested by computing flow over the NACA0012 hydrofoil. In addition, some important design criteria of a preconditioner, such as stiffness reduction, hyperbolicity, symmetrisability, accuracy preservation for M → 0, and M-property have been examined analytically.     

谱元方法求解环形空间内自然对流换热

提出了将谱元方法应用到极坐标系下，利用极坐标系下的谱元方法求解环形空间内自然对流问题。具体求解了原始变量速度和压力的不可压缩Navier-Stokes方程和能量方程，通过在时间方向采用时间分裂方法和空间采用谱元方法对方程进行离散求解，取得了与基准解较一致的计算结果。     

Application of a preconditioned high‐order accurate artificial compressibility‐based incompressible flow solver in wide range of Reynolds numbers

In the present study, the preconditioned incompressible Navier‐Stokes equations with the artificial compressibility method formulated in the generalized curvilinear coordinates are numerically solved by using a high‐order compact finite‐difference scheme for accurately and efficiently computing the incompressible flows in a wide range of Reynolds numbers. A fourth‐order compact finite‐difference scheme is utilized to accurately discretize the spatial derivative terms of the governing equations, and the time integration is carried out based on the dual time‐stepping method. The capability of the proposed solution methodology for the computations of the steady and unsteady incompressible viscous flows from very low to high Reynolds numbers is investigated through the simulation of different 2‐dimensional benchmark problems, and the results obtained are compared with the existing analytical, numerical, and experimental data. A sensitivity analysis is also performed to evaluate the effects of the size of the computational domain and other numerical parameters on the accuracy and performance of the solution algorithm. The present solution procedure is also extended to 3 dimensions and applied for computing the incompressible flow over a sphere. Indications are that the application of the preconditioning in the solution algorithm together with the high‐order discretization method in the generalized curvilinear coordinates provides an accurate and robust solution method for simulating the incompressible flows over practical geometries in a wide range of Reynolds numbers including the creeping flows.     

Cavitating/non-cavitating flows simulation by third-order finite volume scheme and power-law preconditioning method

Equations of steady inviscid and laminar flows are solved by means of a third-order finite volume (FV) scheme. For this purpose, a cell-centered discretization technique is employed. In this technique, the flow parameters at the cell faces are computed using a third-order weighted averages procedure. A fourth-order artificial dissipation is used for stability of the solution. In order to achieve the steady-state situation, four-step Runge-Kutta explicit time integration method is applied. An advanced progressive preconditioning method, named the power-law preconditioning method, is used for faster convergence. In this method, the preconditioning matrix is adjusted automatically from the velocity and/or pressure flow-field by a power-law relation. Attention is directed towards accuracy and convergence of the schemes. The results presented in the paper focus on steady inviscid and laminar flows around sheet-cavitating and fully-wetted bodies including hydrofoils and circular/elliptical cylinder. Excellent agreements are obtained when numerical predictions are compared with other available experimental and numerical results. In addition, it is found that using the power-law preconditioner significantly increases the numerical convergence speed.     

Efficient preconditioning techniques for finite‐element quadratic discretization arising from linearized incompressible Navier–Stokes equations

We develop an efficient preconditioning techniques for the solution of large linearized stationary and non‐stationary incompressible Navier–Stokes equations. These equations are linearized by the Picard and Newton methods, and linear extrapolation schemes in the non‐stationary case. The time discretization procedure uses the Gear scheme and the second‐order Taylor–Hood element P₂?P₁ is used for the approximation of the velocity and the pressure. Our purpose is to develop an efficient preconditioner for saddle point systems. Our tools are the addition of stabilization (penalization) term r?(div(·)), and the use of triangular block matrix as global preconditioner. This preconditioner involves the solution of two subsystems associated, respectively, with the velocity and the pressure and have to be solved efficiently. Furthermore, we use the P₁?P₂ hierarchical preconditioner recently proposed by the authors, for the block matrix associated with the velocity and an additive approach for the Schur complement approximation. Finally, several numerical examples illustrating the good performance of the preconditioning techniques are presented. Copyright © 2009 John Wiley & Sons, Ltd.     

Temporal accuracy analysis of phase change convection simulations using the JFNK‐SIMPLE algorithm

The incompressible Navier–Stokes and energy conservation equations with phase change effects are applied to two benchmark problems: (1) non‐dimensional freezing with convection; and (2) pure gallium melting. Using a Jacobian‐free Newton–Krylov (JFNK) fully implicit solution method preconditioned with the SIMPLE (Numerical Heat Transfer and Fluid Flow. Hemisphere: New York, 1980) algorithm using centred discretization in space and three‐level discretization in time converges with second‐order accuracy for these problems. In the case of non‐dimensional freezing, the temporal accuracy is sensitive to the choice of velocity attenuation parameter. By comparing to solutions with first‐order backward Euler discretization in time, it is shown that the second‐order accuracy in time is required to resolve the fine‐scale convection structure during early gallium melting. Qualitative discrepancies develop over time for both the first‐order temporal discretized simulation using the JFNK‐SIMPLE algorithm that converges the nonlinearities and a SIMPLE‐based algorithm that converges to a more common mass balance condition. The discrepancies in the JFNK‐SIMPLE simulations using only first‐order rather than second‐order accurate temporal discretization for a given time step size appear to be offset in time. Copyright © 2007 John Wiley & Sons, Ltd.     

Analysis of preconditioned iterative solvers for incompressible flow problems

Solving efficiently the incompressible Navier–Stokes equations is a major challenge, especially in the three‐dimensional case. The approach investigated by Elman et al. (Finite Elements and Fast Iterative Solvers. Oxford University Press: Oxford, 2005) consists in applying a preconditioned GMRES method to the linearized problem at each iteration of a nonlinear scheme. The preconditioner is built as an approximation of an ideal block‐preconditioner that guarantees convergence in 2 or 3 iterations. In this paper, we investigate the numerical behavior for the three‐dimensional lid‐driven cavity problem with wedge elements; the ultimate motivation of this analysis is indeed the development of a preconditioned Krylov solver for stratified oceanic flows which can be efficiently tackled using such meshes. Numerical results for steady‐state solutions of both the Stokes and the Navier–Stokes problems are presented. Theoretical bounds on the spectrum and the rate of convergence appear to be in agreement with the numerical experiments. Sensitivity analysis on different aspects of the structure of the preconditioner and the block decomposition strategies are also discussed. Copyright © 2011 John Wiley & Sons, Ltd.     

A Jacobian‐free Newton–Krylov method for thermalhydraulics simulations

The current paper is focused on investigating a Jacobian‐free Newton–Krylov (JFNK) method to obtain a fully implicit solution for two‐phase flows. In the JFNK formulation, the Jacobian matrix is not directly evaluated, potentially leading to major computational savings compared with a simple Newton's solver. The objectives of the present paper are as follows: (i) application of the JFNK method to two‐fluid models; (ii) investigation of the advantages and disadvantages of the fully implicit JFNK method compared with commonly used explicit formulations and implicit Newton–Krylov calculations using the determination of the Jacobian matrix; and (iii) comparison of the numerical predictions with those obtained by the Canadian Algorithm for Thermaulhydraulics Network Analysis 4. Two well‐known benchmarks are considered, the water faucet and the oscillating manometer. An isentropic two‐fluid model is selected. Time discretization is performed using a backward Euler scheme. A Crank–Nicolson scheme is also implemented to check the effect of temporal discretization on the predictions. Advection Upstream Splitting Method+ is applied to the convective fluxes. The source terms are discretized using a central differencing scheme. One explicit and two implicit formulations, one with Newton's solver with the Jacobian matrix and one with JFNK, are implemented. A detailed grid and model parameter sensitivity analysis is performed. For both cases, the JFNK predictions are in good agreement with the analytical solutions and explicit profiles. Further, stable results can be achieved using high CFL numbers up to 200 with a suitable choice of JFNK parameters. The computational time is significantly reduced by JFNK compared with the calculations requiring the determination of the Jacobian matrix. Copyright © 2015 John Wiley & Sons, Ltd.