An implicit meshless method for application in computational fluid dynamics

An implicit meshless scheme is developed for solving the Euler equations, as well as the laminar and Reynolds‐averaged Navier–Stokes equations. Spatial derivatives are approximated using a least squares method on clouds of points. The system of equations is linearised, and solved implicitly using approximate, analytical Jacobian matrices and a preconditioned Krylov subspace iterative method. The details of the spatial discretisation, linear solver and construction of the Jacobian matrix are discussed; and results that demonstrate the performance of the scheme are presented for steady and unsteady two dimensional fluid flows. Copyright © 2012 John Wiley & Sons, Ltd.     

A parallel computational method for simulating two‐phase gel dynamics on a staggered grid

We develop a parallel computational algorithm for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of transport equations for the two phases, two coupled momentum equations, and a volume‐averaged incompressibility constraint. Multigrid with Vanka‐type box‐relaxation scheme is used as preconditioner for the Krylov subspace solver (GMRES) to solve the momentum and incompressibility equations. Through numerical experiments of a model problem, the efficiency, robustness and scalability of the algorithm are illustrated. Copyright © 2008 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 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.     

Stability of convective flows in cavities: solution of benchmark problems by a low‐order finite volume method

A problem of stability of steady convective flows in rectangular cavities is revisited and studied by a second‐order finite volume method. The study is motivated by further applications of the finite volume‐based stability solver to more complicated applied problems, which needs an estimate of convergence of critical parameters. It is shown that for low‐order methods the quantitatively correct stability results for the problems considered can be obtained only on grids having more than 100 nodes in the shortest direction, and that the results of calculations using uniform grids can be significantly improved by the Richardson's extrapolation. It is shown also that grid stretching can significantly improve the convergence, however sometimes can lead to its slowdown. It is argued that due to the sparseness of the Jacobian matrix and its large dimension it can be effective to combine Arnoldi iteration with direct sparse solvers instead of traditional Krylov‐subspace‐based iteration techniques. The same replacement in the Newton steady‐state solver also yields a robust numerical process, however, it cannot be as effective as modern preconditioned Krylov‐subspace‐based iterative solvers. Copyright © 2006 John Wiley & Sons, Ltd.     

A Cartesian grid method for two‐phase gel dynamics on an irregular domain

We develop a numerical method for simulating models of two‐phase gel dynamics in an irregular domain using a regular Cartesian grid. The models consist of transport equations for the volume fractions of the two phases, polymer network and solvent; coupled momentum equations for the two phases; and a volume‐averaged incompressibility constraint. Multigrid with Vanka‐type box relaxation scheme is used as a preconditioner for the Krylov subspace solver (GMRES) to solve the momentum and incompressibility equations. Ghost points are used to enforce no‐slip boundary conditions for the velocity field of each phase, and no‐flux boundary conditions for the volume fractions. The behavior of the new method, including its rate of convergence, is explored through numerical experiments for a problem in which strong phase separation develops from an initially (almost) homogeneous phase distribution. We also use the method to explore situations, motivated by biology, which show that imposed boundary velocities can cause substantial redistribution of network and solvent. Copyright © 2010 John Wiley & Sons, Ltd.     

Development of temporal and spatial high‐order schemes for two‐fluid seven‐equation two‐pressure model and its applications in two‐phase flow benchmark problems

