The improvement of numerical modeling in the solution of incompressible viscous flow problems using finite element method based on spherical Hankel shape functions

In this paper, the finite element method with new spherical Hankel shape functions is developed for simulating 2‐dimensional incompressible viscous fluid problems. In order to approximate the hydrodynamic variables, the finite element method based on new shape functions is reformulated. The governing equations are the Navier‐Stokes equations solved by the finite element method with the classic Lagrange and spherical Hankel shape functions. The new shape functions are derived using the first and second kinds of Bessel functions. In addition, these functions have properties such as piecewise continuity. For the enrichment of Hankel radial basis functions, polynomial terms are added to the functional expansion that only employs spherical Hankel radial basis functions in the approximation. In addition, the participation of spherical Bessel function fields has enhanced the robustness and efficiency of the interpolation. To demonstrate the efficiency and accuracy of these shape functions, 4 benchmark tests in fluid mechanics are considered. Then, the present model results are compared with the classic finite element results and available analytical and numerical solutions. The results show that the proposed method, even with less number of elements, is more accurate than the classic finite element method.     

A reduced‐order approach for optimal control of fluids using proper orthogonal decomposition

In this article, a reduced‐order modeling approach, suitable for active control of fluid dynamical systems, based on proper orthogonal decomposition (POD) is presented. The rationale behind the reduced‐order modeling is that numerical simulation of Navier–Stokes equations is still too costly for the purpose of optimization and control of unsteady flows. The possibility of obtaining reduced‐order models that reduce the computational complexity associated with the Navier–Stokes equations is examined while capturing the essential dynamics by using the POD. The POD allows the extraction of a reduced set of basis functions, perhaps just a few, from a computational or experimental database through an eigenvalue analysis. The solution is then obtained as a linear combination of this reduced set of basis functions by means of Galerkin projection. This makes it attractive for optimal control and estimation of systems governed by partial differential equations (PDEs). It is used here in active control of fluid flows governed by the Navier–Stokes equations. In particular, flow over a backward‐facing step is considered. Reduced‐order models/low‐dimensional dynamical models for this system are obtained using POD basis functions (global) from the finite element discretizations of the Navier–Stokes equations. Their effectiveness in flow control applications is shown on a recirculation control problem using blowing on the channel boundary. Implementational issues are discussed and numerical experiments are presented. Copyright © 2000 John Wiley & Sons, Ltd.     

Integrated radial basis functions‐based differential quadrature method and its performance

In this paper, indirect radial basis function networks (IRBFN) proposed by Nam and Tranh (Neural Networks 2001; 14 (2):185–199; Appl. Math. Modelling 2003; 27 :197–220) are incorporated into the differential quadrature (DQ) approximation of derivatives. For simplicity, this new variant of RBF‐DQ approach is named as iRBF‐DQ method. The proposed approach is validated by its application to solve the one‐dimensional Burger's equation, and simulate natural convection in a concentric annulus by solving Navier–Stokes equations. It was found that as compared to the benchmark data, the iRBF‐DQ approach can provide more accurate results than the original RBF‐DQ method. Copyright © 2006 John Wiley & Sons, Ltd.     

Hybrid genetic algorithms and artificial neural networks for complex design optimization in CFD

The present paper is devoted to the study of design optimization strategies in the particular framework of complex computational fluid dynamics. Genetic algorithms are chosen as the optimization strategy, thanks to their robustness and flexibility. Two ways are explored to improve the behaviour of genetic algorithms in order to increase the efficiency of the search. First, approximated pre‐evaluations based on artificial neural networks are used to benefit from the knowledge acquired from the problem and to reduce the number of expensive evaluations by the flow solver required at each generation. Then, a hybridization technique is proposed for the final local search, which is performed by a deterministic method. These approaches are validated and applied on two‐ and three‐dimensional problems, involving Reynolds‐averaged Navier–Stokes computations with near‐wall turbulence modeling. Copyright © 2004 John Wiley & Sons, Ltd.     

Applications of the artificial compressibility method for turbulent open channel flows

A three‐dimensional (3‐D) numerical method for solving the Navier–Stokes equations with a standard k–ε turbulence model is presented. In order to couple pressure with velocity directly, the pressure is divided into hydrostatic and hydrodynamic parts and the artificial compressibility method (ACM) is employed for the hydrodynamic pressure. By introducing a pseudo‐time derivative of the hydrodynamic pressure into the continuity equation, the incompressible Navier–Stokes equations are changed from elliptic‐parabolic to hyperbolic‐parabolic equations. In this paper, a third‐order monotone upstream‐centred scheme for conservation laws (MUSCL) method is used for the hyperbolic equations. A system of discrete equations is solved implicitly using the lower–upper symmetric Gauss–Seidel (LU‐SGS) method. This newly developed numerical method is validated against experimental data with good agreement. Copyright © 2005 John Wiley & Sons, Ltd.     

