多点择优推进阵面法生成曲面三角形网格

在现有曲面非结构网格生成法的基础上,提出了一种新的曲面网格生成法——多点择优推进阵面法.它可在曲面上直接进行三角形网格划分,克服了映射法的网格变形问题,并且可以在网格生成结束后,对曲面网格直接进行Laplace格点松弛光顺.该方法使用简单,不受曲面块类型的限制,且网格质量高,可以为三维非结构网格生成提供高质量的初始阵面,并给出了若干个算例.     

用墨浸法自动生成三维无结构网格

提出了为用Delaunay法自动生成无结构网格而发展的"墨浸式"加点法。采用"墨浸式"加入边界点的方法,使得Delaunay方法的固有缺陷,即可能出现边界穿透的问题,得到简化。"墨浸式"加点法成功地在一些复杂边界域内生成了可用于流场计算的无结构网格。     

八叉树网格到非结构混合网格的转换

在数值模拟中, 非结构网格的优势是可以采用相同的数值格式统一处理任意复杂的计算区域, 但在网格生成过程中难度大, 并且不容易控制网格质量。树结构网格可以认为是介于结构网格和非结构网格之间的一种网格, 目前已经有相对成熟的方法快速在复杂区域内生成二维四叉树网格和三维八叉树网格。在实际应用中, 数值方法往往需要在连接协调的非结构网格上做离散, 树结构网格中不同尺寸的网格之间连接不是协调的, 在应用上会受到很多限制。文章实现了树结构网格到非结构混合网格的转换, 这种转换在二维情况下就是将四叉树网格转换为非结构三角形和四边形的混合网格, 三维情况下则将八叉树网格转换为非结构混合网格。这一转换过程的难点在于需要考虑数千种不同的八叉树单元, 并给出能实现连接协调的非结构混合网格划分。可以出现的网格单元包括六面体、三棱柱、金字塔和四面体这4种不同情况。通过特别的分类, 实现了程序的自动生成, 这种程序自动生成技术一方面可以避免人工编写大量程序时的失误, 另一方面也使得对数以千计的不同情况的处理成为可能。通过对几个简单网格的测试, 对网格数据转换方法做了初步的验证。      

Minimization of the Truncation Error by Grid Adaptation

A new grid adaptation strategy, which minimizes the truncation error of a pth-order finite difference approximation, is proposed. The main idea of the method is based on the observation that the global truncation error associated with discretization on nonuniform meshes can be minimized if the interior grid points are redistributed in an optimal sequence. The method does not explicitly require the truncation error estimate, and at the same time, it allows one to increase the design order of approximation globally by one, so that the same finite difference operator reveals superconvergence properties on the optimal grid. Another very important characteristic of the method is that if the differential operator and the metric coefficients are evaluated identically by some hybrid approximation, then the single optimal grid generator can be employed in the entire computational domain independently of points where the hybrid discretization switches from one approximation to another. Generalization of the present method to multiple dimensions is presented. Numerical calculations of several one-dimensional and one two-dimensional test examples demonstrate the performance of the method and corroborate the theoretical results.     

A Cartesian method for fitting the bathymetry and tracking the dynamic position of the shoreline in a three-dimensional, hydrodynamic model

This paper presents a Cartesian method for the simultaneous fitting of the bathymetry and shorelines in a three-dimensional, hydrodynamic model for free-surface flows. The model, named LESS3D (Lake & Estuarine Simulation System in Three Dimensions), solves flux-based finite difference equations in the Cartesian-coordinate system (x,y,z). It uses a bilinear bottom to fit the bottom topography and keeps track the dynamic position of the shoreline. The resulting computational cells are hybrid: interior cells are regular Cartesian grid cells with six rectangular faces, and boundary/bottom cells (at least one face is the water–solid interface) are unstructured cells whose faces are generally not rectangular. With the bilinear interpolation, the shape of a boundary/bottom cell can be determined at each time step. This allows the Cartesian coordinate model to accurately track the dynamic position of the shorelines. The method was tested with a laboratory experiment of a Tsunami runup case on a circular island. It was also tested for an estuary in Florida, USA. Both model applications demonstrated that the Cartesian method is quite robust. Because the present method does not require any coordinate transformation, it can be an attractive alternative to curvilinear grid model.     

多重网格法在非结构网格中的应用

