Parallel ILU preconditioning,a priori pivoting and segregation of variables for iterative solution of the mixed finite element formulation of the Navier–Stokes equations

A parallel ILU preconditioning algorithm for the incompressible Navier–Stokes equations has been designed, implemented and tested. The computational mesh is divided into N subdomains which are processed in parallel in different processors. During ILU factorization, matrices and vectors associated with the nodes on the interface between the subdomains are communicated to the equation matrices to the adjacent subdomain. The bases for the parallel algorithm are an appropriate node ordering scheme and a segregation of velocity and pressure degrees of freedom. The inner nodes of the subdomain are numbered first and then the nodes on the interface between the subdomains. To avoid division by zero during the ILU factorization, the equations corresponding to the velocity degrees of freedom are assembled first in the global equation matrix, followed by the equations corresponding to the pressure degrees of freedom. Copyright © 2003 John Wiley & Sons, Ltd.     

Parallelization of the ILU(0) preconditioner for CFD problems on shared‐memory computers

The use of ILU(0) factorization as a preconditioner is quite frequent when solving linear systems of CFD computations. This is because of its efficiency and moderate memory requirements. For a small number of processors, this preconditioner, parallelized through coloring methods, shows little savings when compared with a sequential one using adequate reordering of the unknowns. Level scheduling techniques are applied to obtain the same preconditioning efficiency as in a sequential case, while taking advantage of parallelism through block algorithms. Numerical results obtained from the parallel solution of the compressible Navier–Stokes equations show that this technique gives interesting savings in computational times on a small number of processors of shared‐memory computers. In addition, it does this while keeping all the benefits of an ILU(0) factorization with an adequate reordering of the unknowns, and without the loss of efficiency of factorization associated with a more scalable coloring strategy. Copyright © 1999 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.     

A parallel solver based on the dual Schur decomposition of general finite element matrices

A parallel solver based on domain decomposition is presented for the solution of large algebraic systems arising in the finite element discretization of mechanical problems. It is hybrid in the sense that it combines a direct factorization of the local subdomain problems with an iterative treatment of the interface system by a parallel GMRES algorithm. An important feature of the proposed solver is the use of a set of Lagrange multipliers to enforce continuity of the finite element unknowns at the interface. A projection step and a preconditioner are proposed to control the conditioning of the interface matrix. The decomposition of the finite element mesh is formulated as a graph partitioning problem. A two-step approach is used where an initial decomposition is optimized by non-deterministic heuristics to increase the quality of the decomposition. Parallel simulations of a Navier–Stokes flow problem carried out on a Convex Exemplar SPP system with 16 processors show that the use of optimized decompositions and the preconditioning step are keys to obtaining high parallel efficiencies. Typical parallel efficiencies range above 80%. © 1998 John Wiley & Sons, Ltd.     

求解接触问题的一种新的实验误差法

提出了一种带松弛因子的UZAW算法求解实验误差法中给定状态下的位移和接触力满足的等式方程，并证明了该算法是R超线性收敛的。整个区域被划分为多个子区域，不同子区域位移场的求解是独立的。还提出了一种带参数的以不完全因子分解为基础的预条件子共轭梯度法求解不同子区域位移场，该算法在块体规模较大时更加有效。     

Adaptive mesh refinement‐enhanced local DFD method and its application to solve Navier–Stokes equations

Recently, the domain‐free discretization (DFD) method was presented to efficiently solve problems with complex geometries without introducing the coordinate transformation. In order to exploit the high performance of the DFD method, in this paper, the local DFD method with the use of Cartesian mesh is presented, where the physical domain is covered by a Cartesian mesh and the local DFD method is applied for numerical discretization. In order to further improve the efficiency of the solver, the newly developed solution‐based adaptive mesh refinement (AMR) technique is also introduced. The proposed methods are then applied to the simulation of natural convection in concentric annuli between a square outer cylinder and a circular inner cylinder. Numerical experiments show that the present numerical results agree very well with available data in the literature, and AMR‐enhanced local DFD method is an effective tool for the computation of flow problems. Copyright © 2005 John Wiley & Sons, Ltd.     

A local grid refinement method for three‐dimensional turbulent recirculating flows

