基于八叉树的全局接触搜索算法研究

接触搜索是接触-碰撞问题有限元模拟中最为耗时的部分,高效的接触搜索算法是提高数值分析效率的关键。以面心坐标和特征长度表征接触主片,并引入树包围盒和从节点包围盒的概念,基于八叉树算法发展了一种高效的全局接触搜索方法,计算复杂度为O(Nlog8M),其中N为从节点数,M为接触主片数。程序实现时,通过引入接触预搜索和相邻搜索方式加速搜索速度。本文算法基于PANDA-Impact软件实现,并进行了算例验证分析。结果表明,本文算法具有很好的接触搜索效率与适用性,与桶排序算法相比,当接触复杂且规模较大时,本文算法表现出较大的优势。     

自适应无网格热弹塑性接触模型研究

提出一种自适应无网格热弹塑性接触求解模型,求解接触问题的线性规划-增量初应力法与基于应变能梯度的自适应无网格法相结合,给出了模型计算理论和算法实现.通过圆柱体与弹塑性平面热弹塑性接触算例对模型进行验证.对是否考虑材料应变硬化,是否考虑摩擦力和热输入,是否考虑材料屈服强度温度相关等情况的两种算例进行了讨论.结果表明,该模型能有效地求解考虑不同情况下的热弹塑性接触问题,在较真实地模拟接触状况的同时,具有较高的计算精度和计算效率.     

基于改进人工鱼群算法的DGPS整周模糊度快速固定

为提高DGPS整周模糊度的搜索效率,将改进人工鱼群算法引入模糊度固定解搜索环节。在解算中首先根据GPS双差载波相位观测方程,利用卡尔曼滤波估计模糊度浮点解,针对短基线解算问题,以基线长度为约束确定模糊度搜索范围,进而采用LLL降相关算法对模糊度浮点解作降相关处理,最后利用附加整数约束的改进人工鱼群算法搜索整周模糊度固定解。算例分析结果表明,在与遗传算法的100次对比实验中,改进人工鱼群算法搜索平均用时1.6617 s,比遗传算法缩短2.4987 s,算法搜索速度更快,搜索效率明显提高。算法的模糊度搜索成功率为92%,高出遗传算法9%,搜索成功率得到有效提升。因此,与遗传算法相比,改进人工鱼群算法能够更为快速地得到整周模糊度固定解,且具有更高的搜索效率和成功率。     

基于范例学习的遗传算法在连续体结构拓扑优化中的应用

本文提出了一种用机器学习来改进遗传算法搜索效率的新方法———基于范例学习的遗传算法(简称CLGA),并将该方法成功应用于连续体结构拓扑优化。CLGA的基本思想是利用已搜索过的点的信息来指导后续的搜索,避免重复计算,从而提高了GA搜索的效率。本文提出了目标向量的概念,可以在不同尺度下量化链码产生的不同结构个体之间的相似性。算例的计算结果表明,该方法是一种高效的连续体拓扑优化方法。     

无网格模型的子结构分析

提出一种无网格模型的子结构分析方法。基于界带分析方法,处理无网格模型子结构之间的连接,能够保证各个子结构之间无缝连接,从而使无网格子结构模型与原无网格模型等价,同时还能够降低无网格刚度方程的计算规模。数值算例表明,本文方法是正确可靠的,可以保证各个子结构之间无缝连接。     

爆轰驱动多介质问题的Lagrange多分区自适应数值模拟研究

