Three‐dimensional instability of axisymmetric flows: solution of benchmark problems by a low‐order finite volume method

Several problems on three‐dimensional instability of axisymmetric steady flows driven by convection or rotation or both are studied by a second‐order finite volume method combined with the Fourier decomposition in the periodic azimuthal direction. The study is focused on the convergence of the critical parameters with mesh refinement. The calculations are done on the uniform and stretched grids with variation of the stretching. Converged results are reported for all the problems considered and are compared with the previously published data. Some of the calculated critical parameters are reported for the first time. The convergence studies show that the three‐dimensional instability of axisymmetric flows can be computed with a good accuracy only on fine enough grids having about 100 nodes in the shortest spatial direction. It is argued that a combination of fine uniform grids with the Richardson extrapolation can be a good replacement for a grid stretching. It is shown once more that the sparseness of the Jacobian matrices produced by the finite volume method allows one to enhance performance of the Newton and Arnoldi iteration procedures by combining them with a direct sparse linear solver instead of using the Krylov‐subspace‐based iteration methods. Copyright © 2006 John Wiley & Sons, Ltd.     

Preconditioned Krylov subspace methods used in solving two‐dimensional transient two‐phase flows

This paper investigates the performance of preconditioned Krylov subspace methods used in a previously presented two‐fluid model developed for the simulation of separated and intermittent gas–liquid flows. The two‐fluid model has momentum and mass balances for each phase. The equations comprising this model are solved numerically by applying a two‐step semi‐implicit time integration procedure. A finite difference numerical scheme with a staggered mesh is used. Previously, the resulting linear algebraic equations were solved by a Gaussian band solver. In this study, these algebraic equations are also solved using the generalized minimum residual (GMRES) and the biconjugate gradient stabilized (Bi‐CGSTAB) Krylov subspace iterative methods preconditioned with incomplete LU factorization using the ILUT(p, τ) algorithm. The decrease in the computational time using the iterative solvers instead of the Gaussian band solver is shown to be considerable. Copyright © 1999 John Wiley & Sons, Ltd.     

Anisotropic mesh adaptation: towards user‐independent,mesh‐independent and solver‐independent CFD. Part I: general principles

The present paper is the lead article in a three‐part series on anisotropic mesh adaptation and its applications to structured and unstructured meshes. A flexible approach is proposed and tested on two‐dimensional, inviscid and viscous, finite volume and finite element flow solvers, over a wide range of speeds. The directional properties of an interpolation‐based error estimate, extracted from the Hessian of the solution, are used to control the size and orientation of mesh edges. The approach is encapsulated into an edge‐based anisotropic mesh optimization methodology (MOM), which uses a judicious sequence of four local operations: refinement, coarsening, edge swapping and point movement, to equi‐distribute the error estimate along all edges, without any recourse to remeshing. The mesh adaptation convergence of the MOM loop is carefully studied for a wide variety of test cases. The mesh optimization generic coupling of MOM with finite volume and finite element flow solvers is shown to yield the same final mesh no matter what the starting point is. It is also shown that on such optimized meshes, the need for computational fluid dynamics (CFD) stabilization artifices, such as upwinding or artificial viscosity, are drastically reduced, if not altogether eliminated, in most well‐posed formulations. These two conclusions can be considered significant steps towards mesh‐independent and solver‐independent CFD. The structure of the three‐part series is thus, 1, general principles; 2, methodology and applications to structured and unstructured grids; 3, applications to three‐dimensional flows. Copyright © 2000 John Wiley & Sons, Ltd.     

A comparison of time integration methods in an unsteady low‐Reynolds‐number flow

This paper describes three different time integration methods for unsteady incompressible Navier–Stokes equations. Explicit Euler and fractional‐step Adams–Bashford methods are compared with an implicit three‐level method based on a steady‐state SIMPLE method. The implicit solver employs a dual time stepping and an iteration within the time step. The spatial discretization is based on a co‐located finite‐volume technique. The influence of the convergence limits and the time‐step size on the accuracy of the predictions are studied. The efficiency of the different solvers is compared in a vortex‐shedding flow over a cylinder in the Reynolds number range of 100–1600. A high‐Reynolds‐number flow over a biconvex airfoil profile is also computed. The computations are performed in two dimensions. At the low‐Reynolds‐number range the explicit methods appear to be faster by a factor from 5 to 10. In the high‐Reynolds‐number case, the explicit Adams–Bashford method and the implicit method appear to be approximately equally fast while yielding similar results. Copyright © 2002 John Wiley & Sons, Ltd.     

