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.     

Development of highly accurate interpolation method for mesh‐free flow simulations II. Application of CIVA method to incompressible flow simulations

This is the second report on the development of a highly accurate interpolation method, which is called cubic interpolation with volume/area (CIVA) co‐ordinates, for mesh‐free flow simulations. In this paper, the method of determining the c‐parameter of CIVA using a constant curvature condition is first considered for the two‐ and three‐dimensional cases. A computation of a three‐dimensional passive scalar advection problem is performed for accuracy verification and for comparison with widely used methods. Then, an application algorithm of the CIVA method respecting incompressible fluid simulation is presented. As the incompressible condition based on Lagrangian approaches causes problems, in this paper we consider the condition based on the conventional Eulerian approach. The CIVA‐based incompressible flow simulation algorithm enables a highly accurate simulation of many kinds of problems that have complicated geometries and involve complicated phenomena. To confirm the facts, numerical analyzes are executed for some benchmark problems, namely flow in a square cavity, free surface sloshing and moving boundary problems in complex geometries. The results show that the method achieves high accuracy and has high flexibility, even for the flows involving high Reynolds number, complicated geometries, moving boundaries and free surfaces. Copyright © 2000 John Wiley & Sons, Ltd.     

Parallel solution of three‐dimensional Marangoni flow in liquid bridges

This paper describes the implementation and performances of a parallel solver for the direct numerical simulation of the three‐dimensional and time‐dependent Navier–Stokes equations on distributed‐memory, massively parallel computers. The feasibility of this approach to study Marangoni flow instability in half zone liquid bridges is examined. The results indicate that the incompressible, non‐linear Navier–Stokes problem, governing the Marangoni flows behavior, can effectively be parallelized on a distributed memory parallel machine by remapping the distributed data structure. The numerical code is based on a three‐dimensional Simplified Marker and Cell (SMAC) primitive variable method applied to a staggered finite difference grid. Using this method, the problem is split into two problems, one parabolic and the other elliptic A parallel algorithm, explicit in time, is utilized to solve the parabolic equations. A parallel multisplitting kernel is introduced for the solution of the pseudo pressure elliptic equation, representing the most time‐consuming part of the algorithm. A grid‐partition strategy is used in the parallel implementations of both the parabolic equations and the multisplitting elliptic kernel. A Message Passing Interface (MPI) is coded for the boundary conditions; this protocol is portable to different systems supporting this interface for interprocessor communications. Numerical experiments illustrate good numerical properties and parallel efficiency. In particular, good scalability on a large number of processors can be achieved as long as the granularity of the parallel application is not too small. However, increasing the number of processors, the Speed‐Up is ever smaller than the ideal linear Speed‐Up. The communication timings indicate that complex practical calculations, such as the solutions of the Navier–Stokes equations for the numerical simulation of the instability of Marangoni flows, can be expected to run on a massively parallel machine with good efficiency. Copyright © 1999 John Wiley & Sons, Ltd.     

Implementing a high‐order accurate implicit operator scheme for solving steady incompressible viscous flows using artificial compressibility method

This paper uses a fourth‐order compact finite‐difference scheme for solving steady incompressible flows. The high‐order compact method applied is an alternating direction implicit operator scheme, which has been used by Ekaterinaris for computing two‐dimensional compressible flows. Herein, this numerical scheme is efficiently implemented to solve the incompressible Navier–Stokes equations in the primitive variables formulation using the artificial compressibility method. For space discretizing the convective fluxes, fourth‐order centered spatial accuracy of the implicit operators is efficiently obtained by performing compact space differentiation in which the method uses block‐tridiagonal matrix inversions. To stabilize the numerical solution, numerical dissipation terms and/or filters are used. In this study, the high‐order compact implicit operator scheme is also extended for computing three‐dimensional incompressible flows. The accuracy and efficiency of this high‐order compact method are demonstrated for different incompressible flow problems. A sensitivity study is also conducted to evaluate the effects of grid resolution and pseudocompressibility parameter on accuracy and convergence rate of the solution. The effects of filtering and numerical dissipation on the solution are also investigated. Test cases considered herein for validating the results are incompressible flows in a 2‐D backward facing step, a 2‐D cavity and a 3‐D cavity at different flow conditions. Results obtained for these cases are in good agreement with the available numerical and experimental results. The study shows that the scheme is robust, efficient and accurate for solving incompressible flow problems. Copyright © 2010 John Wiley & Sons, Ltd.     

