On iterative methods for the incompressible Stokes problem

In this paper, we discuss various techniques for solving the system of linear equations that arise from the discretization of the incompressible Stokes equations by the finite‐element method. The proposed solution methods, based on a suitable approximation of the Schur‐complement matrix, are shown to be very effective for a variety of problems. In this paper, we discuss three types of iterative methods. Two of these approaches use the pressure mass matrix as preconditioner (or an approximation) to the Schur complement, whereas the third uses an approximation based on the ideas of least‐squares commutators (LSC). We observe that the approximation based on the pressure mass matrix gives h‐independent convergence, for both constant and variable viscosity. Copyright © 2010 John Wiley & Sons, Ltd.     

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.     

Efficient augmented Lagrangian‐type preconditioning for the Oseen problem using Grad‐Div stabilization

Efficient preconditioning for Oseen‐type problems is an active research topic. We present a novel approach leveraging stabilization for inf‐sup stable discretizations. The Grad‐Div stabilization shares the algebraic properties with an augmented Lagrangian‐type term. Both simplify the approximation of the Schur complement, especially in the convection‐dominated case. We exploit this for the construction of the preconditioner. Solving the discretized Oseen problem with an iterative Krylov‐type method shows that the outer iteration numbers are retained independent of mesh size, viscosity, and finite element order. Thus, the preconditioner is very competitive. Copyright © 2012 John Wiley & Sons, Ltd.     

A variational multiscale Newton–Schur approach for the incompressible Navier–Stokes equations

In the following paper, we present a consistent Newton–Schur (NS) solution approach for variational multiscale formulations of the time‐dependent Navier–Stokes equations in three dimensions. The main contributions of this work are a systematic study of the variational multiscale method for three‐dimensional problems and an implementation of a consistent formulation suitable for large problems with high nonlinearity, unstructured meshes, and non‐symmetric matrices. In addition to the quadratic convergence characteristics of a Newton–Raphson‐based scheme, the NS approach increases computational efficiency and parallel scalability by implementing the tangent stiffness matrix in Schur complement form. As a result, more computations are performed at the element level. Using a variational multiscale framework, we construct a two‐level approach to stabilizing the incompressible Navier–Stokes equations based on a coarse and fine‐scale subproblem. We then derive the Schur complement form of the consistent tangent matrix. We demonstrate the performance of the method for a number of three‐dimensional problems for Reynolds number up to 1000 including steady and time‐dependent flows. Copyright © 2009 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.     

SIMPLE‐type preconditioners for cell‐centered,colocated finite volume discretization of incompressible Reynolds‐averaged Navier–Stokes equations

This paper contains a comparison of four SIMPLE‐type methods used as solver and as preconditioner for the iterative solution of the (Reynolds‐averaged) Navier–Stokes equations, discretized with a finite volume method for cell‐centered, colocated variables on unstructured grids. A matrix‐free implementation is presented, and special attention is given to the treatment of the stabilization matrix to maintain a compact stencil suitable for unstructured grids. We find SIMPLER preconditioning to be robust and efficient for academic test cases and industrial test cases. Compared with the classical SIMPLE solver, SIMPLER preconditioning reduces the number of nonlinear iterations by a factor 5–20 and the CPU time by a factor 2–5 depending on the case. The flow around a ship hull at Reynolds number 2E9, for example, on a grid with cell aspect ratio up to 1:1E6, can be computed in 3 instead of 15 h.Copyright © 2012 John Wiley & Sons, Ltd.     

A non‐conforming least‐squares finite element method for incompressible fluid flow problems