间断Galerkin有限元和有限体积混合计算方法研究

通过局部坐标变换而建立的非正交单元间断Galerkin(DG)有限元计算方法计算精度高， 但计算量大、内存需求大；而非结构网格有限体积方法虽然准确计算热流的问题目 前还没有完全解决，但其具有计算速度快和内存需求小的优点. 该研究是将有 限元和有限体积方法的优点结合，发展有限元和有限体积的混合方法. 在物面 附近黏性占主导作用的区域内采用有限元方法进行计算，在远离物面的区域采用快速的有限 体积方法进行计算，在有限元和有限体积方法结合处要保证通量守恒. 通过算例说明有 限元和有限体积混合方法既能保证黏性区域的热流计算精度和流场结构的分辨率，又能 降低内存需求和提高计算效率，使有限元方法应用于复杂外形(实际工程问题)的计 算成为可能.     

高阶谱元区域分解算法求解定常方腔驱动流

主要利用Jacobian-free的Newton-Krylov方法求解定常不可压缩Navier-Stokes方程,将基于高阶谱元法的区域分解Stokes算法的非定常时间推进步作为Newton迭代的预处理,回避了传统Newton方法Jacobian矩阵的显式装配,节省了程序内存,同时降低了Newton迭代线性系统的条件数,且没有非线性对流项的隐式求解,大大加快了收敛速度。对有分析解的Kovasznay流动的计算结果表明,本高阶谱元法在空间上有指数收敛的谱精度,且对定常解的Newton迭代是二次收敛的。本文模拟了二维方腔顶盖一致速度驱动流,同基准解符合得很好,表明本文方法是准确可靠的。本文还考虑了Re=800时方腔顶盖正弦速度驱动流,除得到已知的一个稳定对称解和一对稳定非对称解外,还获得了一对新的不稳定的非对称解。     

Numerical comparison of hybridized discontinuous Galerkin and finite volume methods for incompressible flow

In this study, a hybridizable discontinuous Galerkin method is presented for solving the incompressible Navier–Stokes equation. In our formulation, the convective part is linearized using a Picard iteration, for which there exists a necessary criterion for convergence. We show that our novel hybridized implementation can be used as an alternative method for solving a range of problems in the field of incompressible fluid dynamics. We demonstrate this by comparing the performance of our method with standard finite volume solvers, specifically the well‐established finite volume method of second order in space, such as the icoFoam and simpleFoam of the OpenFOAM package for three typical fluid problems. These are the Taylor–Green vortex, the 180‐degree fence case and the DFG benchmark. Our careful comparison yields convincing evidence for the use of hybridizable discontinuous Galerkin method as a competitive alternative because of their high accuracy and better stability properties. Copyright © 2014 John Wiley & Sons, Ltd.     

A fast nested multi‐grid viscous flow solver for adaptive Cartesian/Quad grids

A nested multi‐grid solution algorithm has been developed for an adaptive Cartesian/Quad grid viscous flow solver. Body‐fitted adaptive Quad (quadrilateral) grids are generated around solid bodies through ‘surface extrusion’. The Quad grids are then overlapped with an adaptive Cartesian grid. Quadtree data structures are employed to record both the Quad and Cartesian grids. The Cartesian grid is generated through recursive sub‐division of a single root, whereas the Quad grids start from multiple roots—a forest of Quadtrees, representing the coarsest possible Quad grids. Cell‐cutting is performed at the Cartesian/Quad grid interface to merge the Cartesian and Quad grids into a single unstructured grid with arbitrary cell topologies (i.e., arbitrary polygons). Because of the hierarchical nature of the data structure, many levels of coarse grids have already been built in. The coarsening of the unstructured grid is based on the Quadtree data structure through reverse tree traversal. Issues arising from grid coarsening are discussed and solutions are developed. The flow solver is based on a cell‐centered finite volume discretization, Roe's flux splitting, a least‐squares linear reconstruction, and a differentiable limiter developed by Venkatakrishnan in a modified form. A local time stepping scheme is used to handle very small cut cells produced in cell‐cutting. Several cycling strategies, such as the saw‐tooth, W‐ and V‐cycles, have been studies. The V‐cycle has been found to be the most efficient. In general, the multi‐grid solution algorithm has been shown to greatly speed up convergence to steady state—by one to two orders. Copyright © 2000 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 multigrid pseudospectral method for steady flow computation

