Pacing CFD: automatic mesh adaptation as an efficient tool to improve CFD accuracy

We propose in this paper to demonstrate the impact of mesh adaptation technology on computational fluid dynamics (CFD) solution accuracy. A global methodology is presented that includes a selected number of pre-processing techniques that sensibly improve the quality of the initial meshes and accelerate the solution-adaptation process. Finally, the efficiency of the approach is demonstrated through meaningful numerical tests.     

On the sizes of Delaunay meshes

Let be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of with bounded vertex degree is within a factor of the size of any Delaunay mesh of with bounded radius-edge ratio. The term depends on the geometry of and it is likely a small constant when the boundaries of are fine triangular meshes. There are several consequences. First, among all Delaunay meshes with bounded radius-edge ratio, those returned by Delaunay refinement algorithms have asymptotically optimal sizes. This is another advantage of meshing with Delaunay refinement algorithms. Second, if no input angle is acute, the minimum Delaunay mesh with bounded radius-edge ratio is not much smaller than any minimum mesh with aspect ratio bounded by a particular constant.     

Optimal acyclic edge colouring of grid like graphs

We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian product of d graphs each of which is an induced path or cycle. This class includes some known classes of graphs like d-dimensional meshes, hypercubes, tori, etc. Our estimates are exact except when the graph is a product of a path and a number of odd cycles, in which case the estimates differ by an additive factor of at most 1. Our results are also constructive and provide an optimal (or almost optimal) acyclic edge colouring in polynomial time.     

Dependence Relations Among the Shifts of a Multivariate Refinable Distribution

Refinable functions are an intrinsic part of subdivision schemes and wavelet constructions. The relevant properties of such functions must usually be determined from their refinement masks. In this paper, we provide a characterization of linear independence for the shifts of a multivariate refinable vector of distributions in terms of its (finitely supported) refinement mask. March 14, 1998. Dates revised: February 3, 1999 and August 6, 1999. Date accepted: November 16, 1999.     

Graph layering by promotion of nodes

This work contributes to the wide research area of visualization of hierarchical graphs. We present a new polynomial-time heuristic which can be integrated into the Sugiyama method for drawing hierarchical graphs. Our heuristic, which we call Promote Layering (PL), is applied to the output of the layering phase of the Sugiyama method. PL is a simple and easy to implement algorithm which decreases the number of so-called dummy (or virtual) nodes in a layered directed acyclic graph. In particular, we propose applying PL after the longest-path layering algorithm and we present an extensive empirical evaluation of this layering technique.     

Lipschitz continuity of refinable functions on the Heisenberg group

In this paper, the Lipschitz continuity of refinable functions related to the general acceptable dilations on the Heisenberg group will be investigated in terms of the uniform joint spectral radius. We also give an investigation of the refinable functions in the generalized Lipschitz spaces related to a kind of special acceptable dilations.     

微秒级导通时间等离子体断路开关的二维雪耙模型

 给出了适合微秒级导通时间等离子体断路开关的二维雪耙模型的具体描述，建立了二维雪耙模型的基本方程及其差分格式，对方程进行了显式求解。通过对一个模型的计算，给出了雪耙阵面的传播图像，指出了断路开关的断开位置及附近点密度随时间的变化曲线，在该位置附近出现了等离子体薄化现象。     

基于二维真实隐马氏模型的手写体文字识别算法

近几年来，人们采用各种方法试图将1D隐马氏模型(HMM)^[2]推广到2D隐马氏模型。令人失望的是由于在建立合适的2D模型及其计算上的复杂度问题上存在困难，前面的尝试都没有得到一个真实的2DHMM．本文对于应用真实2D隐马氏模型(隐马氏网格随机场HMMRF)^[1,4]进行手写字符识别问题提出新的框架，针对文献[1]中的单点最优算法给出局部最优的译码算法。HMMRF模型是1D隐马氏模型到2D的扩展，能更好的描述字符的2D特性。HMMRF在字符识别中的应用具有两个相——学习相和译码相。在学习相和译码相中我们的最优标准是基于极大边缘后验概率的。不过，在涉及到2D模型中的计算问题时，对模型做出某些简单化的假设是必要的。本文用到的方法对于在合理的模型假设下解决手写字符识别问题呈现了很大的潜力。     

局部网格生成中初始探索圆半径的搜索算法

无网格不一致性的基于节点的局部网格生成(NLMG)算法是基于节点的局部有限元方法(NLFEM)实现无缝连接的核心算法之一,而快速合理的确定中心节点的初始探索圆半径是降低NLMG算法计算量和确保其可靠性的关键一步。本文提出了基于均匀桶的快速局部搜索算法(UBFLSM),并将其成功应用于NLMG算法,解决了初始探索圆半径和探索圆半径优化后候选卫星点集的确定这两个难点,确保NLMG算法无网格不一致性。并/串行数值试验(实现从网格生成到总刚度矩阵生成之间的无缝连接)均表明,该算法是快速及可靠的。     

A local pseudo arc-length method for hyperbolic conservation laws

A local pseudo arc-length method（LPALM）for solving hyperbolic conservation laws is presented in this paper.The key idea of this method comes from the original arc-length method,through which the critical points are bypassed by transforming the computational space.The method is based on local changes of physical variables to choose the discontinuous stencil and introduce the pseudo arc-length parameter,and then transform the governing equations from physical space to arc-length space.In order to solve these equations in arc-length coordinate,it is necessary to combine the velocity of mesh points in the moving mesh method,and then convert the physical variable in arclength space back to physical space.Numerical examples have proved the effectiveness and generality of the new approach for linear equation,nonlinear equation and system of equations with discontinuous initial values.Non-oscillation solution can be obtained by adjusting the parameter and the mesh refinement number for problems containing both shock and rarefaction waves.