结构非线性动力分析混合时间积分并行算法

综合隐式和显式时间积分技术,对结构非线性动力反应分析提出一种并行混合时间积分算法.该算法采用区域分解技术.将并发性引入到算法中,即利用显式时间积分技术进行界面节点积分而利用隐式算法求解局部子区域.为实现并行混合时间积分算法,设计了灵活的并行数据信息流.编写了该算法的程序,在工作站机群实现了数值算例,验证了算法的精度和性能.计算结果表明该算法具有良好的并行性能,优于隐式算法.     

非线性动力方程精细积分法的自适应步长研究

基于Adams显式和隐式预估公式实现对时间步长的 自适应选择,利用当前时刻v(tk),采用预估公式的两种形式(显式与隐式),对v(tk+1)进行两次预估,利用两公式局部截断误差关系,得出误差估计值ξ(tk+1),并根据其大小 自适应调节时间步长.将该思想应用于预估型(求解过程需要用到预估公式)精细积分算法中,使精细积分算法的时间步长依赖于给定的每步误差限值,提高计算精度,且使算法具有很好的稳定性,对刚度硬化和软化问题均有很好的效果.数值算例验证了本文思想的有效性与适用性.     

Padé逼近求解抛物型偏微分方程的并行算法研究

一维抛物型偏微分方程可以用精细积分方法精确求解.当精细积分中的矩阵指数函数用Padé逼近来代替时,可以得到一系列由简到繁、精度由低到高的差分格式,因而便于根据实际需要进行选取.常见的求解抛物型方程的差分格式如古典显式格式、隐式格式及六点差分格式为其中的特例.Padé逼近格式主要包括矩阵运算和线性方程组求解.本文利用Padé逼近格式对应的方程组系数矩阵为带状矩阵的特点,把原来在整个区域上求解的问题转化为分区域求解,在TRANSPUTER并行机上实现了该问题的并行算法,并对该并行算法的时间复杂度进行了分析.算例结果表明Padé逼近并行算法有很好的计算效果和并行效率.     

Pad逼近求解抛物型偏微分方程的并行算法研究

一维抛物型偏微分方程可以用精细积分方法精确求解。当精细积分中的矩阵指数函数用Pad 逼近来代替时 ,可以得到一系列由简到繁、精度由低到高的差分格式 ,因而便于根据实际需要进行选取。常见的求解抛物型方程的差分格式如古典显式格式、隐式格式及六点差分格式为其中的特例。Pad 逼近格式主要包括矩阵运算和线性方程组求解。本文利用 Pad 逼近格式对应的方程组系数矩阵为带状矩阵的特点 ,把原来在整个区域上求解的问题转化为分区域求解 ,在 TRANSPUTER并行机上实现了该问题的并行算法 ,并对该并行算法的时间复杂度进行了分析。算例结果表明 Pad 逼近并行算法有很好的计算效果和并行效率。     

Pade逼近求解抛物型偏微分方程的并行算法研究

一维抛物型偏微分方程可以用精细积分方法精确求解。当精细积分中的矩阵指数函数用Pade逼近来代替时,可以得到一系列由简到繁、精度由低到高的差分格式,因而便于根据实际需要进行选取。常见的求解抛物型方程的差分格式如古典显式格式、隐式格式及六点差分格式为其中的特例。Pade逼近格式主要包括矩阵运算和线性方程组求解。本文利用Pade逼近格式对应的方程组系数矩阵为带状矩阵的特点,把原来在整个区域上求解的问题转化为分区域求解,在TRANSPUTER并行机上实现了该问题的并行算法,并对该并行算法的时间复杂度进行了分析。算例结果表明Pade逼近并行算法有很好的计算效果和并行效率。     

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

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

隐式重启动Arnoldi/Lanczos法的子区域并行算法

针对求解有限元分析的特征值问题,提出了一种隐式重启动Arnoldi/Lanczos方法的子区域并行算法。隐式重启动Arnoldi/Lanczos利用重启动技术以提高所需谱的收敛性,并能有效处理Krylov基形成问题、存储所需的内存问题、计算成本问题。并行算法中采取子区域接子区域方法、重叠和非重叠网格划分技术。采用压缩数据结构来储存系数矩阵。对Krylov的数值线性代数运算和隐式重启动法中的数值线性代数运算的并行化进行了研究。数值算例表明:该算法具有良好的适用性和效率,适合分布式储存体系的机群。     