In this paper, we develop least‐squares finite element methods (LSFEMs) for incompressible fluid flows with improved mass conservation. Specifically, we formulate a new locally conservative LSFEM for the velocity–vorticity–pressure Stokes system, which uses a piecewise divergence‐free basis for the velocity and standard C⁰ elements for the vorticity and the pressure. The new method, which we term dV‐VP improves upon our previous discontinuous stream‐function formulation in several ways. The use of a velocity basis, instead of a stream function, simplifies the imposition and implementation of the velocity boundary condition, and eliminates second‐order terms from the least‐squares functional. Moreover, the size of the resulting discrete problem is reduced because the piecewise solenoidal velocity element is approximately one‐half of the dimension of a stream‐function element of equal accuracy. In two dimensions, the discontinuous stream‐function LSFEM [1] motivates modification of our functional, which further improves the conservation of mass. We briefly discuss the extension of this modification to three dimensions. Computational studies demonstrate that the new formulation achieves optimal convergence rates and yields high conservation of mass. We also propose a simple diagonal preconditioner for the dV‐VP formulation, which significantly reduces the condition number of the LSFEM problem. Published 2012. This article is a US Government work and is in the public domain in the USA.     

Nodal operator splitting adaptive finite element algorithms for the Navier–Stokes equations

Solution algorithms for solving the Navier–Stokes equations without storing equation matrices are developed. The algorithms operate on a nodal basis, where the finite element information is stored as the co-ordinates of the nodes and the nodes in each element. Temporary storage is needed, such as the search vectors, correction vectors and right hand side vectors in the conjugate gradient algorithms which are limited to one-dimensional vectors. The nodal solution algorithms consist of splitting the Navier–Stokes equations into equation systems which are solved sequencially. In the pressure split algorithm, the velocities are found from the diffusion–convection equation and the pressure is computed from these velocities. The computed velocities are then corrected with the pressure gradient. In the velocity–pressure split algorithm, a velocity approximation is first found from the diffusion equation. This velocity is corrected by solving the convection equation. The pressure is then found from these velocities. Finally, the velocities are corrected by the pressure gradient. The nodal algorithms are compared by solving the original Navier–Stokes equations. The pressure split and velocity–pressure split equation systems are solved using ILU preconditioned conjugate gradient methods where the equation matrices are stored, and by using diagonal preconditioned conjugate gradient methods without storing the equation matrices. © 1998 John Wiley & Sons, Ltd.     

A preconditioned alternating inner-outer iterative solution method for the mixed finite element formulation of the Navier-Stokes equations

In the present work a new iterative method for solving the Navier-Stokes equations is designed. In a previous paper a coupled node fill-in preconditioner for iterative solution of the Navier-Stokes equations proved to increase the convergence rate considerably compared with traditional preconditioners. The further development of the present iterative method is based on the same storage scheme for the equation matrix as for the coupled node fill-in preconditioner. This storage scheme separates the velocity, the pressure and the coupling of pressure and velocity coefficients in the equation matrix. The separation storage scheme allows for an ILU factorization of both the velocity and pressure unknowns. With the inner-outer solution scheme the velocity unknowns are eliminated before the resulting equation system for the pressures is solved iteratively. After the pressure unknown has been found, the pressures are substituted into the original equation system and the velocities are also found iteratively. The behaviour of the inner-outer iterative solution algorithm is investigated in order to find optimal convergence criteria for the inner iterations and compared with the solution algorithm for the original equation system. The results show that the coupled node fill-in preconditioner of the original equation system is more efficient than the coupled node fill-in preconditioner of the reduced equation system. However, the solution technique of the reduced equation system revals properties which may be advantageous in future solution algorithms.     

Accelerated convergence of the numerical simulation of incompressible flow in general curvilinear co‐ordinates by discretizations on the double‐staggered grids

