An iterative parallel algorithm of finite element method

In this paper, a parallel algorithm with iterative form for solving finite element equation is presented. Based on the iterative solution of linear algebra equations, the parallel computational steps are introduced in this method. Also by using the weighted residual method and choosing the appropriate weighting functions, the finite element basic form of parallel algorithm is deduced. The program of this algorithm has been realized on the ELXSI-6400 parallel computer of Xi'an Jiaotong University. The computational results show the operational speed will be raised and the CPU time will be cut down effectively. So this method is one kind of effective parallel algorithm for solving the finite element equations of large-scale structures.     

A combined programming and iteration algorithm for finite element analysis of three-dimensional contact problems

Comparing with two-dimensional contact problems, three-dimensional frictional contact problems are more difficult to deal with, because of the unknown slip direction of the tangential force and enormous computing time. In order to overcome these difficulties, a combined PQP (Parametric Quadratic Programming) and iteration method is derived in this paper. The iteration algorithm, which alleviates the difficulty of unknown slip direction, is used along with the PQP method to cut down computing costs. Numerical example is given to demonstrate the validity of the present algorithm. The project supported by the Machinary and Electronics Ministry of China     

基于重叠划分的自由网格四边形单元计算方法

提出了一种基于重叠划分的自由网格四边形单元计算方法。这一方法将四边形单元引入到自由网格计算方法中，不仅提高了计算的精度，同时还保留了自由网格计算方法的特点。方法首先对分析域内自动生成的每一个节点建立一套临时三角形单元，利用这些临时三角形单元组合生成四边形单元，以节点为单位进行计算。由于各矩阵的计算与组集均以节点为中心进行处理，因而特别适合于并行计算环境。在详细介绍自由网格四边形单元计算方法的基础上，利用数值算例证实了这一方法改善计算精度方面的有效性。     

凹形多面体离散单元的水平集函数接触算法

多面体模型理论上可构造任意颗粒形态,然而受单元接触算法的限制,仅用于凸形颗粒材料的离散元模拟。对于具有凹形特征的多面体单元,单个接触点的搜索算法难以精确计算单元间的作用力。考虑多面体单元间存在单个或多个接触点的计算特性,本文发展了适用于凸形和凹形多面体颗粒材料的水平集函数接触算法。该方法通过点-三角形单元距离计算方法和奇-偶数判定方法建立多面体单元的零水平集函数和空间水平集函数,并对水平集函数进行三线性插值,可得到多面体单元间的单个或多个接触点。为检验水平集函数接触算法的可靠性,对球形和凹形多面体颗粒材料的堆积和倒塌过程进行离散元模拟,并分析颗粒形状对堆积密度和休止角的影响规律。     

A new modification of false position method based on homotopy analysis method

A new modification of false position method for solving nonlinear equations is presented by applying homotopy analysis method （HAM）. Some numerical illustrations are given to show the efficiency of algorithm.     

A non‐iterative implicit algorithm for the solution of advection–diffusion equation on a sphere

A numerical algorithm for the solution of advection–diffusion equation on the surface of a sphere is suggested. The velocity field on a sphere is assumed to be known and non‐divergent. The discretization of advection–diffusion equation in space is carried out with the help of the finite volume method, and the Gauss theorem is applied to each grid cell. For the discretization in time, the symmetrized double‐cycle componentwise splitting method and the Crank–Nicolson scheme are used. The numerical scheme is of second order approximation in space and time, correctly describes the balance of mass of substance in the forced and dissipative discrete system and is unconditionally stable. In the absence of external forcing and dissipation, the total mass and L₂‐norm of solution of discrete system is conserved in time. The one‐dimensional periodic problems arising at splitting in the longitudinal direction are solved with Sherman–Morrison's formula and Thomas's algorithm. The one‐dimensional problems arising at splitting in the latitudinal direction are solved by the bordering method that requires a prior determination of the solution at the poles. The resulting linear systems have tridiagonal matrices and are solved by Thomas's algorithm. The suggested method is direct (without iterations) and rapid in realization. It can also be applied to linear and nonlinear diffusion problems, some elliptic problems and adjoint advection–diffusion problems on a sphere. Copyright © 2015 John Wiley & Sons, Ltd.     

离散元数值模拟中查找邻居元关系的改进算法