将多重网格法运用于非结构网格.网格是通过聚合法得到的,网格之间是相互关联的.方程的求解采用Jamson的有限体积法.给出了二维、三维情况的数值算例.     

二维非结构网格生成及自动加密技术

介绍一种可对任意二维区域进行非结构网格划分的方法,提出关于网格调整光滑的新思想,可对Laplace型滤波算子赋予新的意义。在此基础上再有目的选择松弛因子的大小,可达到同样的光滑效果而迭代次数显著减少。利用文献[3]提供的自动加点算法,对该方法稍加改进,就能完成自适应过程。利用该方法编制的程序,只需提供边界点座标,就能快速地得到满意的网格。     

Compact local integrated-RBF approximations for second-order elliptic differential problems

This paper presents a new compact approximation method for the discretisation of second-order elliptic equations in one and two dimensions. The problem domain, which can be rectangular or non-rectangular, is represented by a Cartesian grid. On stencils, which are three nodal points for one-dimensional problems and nine nodal points for two-dimensional problems, the approximations for the field variable and its derivatives are constructed using integrated radial basis functions (IRBFs). Several pieces of information about the governing differential equation on the stencil are incorporated into the IRBF approximations by means of the constants of integration. Numerical examples indicate that the proposed technique yields a very high rate of convergence with grid refinement.     

Mass,momentum and energy conserving (MaMEC) discretizations on general grids for the compressible Euler and shallow water equations

The paper explains a method by which discretizations of the continuity and momentum equations can be designed, such that they can be combined with an equation of state into a discrete energy equation. The resulting ‘MaMEC’ discretizations conserve mass, momentum as well as energy, although no explicit conservation law for the total energy is present. Essential ingredients are (i) discrete convection that leaves the discrete energy invariant, and (ii) discrete consistency between the thermodynamic terms. Of particular relevance is the way in which finite volume fluxes are related to nodal values. The method is an extension of existing methods based on skew-symmetry of discrete operators, because it allows arbitrary equations of state and a larger class of grids than earlier methods.The method is first illustrated with a one-dimensional example on a highly stretched staggered grid, in which the MaMEC method calculates qualitatively correct results and a non-skew-symmetric finite volume method becomes unstable. A further example is a two-dimensional shallow water calculation on a rectilinear grid as well as on an unstructured grid. The conservation of mass, momentum and energy is checked, and losses are found negligible up to machine accuracy.     

径向基函数插值方法在动网格技术中的应用

分析用于非结构网格的弹簧比拟和用于结构网格的无限插值动态网格方法在实际应用中的优缺点,提出无需网格连接关系的基于径向基函数(radial basis functions,RBF)插值的动网格技术并编制相应的网格运动计算程序.以二维菱形翼的旋转运动及三维菱形翼的柔性变形为例,分析不同基函数和紧支半径的选取对网格质量及计算效率的影响,并通过与弹簧比拟方法的对比验证了RBF方法的有效性.结果表明:RBF方法数据结构简单,计算效率高,适应大变形能力强,可以有效地实现计算流体力学中的网格运动问题.     

Evaluation of optimal density weighting for regridding

Density weighting is a necessary component of the regridding algorithm for interpolating nonuniformly sampled data points onto a regular grid. Differing concepts of optimality for the density weighting have been proposed previously. The present study reviews some of these concepts and evaluates the accuracy of different techniques by comparison with the image obtained by a computationally intensive least squares minimization. A variant on one of the techniques is proposed that yields the highest accuracy of those studied.     

The Elastoplast Discontinuous Galerkin (EDG) method for the Navier–Stokes equations

The present work details the Elastoplast (this name is a translation from the French “sparadrap”, a concept first applied by Yves Morchoisne for Spectral methods [1]) Discontinuous Galerkin (EDG) method to solve the compressible Navier–Stokes equations. This method was first presented in 2009 at the ICOSAHOM congress with some Cartesian grid applications. We focus here on unstructured grid applications for which the EDG method seems very attractive. As in the Recovery method presented by van Leer and Nomura in 2005 for diffusion, jumps across element boundaries are locally eliminated by recovering the solution on an overlapping cell. In the case of Recovery, this cell is the union of the two neighboring cells and the Galerkin basis is twice as large as the basis used for one element. In our proposed method the solution is rebuilt through an L² projection of the discontinuous interface solution on a small rectangular overlapping interface element, named Elastoplast, with an orthogonal basis of the same order as the one in the neighboring cells. Comparisons on 1D and 2D scalar diffusion problems in terms of accuracy and stability with other viscous DG schemes are first given. Then, 2D results on acoustic problems, vortex problems and boundary layer problems both on Cartesian or unstructured triangular grids illustrate stability, precision and versatility of this method.     

