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.     

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

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

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.     

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.     

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 Newton–Krylov finite volume algorithm for the power-law non-Newtonian fluid flow using pseudo-compressibility technique

An implicit Newton–Krylov finite volume algorithm has been developed for efficient steady-state computation of the power-law non-Newtonian fluid flows. The pseudo-compressibility technique is used for the coupling of continuity and momentum equations. The spatial discretization is central (second-order) for both convective and diffusive terms and the accuracy of the solution is verified. The nine block diagonal Jacobian matrix (needed for implicit formulation) is computed directly through the flux differentiation. Five-diagonal and three-diagonal block matrices (the simplified versions of the main Jacobian matrix) are used with the ILU(0 & 1) and the Thomas linear solvers for preconditioning, respectively. The performance of the Newton-GMRES solver is examined in detail for different preconditioning strategies. The effects of the power-law behavior index and Re number on the convergence rate are also studied. The performance of the Newton-BiCGSTAB and the Newton-GMRES solvers are compared with each other. The results show, the ILU(1)/Newton-GMRES is the most efficient combination that is robust even in high Reynolds number shear-thinning fluid flow cases.     

Continuation of travelling‐wave solutions of the Navier–Stokes equations

An efficient way of obtaining travelling waves in a periodic fluid system is described and tested. We search for steady states in a reference frame travelling at the wave phase velocity using a first‐order pseudospectral semi‐implicit time scheme adapted to carry out the Newton's iterations. The method is compared to a standard Newton–Raphson solver and is shown to be highly efficient in performing this task, even when high‐resolution grids are used. This method is well suited to three‐dimensional calculations in cylindrical or spherical geometries. Copyright © 2006 John Wiley & Sons, Ltd.     

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

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

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.     

NEWTON–GMRES ALGORITHM APPLIED TO COMPRESSIBLE FLOWS

This paper addresses the resolution of non-linear problems arising from an implicit time discretization in CFD problems. We study the convergence of the Newton–GMRES algorithm with a Jacobian approximated by a finite difference scheme and with restarting in GMRES. In our numerical experiments we observe, as predicted by the theory, the impact of the matrix-free approximations. A second-order scheme clearly improves the convergence in the Newton process.     

Implicit time accurate simulation of unsteady flow

Implicit time integration was studied in the context of unsteady shock‐boundary layer interaction flow. With an explicit second‐order Runge–Kutta scheme, a reference solution to compare with the implicit second‐order Crank–Nicolson scheme was determined. The time step in the explicit scheme is restricted by both temporal accuracy as well as stability requirements, whereas in the A‐stable implicit scheme, the time step has to obey temporal resolution requirements and numerical convergence conditions. The non‐linear discrete equations for each time step are solved iteratively by adding a pseudo‐time derivative. The quasi‐Newton approach is adopted and the linear systems that arise are approximately solved with a symmetric block Gauss–Seidel solver. As a guiding principle for properly setting numerical time integration parameters that yield an efficient time accurate capturing of the solution, the global error caused by the temporal integration is compared with the error resulting from the spatial discretization. Focus is on the sensitivity of properties of the solution in relation to the time step. Numerical simulations show that the time step needed for acceptable accuracy can be considerably larger than the explicit stability time step; typical ratios range from 20 to 80. At large time steps, convergence problems that are closely related to a highly complex structure of the basins of attraction of the iterative method may occur. Copyright © 2001 John Wiley & Sons, Ltd.     

On nonlinear preconditioners in Newton–Krylov methods for unsteady flows

The application of nonlinear schemes like dual time stepping as preconditioners in matrix‐free Newton–Krylov‐solvers is considered and analyzed, with a special emphasis on unsteady viscous flows. We provide a novel formulation of the left preconditioned operator that says it is in fact linear in the matrix‐free sense, but changes the Newton scheme. This allows to get some insight in the convergence properties of these schemes, which is demonstrated through numerical results. Copyright © 2009 John Wiley & Sons, Ltd.     

Implicit FEM‐FCT algorithms and discrete Newton methods for transient convection problems

A new generalization of the flux‐corrected transport (FCT) methodology to implicit finite element discretizations is proposed. The underlying high‐order scheme is supposed to be unconditionally stable and produce time‐accurate solutions to evolutionary convection problems. Its nonoscillatory low‐order counterpart is constructed by means of mass lumping followed by elimination of negative off‐diagonal entries from the discrete transport operator. The raw antidiffusive fluxes, which represent the difference between the high‐ and low‐order schemes, are updated and limited within an outer fixed‐point iteration. The upper bound for the magnitude of each antidiffusive flux is evaluated using a single sweep of the multidimensional FCT limiter at the first outer iteration. This semi‐implicit limiting strategy makes it possible to enforce the positivity constraint in a very robust and efficient manner. Moreover, the computation of an intermediate low‐order solution can be avoided. The nonlinear algebraic systems are solved either by a standard defect correction scheme or by means of a discrete Newton approach, whereby the approximate Jacobian matrix is assembled edge by edge. Numerical examples are presented for two‐dimensional benchmark problems discretized by the standard Galerkin finite element method combined with the Crank–Nicolson time stepping. Copyright © 2007 John Wiley & Sons, Ltd.     

Unstructured finite element method for the solution of the Boussinesq problem in three dimensions

We present a numerical method for the monolithic discretisation of the Boussinesq system in three spatial dimensions. The key ingredients of the proposed methodology are the finite element discretisation of the spatial part of the problem using unstructured tetrahedral meshes, an implicit time integrator, based on adaptive predictor–corrector scheme (the explicit second‐order Adams–Bashforth method with the implicit stabilised trapezoid rule), and a new preconditioned Krylov subspace solver for the resulting linearised discrete problem. We test the proposed methodology on a number of physically relevant cases, including laterally heated cavities and the Rayleigh–Bénard convection. Copyright © 2013 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.     