A local grid refinement method is presented and applied to a three‐dimensional turbulent recirculating flow. It is based on the staggered grid arrangement. The computational domain is covered by block‐structured subgrids of different refinement levels. The exchange of information between the subgrids is fully conservative and all grids are treated implicitly. This allows for a simultaneous solution of one variable in all grids. All variables are stored in one‐dimensional arrays. The solver selected for the solution of the discretised finite difference equations is the preconditioned bi‐conjugate gradient (Bi‐CG) method. For the case examined (turbulent flow around a surface‐mounted cube), it was found that the latter method converges faster than the line solver. The locally refined mesh improved the accuracy of the pressure distribution on cube faces compared with a coarse mesh and yielded the same results as a fine single mesh, with a 62% gain in computer time. Copyright © 1999 John Wiley & Sons, Ltd.     

Parallel SOR methods with a parabolic-diffusion acceleration technique for solving an unstructured-grid Poisson equation on 3D arbitrary geometries

This paper presents a parallel algorithm for the finite-volume discretisation of the Poisson equation on three-dimensional arbitrary geometries. The proposed method is formulated by using a 2D horizontal block domain decomposition and interprocessor data communication techniques with message passing interface. The horizontal unstructured-grid cells are reordered according to the neighbouring relations and decomposed into blocks using a load-balanced distribution to give all processors an equal amount of elements. In this algorithm, two parallel successive over-relaxation methods are presented: a multi-colour ordering technique for unstructured grids based on distributed memory and a block method using reordering index following similar ideas of the partitioning for structured grids. In all cases, the parallel algorithms are implemented with a combination of an acceleration iterative solver. This solver is based on a parabolic-diffusion equation introduced to obtain faster solutions of the linear systems arising from the discretisation. Numerical results are given to evaluate the performances of the methods showing speedups better than linear.     

A numerical eigenvalue study of preconditioned non‐equilibrium transport equations

The finite element integration of non‐equilibrium contaminant transport in porous media yields sparse, unsymmetric, real or complex equations, which may be solved by iterative projection methods, such as Bi‐CGSTAB and TFQMR, on condition that they are effectively preconditioned. To ensure a fast convergence, the eigenspectrum of the preconditioned equations has to be very compact around unity. Compactness is generally measured by the spectral condition number. In difficult advection‐dominated problems, however, the condition number may be large and nevertheless, convergence may be good. A numerical study of the preconditioned eigenspectrum of a representative test case is performed using the incomplete triangular factorization. The results show that preconditioning eliminates most of the original complex eigenvalues, and that compactness is not necessarily jeopardized by a large condition number. Quite surprisingly, it is shown that the preconditioned complex problem may have a more compact real eigenspectrum than the equivalent real problem. Copyright © 1999 John Wiley & Sons, Ltd.     

Adaptive thermo-fluid moving boundary computations for interfacial dynamics

In this study,we present adaptive moving boundary computation technique with parallel implementation on a distributed memory multi-processor system for large scale thermo-fluid and interfacial flow computations.The solver utilizes Eulerian-Lagrangian method to track moving(Lagrangian) interfaces explicitly on the stationary(Eulerian) Cartesian grid where the flow fields are computed.We address the domain decomposition strategies of Eulerian-Lagrangian method by illustrating its intricate complexity of the computation involved on two different spaces interactively and consequently,and then propose a trade-off approach aiming for parallel scalability.Spatial domain decomposition is adopted for both Eulerian and Lagrangian domain due to easy load balancing and data locality for minimum communication between processors.In addition,parallel cell-based unstructured adaptive mesh refinement(AMR) technique is implemented for the flexible local refinement and even-distributed computational workload among processors.Selected cases are presented to highlight the computational capabilities,including Faraday type interfacial waves with capillary and gravitational forcing,flows around varied geometric configurations and induced by boundary conditions and/or body forces,and thermo-fluid dynamics with phase change.With the aid of the present techniques,large scale challenging moving boundary problems can be effectively addressed.     

A parallel finite element sliding mesh technique for the simulation of viscous flows in agitated tanks

A parallel sliding mesh algorithm for the finite element simulation of viscous fluid flows in agitated tanks is presented. Lagrange multipliers are used at the sliding interfaces to enforce the continuity between the fixed and moving subdomains. The novelty of the method consists of the coupled solution of the resulting velocity–pressure‐Lagrange multipliers system of equations by an ILU(0)‐QMR solver. A penalty parameter is introduced for both the interface and the incompressibility constraints to avoid pivoting problems in the ILU(0) algorithm. To handle the convective term, both the Newton–Raphson scheme and the semi‐implicit linearization are tested. A penalty parameter is introduced for both the interface and the incompressibility constraints to avoid the failure of the ILU(0) algorithm due to the lack of pivoting. Furthermore, this approach is versatile enough so that it allows partitioning of sliding and fixed subdomains if parallelization is required. Although the sliding mesh technique is fairly common in CFD, the main advantage of the proposed approach is its low computational cost due to the inexpensive and parallelizable calculations that involve preconditioned sparse iterative solvers. The method is validated for Couette and coaxial stirred tanks. Copyright © 2011 John Wiley & Sons, Ltd.     