Current existing main nuclear thermal‐hydraulics (T‐H) system analysis codes, such as RALAP5, TRACE, and CATHARE, play a crucial role in the nuclear engineering field for the design and safety analysis of nuclear reactor systems. However, two‐fluid model used in these T‐H system analysis codes is ill posed, easily leading to numerical oscillations, and the classical first‐order methods for temporal and special discretization are widely employed for numerical simulations, yielding excessive numerical diffusion. Two‐fluid seven‐equation two‐pressure model is of particular interest due to the inherent well‐posed advantage. Moreover, high‐order accuracy schemes have also attracted great attention to overcome the challenge of serious numerical diffusion induced by low‐order time and space schemes for accurately simulating nuclear T‐H problems. In this paper, the semi‐implicit solution algorithm with high‐order accuracy in space and time is developed for this well‐posed two‐fluid model and the robustness and accuracy are verified and assessed against several important two‐phase flow benchmark tests in the nuclear engineering T‐H field, which include two linear advection problems, the oscillation problem of the liquid column, the Ransom water faucet problem, the reversed water faucet problem, and the two‐phase shock tube problem. The following conclusions are achieved. (1) The proposed semi‐implicit solution algorithm is robust in solving two‐phase flows, even for fast transients and discontinuous solutions. (2) High‐order schemes in both time and space could prevent excessive numerical diffusion effectively and the numerical simulation results are more accurate than those of first‐order time and space schemes, which demonstrates the advantage of using high‐order schemes.     

A variationally consistent finite element approach to the two‐fluid internal contact‐line problem

A new method for simulating incompressible viscous fluid flow involving moving internal contact lines is presented. The steady state interface shape is determined by a variationally consistent formulation of the surface tension contribution to the equations of motion adapted to the case of internal contact lines through the application of a global force balance compatibility condition that consistently removes the pressure indeterminacy. The Crouzeix–Raviart element is chosen to capture the pressure discontinuity at the two‐fluid interface. The resulting discrete equations are solved by an iterative procedure which displays fast convergence characteristics for small capillary numbers. Numerical results for the case of the steady movement of a fluid meniscus in a two‐dimensional channel are presented. Copyright © 2000 John Wiley & Sons, Ltd.     

Iterative and multigrid methods in the finite element solution of incompressible and turbulent fluid flow

Multigrid and iterative methods are used to reduce the solution time of the matrix equations which arise from the finite element (FE) discretisation of the time‐independent equations of motion of the incompressible fluid in turbulent motion. Incompressible flow is solved by using the method of reduce interpolation for the pressure to satisfy the Brezzi–Babuska condition. The k–l model is used to complete the turbulence closure problem. The non‐symmetric iterative matrix methods examined are the methods of least squares conjugate gradient (LSCG), biconjugate gradient (BCG), conjugate gradient squared (CGS), and the biconjugate gradient squared stabilised (BCGSTAB). The multigrid algorithm applied is based on the FAS algorithm of Brandt, and uses two and three levels of grids with a ‘V‐cycling’ schedule. These methods are all compared to the non‐symmetric frontal solver. Copyright © 1999 John Wiley & Sons, Ltd.     

Mathematical modelling of two‐phase non‐Newtonian flow in a helical pipe

Governing equations for a two‐phase 3D helical pipe flow of a non‐Newtonian fluid with large particles are derived in an orthogonal helical coordinate system. The Lagrangian approach is utilized to model solid particle trajectories. The interaction between solid particles and the fluid that carries them is accounted for by a source term in the momentum equation for the fluid. The force‐coupling method (FCM), developed by M.R. Maxey and his group, is adopted; in this method the momentum source term is no longer a Dirac delta function but is spread on a numerical mesh by using a finite‐sized envelop with a spherical Gaussian distribution. The influence of inter‐particle and particle–wall collisions is also taken into account. Copyright © 2005 John Wiley & Sons, Ltd.     

Numerical study of wave propagation in compressible two‐phase flow

We propose a new model and a solution method for two‐phase two‐fluid compressible flows. The model involves six equations obtained from conservation principles applied to a one‐dimensional flow of gas and liquid mixture completed by additional closure governing equations. The model is valid for pure fluids as well as for fluid mixtures. The system of partial differential equations with source terms is hyperbolic and has conservative form. Hyperbolicity is obtained using the principles of extended thermodynamics. Features of the model include the existence of real eigenvalues and a complete set of independent eigenvectors. Its numerical solution poses several difficulties. The model possesses a large number of acoustic and convective waves and it is not easy to upwind all of these accurately and simply. In this paper we use relatively modern shock‐capturing methods of a centred‐type such as the total variation diminishing (TVD) slope limiter centre (SLIC) scheme which solve these problems in a simple way and with good accuracy. Several numerical test problems are displayed in order to highlight the efficiency of the study we propose. The scheme provides reliable results, is able to compute strong shock waves and deals with complex equations of state. Copyright © 2006 John Wiley & Sons, Ltd.     