Parallel three‐dimensional simulation of the injection molding process

This paper describes the development of a parallel three‐dimensional unstructured non‐isothermal flow solver for the simulation of the injection molding process. The numerical model accounts for multiphase flow in which the melt and air regions are considered to be a continuous incompressible fluid with distinct physical properties. This aspect avoids the complex reconstruction of the interface. A collocated finite volume method is employed, which can switch between first‐ and second‐order accuracy in both space and time. The pressure implicit with splitting of operators algorithm is used to compute the transient flow variables and couple velocity and pressure. The temperature equation is solved using a transport equation with convection and diffusion terms. An upwind differencing scheme is used for the discretization of the convection term to enforce a bounded solution. In order to capture the sharp interface, a bounded compressive high‐resolution scheme is employed. Parallelization of the code is achieved using the PETSc framework and a single program multiple data message passing model. Predicted numerical solutions for several example problems are considered. The first case validates the solution algorithm for moderate Reynolds number flows using a structured mesh. The second case employs an unstructured hybrid mesh showing the capability of the solver to describe highly viscous flows closer to realistic injection molding conditions. The final case presents the non‐isothermal filling of a thick cavity using three mesh sizes and up to 80 processors to assess parallel performance. The proposed algorithm is shown to have good accuracy and scalability. Copyright © 2008 John Wiley & Sons, Ltd.     

A stable and accurate projection method on a locally refined staggered mesh

In this paper, a robust projection method on a locally refined mesh is proposed for two‐ and three‐dimensional viscous incompressible flows. The proposed method is robust not only when the interface between two meshes is located in a smooth flow region but also when the interface is located in a flow region with large gradients and/or strong unsteadiness. In numerical simulations, a locally refined mesh saves many grid points in regions of relatively small gradients compared with a uniform mesh. For efficiency and ease of implementation, we consider a two‐level blocked structure, for which both of the coarse and fine meshes are uniform Cartesian ones individually. Unfortunately, the introduction of the two‐level blocked mesh results in an important but difficult issue: coupling of the coarse and fine meshes. In this paper, by properly addressing the issue of the coupling, we propose a stable and accurate projection method on a locally refined staggered mesh for both two‐ and three‐dimensional viscous incompressible flows. The proposed projection method is based on two principles: the linear interpolation technique and the consistent discretization of both sides of the pressure Poisson equation. The proposed algorithm is straightforward owing to the linear interpolation technique, is stable and accurate, is easy to extend from two‐ to three‐dimensional flows, and is valid even when flows with large gradients cross the interface between the two meshes. The resulting pressure Poisson equation is non‐symmetric on a locally refined mesh. The numerical results for a series of exact solutions for 2D and 3D viscous incompressible flows verify the stability and accuracy of the proposed projection method. The method is also applied to some challenging problems, including turbulent flows around particles, flows induced by impulsively started/stopped particles, and flows induced by particles near solid walls, to test the stability and accuracy. Copyright © 2010 John Wiley & Sons, Ltd.     

A parallel cell‐based DSMC method on unstructured adaptive meshes