RTM充模过程数值模拟的隐式有限元算法

建立了基于欧拉方法描述树脂传递模塑(RTM)工艺充模过程的基本数学方程,并采用有限元隐式时间积分方法对基本方程进行了数值求解．编制了基于隐式有限元算法及传统有限元控制体算法的程序,通过具体算例比较了这两种算法的优缺点．与传统的有限元控制体法相比,该文提出的隐式有限元算法能节省计算时间,特别适合于单元、节点数目多的情况．隐式有限元算法是一种纯有限元方法,不需要使用控制体积技术,采用该算法计算出的流动前沿与时间步长无关。     

基于混合Lie算子辛算法的不变流形计算

平动点附近周期轨道的不变流形因其在低能轨道转移中起着重要作用而受到广泛关注.在设计低能轨道过程中不变流形要实时进行能量匹配,但利用传统数值积分方法进行积分时能量会耗散.显式辛算法具有比隐式辛算法计算效率高的优势,但其要求Hamilton系统必须分成两个可积的部分,而旋转坐标系下的圆型限制性三体问题是不可分的,因而显式辛算法难以用于求解旋转坐标系下的圆型限制性三体问题.本文通过引入混合Lie算子,成功实现了带三阶导数项的力梯度辛算法对圆型限制性三体问题的求解,并将基于混合Lie算子的带三阶导数项的辛算法与Runge-Kutta78算法和Runge-Kutta45算法进行仿真对比,仿真结果表明基于混合Lie算子的含有三阶导数项的辛算法位置精度高、能量误差小且计算效率高.利用基于混合Lie算子的带三阶导数项的辛算法计算不变流形,可以实现低能轨道转移过程中轨道拼接点的能量精准匹配.     

气体动理学统一算法的隐式方法研究

目前的气体动理学统一算法(unified gas kinetic scheme, 简称UGKS) 在求解高速流动问题时的计算效率,难以满足求解复杂工程问题的需求. 为了提高该算法的计算效率, 本文对模型方程的对流项和碰撞项进行了隐式处理, 并针对UGKS 界面通量与演化时间相关的特点, 引入了演化时间平均界面通量, 通过对控制方程矩阵进行近似LU 分解(lower-upper decomposition), 实现了隐式UGKS. 不同来流马赫数的圆柱绕流算例测试表明, 只要演化时间选取得当, 隐式方法可以得到与显式方法完全相同的结果, 且计算效率可以提高1~2 个量级.      

An enriched finite element algorithm for the implicit simulation of the Stefan problem

An implicit enriched finite element algorithm is proposed to simulate heat transfer involving isothermal phase changes. This technique is based on a mixed variational formulation discretized by means of an enriched finite element approximation of the enthalpy in space. The interface is implicitly described without coupling with an interface-capturing technique. The time integration is carried out with an implicit (backward) Euler algorithm in time. Two examples in 1D and 2D clearly evidence the efficiency of the method developed.     

A new implicit surface tension implementation for interfacial flows

A new implementation of surface tension effects in interfacial flow codes is proposed which is both fully implicit in space, that is the interface never has to be reconstructed, and also semi‐implicit in time, with semi‐implicit referring to the time integration of the surface tension forces. The main idea is to combine two previously separate techniques to yield a new expression for the capillary forces. The first is the continuum surface force (CSF) method, which is used to regularize the discontinuous surface tension force term. The regularization can be elegantly implemented with the use of distance functions, which makes the level set method a suitable choice for the interface‐tracking algorithm. The second is to use a finite element discretization together with the Laplace–Beltrami operator, which enables simple reformulation of the surface tension term into its semi‐implicit equivalent. The performance of the new method is benchmarked against standard explicit methods, where it is shown that the new method is significantly more robust for the chosen test problems when the time steps exceed the numerical capillary time step restriction. Some improvements are also found in the average number of nonlinear iterations and linear multigrid steps taken while solving the momentum equations. Copyright © 2005 John Wiley & Sons, Ltd.     