离散元方法是近年发展起来的有前途的新概念数值模拟方法,然而查找邻居元关系耗费大量机时和内存。本文引入一种改进算法-“区域法”,并对其原理、算法、运行时间和空间进行了分析。和原算法中的“窗口法”的比较结果表明,新算法在运行时间和空间方面均明显优于原算法。     

基于算法复杂度理论的拟力法计算效率评价

算法复杂度理论是一种算法效率定量评价方法,该方法通过度量算法的复杂度来客观反映其执行效率,避免了计算机系统性能等因素对效率评价的影响。拟力法是一种高效的结构非线性分析方法,以往研究工作只是在非线性分析过程和运行时间上对计算效率进行了探索,并没有从理论上量化分析。本文采用算法复杂度理论对拟力法和传统变刚度非线性求解方法进行分析,给出了两种方法的时间复杂度函数,并对比了其计算效率进行定量,从数学角度解释了拟力法计算效率高的根本原因。算例对两种方法的时间复杂度和计算时间进行对比分析,直观地说明了拟力法在计算效率方面的优越性。     

Non-linear analysis of structures using two-point method

Non-linear algebraic equations must be solved by an iterative method, the non-linear equations being linearized by evaluating the non-linear terms with the known solution from the preceding iteration. The Newton-Raphson method, which is based on the Taylor series expansion and uses the tangent stiffness matrix, has been extensively used to solve non-linear problems. In this paper, a new Newton-Raphson algorithm is developed for analyses involving non-linear behavior. Our method, here named as a two-point method, is constructed as a predictor-corrector one, most frequently taking Newton's method in the first iteration. It should be noted that our concern in this research ignores the problem of passing limit points. The presented method incorporates the known information at each stage of the loading process to determine the subsequent unknown variables. Compared with the classic Newton-Raphson algorithm, it offers a strategy that can be deployed to reduce both the number of the iterations and the computing time involved in non-linear analysis of structures.     

极限分析和安定分析的并行算法

本文基于结构极限分析和安定分析的温度参数法，研究了线性规划的并行算法，温度参数法求解的关键是线性规划的求解效率，在分布式布储的多处理机系统上，采用了线性规划的分块单纯形法。对相当于大量工况的结构，子结构是一个很好的并行结构分析方法。     

动力学平衡方程的辛两步求解算法

基于线性多步方法的构造格式和辛变换,给出了动力学方程的两种辛两步法求解格式,它们分别具有四阶精度和二阶精度,但都只有二阶格式的计算量,因此四阶辛两步法具有较大的应用价值。对两种辛两步法和解析解进行了数值比较,证明了二阶精度辛两步格式在一定条件下就是欧拉中点保辛算法,或δ=0.5和α=0.25的Newmark辛格式。     

结构动力方程的更新精细积分方法

将高斯积分方法与精细积分方法中的指数矩阵运算技巧结合起来,建立了精细积分法的更新形式及计算过程,对该更新精细积分方法的稳定性进行了论证与探讨。在实施精细积分过程中不必进行矩阵求逆,整个积分方法的精度取决于所选高斯积分点的数量。这种方法理论上可实现任意高精度,计算效率较高,其稳定性条件极易满足。数值例题也显示了这种方法的有效性。     

On the use of characteristic‐based split meshfree method for solving flow problems

This study presents characteristic‐based split (CBS) algorithm in the meshfree context. This algorithm is the extension of general CBS method which was initially introduced in finite element framework. In this work, the general equations of flow have been represented in the meshfree context. A new finite element and MFree code is developed for solving flow problems. This computational code is capable of solving both time‐dependent and steady‐state flow problems. Numerical simulation of some known benchmark flow problems has been studied. Computational results of MFree method have been compared to those of finite element method. The results obtained have been verified by known numerical, analytical and experimental data in the literature. A number of shape functions are used for field variable interpolation. The performance of each interpolation method is discussed. It is concluded that the MFree method is more accurate than FEM if the same numbers of nodes are used for each solver. Meshfree CBS algorithm is completely stable even at high Reynolds numbers. Copyright © 2007 John Wiley & Sons, Ltd.     

A DOMAIN DECOMPOSITION ALGORITHM WITH FINITE ELEMENT-BOUNDARY ELEMENT COUPLING