Fast boundary‐domain integral algorithm for the computation of incompressible fluid flow problems

The paper deals with the numerical solution of fluid dynamics using the boundary‐domain integral method (BDIM). A velocity–vorticity formulation of the Navier–Stokes equations is adopted, where the kinematic equation is written in its parabolic form. Computational aspects of the numerical simulation of two‐dimensional flows is described in detail. In order to lower the computational cost, the subdomain technique is applied. A preconditioned Krylov subspace method (PKSM) is used for the solution of systems of linear equations. Level‐based fill‐in incomplete lower upper decomposition (ILU) preconditioners are developed and their performance is examined. Scaling of stopping criteria is applied to minimize the number of iterations for the PKSM. The effectiveness of the proposed method is tested on several benchmark test problems. Copyright © 1999 John Wiley & Sons, Ltd.     

On coupling the Reynolds‐averaged Navier–Stokes equations with two‐equation turbulence model equations

Two methods for coupling the Reynolds‐averaged Navier–Stokes equations with the q–ω turbulence model equations on structured grid systems have been studied; namely a loosely coupled method and a strongly coupled method. The loosely coupled method first solves the Navier–Stokes equations with the turbulent viscosity fixed. In a subsequent step, the turbulence model equations are solved with all flow quantities fixed. On the other hand, the strongly coupled method solves the Reynolds‐averaged Navier–Stokes equations and the turbulence model equations simultaneously. In this paper, numerical stabilities of both methods in conjunction with the approximated factorization‐alternative direction implicit method are analysed. The effect of the turbulent kinetic energy terms in the governing equations on the convergence characteristics is also studied. The performance of the two methods is compared for several two‐ and three‐dimensional problems. Copyright © 2005 John Wiley & Sons, Ltd.     

A discontinuous Galerkin‐based sharp‐interface method to simulate three‐dimensional compressible two‐phase flow

A numerical method for the simulation of compressible two‐phase flows is presented in this paper. The sharp‐interface approach consists of several components: a discontinuous Galerkin solver for compressible fluid flow, a level‐set tracking algorithm to follow the movement of the interface and a coupling of both by a ghost‐fluid approach with use of a local Riemann solver at the interface. There are several novel techniques used: the discontinuous Galerkin scheme allows locally a subcell resolution to enhance the interface resolution and an interior finite volume Total Variation Diminishing (TVD) approximation at the interface. The level‐set equation is solved by the same discontinuous Galerkin scheme. To obtain a very good approximation of the interface curvature, the accuracy of the level‐set field is improved and smoothed by an additional P_NP_M‐reconstruction. The capabilities of the method for the simulation of compressible two‐phase flow are demonstrated for a droplet at equilibrium, an oscillating ellipsoidal droplet, and a shock‐droplet interaction problem at Mach 3. Copyright © 2015 John Wiley & Sons, Ltd.     

Schwarz domain decomposition for the incompressible Navier–Stokes equations in general co‐ordinates

This paper describes a domain decomposition method for the incompressible Navier–Stokes equations in general co‐ordinates. Domain decomposition techniques are needed for solving flow problems in complicated geometries while retaining structured grids on each of the subdomains. This is the so‐called block‐structured approach. It enables the use of fast vectorized iterative methods on the subdomains. The Navier–Stokes equations are discretized on a staggered grid using finite volumes. The pressure‐correction technique is used to solve the momentum equations together with incompressibility conditions. Schwarz domain decomposition is used to solve the momentum and pressure equations on the composite domain. Convergence of domain decomposition is accelerated by a GMRES Krylov subspace method. Computations are presented for a variety of flows. Copyright © 2000 John Wiley & Sons, Ltd.     

Optimization of heat‐transfer rate into time‐periodic two‐dimensional Stokes flows

