A multigrid accelerated hybrid unstructured mesh method for 3D compressible turbulent flow

 A cell vertex finite volume method for the solution of steady compressible turbulent flow problems on unstructured hybrid meshes of tetrahedra, prisms, pyramids and hexahedra is described. These hybrid meshes are constructed by firstly discretising the computational domain using tetrahedral elements and then by merging certain tetrahedra. A one equation turbulence model is employed and the solution of the steady flow equations is obtained by explicit relaxation. The solution process is accelerated by the addition of a multigrid method, in which the coarse meshes are generated by agglomeration, and by parallelisation. The approach is shown to be effective for the simulation of a number of 3D flows of current practical interest. Sponsored by The Research Council of Norway, project number 125676/410 Dedicated to the memory of Prof. Mike Crisfield, a respected colleague     

Computing surfaces invariant under subdivision

In this paper, we propose a general subdivision algorithm for generating surfaces. The algorithm has as motivation our earlier work on the design of free form curves where similar ideas were investigated. Here we describe some properties of uniform refinement algorithms for surface generation. A detail analysis of their properties will be given later by one of us.     

Anisotropic mesh adaption by metric‐driven optimization

We describe a Gauss–Seidel algorithm for optimizing a three‐dimensional unstructured grid so as to conform to a given metric. The objective function for the optimization process is based on the maximum value of an elemental residual measuring the distance of any simplex in the grid to the local target metric. We analyse different possible choices for the objective function, and we highlight their relative merits and deficiencies. Alternative strategies for conducting the optimization are compared and contrasted in terms of resulting grid quality and computational costs. Numerical simulations are used for demonstrating the features of the proposed methodology, and for studying some of its characteristics. Copyright © 2004 John Wiley & Sons, Ltd.     

高炉煤气净化系统新技术研究与应用

济钢第二炼铁厂针对原高炉煤气净化系统处理能力不足等问题，研制了新的煤气净化系统。该系统采用单根文氏管、串联花环、丝网脱水器湿法除尘，取代原串联文氏管电除尘净化工艺。应用表明，新系统运行安全，净煤气含尘量小于10^mg／m^3，含水量小于5g／m^3，高炉风温提高90℃。     

Mesh data structure selection for mesh generation and FEA applications

The data structure representing a mesh and the operators to create and query such a database play a crucial role in the performance of mesh generation and FE analysis applications. The design of such a database must balance the conflicting requirements of compactness and computational efficiency. In this article, 10 different mesh representations are reviewed for linear tetrahedral and hexahedral meshes. A methodology for calculating the storage and computational costs of mesh representations is presented and the 10 data structures are analysed. Also, a system for ranking different data structures based on their computational and storage costs is devised and the various mesh representations are ranked according to this measure. Copyright © 2002 John Wiley & Sons, Ltd.     

网格曲面中孔洞的光滑填充算法研究

三角网格模型是几何描述的一种重要形式，有着广泛的应用。但三角网络模型常常会存在孔洞缺陷。这些孔洞的存在一方面影响视觉效果，另一方面会影响许多后续的操作，如快速原型制造、有限元分析等，因此有必要对这些孔洞进行修补。目前绝大多数孔洞填充算法是将网格模型中的孔洞提取成空间多边形，并对孔洞多边形进行三角化。这种处理方法的主要缺陷是没有考虑网格曲面在孔洞附近的几何形态，因而填充部分不能与整个曲面光滑地融为一体。笔者提出了一种三角网格曲面中孔洞的光滑填充算法。该算法根据孔洞周围网格曲面的几何信息来增加孔洞内部的采样点，然后再对增加的采样点进行三角化，较好地解决了填充部分与整体曲面光滑连接的问题。     

Material state remapping in computational solid mechanics

A computational procedure for remapping material state information from one finite element mesh to another is described. The procedure is useful in connection with evolving meshes for inelastic problems, as for example occur in the context of fracture simulation and adaptive mesh refinement. The proposed method is based on weak enforcement of equality between corresponding fields on the two meshes, where piecewise‐constant fields on both meshes are generalized from the quadrature‐point values. The essential algorithmic problem is that of calculating the volume partition of an arbitrary convex region with respect to a covering set of disjoint convex regions. Instead of geometrically resolving the associated intersections, the problem is herein approximated by a constrained optimization problem, which may be readily and efficiently solved computationally. This formulation is a main contribution of the paper. Computational examples are given that illustrate the effectiveness of the proposed procedure. Copyright © 2002 John Wiley & Sons, Ltd.     

无线网状网技术与应用

无线网状网(WMNs)由网状路由器节点和客户机节点组成,其中的网状路由器节点组成了无线网状网的网络骨干,其移动性很小。他们一起为无线网状网和其他常规无线网络的客户机节点提供网络的无线接入。WMNs技术结合了中心式控制的蜂窝网与分布式控制的无线自组织网的优点,可有效克服这两种技术的缺陷并显著提高无线网络的性能,已经成为下一代无线通信网络的研究热点之一。WMNs可为无线个域网、局域网、校园网、城域网的一系列应用提供高速无线宽带接入服务。虽然目前WMNs技术发展很快,但其协议栈各层仍存在许多有待研究的课题。首先简要介绍了无线网状网的结构与特点;随后重点分析了其主要的几个应用领域;最后探讨了WMNs各协议层的研究现状与关键技术,并分析了该技术存在的问题及未来的研究方向。     

同心筒发射中旁泄流影响的数值研究

同心筒是一种先进的新型的舰载导弹垂直发射装置。文中采用动网格技术模拟了导弹在同心式发射筒内发射的瞬态过程。探讨了发射过程中旁泄流的产生与消失原因。通过设计内外筒的合理大小可以有效减弱旁泄流的影响。通过大量的数值实验,给出了避免外筒发生雍塞的代数关系式。     

数值地形图的生成及其水文地貌特征评价

数值地形图(DEM)是利用地理信息系统(GIS)进行流域水文模拟的基础, 其精度直接影响模拟结果在没有现成的数值地形图时, 应用人员往往利用传统的地形图来生成它. 本文分别采用Arc/Info地理信息系统软件提供的哈奇逊法和不规则三角网五次插值法, 对一个实验流域的高程取样点进行插值, 生成了4种不同的数值地形图, 从凹洼分布、流域界定、河网提取、地面坡度和地形指数、以及地面径流汇成等方面, 对它们的水文地貌精度进行了比较. 结果表明, 两种方法都能生成由高程点群所反映的地形, 然而由于哈奇逊法能够结合流域的河网结构及其具有物理基础的水文地貌加强法来处理凹洼问题, 因此大大地提高了其所生成的流域数值地形图水文地貌特征精度.