AGE method simulations of a turbulent far‐wake compared to spectral DNS

Turbulent flow simulation methods based on finite differences are attractive for their simplicity, flexibility and efficiency, but not always for accuracy or stability. This paper demonstrates that a good compromise is possible with the advected grid explicit (AGE) method. Starting from the same initial field as a previous spectral DNS, AGE method simulations of a planar turbulent wake were carried out as DNS, and then at three levels of reduced resolution. The latter cases were in a sense large‐eddy simulations (LES), although no specific sub‐grid‐scale model was used. Results for the two DNS methods, including variances and power spectra, were very similar, but the AGE simulation required much less computational effort. Small‐scale information was lost in the reduced resolution runs, but large‐scale mean and instantaneous properties were reproduced quite well, with further large reductions in computational effort. Quality of results becomes more sensitive to the value chosen for one of the AGE method parameters as resolution is reduced, from which it is inferred that the numerical stability procedure controlled by the parameter is acting in part as a sub‐grid‐scale model. Copyright © 2002 John Wiley & Sons, Ltd.     

The Markov power moment problem in problems of controllability and frequency extinguishing for the wave equation on a half-axis

In this paper necessary and sufficient conditions of null-controllability and approximate null-controllability are obtained for the wave equation on a half-axis. Controls solving these problems are found explicitly. Moreover, bang-bang controls solving the approximate null-controllability problem are constructed with the aid of solutions of a frequency extinguishing problem in the restricted band (−a,a) for this equation and the Markov power moment problem.     

A model study for the steady state error of numerical approximations of inviscid flow equations on Cartesian grid

The widely used locally adaptive Cartesian grid methods involve a series of abruptly refined interfaces. In this paper we consider the influence of the refined interfaces on the steady state errors for second‐order three‐point difference approximations of flow equations. Since the various characteristic components of the Euler equations should behave similarly on such grids with regard to refinement‐induced errors, it is sufficient enough to conduct the analysis on a scalar model problem. The error we consider is a global error, different to local truncation error, and reflects the interaction between multiple interfaces. The steady state error will be compared to the errors on smooth refinement grids and on uniform grids. The conclusion seems to support the numerical findings of Yamaleev and Carpenter (J. Comput. Phys. 2002; 181: 280–316) that refinement does not necessarily reduce the numerical error. Copyright © 2005 John Wiley & Sons, Ltd.     

数字全息图变频采样研究

根据Whittaker-Shannon抽样定理,对菲涅耳全息图进行变频率采样,保证整个全息图各部分采样频率为该处相应空间频率的两倍,从而完全消除数字全息图由于采样冗余而带来全息图的信息冗余.并且,对变频采样后的全息图进行线性插值恢复即可获得良好的再现像质.实验和理论均证明了该方法的有效性和可行性,为全息图的信息存贮与传输提出一条新的思路.     

Stability and Nonlinear Deformation of Cylindrical Grids

The general stability of single-layer cylindrical grids is studied in linear and nonlinear formulations. Dependence of the general buckling load on the geometry and stiffness parameters of a grid is established in an analytical form. Such grids are numerically analyzed for stability. It is established that the general buckling load is much less than the local buckling load. Typical general buckling modes are found. It is shown that such grids are weakly sensitive to imperfections     

Computations of two passing‐by high‐speed trains by a relaxation overset‐grid algorithm

This paper presents a relaxation algorithm, which is based on the overset grid technology, an unsteady three‐dimensional Navier–Stokes flow solver, and an inner‐ and outer‐relaxation method, for simulation of the unsteady flows of moving high‐speed trains. The flow solutions on the overlapped grids can be accurately updated by introducing a grid tracking technique and the inner‐ and outer‐relaxation method. To evaluate the capability and solution accuracy of the present algorithm, the computational static pressure distribution of a single stationary TGV high‐speed train inside a long tunnel is investigated numerically, and is compared with the experimental data from low‐speed wind tunnel test. Further, the unsteady flows of two TGV high‐speed trains passing by each other inside a long tunnel and at the tunnel entrance are simulated. A series of time histories of pressure distributions and aerodynamic loads acting on the train and tunnel surfaces are depicted for detailed discussions. Copyright © 2004 John Wiley & Sons, Ltd.     

