A dual domain decomposition method for finite element digital image correlation

The computational burden associated to finite element based digital image correlation methods is mostly due to the inversion of finite element systems and to image interpolations. A non‐overlapping dual domain decomposition method is here proposed to rationalise the computational cost of high resolution finite element digital image correlation measurements when dealing with large images. It consists in splitting the global mesh into submeshes and the reference and deformed states images into subset images. Classic finite element digital image correlation formulations are first written in each subdomain independently. The displacement continuity at the interfaces is enforced by introducing a set of Lagrange multipliers. The problem is then condensed on the interface and solved by a conjugate gradient algorithm. Three different preconditioners are proposed to accelerate its convergence. The proposed domain decomposition method is here exemplified with real high resolution images. It is shown to combine the metrological performances of finite element based digital image correlation and the parallelisation ability of subset based methods. Copyright © 2015 John Wiley & Sons, Ltd.     

Optimized partitioning of unstructured finite element meshes

We address the problem of automatic partitioning of unstructured finite element meshes in the context of parallel numerical algorithms based on domain decomposition. A two-step approach is proposed, which combines a direct partitioning scheme with a non-deterministic procedure of combinatorial optimization. In contrast with previously published experiments with non-deterministic heuristics, the optimization step is shown to produce high-quality decompositions at a reasonable compute cost. We also show that the optimization approach can accommodate complex topological constraints and minimization objectives. This is illustrated by considering the particular case of topologically one-dimensional partitions, as well as load balancing of frontal subdomain solvers. Finally, the optimization procedure produces, in most cases, decompositions endowed with geometrically smooth interfaces. This contrasts with available partitioning schemes, and is crucial to some modern numerical techniques based on domain decomposition and a Lagrange multiplier treatment of the interface conditions.     

Dynamic analysis and drilling degrees of freedom

Finite element methods for dynamic analysis employing elements with drilling degrees of freedom are presented. The formulation is based on a variational principle in which displacements and rotations are interpolated independently. The issue of zero masses corresponding to rotational degrees of freedom is addressed and techniques for defining consistent and lumped rotational mass matrices are presented.     

有限元并行计算中网格自动区域划分的研究

本文针对集群系统下大规模并行有限元分析,设计了简单实用的网格自动区域划分算法,以使并行计算时减少由于负载不均衡所引起的效率下降,并应用于“汽车碰撞模拟”项目中的车架模型的分割。重点讨论并改进了贪婪算法和ANP算法,并比较了两种算法各自的特点及其适用性。通过数值算例证明,对于不同类型的有限元网格都得到了满意的结果,本文的算法具有广泛的适用性。且对该算法稍加改进,则可应用于各类动态并行计算问题所提出的动态负载均衡要求。     

冲击-接触问题有限元仿真的并行计算

冲击．接触问题广泛存在于汽车碰撞等的模拟计算中。简单介绍了求解该类问题的显式有限元方法，对显式有限元方法的并行性进行了讨论。根据显式有限元和冲击一接触问题的计算特点，设计并实现了接触均衡的分区算法。算例计算结果表明：该并行算法具有较好的加速比和并行效率。     

Extension of moment-method solutions to vector scattering by three-dimensional non-linear dielectric objects in free space

In this paper, we explore the possibility of applying the moment method to determine the electromagnetic field distributions inside three-dimensional bounded non-linear dielectric objects of arbitrary shapes. The moment method has usually been employed to solve linear scattering problems. We start with an integral equation formulation, and derive a non-linear system of algebraic equations that allows us to obtain an approximate solution for the harmonic vector components of the electric field. Preliminary results of some numerical simulations are reported.