凝聚炸药爆轰驱动惰性金属材料形成的多介质流动问题广泛存在于工程应用领域, Lagrange方法由于其物质界面的高保真特性一直在相关问题的数值模拟中发挥着不可替代的作用.加密网格是提高爆轰驱动多介质问题模拟精度的常用途径之一.然而, Lagrange框架下整体密网格计算常会遇到网格畸变、计算效率低等问题.为此,针对爆轰驱动多介质流动问题,提出了一种Lagrange框架下的非结构网格多层自适应方法,在保证所关心区域局部网格分辨率的前提下,大幅缩减了整体计算规模,提升了Lagrange计算的健壮性.设计了非结构网格多层数据结构,提出了多层网格分层存储、有效网格压至一层进行Lagrange计算的AMR策略,同时还发展了自适应接触滑移耦合算法,实现了AMR计算与多分区接触滑移计算的“紧耦合”.相比于已有工作,所提出的AMR方法既保持了非结构网格多层数据结构的灵活性优势,又避免了Lagrange框架下多层网格分别计算带来的层间耦合困难,同时因实现了与接触滑移的自适应耦合,使得它能很好地适应多分区的多介质问题.在一维、二维爆轰算例验证所提出方法正确性的前提下,开展了拐角爆轰、多层炸药隔爆和有限尺寸弯...     

基于T样条的变网格等几何薄板动力学分析

具有大位移、大变形的薄板在接触碰撞等工况下, 其局部应变会产生剧烈变化. 为了保证对其进行动力学分析的精度和计算效率, 本文整合计算机辅助设计(CAD)与计算机辅助工程(CAE)系统, 提出了一种基于T样条曲面的变网格柔性系统等几何分析方法. 首先, 建立基于T样条曲面单元的基尔霍夫薄板运动学模型, 并根据非线性格林?拉格朗日应变建立由T样条曲面单元离散的薄板弹性模型. 其次, 通过在T网格中的局部区域插入节点的方式, 达到T样条曲面网格局部更新的目的. 利用T样条混合函数细化算法得到计算新广义变量的转换矩阵, 并结合广义α法创建了变自由度系统动力学方程的求解算法, 形成了系统的T样条单元局部细化算法. 最后, 静力学算例与柔性单摆模型分别验证了T样条薄板弹性模型的正确性, 以及T样条薄板单元在动力学分析上的精度和收敛性. 通过对受冲击柔性薄板的动力学分析表明, 本文所提出T样条单元及局部细化算法可以只在接触碰撞等应变剧烈变化的区域实现局部网格细化, 从而控制系统自由度数, 提高计算效率.      

离散变量结构优化设计的相对差商-遗传算法

将相对差商法(RDQA)和遗传算法(GA)结合起来,提出一个离散变量结构优化设计的有效解法———相对差商-遗传算法。3个算例结果显示出其优于相对差商法与遗传算法:(1)大大提高了遗传算法搜索全局最优解的能力及计算效率;(2)间接证明了相对差商法具有足够的逼近全局最优解的能力。     

一种新的准结构网格生成方法

在有限元分析中,高质量的结构网格可以有效地提高有限元分析的精度,但结构网格的几何适应性差,针对复杂边界的二维计算模型,现有的方法很难自动生成高质量的结构网格;而非结构网格几何适应性很好,但存在计算效率低和精度差等问题。提出了一种新的准结构网格生成方法,能够实现复杂区域的网格自动生成并且具有高网格质量。该方法首先对计算区域运用Delaunay三角剖分技术生成粗背景网格;然后利用背景网格,使用优化的Voronoi图生成过渡的蜂巢网格;最后,通过中心圆方法对蜂巢网格单元进行结构网格剖分。分析NACA0012翼型数值模拟结果表明,提出的新准结构网格生成方法能够对边界复杂的模型自动生成高质量的网格,并且通过三种不同拓扑类型网格计算结果相互对比及与实验结果对比,证明准结构网格具有高计算精度。     

可扩展的冲击—接触并行计算研究

冲击—接触计算模型在汽车碰撞、金属成型等的模拟计算中有着广泛的应用，鉴于冲击—接触计算过程复杂和计算量大，本文在分布式可扩展的并行计算平台上，设计并实现了冲击—接触的并行计算。算例证明，计算平台稳定可靠，算法简单实用，且具有较好的并行效率和可扩展性。     

Implementation and efficiency analysis of parallel computation using OpenACC: a case study using flow field simulations