The convergence rate of a methodology for solving incompressible flow in general curvilinear co‐ordinates is analyzed. Double‐staggered grids (DSGs), each defined by the same boundaries as the physical domain, are used for discretization. Both grids are MAC quadrilateral meshes with scalar variables (pressure, temperature, etc.) arranged at the center and the Cartesian velocity components at the middle of the sides of the mesh cells. The problem was checked against benchmark solutions of natural convection in a squeezed cavity, heat transfer in concentric horizontal cylindrical annuli, and a hot cylinder in a duct. Poisson's pressure‐correction equations that arise from the SIMPLE‐like procedure are solved by several methods: successive overrelaxation, symmetric overrelaxation, modified incomplete factorization preconditioner, conjugate gradient (CG), and CG with preconditioner. A genetic algorithm was developed to solve problems of numerical optimization of SIMPLE‐like calculation time in a space of iteration numbers and relaxation parameters. The application provides a means of making an unbiased comparison between the DSGs method and the widely used interpolation method. Furthermore, the convergence rate was demonstrated by application to the calculation of natural convection heat transfer in concentric horizontal cylindrical annuli. Calculation times when DSGs were used were 2–10 times shorter than those achieved by interpolation. With the DSGs method, calculation time increases slightly with increasing non‐orthogonality of the grids, whereas an interpolation method calls for very small iteration parameters that lead to unacceptable calculation times. Copyright © 2007 John Wiley & Sons, Ltd.     

Application of point implicit Runge–Kutta methods to inviscid and laminar flow problems using AUSM and AUSM+ upwinding

Explicit Runge–Kutta methods preconditioned by a pointwise matrix valued preconditioner can significantly improve the convergence rate to approximate steady state solutions of laminar flows. This has been shown for central discretisation schemes and Roe upwinding. Since the first-order approximation to the inviscid flux assuming constant weighting of the dissipative terms is given by the absolute value of the Roe matrix, the construction of the preconditioner is rather simple compared to other upwind techniques. However, in this article we show that similar improvements in the convergence rates can also be obtained for the AUSM⁺ scheme. Following the ideas for the central and Roe schemes, the preconditioner is obtained by a first-order approximation to the derivative of the convective flux. Viscous terms are included into the preconditioner considering a thin shear layer approximation. A complete derivation of the derivative terms is shown. In numerical examples, we demonstrate the improved convergence rates when compared with a standard explicit Runge–Kutta method accelerated with local time stepping.     

Numerical solution of three‐dimensional velocity–vorticity Navier–Stokes equations by finite difference method

This paper describes the finite difference numerical procedure for solving velocity–vorticity form of the Navier–Stokes equations in three dimensions. The velocity Poisson equations are made parabolic using the false‐transient technique and are solved along with the vorticity transport equations. The parabolic velocity Poisson equations are advanced in time using the alternating direction implicit (ADI) procedure and are solved along with the continuity equation for velocities, thus ensuring a divergence‐free velocity field. The vorticity transport equations in conservative form are solved using the second‐order accurate Adams–Bashforth central difference scheme in order to assure divergence‐free vorticity field in three dimensions. The velocity and vorticity Cartesian components are discretized using a central difference scheme on a staggered grid for accuracy reasons. The application of the ADI procedure for the parabolic velocity Poisson equations along with the continuity equation results in diagonally dominant tri‐diagonal matrix equations. Thus the explicit method for the vorticity equations and the tri‐diagonal matrix algorithm for the Poisson equations combine to give a simplified numerical scheme for solving three‐dimensional problems, which otherwise requires enormous computational effort. For three‐dimensional‐driven cavity flow predictions, the present method is found to be efficient and accurate for the Reynolds number range 100?Re?2000. Copyright © 2004 John Wiley & Sons, Ltd.     

A matrix‐free preconditioned Newton/GMRES method for unsteady Navier–Stokes solutions

