Large eddy simulation of cross-flow through a staggered tube bundle at subcritical Reynolds number

The Large Eddy Simulation (LES) technique is used to study the vortex shedding characteristics inside a staggered tube array consisting of six rows with intermediate spacings (S_L/D×S_T/D=1.6×3.6) at the subcritical Reynolds number of 8600 (based on the gap velocity). The filtered equations are discretised using the finite volume method in an unstructured, collocated grid arrangement with second-order accurate methods in space and time. The predictions of mean velocities and Reynolds stresses are in very good agreement with detailed LDA measurements performed in 17 stations along the depth of the array. The sizes of the recirculation zones behind the cylinders in the first and third row also compare favourably with available correlations. Two distinct and independent shedding frequencies are detected behind the first two rows, but the high-frequency component vanishes in the downstream rows. The corresponding Strouhal numbers agree well with measurements available in the literature for similar tube spacings. The lift coefficient as well as instantaneous flow patterns of the whole array are also examined.     

贯流风机流场的实验和数值研究

贯流风机流场的分析研究是对其进行结构调整、性能优化的前提。本文运用烟迹和闪光照相的方法对贯流风机的内部流动进行了流场显示研究，得到了瞬态流场照片，并通过多点总压和静压测量得到了速度分布。本文还对贯流风机的流场进行了数值模拟。结果表明：数值计算与实验结果符合得较好，这两者的结合是研究贯流风机流动和改进其性能的有效手段。本文最后就贯流风机的噪声进行了初步研究，得出了一些有价值的结果。     

HLLE++格式在高马赫数空腔流动模拟中的应用

空腔流动存在剪切层运动、涡脱落与破裂,以及激波与激波、激波与剪切层、激波与膨胀波和激波/涡/剪切层相互干扰等现象,流动非常复杂,特别是高马赫数(M>2)时,剪切层和激波更强,激波与激波干扰更严重,对数值格式的要求更高,既需要格式耗散小,对分离涡等有很高的模拟精度,又需要格式在激波附近具有较大的耗散,可以很好地捕捉激波,防止非物理解的出现。Roe和HLLC等近似Riemann解格式在高马赫数强激波处可能会出现红玉现象,而HLLE++格式大大改善了这种缺陷,在捕捉高超声速激波时避免了红玉现象的发生,同时还保持在光滑区域的低数值耗散特性。本文在结构网格下HLLE++格式的基础上,通过改进激波探测的求解,建立了基于非结构混合网格的HLLE++计算方法,通过无粘斜坡算例,验证了HLLE++格式模拟高马赫数流动的能力,并应用于高马赫数空腔流动的数值模拟,开展了网格和湍流模型影响研究,验证了方法模拟高马赫数空腔流动的可靠性和有效性。     

云计算技术在未来智能电网信息处理平台中的应用

未来的电网将会是一个高度自动化、智能化的电网,如此一个庞大、复杂的系统从发电、输电一直到变、配、用电的过程时刻都会生成海量的电能信息及设备运行状态数据,这就需要一个强有力的信息处理平台作为支撑,且这个平台应具有对海量数据的可靠存储、准确分析、实时同步更新及共享的功能,尤其是音视频等异构数据的分析与处理.云计算技术在大数据处理中具有得天独厚的优势,本文将云计算技术引入到未来智能电网的信息处理平台的建设中,针对未来智能电网信息处理平台的各项功能需求,对比目前电网信息处理平台的诸多瓶颈进行深层次的探讨,证明了将云计算技术应用到未来智能电网信息处理平台中的可行性。     

稀疏计算层析成像重构中迭代去噪方法的分析

研究了稀疏计算层析成像重构中的迭代去噪模型及其求解算法,理论推导及模拟实验验证了代数重构技术的抑噪能力.根据稀疏计算层析成像成像过程的噪音特征,提出了基于欧氏范数不等式约束和基于无穷范数不等式约束的去噪模型.提出了基于凸集投影方法求解去噪模型的算法,并给出了算法推导过程.结果表明:欧氏范数去噪模型优于无穷范数去噪模型,代数重构技术具有抑制噪音的作用.     

Different modelings of cell‐face velocities and their effects on the pressure–velocity coupling,accuracy and convergence of solution

In this article, a detailed study on the effects of different modelings of cell‐face velocities on pressure–velocity coupling, accuracy and convergence rate of the solution has been conducted. Discussions are focused on the collocated scheme of Schneider and Karimian (Computational Mechanics 1994; 14 : 1–16) in the context of a control‐volume finite‐element Method. In this scheme, variables at the control volume surface are evaluated based on the physics of their governing equations, and the fully coupled system obtained is solved using a direct sparse solver. A special test problem has been defined to check the pressure–velocity coupling for all of the formulations. Other test cases, including Taylor problem, inviscid converging–diverging nozzle and the lid‐driven cavity, have been conducted for different Reynolds numbers, mesh sizes and time steps to investigate the accuracy and the performance of the formulations. Finally, a reliable and efficient scheme for the evaluation of cell‐face velocities is proposed, which can be easily extended to three dimensions. Copyright © 2010 John Wiley & Sons, Ltd.     

Cubature formulas for function spaces with moderate smoothness

We construct simple algorithms for high-dimensional numerical integration of function classes with moderate smoothness. These classes consist of square-integrable functions over the d-dimensional unit cube whose coefficients with respect to certain multiwavelet expansions decay rapidly. Such a class contains discontinuous functions on the one hand and, for the right choice of parameters, the quite natural d-fold tensor product of a Sobolev space H^s[0,1] on the other hand.The algorithms are based on one-dimensional quadrature rules appropriate for the integration of the particular wavelets under consideration and on Smolyak's construction. We provide upper bounds for the worst-case error of our cubature rule in terms of the number of function calls. We additionally prove lower bounds showing that our method is optimal in dimension d=1 and almost optimal (up to logarithmic factors) in higher dimensions. We perform numerical tests which allow the comparison with other cubature methods.     

An exact algorithm for MAX-CUT in sparse graphs

We study exact algorithms for the MAX-CUT problem. Introducing a new technique, we present an algorithmic scheme that computes a maximum cut in graphs with bounded maximum degree. Our algorithm runs in time O^*(2^(1-(2/Δ))n). We also describe a MAX-CUT algorithm for general graphs. Its time complexity is O^*(2^mn/(m+n)). Both algorithms use polynomial space.