A high-order solver for simulating vortex-induced vibrations using the sliding-mesh spectral difference method and hybrid grids

We present a high-order solver for simulating vortex-induced vibrations (VIVs) at very challenging situations, for example, VIVs of a row of very closely placed objects with large relative displacements. This solver works on unstructured hybrid grids by employing the high-order tensor-product spectral difference method for quadrilateral grids and the Raviart-Thomas spectral difference method for triangular grids. To deal with the challenging situations where a traditional conforming moving mesh is incapable, we split a computational domain into nonoverlapping subdomains, where each interior subdomain encloses an object and moves freely with respect to its neighbors. A nonuniform sliding-mesh method that ensures high-order accuracy is developed to deal with sliding interfaces between subdomains. A monolithic approach is adopted to seamlessly couple the fluid and solid vibration equations. Moreover, the solver is parallelized to further improve its efficiency on distributed-memory computers. Through a series of numerical tests, we demonstrate that this solver is high-order accurate for both inviscid and viscous flows and has good parallel efficiency, making it ideal for VIV studies.     

结构的多机并行分析I——结构的并行有限元方法

本文详细分析和讨论了结构分析的并行有限元方法—并行预处理共轭梯度法(以下简称PPCG法)。着重讨论了基于自带存储器的多处理机系统的并行预处理算法问题,并由此提出了两种PPCG法:PPCG1和PPCG2法。这两种方法适用于以单道剖分(one-way dissection)的子结构法为基础的并行分析。由于这种剖分法产生的结构刚度矩阵具有箭头形状,可独立地消除各子结构的内部自由度,并且不会在刚度矩阵中产生新的非零元素,因此很适合具有较多处理机的并行机系统对复杂结构进行的并行分析。     

Simulation of two- and three-dimensional internal subsonic flows using a finite element method

In this paper a finite element method is presented to predict internal subsonic flows. Using a low-Mach-number approximation, the pressure is decomposed into a mean thermodynamic contribution and a dynamic fluctuation to deal with the complex role of the pressure in internal aerodynamics. A semi-implicit time integration and a finite element method with a moving mesh are described to take into account complex geometries and moving boundaries. An Uzawa algorithm accelerated by a preconditioned residual method is introduced to solve the coupled non-symmetric linear system for the velocity components and the pressure. An efficient conjugate gradient method combined with an incomplete LU preconditioning is used to solve the non-symmetric linear systems arising from the discretization. The implementation of the numerical scheme on parallel supercomputers is also discussed. Efficient algorithms for the finite element assembly phase and for the solution of linear systems are described which take advantage of the parallel architecture of the new generation of supercomputers. With this technique a global speed-up of 10 is achieved on a supercomputer with eight processors. To illustrate the capabilities of the numerical method, 2D and 3D simulations of flows in the combustion chamber of a reciprocating engine and around the combustor dome of a gas turbine engine are presented.     

Conjugate gradient methods and ILU preconditioning of non-symmetric matrix systems with arbitrary sparsity patterns

Preconditioning techniques based on incomplete Gaussian elimination for large, sparse, non-symmetric matrix systems are described. A certain level of fill-in may be specified in the incomplete factorizations. All methods considered may be applied to matrices with arbitrary sparsity patterns, for instance those associated with the general preprocessor algorithms or adaptive mesh techniques. The preconditioners have been combined with five conjugate gradient-like methods and tested on finite element discretized scalar convection-diffusion equations in 2D and 3D. It is found from numerical experiments that an amount of fill-in corresponding to about 50% of the number of original non-zero matrix entries is the optimal choice for this class of preconditioners. The preconditioners show almost no sensitivity to grid distortion. In problems with significantly variable coefficients or anisotropy the preconditioners stabilize the basic iterative schemes in addition to reducing the computational work substantially, mostly by more than 90%. The modified preconditioning technique, where fill-in is added on the main diagonal, performs in general better than the standard incomplete LU factorization, but is inferior to the latter in 3D problems and for matrix systems with complicated sparsity patterns.     