Depth‐integrated nonhydrostatic free‐surface flow modeling using weighted‐averaged equations

In this study, a depth‐integrated nonhydrostatic flow model is developed using the method of weighted residuals. Using a unit weighting function, depth‐integrated Reynolds‐averaged Navier‐Stokes equations are obtained. Prescribing polynomial variations for the field variables in the vertical direction, a set of perturbation parameters remains undetermined. The model is closed generating a set of weighted‐averaged equations using a suitable weighting function. The resulting depth‐integrated nonhydrostatic model is solved with a semi‐implicit finite‐volume finite‐difference scheme. The explicit part of the model is a Godunov‐type finite‐volume scheme that uses the Harten‐Lax‐van Leer‐contact wave approximate Riemann solver to determine the nonhydrostatic depth‐averaged velocity field. The implicit part of the model is solved using a Newton‐Raphson algorithm to incorporate the effects of the pressure field in the solution. The model is applied with good results to a set of problems of coastal and river engineering, including steady flow over fixed bedforms, solitary wave propagation, solitary wave run‐up, linear frequency dispersion, propagation of sinusoidal waves over a submerged bar, and dam‐break flood waves.     

A high‐order alternating direction implicit method for the unsteady convection‐dominated diffusion problem

A high‐order alternating direction implicit (ADI) method for solving the unsteady convection‐dominated diffusion equation is developed. The fourth‐order Padé scheme is used for the discretization of the convection terms, while the second‐order Padé scheme is used for the diffusion terms. The Crank–Nicolson scheme and ADI factorization are applied for time integration. After ADI factorization, the two‐dimensional problem becomes a sequence of one‐dimensional problems. The solution procedure consists of multiple use of a one‐dimensional tridiagonal matrix algorithm that produces a computationally cost‐effective solver. Von Neumann stability analysis is performed to show that the method is unconditionally stable. An unsteady two‐dimensional problem concerning convection‐dominated propagation of a Gaussian pulse is studied to test its numerical accuracy and compare it to other high‐order ADI methods. The results show that the overall numerical accuracy can reach third or fourth order for the convection‐dominated diffusion equation depending on the magnitude of diffusivity, while the computational cost is much lower than other high‐order numerical methods. Copyright © 2011 John Wiley & Sons, Ltd.     

Multiscale modeling of irradiated polycrystalline FCC metals

We propose a set of models for the post-irradiation deformation response of polycrystalline FCC metals. First, a defect- and dislocation-density based evolution model is developed to capture the features of irradiation-induced hardening as well as intra-granular softening. The proposed hardening model is incorporated within a rate-independent single crystal plasticity model. The result is a non-homogeneous deformation model that accounts for defect absorption on the active slip planes during plastic loading. The macroscopic non-linear constitutive response of the polycrystalline aggregate of the single crystal grains is then obtained using a micro–macro transition scheme, which is realized within a Jacobian-free multiscale method (JFMM). The Jacobian-free approach circumvents explicit computation of the tangent matrix at the macroscale by using a Newton–Krylov process. This has a major advantage in terms of storage requirements and computational cost over existing approaches based on homogenized material coefficients in which explicit Jacobian computation is required at every Newton step. The mechanical response of neutron-irradiated single and polycrystalline OFHC copper is studied and it is shown to capture experimentally observed grain-level phenomena.     

An implicit pseudo‐spectral multi‐domain method for the simulation of incompressible flows

A pseudo‐spectral method for the solution of incompressible flow problems based on an iterative solver involving an implicit treatment of linearized convective terms is presented. The method allows the treatment of moderately complex geometries by means of a multi‐domain approach and it is able to cope with non‐constant fluid properties and non‐orthogonal problem domains. In addition, the fully implicit scheme yields improved stability properties as opposed to semi‐implicit schemes commonly employed. Key components of the method are a Chebyshev collocation discretization, a special pressure–correction scheme, and a restarted GMRES method with a preconditioner derived from a fast direct solver. The performance of the proposed method is investigated by considering several numerical examples of different complexity, and also includes comparisons to alternative solution approaches based on finite‐volume discretizations. Copyright © 2003 John Wiley & Sons, Ltd.     

Effects of the Jacobian evaluation on Newton's solution of the Euler equations

Newton's method is developed for solving the 2‐D Euler equations. The Euler equations are discretized using a finite‐volume method with upwind flux splitting schemes. Both analytical and numerical methods are used for Jacobian calculations. Although the numerical method has the advantage of keeping the Jacobian consistent with the numerical residual vector and avoiding extremely complex analytical differentiations, it may have accuracy problems and need longer execution time. In order to improve the accuracy of numerical Jacobians, detailed error analyses are performed. Results show that the finite‐difference perturbation magnitude and computer precision are the most important parameters that affect the accuracy of numerical Jacobians. A method is developed for calculating an optimal perturbation magnitude that can minimize the error in numerical Jacobians. The accuracy of the numerical Jacobians is improved significantly by using the optimal perturbation magnitude. The effects of the accuracy of numerical Jacobians on the convergence of the flow solver are also investigated. In order to reduce the execution time for numerical Jacobian evaluation, flux vectors with perturbed flow variables are calculated only for neighbouring cells. A sparse matrix solver that is based on LU factorization is used. Effects of different flux splitting methods and higher‐order discretizations on the performance of the solver are analysed. Copyright © 2005 John Wiley & Sons, Ltd.