高次Galerkin有限元法的超收敛性

通过局部误差估计,对具有光滑边界的二阶常系数椭圆型方程,给出了高次Ｇａｌｅｒｋｉｎ 有限元法的超收敛性． 运用对称技巧和积分恒等式技巧,在局部对称矩形网格或三角形网格上,我们得到了改进的超收敛性（提高１－ ３ 阶）．     

Predicting turbulent flow in a staggered tube bundle

This paper presents the results of calculations performed for the turbulent, incompressible flow around a staggered array of tubes for which carefully obtained experimental results are available as part of an established ERCOFTAC-IAHR test case. The Reynolds-averaged Navier–Stokes equations are solved using a pressure-based finite volume algorithm, using collocated cell vertex store on an unstructured and adaptive mesh of tetrahedra. Turbulence closure is obtained with a truncated form of a low-Reynolds number k– model developed by Yang and Shih. The computational domain covers all seven rows of tubes used in the experimental study and periodic flow is allowed to develop naturally. The results of the computations are surprisingly good and compare favourably with results obtained by others using a wide range of alternative k– models for a single cylinder with periodic inflow and outflow boundaries on structured meshes.     

Unstructured Adaptive Grid Flow Simulations of Inert and Reactive Gas Mixtures

Unstructured adaptive grid flow simulation is applied to the calculation of high-speed compressible flows of inert and reactive gas mixtures. In the present case, the flowfield is simulated using the 2-D Euler equations, which are discretized in a cell-centered finite volume procedure on unstructured triangular meshes. Interface fluxes are calculated by a Liou flux vector splitting scheme which has been adapted to an unstructured grid context by the authors. Physicochemical properties are functions of the local mixture composition, temperature, and pressure, which are computed using the CHEMKIN-II subroutines. Computational results are presented for the case of premixed hydrogen–air supersonic flow over a 2-D wedge. In such a configuration, combustion may be triggered behind the oblique shock wave and transition to an oblique detonation wave is eventually obtained. It is shown that the solution adaptive procedure implemented is able to correctly define the important wave fronts. A parametric analysis of the influence of the adaptation parameters on the computed solution is performed.     

The implementation of an aeronautical CFD flow code onto distributed memory parallel systems

The parallelization of an industrially important in‐house computational fluid dynamics (CFD) code for calculating the airflow over complex aircraft configurations using the Euler or Navier–Stokes equations is presented. The code discussed is the flow solver module of the SAUNA CFD suite. This suite uses a novel grid system that may include block‐structured hexahedral or pyramidal grids, unstructured tetrahedral grids or a hybrid combination of both. To assist in the rapid convergence to a solution, a number of convergence acceleration techniques are employed including implicit residual smoothing and a multigrid full approximation storage scheme (FAS). Key features of the parallelization approach are the use of domain decomposition and encapsulated message passing to enable the execution in parallel using a single programme multiple data (SPMD) paradigm. In the case where a hybrid grid is used, a unified grid partitioning scheme is employed to define the decomposition of the mesh. The parallel code has been tested using both structured and hybrid grids on a number of different distributed memory parallel systems and is now routinely used to perform industrial scale aeronautical simulations. Copyright © 2000 John Wiley & Sons, Ltd.     

An unstructured grid,three‐dimensional model based on the shallow water equations

A semi‐implicit finite difference model based on the three‐dimensional shallow water equations is modified to use unstructured grids. There are obvious advantages in using unstructured grids in problems with a complicated geometry. In this development, the concept of unstructured orthogonal grids is introduced and applied to this model. The governing differential equations are discretized by means of a semi‐implicit algorithm that is robust, stable and very efficient. The resulting model is relatively simple, conserves mass, can fit complicated boundaries and yet is sufficiently flexible to permit local mesh refinements in areas of interest. Moreover, the simulation of the flooding and drying is included in a natural and straightforward manner. These features are illustrated by a test case for studies of convergence rates and by examples of flooding on a river plain and flow in a shallow estuary. Copyright © 2000 John Wiley & Sons, Ltd.     

Considerations on the spring analogy