Coupled lubrication and Stokes flow finite elements

A method is developed for performing a local reduction of the governing physics for fluid problems with domains that contain a combination of narrow and non‐narrow regions, and the computational accuracy and performance of the method are measured. In the narrow regions of the domain, where the fluid is assumed to have no inertia and the domain height and curvature are assumed small, lubrication, or Reynolds, theory is used locally to reduce the two‐dimensional Navier–Stokes equations to the one‐dimensional Reynolds equation while retaining a high degree of accuracy in the overall solution. The Reynolds equation is coupled to the governing momentum and mass equations of the non‐narrow region with boundary conditions on the mass and momentum flux. The localized reduction technique, termed ‘stitching,’ is demonstrated on Stokes flow for various geometries of the hydrodynamic journal bearing—a non‐trivial test problem for which a known analytical solution is available. The computational advantage of the coupled Stokes–Reynolds method is illustrated on an industrially applicable fully‐flooded deformable‐roll coating example. The examples in this paper are limited to two‐dimensional Stokes flow, but extension to three‐dimensional and Navier–Stokes flow is possible. Copyright © 2003 John Wiley & Sons, Ltd.     

Fourth‐order accurate compact‐difference discretization method for Helmholtz and incompressible Navier–Stokes equations

A fourth‐order accurate solution method for the three‐dimensional Helmholtz equations is described that is based on a compact finite‐difference stencil for the Laplace operator. Similar discretization methods for the Poisson equation have been presented by various researchers for Dirichlet boundary conditions. Here, the complicated issue of imposing Neumann boundary conditions is described in detail. The method is then applied to model Helmholtz problems to verify the accuracy of the discretization method. The implementation of the solution method is also described. The Helmholtz solver is used as the basis for a fourth‐order accurate solver for the incompressible Navier–Stokes equations. Numerical results obtained with this Navier–Stokes solver for the temporal evolution of a three‐dimensional instability in a counter‐rotating vortex pair are discussed. The time‐accurate Navier–Stokes simulations show the resolving properties of the developed discretization method and the correct prediction of the initial growth rate of the three‐dimensional instability in the vortex pair. Copyright © 2004 John Wiley & Sons, Ltd.     

Multigrid solutions of the Euler and Navier–Stokes equations on unstructured grids

A computationally efficient multigrid algorithm for upwind edge‐based finite element schemes is developed for the solution of the two‐dimensional Euler and Navier–Stokes equations on unstructured triangular grids. The basic smoother is based upon a Galerkin approximation employing an edge‐based formulation with the explicit addition of an upwind‐type local extremum diminishing (LED) method. An explicit time stepping method is used to advance the solution towards the steady state. Fully unstructured grids are employed to increase the flexibility of the proposed algorithm. A full approximation storage (FAS) algorithm is used as the basic multigrid acceleration procedure. Copyright © 1999 John Wiley & Sons, Ltd.     

A Galerkin spectral method based on helical‐wave decomposition for the incompressible Navier–Stokes equations

This paper presents a global Galerkin spectral method for solving the incompressible Navier–Stokes equations in three‐dimensional bounded domains. The method is based on helical‐wave decomposition (HWD), which uses the vector eigenfunctions of the curl operator as orthogonal basis functions. We shall first review the general theory of HWD in an arbitrary simply connected domain, along with some new developments. We then employ the HWD to construct a Galerkin spectral method. The current method innovates the existing HWD‐based spectral method by (a) adding a series of auxiliary fields to the HWD of the velocity field to fulfill the no‐slip boundary condition and to settle the convergence problem of the HWD of the curl fields, and (b) providing a pseudo‐spectral method that utilizes a fast spherical harmonic transform algorithm and Gaussian quadrature to calculate the nonlinear term in the Navier–Stokes equations. The auxiliary fields are uniquely determined by solving the Stokes and Stokes‐like equations under adequate boundary conditions. The implementation of the method under the spherical geometry is presented in detail. Several numerical examples are provided to validate the proposed method. The method can be easily extended to other domains once the helical‐wave bases, which depend only on the geometry of the domains, are available. Copyright © 2015 John Wiley & Sons, Ltd.     

Two‐level finite element method with a stabilizing subgrid for the incompressible Navier–Stokes equations