In this work two‐dimensional steady flow problems are cast into a fixed‐point formulation, Q = F(Q). The non‐linear operator, F, is an approximate pseudospectral solver to the Navier–Stokes equations. To search the solution we employ Picard iteration together with a one‐dimensional error minimization and a random perturbation in case of getting stuck. A monotone convergence is brought out, and is greatly improved by using a multigrid strategy. The efficacy of this approach is demonstrated by computing flow between eccentric rotating cylinders, and the regularized lid‐driven cavity flow with Reynolds number up to 1000. Copyright © 2003 John Wiley & Sons, Ltd.     

Algebraic multigrid and incompressible fluid flow

This paper is concerned with the development of algebraic multigrid (AMG) solution methods for the coupled vector–scalar fields of incompressible fluid flow. It addresses in particular the problems of unstable smoothing and of maintaining good vector–scalar coupling in the AMG coarse‐grid approximations. Two different approaches have been adopted. The first is a direct approach based on a second‐order discrete‐difference formulation in primitive variables. Here smoothing is stabilized using a minimum residual control harness and velocity–pressure coupling is maintained by employing a special interpolation during the construction of the inter‐grid transfer operators. The second is an indirect approach that avoids the coupling problem altogether by using a fourth‐order discrete‐difference formulation in a single scalar‐field variable, primitive variables being recovered in post‐processing steps. In both approaches the discrete‐difference equations are for the steady‐state limit (infinite time step) with a fully implicit treatment of advection based on central differencing using uniform and non‐uniform unstructured meshes. They are solved by Picard iteration, the AMG solvers being used repeatedly for each linear approximation. Both classical AMG (C‐AMG) and smoothed‐aggregation AMG (SA‐AMG) are used. In the direct approach, the SA‐AMG solver (with inter‐grid transfer operators based on mixed‐order interpolation) provides an almost mesh‐independent convergence. In the indirect approach for uniform meshes, the C‐AMG solver (based on a Jacobi‐relaxed interpolation) provides solutions with an optimum scaling of the convergence rates. For non‐uniform meshes this convergence becomes mesh dependent but the overall solution cost increases relatively slowly with increasing mesh bandwidth. Copyright © 2006 John Wiley & Sons, Ltd.     

The shallow flow equations solved on adaptive quadtree grids

This paper describes an adaptive quadtree grid‐based solver of the depth‐averaged shallow water equations. The model is designed to approximate flows in complicated large‐scale shallow domains while focusing on important smaller‐scale localized flow features. Quadtree grids are created automatically by recursive subdivision of a rectangle about discretized boundary, bathymetric or flow‐related seeding points. It can be fitted in a fractal‐like sense by local grid refinement to any boundary, however distorted, provided absolute convergence to the boundary is not required and a low level of stepped boundary can be tolerated. Grid information is stored as a tree data structure, with a novel indexing system used to link information on the quadtree to a finite volume discretization of the governing equations. As the flow field develops, the grids may be adapted using a parameter based on vorticity and grid cell size. The numerical model is validated using standard benchmark tests, including seiches, Coriolis‐induced set‐up, jet‐forced flow in a circular reservoir, and wetting and drying. Wind‐induced flow in the Nichupté Lagoon, México, provides an illustrative example of an application to flow in extremely complicated multi‐connected regions. Copyright © 2001 John Wiley & Sons, Ltd.     

On parallel pre‐conditioners for pressure Poisson equation in LES of complex geometry flows