A parallel DSMC method based on a cell‐based data structure is developed for the efficient simulation of rarefied gas flows on PC‐clusters. Parallel computation is made by decomposing the computational domain into several subdomains. Dynamic load balancing between processors is achieved based on the number of simulation particles and the number of cells allocated in each subdomain. Adjustment of cell size is also made through mesh adaptation for the improvement of solution accuracy and the efficient usage of meshes. Applications were made for a two‐dimensional supersonic leading‐edge flow, the axi‐symmetric Rothe's nozzle, and the open hollow cylinder flare flow for validation. It was found that the present method is an efficient tool for the simulation of rarefied gas flows on PC‐based parallel machines. Copyright © 2004 John Wiley & Sons, Ltd.     

A methodology for high performance computation of fully inhomogeneous turbulent flows

A large‐eddy simulation methodology for high performance parallel computation of statistically fully inhomogeneous turbulent flows on structured grids is presented. Strategies and algorithms to improve the memory efficiency as well as the parallel performance of the subgrid‐scale model, the factored scheme, and the Poisson solver on shared‐memory parallel platforms are proposed and evaluated. A novel combination of one‐dimensional red–black/line Gauss–Seidel and two‐dimensional red–black/line Gauss–Seidel methods is shown to provide high efficiency and performance for multigrid relaxation of the Poisson equation. Parallel speedups are measured on various shared‐distributed memory systems. Validations of the code are performed in large‐eddy simulations of turbulent flows through a straight channel and a square duct. Results obtained from the present solver employing a Lagrangian dynamic subgrid‐scale model show good agreements with other available data. The capability of the code for more complex flows is assessed by performing a large‐eddy simulation of the tip‐leakage flow in a linear cascade. Copyright © 2006 John Wiley & Sons, Ltd.     

A PARALLEL BLOCK-STRUCTURED MULTIGRID METHOD FOR THE PREDICTION OF INCOMPRESSIBLE FLOWS

In this paper a parallel multigrid finite volume solver for the prediction of steady and unsteady flows in complex geometries is presented. For the handling of the complexity of the geometry and for the parallelization a unified approach connected with the concept of block-structured grids is employed. The parallel implementation is based on grid partitioning with automatic load balancing and follows the message-passing concept, ensuring a high degree of portability. A high numerical efficiency is obtained by a non-linear multigrid method with a pressure correction scheme as smoother. By a number of numerical experiments on various parallel computers the method is investigated with respect to its numerical and parallel efficiency. The results illustrate that the high performance of the underlying sequential multigrid algorithm can largely be retained in the parallel implementation and that the proposed method is well suited for solving complex flow problems on parallel computers with high efficiency.     

A deconvolution‐based fourth‐order finite volume method for incompressible flows on non‐uniform grids

This paper is concerned with the development of a new high‐order finite volume method for the numerical simulation of highly convective unsteady incompressible flows on non‐uniform grids. Specifically, both a high‐order fluxes integration and the implicit deconvolution of the volume‐averaged field are considered. This way, the numerical solution effectively stands for a fourth‐order approximation of the point‐wise one. Moreover, the procedure is developed in the framework of a projection method for the pressure–velocity decoupling, while originally deriving proper high‐order intermediate boundary conditions. The entire numerical procedure is discussed in detail, giving particular attention to the consistent discretization of the deconvolution operation. The present method is also cast in the framework of approximate deconvolution modelling for large‐eddy simulation. The overall high accuracy of the method, both in time and space, is demonstrated. Finally, as a model of real flow computation, a two‐dimensional time‐evolving mixing layer is simulated, with and without sub‐grid scales modelling. Copyright © 2003 John Wiley & Sons, Ltd.     

A massively parallel GPU‐accelerated model for analysis of fully nonlinear free surface waves