The Open Accelerator (OpenACC) application programming interface is a relatively new parallel computing standard. In this paper, particle-based flow field simulations are examined as a case study of OpenACC parallel computation. The parallel conversion process of the OpenACC standard is explained, and further, the performance of the flow field parallel model is analysed using different directive configurations and grid schemes. With careful implementation and optimisation of the data transportation in the parallel algorithm, a speedup factor of 18.26× is possible. In contrast, a speedup factor of just 11.77× was achieved with the conventional Open Multi-Processing (OpenMP) parallel mode on a 20-kernel computer. These results demonstrate that optimised feature settings greatly influence the degree of speedup, and models involving larger numbers of calculations exhibit greater efficiency and higher speedup factors. In addition, the OpenACC parallel mode is found to have good portability, making it easy to implement parallel computation from the original serial model.     

A HYBRID GRANULARITY PARALLEL ALGORITHM FOR PRECISE INTEGRATION OF STRUCTURAL DYNAMIC RESPONSES

Precise integration methods to solve structural dynamic responses and the corresponding time integration formula are composed of two parts： the multiplication of an exponential matrix with a vector and the integration term. The second term can be solved by the series solution. Two hybrid granularity parallel algorithms are designed, that is, the exponential matrix and the first term are computed by the fine-grained parallel algorithra and the second term is computed by the coarse-grained parallel algorithm. Numerical examples show that these two hybrid granularity parallel algorithms obtain higher speedup and parallel efficiency than two existing parallel algorithms.     

Acceleration of three-dimensional Tokamak magnetohydrodynamical code with graphics processing unit and OpenACC heterogeneous parallel programming

ABSTRACT

In this paper, the OpenACC heterogeneous parallel programming model is successfully applied to modification and acceleration of the three-dimensional Tokamak magnetohydrodynamical code (CLT). Through combination of OpenACC and MPI technologies, CLT is further parallelised by using multiple-GPUs. Significant speedup ratios are achieved on NVIDIA TITAN Xp and TITAN V GPUs, respectively, with very few modifications of CLT. Furthermore, the validity of the double precision calculations on the above-mentioned two graphics cards has also been strictly verified with m/n?=?2/1 resistive tearing mode instability in Tokamak.     

Simulation of free and forced convection incompressible flows using an adaptive parallel/vector finite element procedure

The numerical simulation of complex flows demands efficient algorithms and fast computer platforms. The use of adaptive techniques permits adjusting the discretisation according to the analysis requirements, but creates variable computational loads that are difficult to manage in a parallel/vector program. This paper describes the approach adopted to implement an adaptive finite element incompressible Navier–Stokes solver on the Cray J90 machine. Performance measurements for the simulation of free and forced convection incompressible flows indicate that the techniques employed result in a fast parallel/vector code. Copyright © 1999 John Wiley & Sons, Ltd.     

岩质圆形隧洞围岩应力场弹塑性新解

针对动态接触问题的有限元并行计算，提出了一种新的接触算法. 新算法引入局部拉氏 乘子技术来计算接触力. 由于同时考虑了无穿透的接触约束条件和相邻接触对的相互影响， 较之广泛使用的罚参数法，新算法使接触约束条件和系统平衡方程得到更充分的满足. 虽然 为提高接触计算精度而在局部采用了迭代技术，但算法仍然具有较高的效率，且与显式时间 积分方案完全相容. 此外，通过构造专门的区域分解方案，实现了将现有为串行程序开发的 搜索算法平滑移植到并行环境的目标. 数值算例表明，所提出的接触算法具有很好的并行性， 在保证了接触问题并行计算精度的同时，取得了满意的并行效率.     

From level set to volume of fluid and back again at second‐order accuracy