The periodic boundary displacement protocol leading to the optimum wall‐to‐fluid heat‐transfer rate, or to the most efficient mixing rate, in 2‐D annular Stokes flows is determined by calculating the steady periodic velocity and temperature fields. To obtain the steady periodic state one usually solves the dynamical system obtained after the spatial coordinates have been discretized. Here, we calculate the steady periodic state using an implicit method based on the discretization of the time coordinate over a period and the asymptotic regime is enforced by the periodicity condition in the computed temperature field. The obtained system of equations is solved using a Newton‐type iterative algorithm with invariant Jacobian. At each iteration step, the sparse linearized system is solved using a multi‐grid algebraic technique of rapid convergence. From a computational point of view and for the problem considered here, this method is an order of magnitude faster than the one based on a spatial discretization. Copyright © 2006 John Wiley & Sons, Ltd.     

An implicit two‐dimensional non‐hydrostatic model for free‐surface flows

An implicit finite volume model in sigma coordinate system is developed to simulate two‐dimensional (2D) vertical free surface flows, deploying a non‐hydrostatic pressure distribution. The algorithm is based on a projection method which solves the complete 2D Navier–Stokes equations in two steps. First the pressure term in the momentum equations is excluded and the resultant advection–diffusion equations are solved. In the second step the continuity and the momentum equation with only the pressure terms are solved to give a block tri‐diagonal system of equation with pressure as the unknown. This system can be solved by a direct matrix solver without iteration. A new implicit treatment of non‐hydrostatic pressure, similar to the lower layers is applied to the top layer which makes the model free of any hydrostatic pressure assumption all through the water column. This treatment enables the model to evaluate both free surface elevation and wave celerity more accurately. A series of numerical tests including free‐surface flows with significant vertical accelerations and nonlinear behaviour in shoaling zone are performed. Comparison between numerical results, analytical solutions and experimental data demonstrates a satisfactory performance. Copyright © 2006 John Wiley & Sons, Ltd.     

Numerical flux functions for Reynolds‐averaged Navier–Stokes and kω turbulence model computations with a line‐preconditioned p‐multigrid discontinuous Galerkin solver

We present an eigen‐decomposition of the quasi‐linear convective flux formulation of the completely coupled Reynolds‐averaged Navier–Stokes and kω turbulence model equations. Based on these results, we formulate different approximate Riemann solvers that can be used as numerical flux functions in a DG discretization. The effect of the different strategies on the solution accuracy is investigated with numerical examples. The actual computations are performed using a p‐multigrid algorithm. To this end, we formulate a framework with a backward‐Euler smoother in which the linear systems are solved with a general preconditioned Krylov method. We present matrix‐free implementations and memory‐lean line‐Jacobi preconditioners and compare the effects of some parameter choices. In particular, p‐multigrid is found to be less efficient than might be expected from recent findings by other authors. This might be due to the consideration of turbulent flow. Copyright © 2012 John Wiley & Sons, Ltd.     

Comparison of implicit and explicit AUSM‐family schemes for compressible multiphase flows

This paper makes the first attempt of extending implicit AUSM‐family schemes to multiphase flow simulations. Water faucet, air–water shock tube and oscillating manometer problems are used as benchmark tests with the generic four‐equation two‐fluid model. For solving the equations implicitly, Newton's method along with a sparse matrix solver (UMFPACK solver) is employed, and the numerical Jacobian matrix is calculated. Comparison between implicit and explicit AUSM‐family schemes is presented, indicating that similarly accurate results are obtained with both schemes. Furthermore, the water faucet problem is solved using both staggered and collocated grids. This investigation helps integrate high‐resolution schemes into staggered‐grid‐based computational algorithms. The influence of the interface pressure correction on the simulation results is also examined. Results show that the interfacial pressure correction introduces numerical dissipation. However, this dissipation cannot eliminate the overshoots because of the incompatibility of numerical discretization of the conservative and non‐conservative terms in the governing equations. The comparison of CPU time between implicit and explicit schemes is also studied, indicating that the implicit scheme is capable of improving the computational efficiency over its explicit counterpart. Copyright © 2014 John Wiley & Sons, Ltd.