The unsteady compressible Reynolds‐averaged Navier–Stokes equations are discretized using the Osher approximate Riemann solver with fully implicit time stepping. The resulting non‐linear system at each time step is solved iteratively using a Newton/GMRES method. In the solution process, the Jacobian matrix–vector products are replaced by directional derivatives so that the evaluation and storage of the Jacobian matrix is removed from the procedure. An effective matrix‐free preconditioner is proposed to fully avoid matrix storage. Convergence rates, computational costs and computer memory requirements of the present method are compared with those of a matrix Newton/GMRES method, a four stage Runge–Kutta explicit method, and an approximate factorization sub‐iteration method. Effects of convergence tolerances for the GMRES linear solver on the convergence and the efficiency of the Newton iteration for the non‐linear system at each time step are analysed for both matrix‐free and matrix methods. Differences in the performance of the matrix‐free method for laminar and turbulent flows are highlighted and analysed. Unsteady turbulent Navier–Stokes solutions of pitching and combined translation–pitching aerofoil oscillations are presented for unsteady shock‐induced separation problems associated with the rotor blade flows of forward flying helicopters. Copyright © 2000 John Wiley & Sons, Ltd.     

Numerical solutions of fully non‐linear and highly dispersive Boussinesq equations in two horizontal dimensions

This paper investigates preconditioned iterative techniques for finite difference solutions of a high‐order Boussinesq method for modelling water waves in two horizontal dimensions. The Boussinesq method solves simultaneously for all three components of velocity at an arbitrary z‐level, removing any practical limitations based on the relative water depth. High‐order finite difference approximations are shown to be more efficient than low‐order approximations (for a given accuracy), despite the additional overhead. The resultant system of equations requires that a sparse, unsymmetric, and often ill‐conditioned matrix be solved at each stage evaluation within a simulation. Various preconditioning strategies are investigated, including full factorizations of the linearized matrix, ILU factorizations, a matrix‐free (Fourier space) method, and an approximate Schur complement approach. A detailed comparison of the methods is given for both rotational and irrotational formulations, and the strengths and limitations of each are discussed. Mesh‐independent convergence is demonstrated with many of the preconditioners for solutions of the irrotational formulation, and solutions using the Fourier space and approximate Schur complement preconditioners are shown to require an overall computational effort that scales linearly with problem size (for large problems). Calculations on a variable depth problem are also compared to experimental data, highlighting the accuracy of the model. Through combined physical and mathematical insight effective preconditioned iterative solutions are achieved for the full physical application range of the model. Copyright © 2004 John Wiley & Sons, Ltd.     

An L2‐stable approximation of the Navier–Stokes convection operator for low‐order non‐conforming finite elements

We develop in this paper a discretization for the convection term in variable density unstationary Navier–Stokes equations, which applies to low‐order non‐conforming finite element approximations (the so‐called Crouzeix–Raviart or Rannacher–Turek elements). This discretization is built by a finite volume technique based on a dual mesh. It is shown to enjoy an L² stability property, which may be seen as a discrete counterpart of the kinetic energy conservation identity. In addition, numerical experiments confirm the robustness and the accuracy of this approximation; in particular, in L² norm, second‐order space convergence for the velocity and first‐order space convergence for the pressure are observed. Copyright © 2010 John Wiley & Sons, Ltd.     

Wet/dry areas method for interfacial (free surface) flow

In this paper, a new numerical method is developed for two‐dimensional interfacial (free surface) flows, based on the control volume method and conservative integral form of the Navier–Stokes equations with a standard staggered grid. The new method deploys two continuity equations, the continuity equation of the mass conservation for better convergence of the implicit scheme and the continuity equation of the volume conservation for the equation of pressure correction. The convection terms (the total momentum flux) on the surfaces of control volume are accurately calculated from the wet area exposed to the water, and the dry area exposed to the air. The numerical results produced by the new numerical method agree very well with the analytical solution, experimental images and experimentally measured velocity. Copyright © 2012 John Wiley & Sons, Ltd.     

Large eddy simulation of turbulent flows via domain decomposition techniques. Part 1: theory