We consider the Galerkin finite element method for the incompressible Navier–Stokes equations in two dimensions. The domain is discretized into a set of regular triangular elements and the finite‐dimensional spaces employed consist of piecewise continuous linear interpolants enriched with the residual‐free bubble functions. To find the bubble part of the solution, a two‐level finite element method with a stabilizing subgrid of a single node is described, and its application to the Navier–Stokes equation is displayed. Numerical approximations employing the proposed algorithm are presented for three benchmark problems. The results show that the proper choice of the subgrid node is crucial in obtaining stable and accurate numerical approximations consistent with the physical configuration of the problem at a cheap computational cost. Copyright © 2008 John Wiley & Sons, Ltd.     

Finite element and implicit Runge–Kutta implementation of an acoustics–convection upstream resolution algorithm for the time‐dependent two‐dimensional Euler equations

The second of a two‐paper series, this paper details a solver for the characteristics‐bias system from the acoustics–convection upstream resolution algorithm for the Euler and Navier–Stokes equations. An integral formulation leads to several surface integrals that allow effective enforcement of boundary conditions. Also presented is a new multi‐dimensional procedure to enforce a pressure boundary condition at a subsonic outlet, a procedure that remains accurate and stable. A classical finite element Galerkin discretization of the integral formulation on any prescribed grid directly yields an optimal discretely conservative upstream approximation for the Euler and Navier–Stokes equations, an approximation that remains multi‐dimensional independently of the orientation of the reference axes and computational cells. The time‐dependent discrete equations are then integrated in time via an implicit Runge–Kutta procedure that in this paper is proven to remain absolutely non‐linearly stable for the spatially‐discrete Euler and Navier–Stokes equations and shown to converge rapidly to steady states, with maximum Courant number exceeding 100 for the linearized version. Even on relatively coarse grids, the acoustics–convection upstream resolution algorithm generates essentially non‐oscillatory solutions for subsonic, transonic and supersonic flows, encompassing oblique‐ and interacting‐shock fields that converge within 40 time steps and reflect reference exact solutions. Copyright © 2005 John Wiley & Sons, Ltd.     

Finite element solution of three‐dimensional turbulent flows applied to mold‐filling problems

This paper presents a finite element solution algorithm for three‐dimensional isothermal turbulent flows for mold‐filling applications. The problems of interest present unusual challenges for both the physical modelling and the solution algorithm. High‐Reynolds number transient turbulent flows with free surfaces have to be computed on complex three‐dimensional geometries. In this work, a segregated algorithm is used to solve the Navier–Stokes, turbulence and front‐tracking equations. The streamline–upwind/Petrov–Galerkin method is used to obtain stable solutions to convection‐dominated problems. Turbulence is modelled using either a one‐equation turbulence model or the κ–ε two‐equation model with wall functions. Turbulence equations are solved for the natural logarithm of the turbulence variables. The change of dependent variables allows for a robust solution algorithm and good predictions even on coarse meshes. This is very important in the case of large three‐dimensional applications for which highly refined meshes result in untreatable large numbers of elements. The position of the flow front in the mold cavity is computed using a level set approach. Finally, equations are integrated in time using an implicit Euler scheme. The methodology presents the robustness and cost effectiveness needed to tackle complex industrial applications. Copyright © 2000 John Wiley & Sons, Ltd.     

A new immersed boundary method for compressible Navier–Stokes equations

This paper presents an immersed boundary method for compressible Navier–Stokes equations in irregular domains, based on a local radial basis function approximation. This approach allows one to define a reconstruction of the radial basis functions on each irregular interface cell to treat both the Dirichlet and Neumann boundary conditions accurately on the immersed interfaces. Several numerical examples, including problems with available analytical solutions and the well-documented flow past an airfoil, are presented to test the proposed method. The numerical results demonstrate that the proposed method provides accurate solutions for viscous compressible flows.     

A projection method for the spectral solution of non‐homogeneous and incompressible Navier–Stokes equations

This paper is devoted to the development of a parallel, spectral and second‐order time‐accurate method for solving the incompressible and variable density Navier–Stokes equations. The method is well suited for finite thickness density layers and is very efficient, especially for three‐dimensional computations. It is based on an exact projection technique. To enforce incompressibility, for a non‐homogeneous fluid, the pressure is computed using an iterative algorithm. A complete study of the convergence properties of this algorithm is done for different density variations. Numerical simulations showing, qualitatively, the capabilities of the developed Navier–Stokes solver for many realistic problems are presented. The numerical procedure is also validated quantitatively by reproducing growth rates from the linear instability theory in a three‐dimensional direct numerical simulation of an unstable, non‐homogeneous, flow configuration. It is also shown that, even in a turbulent flow, the spectral accuracy is recovered. Copyright © 2012 John Wiley & Sons, Ltd.     