We implement and evaluate a massively parallel and scalable algorithm based on a multigrid preconditioned Defect Correction method for the simulation of fully nonlinear free surface flows. The simulations are based on a potential model that describes wave propagation over uneven bottoms in three space dimensions and is useful for fast analysis and prediction purposes in coastal and offshore engineering. A dedicated numerical model based on the proposed algorithm is executed in parallel by utilizing affordable modern special purpose graphics processing unit (GPU). The model is based on a low‐storage flexible‐order accurate finite difference method that is known to be efficient and scalable on a CPU core (single thread). To achieve parallel performance of the relatively complex numerical model, we investigate a new trend in high‐performance computing where many‐core GPUs are utilized as high‐throughput co‐processors to the CPU. We describe and demonstrate how this approach makes it possible to do fast desktop computations for large nonlinear wave problems in numerical wave tanks (NWTs) with close to 50/100 million total grid points in double/single precision with 4 GB global device memory available. A new code base has been developed in C++ and compute unified device architecture C and is found to improve the runtime more than an order in magnitude in double precision arithmetic for the same accuracy over an existing CPU (single thread) Fortran 90 code when executed on a single modern GPU. These significant improvements are achieved by carefully implementing the algorithm to minimize data‐transfer and take advantage of the massive multi‐threading capability of the GPU device. Copyright © 2011 John Wiley & Sons, Ltd.     

An immersed‐boundary finite‐volume method for direct simulation of flows with suspended paramagnetic particles

In the present study, we have proposed an immersed‐boundary finite‐volume method for the direct numerical simulation of flows with inertialess paramagnetic particles suspended in a nonmagnetic fluid under an external magnetic field without the need for any model such as the dipole–dipole interaction. In the proposed method, the magnetic field (or force) is described by the numerical solution of the Maxwell equation without current, where the smoothed representation technique is employed to tackle the discontinuity of magnetic permeability across the particle–fluid interface. The flow field, on the other hand, is described by the solution of the continuity and momentum equations, where the discrete‐forcing‐based immersed‐boundary method is employed to satisfy the no‐slip condition at the interface. To validate the method, we performed numerical simulations on the two‐dimensional motion of two and three paramagnetic particles in a nonmagnetic fluid subjected to an external uniform magnetic field and then compared the results with the existing finite‐element and semi‐analytical solutions. Comparison shows that the proposed method is robust in the direct simulation of such magnetic particulate flows. This method can be extended to more general flows without difficulty: three‐dimensional particulate flows, flows with a great number of particles, or flows under an arbitrary external magnetic field. Copyright © 2010 John Wiley & Sons, Ltd.     

Euler solutions for aerodynamic inverse shape design

Contributions to the aerodynamics development have to be involved to achieve an increase in quality, reducing time and computer costs. Therefore, this work develops an optimization method based on the finite volume explicit Runge–Kutta multi‐stage scheme with central spatial discretization in combination with multigrid and preconditioning. The multigrid approach includes local time‐stepping and residual smoothing. Such a method allows getting the goal of compressible and almost incompressible solution of fluid flows, having a rate of convergence almost independent from the Mach number. Numerical tests are carried out for the NACA 0012 and 0009 airfoils and three‐dimensional wings based on NACA profiles for Mach‐numbers ranging from 0.8 to 0.002 using the Euler equations. These calculations are found to compare favorably with experimental and numerical data available in the literature. Besides, it is worth pointing out that these results build on earlier ones when finding appropriate new three‐dimensional aerodynamical geometries. Copyright © 2004 John Wiley & Sons, Ltd.     

An adaptive cut‐cell method for environmental fluid mechanics

In this work we present a numerical method for solving the incompressible Navier–Stokes equations in an environmental fluid mechanics context. The method is designed for the study of environmental flows that are multiscale, incompressible, variable‐density, and within arbitrarily complex and possibly anisotropic domains. The method is new because in this context we couple the embedded‐boundary (or cut‐cell) method for complex geometry with block‐structured adaptive mesh refinement (AMR) while maintaining conservation and second‐order accuracy. The accurate simulation of variable‐density fluids necessitates special care in formulating projection methods. This variable‐density formulation is well known for incompressible flows in unit‐aspect ratio domains, without AMR, and without complex geometry, but here we carefully present a new method that addresses the intersection of these issues. The methodology is based on a second‐order‐accurate projection method with high‐order‐accurate Godunov finite‐differencing, including slope limiting and a stable differencing of the nonlinear convection terms. The finite‐volume AMR discretizations are based on two‐way flux matching at refinement boundaries to obtain a conservative method that is second‐order accurate in solution error. The control volumes are formed by the intersection of the irregular embedded boundary with Cartesian grid cells. Unlike typical discretization methods, these control volumes naturally fit within parallelizable, disjoint‐block data structures, and permit dynamic AMR coarsening and refinement as the simulation progresses. We present two‐ and three‐dimensional numerical examples to illustrate the accuracy of the method. Copyright © 2008 John Wiley & Sons, Ltd.     