The present paper discusses large eddy simulations of incompressible turbulent flows in complex geometries. Attention is focused on the application of the Schur complement method for the solution of the elliptic equations arising from the fractional step procedure and/or the semi‐implicit discretization of the momentum equations in velocity–pressure representation. Fast direct and iterative Poisson solvers are compared and their global efficiency evaluated both in serial and parallel architecture environments for model problems of physical relevance. Copyright © 2005 John Wiley & Sons, Ltd.     

A finite element solutionof three-dimensional mixed convection gas flows in horizontal chnnels using preconditioned iterative metrix methods

An algorithm is presented for the finite element solution of three-dimensional mixed convection gas flows in channels heated from below. The algorithm uses Newton's method and iterative matrix methods. Two iterative solution algorithms, conjugate gradient squared (CGS) and generalized minimal residual (GMERS), are used in conjunction with a preconditioning technique that is simple to implement. The preconditioner is a subset of the full Jacobian matrix centered around the main diagonal but retaining the most fundamental axial coupling of the residual equations. A domain-renumbering scheme that enhances the overall algorithm performance is proposed on the basis of and analysis of the preconditioner. Comparison with the frontal elimination method demonstrates that the iterative method will be faster when the front width exceeds approximately 500. Techniques for the direct assembly f the problem into a compressed sparse row storage format are demonstrated. Elimination of fixed boundary conditions is shown to decrease the size of the matrix problem by up to 30%. Finally, fluid flow solutions obtained with the numerical technique are presented. These solutions reveal complex three-dimensional mixed convection fluid flow phenomena at low Reynolds numbers, including the reversal of the direction of longitudinal rolls in the presence of a strong recirculation in the entrance region of the channel.     

A CFD Euler solver from a physical acoustics–convection flux Jacobian decomposition

This paper introduces a continuum, i.e. non‐discrete, upstream‐bias formulation that rests on the physics and mathematics of acoustics and convection. The formulation induces the upstream‐bias at the differential equation level, within a characteristics‐bias system associated with the Euler equations with general equilibrium equations of state. For low subsonic Mach numbers, this formulation returns a consistent upstream‐bias approximation for the non‐linear acoustics equations. For supersonic Mach numbers, the formulation smoothly becomes an upstream‐bias approximation of the entire Euler flux. With the objective of minimizing induced artificial diffusion, the formulation non‐linearly induces upstream‐bias, essentially locally, in regions of solution discontinuities, whereas it decreases the upstream‐bias in regions of solution smoothness. The discrete equations originate from a finite element discretization of the characteristic‐bias system and are integrated in time within a compact block tridiagonal matrix statement by way of an implicit non‐linearly stable Runge–Kutta algorithm for stiff systems. As documented by several computational results that reflect available exact solutions, the acoustics–convection solver induces low artificial diffusion and generates essentially non‐oscillatory solutions that automatically preserve a constant enthalpy, as well as smoothness of both enthalpy and mass flux across normal shocks. Copyright © 1999 John Wiley & Sons, Ltd.     

A fully coupled Navier–Stokes solver for calculation of turbulent incompressible free surface flow past a ship hull

This paper deals with the calculation of free surface flow of viscous incompressible fluid around the hull of a boat moving with rectilinear motion. An original method used to avoid a large part of the theoretical problems connected with free surface boundary conditions in three‐dimensional Navier–Stokes–Reynolds equations is proposed here. The linearised system of convective equations for velocities, pressure and free surface elevation unknowns is discretised by finite differences and two methods to solve the fully coupled resulting matrix are presented here. The non‐linear convergence of fully coupled algorithm is compared with the velocity–pressure weakly coupled algorithm SIMPLER. Turbulence is taken into account through Reynolds decomposition and k–ε or k–ω model to close the equations. These two models are implemented without wall function and numerical calculations are performed up to the viscous sub‐layer. Numerical results and comparisons with experiments are presented on the Series 60 CB=0.60 ship model for a Reynolds number Rn=4.5×10⁶ and a Froude number Fn=0.316. Copyright © 1999 John Wiley & Sons, Ltd.