Calculation of three‐dimensional turbulent flow with a finite volume multigrid method

A numerical method for the efficient calculation of three‐dimensional incompressible turbulent flow in curvilinear co‐ordinates is presented. The mathematical model consists of the Reynolds averaged Navier–Stokes equations and the k–ε turbulence model. The numerical method is based on the SIMPLE pressure‐correction algorithm with finite volume discretization in curvilinear co‐ordinates. To accelerate the convergence of the solution method a full approximation scheme‐full multigrid (FAS‐FMG) method is utilized. The solution of the k–ε transport equations is embedded in the multigrid iteration. The improved convergence characteristic of the multigrid method is demonstrated by means of several calculations of three‐dimensional flow cases. Copyright © 1999 John Wiley & Sons, Ltd.     

Control of Navier–Stokes equations by means of mode reduction

In a previous work (Park HM, Lee MW. An efficient method of solving the Navier–Stokes equation for the flow control. International Journal of Numerical Methods in Engineering 1998; 41 : 1131–1151), the authors proposed an efficient method of solving the Navier–Stokes equations by reducing their number of modes. Employing the empirical eigenfunctions of the Karhunen–Loève decomposition as basis functions of a Galerkin procedure, one can a priori limit the function space considered to the smallest linear sub‐space that is sufficient to describe the observed phenomena, and consequently, reduce the Navier–Stokes equations defined on a complicated geometry to a set of ordinary differential equations with a minimum degree of freedom. In the present work, we apply this technique, termed the Karhunen–Loève Galerkin procedure, to a pointwise control problem of Navier–Stokes equations. The Karhunen–Loève Galerkin procedure is found to be much more efficient than the traditional method, such as finite difference method in obtaining optimal control profiles when the minimization of the objective function has been done by using a conjugate gradient method.     

Non‐intrusive reduced‐order modelling of the Navier–Stokes equations based on RBF interpolation

We present a new non‐intrusive model reduction method for the Navier–Stokes equations. The method replaces the traditional approach of projecting the equations onto the reduced space with a radial basis function (RBF) multi‐dimensional interpolation. The main point of this method is to construct a number of multi‐dimensional interpolation functions using the RBF scatter multi‐dimensional interpolation method. The interpolation functions are used to calculate POD coefficients at each time step from POD coefficients at earlier time steps. The advantage of this method is that it does not require modifications to the source code (which would otherwise be very cumbersome), as it is independent of the governing equations of the system. Another advantage of this method is that it avoids the stability problem of POD/Galerkin. The novelty of this work lies in the application of RBF interpolation and POD to construct the reduced‐order model for the Navier–Stokes equations. Another novelty is the verification and validation of numerical examples (a lock exchange problem and a flow past a cylinder problem) using unstructured adaptive finite element ocean model. The results obtained show that CPU times are reduced by several orders of magnitude whilst the accuracy is maintained in comparison with the corresponding high‐fidelity models. Copyright © 2015 John Wiley & Sons, Ltd.     

Development of a convection–diffusion‐reaction magnetohydrodynamic solver on non‐staggered grids

This paper presents a convection–diffusion‐reaction (CDR) model for solving magnetic induction equations and incompressible Navier–Stokes equations. For purposes of increasing the prediction accuracy, the general solution to the one‐dimensional constant‐coefficient CDR equation is employed. For purposes of extending this discrete formulation to two‐dimensional analysis, the alternating direction implicit solution algorithm is applied. Numerical tests that are amenable to analytic solutions were performed in order to validate the proposed scheme. Results show good agreement with the analytic solutions and high rate of convergence. Like many magnetohydrodynamic studies, the Hartmann–Poiseuille problem is considered as a benchmark test to validate the code. Copyright © 2004 John Wiley & Sons, Ltd.     

The Krylov accelerated SIMPLE(R) method for flow problems in industrial furnaces

Numerical modeling of the melting and combustion process is an important tool in gaining understanding of the physical and chemical phenomena that occur in a gas‐ or oil‐fired glass‐melting furnace. The incompressible Navier–Stokes equations are used to model the gas flow in the furnace. The discrete Navier–Stokes equations are solved by the SIMPLE(R) pressure‐correction method. In these applications, many SIMPLE(R) iterations are necessary to obtain an accurate solution. In this paper, Krylov accelerated versions are proposed: GCR‐SIMPLE(R). The properties of these methods are investigated for a simple two‐dimensional flow. Thereafter, the efficiencies of the methods are compared for three‐dimensional flows in industrial glass‐melting furnaces. Copyright © 2000 John Wiley & Sons, Ltd.     

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.