Solving the Savage–Hutter equations for granular avalanche flows with a second‐order Godunov type method on GPU

In this article, we apply Davis's second‐order predictor‐corrector Godunov type method to numerical solution of the Savage–Hutter equations for modeling granular avalanche flows. The method uses monotone upstream‐centered schemes for conservation laws (MUSCL) reconstruction for conservative variables and Harten–Lax–van Leer contact (HLLC) scheme for numerical fluxes. Static resistance conditions and stopping criteria are incorporated into the algorithm. The computation is implemented on graphics processing unit (GPU) by using compute unified device architecture programming model. A practice of allocating memory for two‐dimensional array in GPU is given and computational efficiency of two‐dimensional memory allocation is compared with one‐dimensional memory allocation. The effectiveness of the present simulation model is verified through several typical numerical examples. Numerical tests show that significant speedups of the GPU program over the CPU serial version can be obtained, and Davis's method in conjunction with MUSCL and HLLC schemes is accurate and robust for simulating granular avalanche flows with shock waves. As an application example, a case with a teardrop‐shaped hydraulic jump in Johnson and Gray's granular jet experiment is reproduced by using specific friction coefficients given in the literature. Copyright © 2014 John Wiley & Sons, Ltd.     

Application of a preconditioned high‐order accurate artificial compressibility‐based incompressible flow solver in wide range of Reynolds numbers

In the present study, the preconditioned incompressible Navier‐Stokes equations with the artificial compressibility method formulated in the generalized curvilinear coordinates are numerically solved by using a high‐order compact finite‐difference scheme for accurately and efficiently computing the incompressible flows in a wide range of Reynolds numbers. A fourth‐order compact finite‐difference scheme is utilized to accurately discretize the spatial derivative terms of the governing equations, and the time integration is carried out based on the dual time‐stepping method. The capability of the proposed solution methodology for the computations of the steady and unsteady incompressible viscous flows from very low to high Reynolds numbers is investigated through the simulation of different 2‐dimensional benchmark problems, and the results obtained are compared with the existing analytical, numerical, and experimental data. A sensitivity analysis is also performed to evaluate the effects of the size of the computational domain and other numerical parameters on the accuracy and performance of the solution algorithm. The present solution procedure is also extended to 3 dimensions and applied for computing the incompressible flow over a sphere. Indications are that the application of the preconditioning in the solution algorithm together with the high‐order discretization method in the generalized curvilinear coordinates provides an accurate and robust solution method for simulating the incompressible flows over practical geometries in a wide range of Reynolds numbers including the creeping flows.     

High‐order stable interpolations for immersed boundary methods

The analysis and improvement of an immersed boundary method (IBM) for simulating turbulent flows over complex geometries are presented. Direct forcing is employed. It consists in interpolating boundary conditions from the solid body to the Cartesian mesh on which the computation is performed. Lagrange and least squares high‐order interpolations are considered. The direct forcing IBM is implemented in an incompressible finite volume Navier–Stokes solver for direct numerical simulations (DNS) and large eddy simulations (LES) on staggered grids. An algorithm to identify the body and construct the interpolation schemes for arbitrarily complex geometries consisting of triangular elements is presented. A matrix stability analysis of both interpolation schemes demonstrates the superiority of least squares interpolation over Lagrange interpolation in terms of stability. Preservation of time and space accuracy of the original solver is proven with the laminar two‐dimensional Taylor–Couette flow. Finally, practicability of the method for simulating complex flows is demonstrated with the computation of the fully turbulent three‐dimensional flow in an air‐conditioning exhaust pipe. Copyright © 2006 John Wiley & Sons, Ltd.     

