Resolution of computational aeroacoustics problems on unstructured grids with a higher-order finite volume scheme

Computational fluid dynamics (CFD) has become increasingly used in the industry for the simulation of flows. Nevertheless, the complex configurations of real engineering problems make the application of very accurate methods that only work on structured grids difficult. From this point of view, the development of higher-order methods for unstructured grids is desirable. The finite volume method can be used with unstructured grids, but unfortunately it is difficult to achieve an order of accuracy higher than two, and the common approach is a simple extension of the one-dimensional case. The increase of the order of accuracy in finite volume methods on general unstructured grids has been limited due to the difficulty in the evaluation of field derivatives. This problem is overcome with the application of the Moving Least Squares (MLS) technique on a finite volume framework. In this work we present the application of this method (FV-MLS) to the solution of aeroacoustic problems.     

A conservative unstructured scheme for rapidly varied flows

This article introduces a new semi‐implicit, staggered finite volume scheme on unstructured meshes for the modelling of rapidly varied shallow water flows. Rapidly varied flows occur in the inundation of dry land during flooding situations. They typically involve bores and hydraulic jumps after obstacles such as road banks. Near such sudden flow transitions, the grid resolution is often low compared with the gradients of the bathymetry. Locally the hydrostatic pressure assumption may become invalid. In these situations, it is crucial to apply the correct conservation properties to obtain accurate results. An important feature of this scheme is therefore its ability to conserve momentum locally or, by choice, preserve constant energy head along a streamline. This is achieved using a special interpolation method and control volumes for momentum. The efficiency of inundation calculations with locally very high velocities, and in the case of unstructured meshes locally very small grid distances, is severely hampered by the Courant condition. This article provides a solution in the form of a locally implicit time integration for the advective terms that allows for an explicit calculation in most of the domain, while maintaining unconditional stability by implicit calculations only where necessary. The complex geometry of flooded urban areas asks for the flexibility of unstructured meshes. The efficient calculation of the pressure gradient in this, and other semi‐implicit staggered schemes, requires, however, an orthogonality condition to be put on the grid. In this article a simple method is introduced to generate unstructured hybrid meshes that fulfil this requirement. Copyright © 2008 John Wiley & Sons, Ltd.     

Interpolation on Sparse Grids and Tensor Products of Nikol'skij–Besov Spaces

We investigate the order of convergence of periodic interpolation on sparse grids (blending interpolation) in the framework of tensor products of Nikol'skij–Besov spaces. To this end, we make use of the uniformity of the considered tensor norms and provide a unified approach to error estimates for the interpolation of univariate periodic functions from Nikol'skij–Besov spaces.     

A numerical algorithm for simulation of the Q-switched fiber laser using the travelling wave model

We develop a finite-difference scheme for approximation of a system of nonlinear PDEs describing the Q-switching process. We construct it by using staggered grids. The transport equations are approximated along characteristics, and quadratic nonlinear functions are linearized using a special selection of staggered grids. The stability analysis proves that a connection between time and space steps arises only due to approximation requirements in order to follow exactly the directions of characteristics. The convergence analysis of this scheme is done in two steps. First, some estimates of the uniform boundedness of the discrete solution are proved. This part of the analysis is done locally, in some neighborhood of the exact solution. Second, on the basis of the obtained estimates, the main stability inequality is proved. The second-order convergence rate with respect to the space and time coordinates follows from this stability estimate. Using the obtained convergence result, we prove that the local stability analysis in the selected neighborhood of the exact solution is sufficient.     

On coordinate transformation and grid stretching for sparse grid pricing of basket options

We evaluate two coordinate transformation techniques in combination with grid stretching for pricing basket options in a sparse grid setting. The sparse grid technique is a basic technique for solving a high-dimensional partial differential equation. By creating a small hypercube sub-grid in the ‘composite’ sparse grid we can also determine hedge parameters accurately. We evaluate these techniques for multi-asset examples with up to five underlying assets in the basket.     

Sparse grids and hybrid methods for the chemical master equation

The direct numerical solution of the chemical master equation (CME) is usually impossible due to the high dimension of the computational domain. The standard method for solution of the equation is to generate realizations of the chemical system by the stochastic simulation algorithm (SSA) by Gillespie and then taking averages over the trajectories. Two alternatives are described here using sparse grids and a hybrid method. Sparse grids, implemented as a combination of aggregated grids are used to address the curse of dimensionality of the CME. The aggregated components are selected using an adaptive procedure. In the hybrid method, some of the chemical species are represented macroscopically while the remaining species are simulated with SSA. The convergence of variants of the method is investigated for a growing number of trajectories. Two signaling cascades in molecular biology are simulated with the methods and compared to SSA results. AMS subject classification (2000)  65C20, 60J25, 92C45     

Evaluation of adaptive mesh refinement and coarsening for the computation of compressible flows on unstructured meshes

The compressible gas flows of interest to aerospace applications often involve situations where shock and expansion waves are present. Decreasing the characteristic dimension of the computational cells in the vicinity of shock waves improves the quality of the computed flows. This reduction in size may be accomplished by the use of mesh adaption procedures. In this paper an analysis is presented of an adaptive mesh scheme developed for an unstructured mesh finite volume upwind computer code. This scheme is tailored to refine or coarsen the computational mesh where gradients of the flow properties are respectively high or low. The refinement and coarsening procedures are applied to the classical gas dynamic problems of the stabilization of shock waves by solid bodies. In particular, situations where oblique shock waves interact with an expansion fan and where bow shocks arise around solid bodies are considered. The effectiveness of the scheme in reducing the computational time, while increasing the solution accuracy, is assessed. It is shown that the refinement procedure alone leads to a number of computational cells which is 20% larger than when alternate passes of refinement and coarsening are used. Accordingly, a reduction of computational time of the same order of magnitude is obtained. Copyright © 2005 John Wiley & Sons, Ltd.     

A multiblock/multilevel mesh refinement procedure for CFD computations

A multiblock/multilevel algorithm with local refinement for general two‐ and three‐dimensional fluid flow is presented. The patched‐based local refinement procedure is presented in detail and algorithmic implementations are also presented. The multiblock implementation is essentially block‐unstructured, i.e. each block having its own local curvilinear co‐ordinate system. Refined grid patches can be put anywhere in the computational domain and can extend across block boundaries. To simplify the implementation, while still maintaining sufficient generality, the refinement is restricted to a refinement of the grid successively halving the grid size within a selected patch. The multiblock approach is implemented within the framework of the well‐known SIMPLE solution strategy. Computational experiments showing the effect of using the multilevel solution procedure are presented for a sample elliptic problem and a few benchmark problems of computational fluid dynamics (CFD). Copyright © 2001 John Wiley & Sons, Ltd.     

Software package for 3D viscous gas flow simulation on multiprocessor computer systems

A parallel software package designed for the numerical simulation of three-dimensional viscous gas flows is presented. The numerical algorithm is based on kinetically consistent difference schemes used on locally refined grids. The software package has been tested in various super-and subsonic flow problems. It provides an opportunity for the direct simulation of turbulent flows. The efficiency of parallelization is analyzed depending on the problem size and the number of processors.