This paper presents an assessment of fast parallel pre‐conditioners for numerical solution of the pressure Poisson equation arising in large eddy simulation of turbulent incompressible flows. Focus is primarily on the pre‐conditioners suitable for domain decomposition based parallel implementation of finite volume solver on non‐uniform structured Cartesian grids. Bi‐conjugate gradient stabilized method has been adopted as the Krylov solver for the linear algebraic system resulting from the discretization of the pressure Poisson equation. We explore the performance of multigrid pre‐conditioner for the non‐uniform grid and compare its performance with additive Schwarz pre‐conditioner, Jacobi and SOR(k) pre‐conditioners. Numerical experiments have been performed to assess the suitability of these pre‐conditioners for a wide range of non‐uniformity (stretching) of the grid in the context of large eddy simulation of a typical flow problem. It is seen that the multigrid preconditioner shows the best performance. Further, the SOR(k) preconditioner emerges as the next best alternative. Copyright © 2016 John Wiley & Sons, Ltd.     

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

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

Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions

The effects of reordering the unknowns on the convergence of incomplete factorization preconditioned Krylov subspace methods are investigated. Of particular interest is the resulting preconditioned iterative solver behavior when adaptive mesh refinement and coarsening (AMR/C) are utilized for serial or distributed parallel simulations. As representative schemes, we consider the familiar reverse Cuthill–McKee and quotient minimum degree algorithms applied with incomplete factorization preconditioners to CG and GMRES solvers. In the parallel distributed case, reordering is applied to local subdomains for block ILU preconditioning, and subdomains are repartitioned dynamically as mesh adaptation proceeds. Numerical studies for representative applications are conducted using the object‐oriented AMR/C software system libMesh linked to the PETSc solver library. Serial tests demonstrate that global unknown reordering and incomplete factorization preconditioning can reduce the number of iterations and improve serial CPU time in AMR/C computations. Parallel experiments indicate that local reordering for subdomain block preconditioning associated with dynamic repartitioning because of AMR/C leads to an overall reduction in processing time. Copyright © 2011 John Wiley & Sons, Ltd.     

Higher order finite element methods and multigrid solvers in a benchmark problem for the 3D Navier–Stokes equations

This paper presents a numerical study of the 3D flow around a cylinder which was defined as a benchmark problem for the steady state Navier–Stokes equations within the DFG high‐priority research program flow simulation with high‐performance computers by Schafer and Turek (Vol. 52, Vieweg: Braunschweig, 1996). The first part of the study is a comparison of several finite element discretizations with respect to the accuracy of the computed benchmark parameters. It turns out that boundary fitted higher order finite element methods are in general most accurate. Our numerical study improves the hitherto existing reference values for the benchmark parameters considerably. The second part of the study deals with efficient and robust solvers for the discrete saddle point problems. All considered solvers are based on coupled multigrid methods. The flexible GMRES method with a multiple discretization multigrid method proves to be the best solver. Copyright © 2002 John Wiley & Sons, Ltd.     

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 finite volume unstructured multigrid method for efficient computation of unsteady incompressible viscous flows

An unstructured non‐nested multigrid method is presented for efficient simulation of unsteady incompressible Navier–Stokes flows. The Navier–Stokes solver is based on the artificial compressibility approach and a higher‐order characteristics‐based finite‐volume scheme on unstructured grids. Unsteady flow is calculated with an implicit dual time stepping scheme. For efficient computation of unsteady viscous flows over complex geometries, an unstructured multigrid method is developed to speed up the convergence rate of the dual time stepping calculation. The multigrid method is used to simulate the steady and unsteady incompressible viscous flows over a circular cylinder for validation and performance evaluation purposes. It is found that the multigrid method with three levels of grids results in a 75% reduction in CPU time for the steady flow calculation and 55% reduction for the unsteady flow calculation, compared with its single grid counterparts. The results obtained are compared with numerical solutions obtained by other researchers as well as experimental measurements wherever available and good agreements are obtained. Copyright © 2004 John Wiley & Sons, Ltd.     

Numbering techniques for preconditioners in iterative solvers for compressible flows

We consider Newton–Krylov methods for solving discretized compressible Euler equations. A good preconditioner in the Krylov subspace method is crucial for the efficiency of the solver. In this paper we consider a point‐block Gauss–Seidel method as preconditioner. We describe and compare renumbering strategies that aim at improving the quality of this preconditioner. A variant of reordering methods known from multigrid for convection‐dominated elliptic problems is introduced. This reordering algorithm is essentially black‐box and significantly improves the robustness and efficiency of the point‐block Gauss–Seidel preconditioner. Results of numerical experiments using the QUADFLOW solver and the PETSc library are given. Copyright © 2007 John Wiley & Sons, Ltd.