On unconditionally positive implicit time integration for the DG scheme applied to shallow water flows

We present a new unconditionally positivity‐preserving (PP) implicit time integration method for the DG scheme applied to shallow water flows. This novel time discretization enhances the currently used PP DG schemes, because in the majority of previous work, explicit time stepping is implemented to deal with wetting and drying. However, for explicit time integration, linear stability requires very small time steps. Especially for locally refined grids, the stiff system resulting from space discretization makes implicit or partially implicit time stepping absolutely necessary. As implicit schemes require a lot of computational time solving large systems of nonlinear equations, a much larger time step is necessary to beat explicit time stepping in terms of CPU time. Unfortunately, the current PP implicit schemes are subject to time step restrictions due to a so‐called strong stability preserving constraint. In this work, we hence give a novel approach to positivity preservation including its theoretical background. The new technique is based on the so‐called Patankar trick and guarantees non‐negativity of the water height for any time step size while still preserving conservativity. In the DG context, we prove consistency of the discretization as well as a truncation error of the third order away from the wet–dry transition. Because of the proposed modification, the implicit scheme can take full advantage of larger time steps and is able to beat explicit time stepping in terms of CPU time. The performance and accuracy of this new method are studied for several classical test cases. Copyright © 2014 John Wiley & Sons, Ltd.     

A domain decomposition approach to finite volume solutions of the Euler equations on unstructured triangular meshes

We report on our recent efforts on the formulation and the evaluation of a domain decomposition algorithm for the parallel solution of two‐dimensional compressible inviscid flows. The starting point is a flow solver for the Euler equations, which is based on a mixed finite element/finite volume formulation on unstructured triangular meshes. Time integration of the resulting semi‐discrete equations is obtained using a linearized backward Euler implicit scheme. As a result, each pseudo‐time step requires the solution of a sparse linear system for the flow variables. In this study, a non‐overlapping domain decomposition algorithm is used for advancing the solution at each implicit time step. First, we formulate an additive Schwarz algorithm using appropriate matching conditions at the subdomain interfaces. In accordance with the hyperbolic nature of the Euler equations, these transmission conditions are Dirichlet conditions for the characteristic variables corresponding to incoming waves. Then, we introduce interface operators that allow us to express the domain decomposition algorithm as a Richardson‐type iteration on the interface unknowns. Algebraically speaking, the Schwarz algorithm is equivalent to a Jacobi iteration applied to a linear system whose matrix has a block structure. A substructuring technique can be applied to this matrix in order to obtain a fully implicit scheme in terms of interface unknowns. In our approach, the interface unknowns are numerical (normal) fluxes. Copyright © 2001 John Wiley & Sons, Ltd.     

Size reduction methods for the implicit time-dependent simulation of micro–macro viscoelastic flow problems

Traditionally, micro–macro simulations have been performed using simple explicit time-marching algorithms, which lack the desirable stability of implicit methods. In this study, a fully implicit time integration scheme is presented and implemented for the first time for the solution of time-dependent complex flows using the Brownian Configuration Fields approach. Special techniques need to be applied to deal with the very large size of the resulting linear systems. A novel size-reduction scheme is used, allowing an independent treatment for each molecular field and suited to parallel hardware architecture. To illustrate the method, a selected number of applications using linear spring chains are presented and the results are compared with their corresponding closed form constitutive equation. The excellent agreement between the results demonstrates the feasibility of the proposed approach.     

Implementation and performance of the time integration of a 3D transport model

The total solution of a three-dimensional model for computing the transport of salinity, pollutants, suspended material (such as sediment or mud), etc. in shallow seas involves many aspects, each of which has to be treated in an optimal way in order to cope with the tremendous computational task involved. In this paper we focus on one of these aspects, i.e. on the time integration, and discuss two numerical solution methods. The emphasis in this paper is on the performance of the methods when implemented on a vector/parallel, shared memory computer such as a Cray-type machine. The first method is an explicit time integrator and can straightforwardly be vectorized and parallelized. Although a stabilizing technique has been applied to this method, it still suffers from a severe time step restriction. The second method is partly implicit, resulting in much better stability characteristics; however, as a consequence of the implicitness, it requires in each step the solution of a large number of tridiagonal systems. When implemented in a standard way, the recursive nature would prevent vectorization, resulting in a very long solution time. Following a suggestion of Golub and Van Loan, this part of the algorithm has been tuned for use on the Cray C98/4256. On the basis of a large-scale test problem, performance results will be presented for various implementations.     