This paper presents an investigation on the spring analogy. The spring analogy serves for deformation in a moving boundary problem. First, two different kinds of springs are discussed: the vertex springs and the segment springs. The vertex spring analogy is originally used for smoothing a mesh after mesh generation or refinement. The segment spring analogy is used for deformation of the mesh in a moving boundary problem. The difference between the two methods lies in the equilibrium length of the springs. By means of an analogy to molecular theory, the two theories are generalized into a single theory that covers both. The usual choice of the stiffness of the spring is clarified by the mathematical analysis of a representative one‐dimensional configuration. The analysis shows that node collision is prevented when the stiffness is chosen as the inverse of the segment length. The observed similarity between elliptic grid generation and the spring analogy is also investigated. This investigation shows that both methods update the grid point position by a weighted average of the surrounding points in an iterative manner. The weighting functions enforce regularity of the mesh. Based on these considerations, several improvements on the spring analogy are developed. The principle of Saint Venant is circumvented by a boundary correction. The prevention of inversion of triangular elements is improved by semi‐torsional springs. The numerical results show the superiority of the segment spring analogy over the vertex one for a small rotation of an NACA0012 mesh. The boundary correction allows for large deformation of the mesh, where the standard spring analogy fails. The final test is performed on a Navier–Stokes mesh. This mesh contains high aspect ratio mesh cells near the boundary. Large deformation of this mesh shows that the semi‐torsional spring improvement is imperative to retain the validity of this mesh. Copyright © 2000 John Wiley & Sons, Ltd.     

An implicit mixed finite-volume–finite-element method for solving 3D turbulent compressible flows

The development of new aeronautic projects require accurate and efficient simulations of compressible flows in complex geometries. It is well known that most flows of interest are at least locally turbulent and that the modelling of this turbulence is critical for the reliability of the computations. A turbulence closure model which is both cheap and reasonably accurate is an essential part of a compressible code. An implicit algorithm to solve the 2D and 3D compressible Navier–Stokes equations on unstructured triangular/tetrahedral grids has been extended to turbulent flows. This numerical scheme is based on second-order finite element–finite volume discretization: the diffusive and source terms of the Navier–Stokes equations are computed using a finite element method, while the other terms are computed with a finite volume method. Finite volume cells are built around each node by means of the medians. The convective fluxes are evaluated with the approximate Riemann solver of Roe coupled with the van Albada limiter. The standard k–ϵ model has been introduced to take into account turbulence. Implicit integration schemes with efficient numerical methods (CGS, GMRES and various preconditioning techniques) have also been implemented. Our interest is to present the whole method and to demonstrate its limitations on some well-known test cases in three-dimensional geometries. © 1997 John Wiley & Sons, Ltd.     

四边形网格的削角细分

提出了一种四边形网格的削角细分方法(Corner-Cuttmg Subdivision Scheme).每细分一次,四边形网格数目增加为原来的两倍,两次细分结果相当于一次二分对偶细分(Binary Dual Subdivision)和一个旋转.细分算法采用线性细分加平滑的形式,具体地讲平滑是采用两次重复平均的方法,因此其生成曲面具有C1连续性.而且由于这种细分方法对网格几何操作简单,所得网格数据量增长相对缓慢,更适合于3D图像重构及网络传输等应用领域..     

A PRESSURE-CORRECTION METHOD FOR THE SOLUTION OF INCOMPRESSIBLE VISCOUS FLOWS ON UNSTRUCTURED GRIDS

An unstructured grid, finite volume method is presented for the solution of two-dimensional viscous, incompressible flow. The method is based on the pressure-correction concept implemented on a semi-staggered grid. The computational procedure can handle cells of arbitrary shape, although solutions presented herein have been obtained only with meshes of triangular and quadrilateral cells. The discretization of the momentum equations is effected on dual cells surrounding the vertices of primary cells, while the pressure-correction equation applies to the primary-cell centroids and represents the conservation of mass across the primary cells. A special interpolation scheme s used to suppress pressure and velocity oscillations in cases where the semi-staggered arrangement does not ensure a sufficiently strong coupling between pressure and velocity to avoid such oscillations. Computational results presented for several viscous flows are shown to be in good agreement with analytical and experimental data reported in the open literature.     

AN ADAPTIVE UNSTRUCTURED TRI-TREE ITERATIVE SOLVER FOR MIXED FINITE ELEMENT FORMULATION OF THE STOKES EQUATIONS

An iterative adaptive equation solver for solving the implicit Stokes equations simultaneously with tri-tree grid generation is developed. The tri-tree grid generator builds a hierarchical grid structure which is mapped to a finite element grid at each hierarchical level. For each hierarchical finite element grid the Stokes equations are solved. The approximate solution at each level is projected onto the next finer grid and used as a start vector for the iterative equation solver at the finer level. When the finest grid is reached, the equation solver is iterated until a tolerated solution is reached. In order to reduce the overall work, the element matrices are integrated analytically beforehand. The efficiency and behaviour of the present adaptive method are compared with those of the previously developed iterative equation solver which is preconditioned by incomplete LU factorization with coupled node fill-in. The efficiency of the incomplete coupled node fill-in preconditioner is shown to be largely dependent on the global node numbering. The preconditioner is therefore tested for the natural node ordering of the tri-tree grid generator and for different ways of sorting the nodes.