A time‐accurate pseudo‐compressibility approach based on an unstructured hybrid finite volume technique applied to unsteady turbulent premixed flame propagation

A preconditioning approach based on the artificial compressibility formulation is extended to solve the governing equations for unsteady turbulent reactive flows with heat release, at low Mach numbers, on an unstructured hybrid grid context. Premixed reactants are considered and a flamelet approach for combustion modelling is adopted using a continuous quenched mean reaction rate. An overlapped cell‐vertex finite volume method is adopted as a discretisation scheme. Artificial dissipation terms for hybrid grids are explicitly added to ensure a stable, discretised set of equations. A second‐order, explicit, hybrid Runge–Kutta scheme is applied for the time marching in pseudo‐time. A time derivative of the dependent variable is added to recover the time accuracy of the preconditioned set of equations. This derivative is discretised by an implicit, second‐order scheme. The resulting scheme is applied to the calculation of an infinite planar (one‐dimensional) turbulent premixed flame propagating freely in reactants whose turbulence is supposed to be frozen, homogeneous and isotropic. The accuracy of the results obtained with the proposed method proves to be excellent when compared to the data available in the literature. Copyright © 2004 John Wiley & Sons, Ltd.     

A virtual boundary method with improved computational efficiency using a multi‐grid method

The flow around spherical, solid objects is considered. The boundary conditions on the solid boundaries have been applied by replacing the boundary with a surface force distribution on the surface, such that the required boundary conditions are satisfied. The velocity on the boundary is determined by extrapolation from the flow field. The source terms are determined iteratively, as part of the solution. They are then averaged and are smoothed out to nearby computational grid points. A multi‐grid scheme has been used to enhance the computational efficiency of the solution of the force equations. The method has been evaluated for flow around both moving and stationary spherical objects at very low and intermediate Reynolds numbers. The results shows a second order accuracy of the method both at creeping flow and at Re=100. The multi‐grid scheme is shown to enhance the convergence rate up to a factor 10 as compared to single grid approach. Copyright © 2004 John Wiley & Sons, Ltd.     

非均匀网格时域伪谱算法在超宽带技术中的应用

 与传统时域有限差分算法相比，采用以伪谱方法离散Maxwell微分方程为基础的时域伪谱(PSTD)算法计算大的电尺度电磁场时域问题，将大大提高计算效率，降低内存需求。为了拓宽PSTD算法的应用，近年来，基于网格插值方法的非均匀时域伪谱算法得到了发展。研究的重点是算法中非均匀网格技术的实现及其在时域瞬态脉冲电磁场模拟和高功率超宽带脉冲技术方面的应用。以高斯脉冲为激励源，用该算法计算了多层介质的反射和透射，并通过超宽带脉冲穿墙实验对这一方法的应用进行了验证。模拟和实验结果具有较好的一致性。     

A grid‐free upwind relaxation scheme for inviscid compressible flows

A new grid‐free upwind relaxation scheme for simulating inviscid compressible flows is presented in this paper. The non‐linear conservation equations are converted to linear convection equations with non‐linear source terms by using a relaxation system and its interpretation as a discrete Boltzmann equation. A splitting method is used to separate the convection and relaxation parts. Least squares upwinding is used for discretizing the convection equations, thus developing a grid‐free scheme which can operate on any arbitrary distribution of points. The scheme is grid free in the sense that it works on any arbitrary distribution of points and it does not require any topological information like elements, faces, edges, etc. This method is tested on some standard test cases. To explore the power of the grid‐free scheme, solution‐based adaptation of points is done and the results are presented, which demonstrate the efficiency of the new grid‐free scheme. Copyright © 2005 John Wiley & Sons, Ltd.