A high‐order element based adaptive mesh refinement strategy for three‐dimensional unstructured grid

Adaptive mesh refinement (AMR) shows attractive properties in automatically refining the flow region of interest, and with AMR, better prediction can be obtained with much less labor work and cost compared to manually remeshing or the global mesh refinement. Cartesian AMR is well established; however, AMR on hybrid unstructured mesh, which is heavily used in the high‐Reynolds number flow simulation, is less matured and existing methods may result in degraded mesh quality, which mostly happens in the boundary layer or near the sharp geometric features. User intervention or additional constraints, such as freezing all boundary layer elements or refining the whole boundary layer, are required to assist the refinement process. In this work, a novel AMR strategy is developed to handle existing difficulties. In the new method, high‐order unstructured elements are first generated based on the baseline mesh; then the refinement is conducted in the parametric space; at last, the mesh suitable for the solver is output. Generating refined elements in the parametric space with high‐order elements is the key of this method and this helps to guarantee both the accuracy and robustness. With the current method, 3‐dimensional hybrid unstructured mesh of huge size and complex geometry can be automatically refined, without user intervention nor additional constraints. With test cases including the 2‐dimensional airfoil and 3‐dimensional full aircraft, the current AMR method proves to be accurate, simple, and robust.     

基于AFT-Delaunay的二维解耦并行网格生成算法

面向平面任意几何区域网格生成,提出了一种将波前法AFT(Advancing Front Technique)与Delaunay法相结合的解耦并行网格生成算法。算法主要思想是沿着求解几何区域惯性轴,采用扩展的AFT-Delaunay算法生成高质量三角形网格墙,递归地将几何区域动态划分成多个彼此解耦的子区域;采用OpenMP多线程并行技术,将子区域分配给多个CPU并行生成子区域网格;子区域内部的网格生成复用AFT-Delaunay算法,保证了生成网格的质量、效率和一致性要求。本算法优先生成几何边界与交界面网格,有利于提高有限元计算精度;各个子区域的网格生成彼此完全解耦,因此并行网格生成过程无需通信。该方法克服了并行交界面网格质量恶化难题,且具有良好的并行加速比,能够全自动、高效率地并行生成高质量的三角网格。     

Incompressible flows with combustion simulated by a preconditioning method using multigrid acceleration and MUSCL reconstruction

A numerical algorithm for the steady state solution of three‐dimensional incompressible flows is presented. A preconditioned time marching scheme is applied to the conservative form of the governing equations. The preconditioning matrix multiplies the time derivatives of the system and circumvents the eigenvalue‐caused stiffness at low speed. The formulation is suitable for constant density flows and for flows where the density depends on non‐passive scalars, such as in low‐speed combustion applications. The k–ε model accounts for turbulent transport effects. A cell‐centred finite volume formulation with a Runge–Kutta time stepping scheme for the primitive variables is used. Second‐order spatial accuracy is achieved by developing for the preconditioned system an approximate Riemann solver with MUSCL reconstruction. A multi‐grid technique coupled with local time stepping and implicit residual smoothing is used to accelerate the convergence to the steady state solution. The convergence behaviour and the validation of the predicted solutions are examined for laminar and turbulent constant density flows and for a turbulent non‐premixed flame simulated by a presumed probability density function (PDF) model. Copyright © 2001 John Wiley & Sons, Ltd.     

HLLC scheme for the preconditioned pseudo-compressibility Navier–Stokes equations for incompressible viscous flows

A new HLLC (Harten-Lax-van leer contact) approximate Riemann solver with the preconditioning technique based on the pseudo-compressibility formulation for numerical simulation of the incompressible viscous flows has been proposed, which follows the HLLC Riemann solver (Harten, Lax and van Leer solver with contact resolution modified by Toro) for the compressible flow system. In the authors' previous work, the preconditioned Roe's Riemann solver is applied to the finite difference discretisation of the inviscid flux for incompressible flows. Although the Roe's Riemann solver is found to be an accurate and robust scheme in various numerical computations, the HLLC Riemann solver is more suitable for the pseudo-compressible Navier--Stokes equations, in which the inviscid flux vector is a non-homogeneous function of degree one of the flow field vector, and however the Roe's solver is restricted to the homogeneous systems. Numerical investigations have been performed in order to demonstrate the efficiency and accuracy of the present procedure in both two- and three-dimensional cases. The present results are found to be in good agreement with the exact solutions, existing numerical results and experimental data.