A domain decomposition algorithm coupling the finite element and the boundary element was presented. It essentially involves subdivision of the analyzed domain into sub-regions being independently modeled by two methods, i.e., the finite element method (FEM) and the boundary element method (BEM). The original problem was restored with continuity and equilibrium conditions being satisfied on the interface of the two sub-regions using an iterative algorithm. To speed up the convergence rate of the iterative algorithm, a dynamically changing relaxation parameter during iteration was introduced. An advantage of the proposed algorithm is that the locations of the nodes on the interface of the two sub-domains can be inconsistent. The validity of the algorithm is demonstrated by the consistence of the results of a numerical example obtained by the proposed method and those by the FEM, the BEM and a present finite element-boundary element (FE-BE) coupling method.     

随机有限元分析的二级区域分解并行求解算法

采用蒙特卡罗模拟(MCS)和加权积分法对二维问题进行随机有限元分析。尽管MCS方法对任何有确定解的问题都具有求解精度高的优点,但由于求解所需的计算量巨大使其应用受到限制。利用并行求解技术可有效地处理这种密集型计算问题。基于有限元分裂对接法(FETI)的并行特性并利用预处理共轭梯度法(PCG)的求解高效性,结合整体子区域实现(GSI-PCG)和FETI法,提出二级求解算法,并在工作站机群上实现了数值算例。算例计算结果表明本文GSI(PCG)-FETI算法具有较高的并行加速比和并行效率,具有良好的性能,可有效地进行二维问题的随机有限元分析。     

无网格Galerkin法GPU加速并行计算及其应用

针对无网格Galerkin法计算耗时的问题,采用逐节点对法来组装刚度矩阵、共轭梯度法求解基于CSR格式存储的稀疏线性方程组,提出了一种利用罚函数法施加本质边界条件的EFG法GPU加速并行算法,给出了刚度矩阵和惩罚刚度矩阵的统一格式,以及GPU加速并行算法的流程图。编写了基于CUDA构架平台的GPU程序,且在NVIDIA GeForce GTX 660显卡上通过数值算例对所提算法进行了性能测试与分析比较,探讨了影响加速比的因素。算例结果验证了所提算法的可行性,并在满足计算精度的前提下,其加速比最大可达17倍;同时线性方程组的求解对加速比起决定性影响。     

物质点法的理论和应用

物质点法采用质点离散材料区域, 用背景网格计算空间导数和求解动量方程,避免了网格畸变和对流项处理, 兼具拉格朗日和欧拉算法的优势, 非常适合模拟涉及材料特大变形和断裂破碎的问题. 本文详细论述了物质点法在基本理论、算法和软件开发方面的进展, 包括广义插值物质点法、接触算法、自适应算法、并行算法、与其他算法的杂交和耦合等. 系统地总结了物质点法在超高速碰撞、冲击侵彻、爆炸、动态断裂、流固耦合、多尺度分析、颗粒材料流动和岩土失效等一系列涉及材料特大变形问题中的应用,展示了其相对于传统数值计算方法的优势.     

水下爆炸过程的高精度数值计算

采用三阶精度的Parabolic Piecewise Method(PPM)方法和Volume Of Fluid(VOF)方法相结合，运用Lagrange-Remapping算法，数值计算爆轰产物、水、空气多种介质之间的相互作用过程，该方法可以用来处理界面两边高密度比可压缩流动以及强剪切滑移运动等问题。     

A Petrov-Galerkin method for the numerical solution of the Bradshaw-Ferriss-Atwell turbulence model

The Bradshaw-Ferriss-Atwell model for 2D constant property turbulent boundary layers is shown to be ill-posed with respect to numerical solution. It is shown that a simple modification to the model equations results in a well-posed system which is hyperbolic in nature. For this modified system a numerical algorithm is constructed by discretizing in space using the Petrov-Galerkin technique (of which the standard Galerkin method is a special case) and stepping in the timelike direction with the trapezoidal (Crank-Nicolson) rule. The algorithm is applied to a selection of test problems. It is found that the solutions produced by the standard Galerkin method exhibit oscillations. It is further shown that these oscillations may be eliminated by employing the Petrov-Galerkin method with the free parameters set to simple functions of the eigenvalues of the modified system.     

确定SOR最佳松弛因子的一个实用算法

SOR迭代方法中的最佳松弛因子的确定 ,是数值代数中的一个理论难题。本文采用优化技术中简便的直接搜索法 ,构造出近似确定最佳松弛因子的数值算法 ,并由此得出一个具有近似确定ωop t功能的自适应 SOR算法 ,数值算例表明 :该算法是实用和快捷的。