A parallel unstructured dynamic mesh adaptation algorithm for 3‐D unsteady flows

An unstructured dynamic mesh adaptation and load balancing algorithm has been developed for the efficient simulation of three‐dimensional unsteady inviscid flows on parallel machines. The numerical scheme was based on a cell‐centred finite‐volume method and the Roe's flux‐difference splitting. Second‐order accuracy was achieved in time by using an implicit Jacobi/Gauss–Seidel iteration. The resolution of time‐dependent solutions was enhanced by adopting an h‐refinement/coarsening algorithm. Parallelization and load balancing were concurrently achieved on the adaptive dynamic meshes for computational speed‐up and efficient memory redistribution. A new tree data structure for boundary faces was developed for the continuous transfer of the communication data across the parallel subdomain boundary. The parallel efficiency was validated by applying the present method to an unsteady shock‐tube problem. The flows around oscillating NACA0012 wing and F‐5 wing were also calculated for the numerical verification of the present dynamic mesh adaptation and load balancing algorithm. Copyright © 2005 John Wiley & Sons, Ltd.     

A multigrid method with higher‐order discretization schemes

The implementation of the multigrid method into the SIMPLE algorithm presents interesting aspects concerning the mass fluxes conservation on coarser grids, the k–ε turbulence model and the higher‐order discretization schemes. Higher‐order discretization schemes for the convection terms are increasingly used in order to guarantee accuracy in demanding engineering applications. However, when used in single‐grid algorithms, their convergence is considerably slower compared with the first‐order schemes. Unbounded higher‐order schemes offer maximum accuracy, but quite often they do not converge due to their oscillatory behaviour. This paper demonstrates the dual function of the multigrid method: reduction of CPU time and stabilization of the iterating procedure, making it possible to perform computations with the third‐order accurate QUICK scheme in all cases. The method is applied to the calculation of two‐ and three‐dimensional flows with or without turbulence modelling. The results show that the convergence rate of the present algorithm does not deteriorate when QUICK is used and that, if applied on complex engineering cases, large gains in computational time can be achieved. Copyright © 2001 John Wiley & Sons, Ltd.     

The Numerical Technique for the Landslide Tsunami Simulations Based on Navier–Stokes Equations

The paper presents an integral technique simulating all phases of a landslide-driven tsunami. The technique is based on the numerical solution of the system of Navier–Stokes equations for multiphase flows. The numerical algorithm uses a fully implicit approximation method, in which the equations of continuity and momentum conservation are coupled through implicit summands of pressure gradient and mass flow. The method we propose removes severe restrictions on the time step and allows simulation of tsunami propagation to arbitrarily large distances. The landslide origin is simulated as an individual phase being a Newtonian fluid with its own density and viscosity and separated from the water and air phases by an interface. The basic formulas of equation discretization and expressions for coefficients are presented, and the main steps of the computation procedure are described in the paper. To enable simulations of tsunami propagation across wide water areas, we propose a parallel algorithm of the technique implementation, which employs an algebraic multigrid method. The implementation of the multigrid method is based on the global level and cascade collection algorithms that impose no limitations on the paralleling scale and make this technique applicable to petascale systems. We demonstrate the possibility of simulating all phases of a landslide-driven tsunami, including its generation, propagation and uprush. The technique has been verified against the problems supported by experimental data. The paper describes the mechanism of incorporating bathymetric data to simulate tsunamis in real water areas of the world ocean. Results of comparison with the nonlinear dispersion theory, which has demonstrated good agreement, are presented for the case of a historical tsunami of volcanic origin on the Montserrat Island in the Caribbean Sea.