非结构网格的并行生成

研究了非结构网格的并行生成方法.改进了R.Lohner的"波阵面"区域分裂算法以使子网格及其边界更有益于网格并行生成,提出了边界并行优化策略,改善了边界的光滑性;完善了子区域内生成网格时接受新点及新单元的条件,在界面网格生成过程中提出只接受新单元而拒绝新点的策略,节省了机时.     

非结构网格的生成及新型数据类型的应用

本文基于 Ｄｅｌａｕｎａｙ三角化方法及局部重组的阵面推进法，给出了任意形状平面区域的非结构化网格剖分方法。文中对加点方法及数据结构和存取模式进行了改进，同时应用链表结构、动态数组和派生类型的数据变量，对算法进行优化，节省了计算内存，提高了网格的生成效率。本文研究为特殊计算区域的三维非结构化网格的生成提供了基本方法。     

含运动物体流场计算的自适应非结构二维网格生成方法

采用自动插点的Delaunay方法和局部网格重新生成方法,对含运动边界自适应非结构二维网格生成方法进行了系统研究,实现了带有非定常运动物体流场的数值计算,并进行了数值实验.     

A Hybrid Method for Dynamic Mesh Generation Based on Radial Basis Functions and Delaunay Graph Mapping

Aiming at complex configuration and large deformation, an efficient hybrid method for dynamic mesh generation is presented in this paper, which is based on Radial Basis Functions (RBFs) and Delaunay graph mapping. Based on the computational mesh, a set of very coarse grid named as background grid is generated firstly, and then the computational mesh can be located at the background grid by Delaunay graph mapping technique. After that, the RBFs method is applied to deform the background grid by choosing partial mesh points on the boundary as the control points. Finally, Delaunay graph mapping method is used to relocate the computational mesh by employing area or volume weight coefficients. By applying different dynamic mesh methods to a moving NACA0012 airfoil, it can be found that the RBFs-Delaunay graph mapping hybrid method is as accurate as RBFs and is as efficient as Delaunay graph mapping technique. Numerical results show that the dynamic meshes for all test cases including one two-dimensional (2D) and two three-dimensional (3D) problems with different complexities, can be generated in an accurate and efficient manner by using the present hybrid method.     

用非结构网格与欧拉方程计算复杂区域的二维流动

提出用Delaunay三角化方法生成非结构网格的一种过程。所生成的网格可用于复杂多连通域内的可压流计算。采用Euler方程和格心有限体积法,研制出程序,给出了算例。     

A sweeping preconditioner for time-harmonic Maxwell’s equations with finite elements

This paper is concerned with preconditioning the stiffness matrix resulting from finite element discretizations of Maxwell’s equations in the high frequency regime. The moving PML sweeping preconditioner, first introduced for the Helmholtz equation on a Cartesian finite difference grid, is generalized to an unstructured mesh with finite elements. The method dramatically reduces the number of GMRES iterations necessary for convergence, resulting in an almost linear complexity solver. Numerical examples including electromagnetic cloaking simulations are presented to demonstrate the efficiency of the proposed method.     

求解双曲型守恒律方程的一类自适应多分辨方法

针对双曲型守恒律方程问题,发展一种有效的自适应多分辨分析方法.通过对嵌套网格上的数值解构造离散多分辨分析,建立小波系数与多层嵌套网格点之间的对应关系.对于小波系数较大的网格点采用高精度WENO格式计算,其余区域则直接采用多项式插值.数值试验表明,该方法在保持原规则网格方法的精度和分辨率的同时,显著地减少计算的CPU时间.     

Interpolation on a triangulated 3D surface

An interpolation method for scalar functions on a rectangular grid on a planar surface is extended to the interpolation function on a closed three-dimensional triangulated surface of arbitrary shape. Two variants are considered. The first one constrains the Laplacian of the function to be zero at points where the function values are unknown. The second one minimizes the Laplacian at all points of the surface considered. Some illustrative examples of both variants are given in applications to the display of potential distributions on the boundary surface of an electrical volume conductor.