Implementation and performance of the time integration of a 3D numerical transport model

The total solution of a three-dimensional model for computing the transport of salinity, pollutants, suspended material (such as sediment or mud), etc. in shallow seas involves many aspects, each of which has to be treated in an optimal way in order to cope with the tremendous computational task involved. In this paper we focus on one of these aspects, i.e. on the time integration, and discuss two numerical solution methods. The emphasis in this paper is on the performance of the methods when implemented on a vector/parallel, shared memory computer such as a Cray-type machine. The first method is an explicit time integrator and can straightforwardly be vectorized and parallelized. Although a stabilizing technique has been applied to this method, it still suffers from a severe time step restriction. The second method is partly implicit, resulting in much beter stability characteristics; however, as a consequence of the implicitness, it requires in each step the solution of a large number of tridiagonal systems. When implemented in a standard way, the recursive nature would prevent vectorization, resulting in a very long solution time. Following a suggestion of Golub and Van Loan, this part of the algorithm has been tuned for use on the Cray C98/4256. On the basis of a large-scale test problem, performance results will be presented for various implementations.     

Efficient and robust constitutive integrators for single-crystal plasticity modeling

Small-scale deformation phenomena such as subgrain formation, development of texture, and grain boundary sliding require simulations with a high degree of spatial resolution. When we consider finite-element simulation of metal deformation, this equates to thousands or hundreds of thousands of finite elements. Simulations of the dynamic deformations of metal samples require elastic–plastic constitutive updates of the material behavior to be performed over a small time step between updates, as dictated by the Courant condition. Further, numerical integration of physically-based equations is inherently sensitive to the step in time taken; they return different predictions as the time step is reduced, eventually approaching a stationary solution. Depending on the deformation conditions, this converged time step becomes short (10⁻⁹ s or less). If an implicit constitutive update is applied to this class of simulation, the benefit of the implicit update (i.e., the ability to evaluate over a relatively large time step) is negated, and the integration is prohibitively slow. The present work recasts an implicit update algorithm into an explicit form, for which each update step is five to six times faster, and the compute time required for a plastic update approaches that needed for a fully-elastic update. For dynamic loading conditions, the explicit model is found to perform an entire simulation up to 50 times faster than the implicit model. The performance of the explicit model is enhanced by adding a subcycling algorithm to the explicit model, by which the maximum time step between constitutive updates is increased an order of magnitude. These model improvements do not significantly change the predictions of the model from the implicit form, and provide overall computation times significantly faster than the implicit form over finite-element meshes. These modifications are also applied to polycrystals via Taylor averaging, where we also see improved model performance.     

High-order time integration applied to metal powder plasticity

The present article treats two objectives. In the first investigation attention is focused on the application of time-adaptive finite elements formulated on the basis of a high-order time integration procedure on a constitutive model for compressible finite strain viscoplasticity for metal powder. In this connection, it has to be emphasized that the integration procedure is not only applied to the evolution equations on Gauss-point level but on the total system of differential–algebraic equations resulting from the application of the vertical line method on the quasi-static finite element equations. The specific application emerges from the field of metal powder compaction. Particular studies are carried out using stiffly accurate, diagonally implicit Runge–Kutta methods in combination with the Multilevel-Newton algorithm for solving the DAE-system. In this respect, the effort vs. accuracy behavior is investigated which is also related to order reduction known in elastoplasticity. The second topic treats the local stress algorithm for taking into account the yield function based finite strain viscoplasticity model, where the classical Newton–Raphson method fails. This is the reason why most constitutive models of powder materials are implemented into explicit finite element codes. Thus, the proposed investigations compare different methods in view of a stable and efficient integration process in implicit finite element formulations.