We present methods for computing either the level set function or volume fraction field from the other at second‐order accuracy. Both algorithms are optimal in that O(N) computations are needed for N total grid points and both algorithms are easily parallelized. This work includes a novel interface reconstruction algorithm in three dimensions that requires a smaller local block of volume fractions than existing algorithms. A compact local solver leads to better algorithm portability and efficiency: for example, fewer restrictions must be imposed on an adaptive mesh, and fewer grid cells must be communicated between processors in a parallel implementation. We also present a fast sweeping method for computing a unique approximation of the signed distance function to a piecewise linear interface. All of the numerical examples confirm second‐order accuracy on both uniform and tree‐based adaptive grids. Copyright © 2015 John Wiley & Sons, Ltd.     

三维气相爆轰动态并行计算程序设计与开发

在三维气相爆轰数值研究中,网格精度和计算域的规模导致网格数占有非常庞大的计算资源,进而给数值模拟带来了极大的挑战。本文针对这一难题,采用5阶WENO格式对带化学反应Euler方程组进行空间离散,基于MPI（MessagePassingInterface）并行模式开发了高精度动态并行代码,并对爆轰波在带有障碍物的三维方形管道中的传播过程进行计算。计算结果表明,高精度动态并行计算能够很好的模拟三维气相爆轰波在大尺寸管道中的传播,不仅提高了计算效率,而且提高了爆轰波阵面的分辨率。与高精度静态并行相比,高精度动态并行计算减少了界面数据通信时间,从而进一步提高了计算效率。因此,高精度动态并行程序为探究三维气相爆轰新的物理机制提供有效的手段。     

Parallel implementation of a non‐hydrostatic model for free surface flows with semi‐Lagrangian advection treatment

The parallel implementation of an unstructured‐grid, three‐dimensional, semi‐implicit finite difference and finite volume model for the free surface Navier–Stokes equations (UnTRIM ) is presented and discussed. The new developments are aimed to make the code available for high‐performance computing in order to address larger, complex problems in environmental free surface flows. The parallelization is based on the mesh partitioning method and message passing and has been achieved without negatively affecting any of the advantageous properties of the serial code, such as its robustness, accuracy and efficiency. The key issue is a new, autonomous parallel streamline backtracking algorithm, which allows using semi‐Lagrangian methods in decomposed meshes without compromising the scalability of the code. The implementation has been carefully verified not only with simple, abstract test cases illustrating the application domain of the code but also with advanced, high‐resolution models presently applied for research and engineering projects. The scheme performance and accuracy aspects are researched and discussed. Copyright © 2008 John Wiley & Sons, Ltd.     

Domain decomposition method with hybrid approximations applied to solve problems of elasticity

To solve two-dimensional boundary-value problems of elasticity, two iteration algorithms of the domain decomposition method are proposed: parallel Neumann–Neumann and sequential Dirichlet–Neumann. They are based on the hybrid boundary–finite-element approximations. The algorithms are proved to converge. The optimal parameters are selected using the minimum-residual and steepest-descent methods. Some plane problems of elasticity are solved as examples, and stationary and nonstationary iteration algorithms in these examples are analyzed for efficiency Translated from Prikladnaya Mekhanika, Vol. 44, No. 11, pp. 18–29, November 2008.     

基于GPU的GPS信号并行捕获

针对计算机中央处理器上串行实现GPS捕获算法耗时长的缺点,利用具有强并行处理能力的图形处理器设计实现了两种分别适用于不同载噪比信号的并行捕获算法以提高捕获速度。所提算法基于计算机统一设备架构的设计思想,采用了并行码相位搜索捕获策略,通过对GPS星座32颗卫星多通道、多频点的并行搜索实现了强信号捕获,而对弱信号则采用非相关积分法,通过对单颗卫星多时段、多频点的并行搜索再进行通道的串行处理来实现并行捕获。仿真结果表明:两种并行捕获算法比串行实现的捕获算法速度提高了10倍;采用非相干积分提高了弱信号捕获能力,对于载噪比为40 dB的10 ms中频数据,在保证捕获速度的同时,仍能够有效实现正确捕获。