X-FEM a good candidate for energy conservation in simulation of brittle dynamic crack propagation

This paper is devoted to the simulation of dynamic brittle crack propagation in an isotropic medium. It focuses on cases where the crack deviates from a straight-line trajectory and goes through stop-and-restart stages. Our argument is that standard methods such as element deletion or remeshing, although easy to use and implement, are not robust tools for this type of simulation essentially because they do not enable one to assess local energy conservation. Standard cohesive zone models behave much better when the crack’s path is known in advance, but are difficult to use when the crack’s path is unknown. The simplest method which consists in placing the cohesive segments along the sides of the finite elements leads to crack trajectories which are mesh-sensitive. The adaptive cohesive element formulation, which adds new cohesive elements when the crack propagates, is shown to have the proper energy conservation properties during remeshing. We show that the X-FEM is a good candidate for the simulation of complex dynamic crack propagation. A two-dimensional version of the proposed X-FEM approach is validated against dynamic experiments on a brittle isotropic plate.     

A hybrid finite element-scaled boundary finite element method for crack propagation modelling

This study develops a novel hybrid method that combines the finite element method (FEM) and the scaled boundary finite element method (SBFEM) for crack propagation modelling in brittle and quasi-brittle materials. A very simple yet flexible local remeshing procedure, solely based on the FE mesh, is used to accommodate crack propagation. The crack-tip FE mesh is then replaced by a SBFEM rosette. This enables direct extraction of accurate stress intensity factors (SIFs) from the semi-analytical displacement or stress solutions of the SBFEM, which are then used to evaluate the crack propagation criterion. The fracture process zones are modelled using nonlinear cohesive interface elements that are automatically inserted into the FE mesh as the cracks propagate. Both the FEM’s flexibility in remeshing multiple cracks and the SBFEM’s high accuracy in calculating SIFs are exploited. The efficiency of the hybrid method in calculating SIFs is first demonstrated in two problems with stationary cracks. Nonlinear cohesive crack propagation in three notched concrete beams is then modelled. The results compare well with experimental and numerical results available in the literature.     

Automatic LEFM crack propagation method based on local Lepp–Delaunay mesh refinement

A numerical method for 2D LEFM crack propagation simulation is presented. This uses a Lepp–Delaunay based mesh refinement algorithm for triangular meshes which allows both the generation of the initial mesh and the local modification of the current mesh as the crack propagates. For any triangle t, Lepp(t) (Longest Edge Propagation Path of t) is a finite, ordered list of increasing longest edge neighbor triangles, that allows to find a pair of triangles over which mesh refinement operations are easily and locally performed. This is particularly useful for fracture mechanics analysis, where high gradients of element size are needed. The crack propagation is simulated by using a finite element model for each crack propagation step, then the mesh near the crack tip is modified to take into account the crack advance. Stress intensify factors are calculated using the displacement extrapolation technique while the crack propagation angle is calculated using the maximum circumferential stress method. Empirical testing shows that the behavior of the method is in complete agreement with experimental results reported in the literature. Good results are obtained in terms of accuracy and mesh element size across the geometry during the process.     

Numerical simulation of multiple 3D fracture propagation using arbitrary meshes

This paper describes a mesh-independent finite element based method for propagating fractures in three dimensions. The iterative algorithm automatically grows fractures in a 3D brittle medium represented by an isotropic linear elastic matrix. Growth is controlled by an input failure and propagation criterion. The geometry and mesh are stored separately, and mesh refinement is topologically guided. Propagation results in the modification of crack geometry, as opposed to changes in the mesh, as the arbitrary tetrahedral mesh adapts to the evolving geometry. Stress intensity factors are computed using the volumetric J Integral on a virtual piecewise cylinder. Modal stress intensity factors are computed using the decomposition method. Mesh and cylinder size effects are studied, as is computational efficiency. A through-going crack embedded in a thick slab, and a horizontal and inclined penny-shape crack, are used to validate the accuracy of the method. The predicted stress intensity factors are in good agreement with analytical solutions. For six integration points per tip segment, integration local to single tips, and a cylinder radius that adapts to the local geometric conditions, results agree with analytical solutions with less than 5% deviation from experimental results.     

A parallel,multiscale domain decomposition method for the transient dynamic analysis of assemblies with friction

The objective of this work is to develop an efficient strategy for dynamic problems with multiple contacts. Our approach is based on the multiscale LATIN method with domain decomposition. This is a mixed method which deals simultaneously with the forces and velocities at the interfaces of the different subdomains. This strategy has already been applied successfully to a variety of static problems; here, it is extended to dynamics. First, we show how the multiscale strategy can be extended to dynamics. Then, we illustrate the capabilities of the method through a 3D academic example and the simulation of a heterogeneous material.     

Adjacency for grid generation and grid adaptation in Delaunay triangulation

One of the characteristics of Delaunay method for mesh generation is its local remeshing ability. The main part of the process is to identify remeshing block out of the whole domain and to execute remeshing on the block. Adjacency, adjacent element array, is introduced with an accompanying algorithm to make the process so simple and versatile that it will be used in generating the initial mesh, in applying mesh adaptation, in mesh revision for moving boundary problems, and in transforming 3-node base mesh to 6-node mesh. These features are demonstrated in the example problems of heat conduction with point sink, crack propagation, and simple upsetting of a circular cylinder. Proposition is made to take utility array ‘adjacency’ as basic element data.     

On a mixed and multiscale domain decomposition method

This paper presents a reexamination of a multiscale computational strategy with homogenization in space and time for the resolution of highly heterogeneous structural problems, focusing on its suitability for parallel computing. Spatially, this strategy can be viewed as a mixed, multilevel domain decomposition method (or, more accurately, as a “structure decomposition” method). Regarding time, a “parallel” property is also described. We also draw bridges between this and other current approaches.     

Feature sensitive multiscale editing on surfaces

A novel editing method for large triangular meshes is presented. We detect surface features, such as edge and corners, by computing local zero and first surface moments, using a robust and noise resistant method. The feature detection is encoded in a finite element matrix, passed to an algebraic multigrid (AMG) algorithm. The AMG algorithm generates a matrix hierarchy ranging from fine to coarse representations of the initial fine grid matrix. This hierarchy comes along with a corresponding multiscale of basis functions, which reflect the surface features on all hierarchy levels. We consider either these basis functions or distinct sets from an induced multiscale domain decomposition as handles for surface manipulation. We present a multiscale editor which enables Boolean operations on this domain decomposition and simply algebraic operations on the basis functions. Users can interactively design their favorite surface handles by simple grouping operations on the multiscale of domains. Several applications on large meshes underline the effectiveness and flexibility of the presented tool.     

Stable and realistic crack pattern generation using a cracking node method

This paper presents a method for simulating surface crack patterns appearing in ceramic glaze, glass, wood and mud. It uses a physically and heuristically combined method to model this type of crack pattern. A stress field is defined heuristically over the triangle mesh of an object. Then, a first-order quasi-static cracking node method (CNM) is used to model deformation. A novel combined stress and energy combined crack criterion is employed to address crack initiation and propagation separately according to physics. Meanwhile, a highest-stress-first rule is applied in crack initiation, and a breadth-first rule is applied in crack propagation. Finally, a local stress relaxation step is employed to evolve the stress field and avoid shattering artifacts. Other related issues are also discussed, such as the elimination of quadrature sub-cells, the prevention of parallel cracks and spurious crack procession. Using this method, a variety of crack patterns observed in the real world can be reproduced by changing a set of parameters. Consequently, our method is robust because the computational mesh is independent of dynamic cracks and has no sliver elements. We evaluate the realism of our results by comparing them with photographs of real-world examples. Further, we demonstrate the controllability of our method by varying different parameters.     

Domain Decomposition Models for Parallel Monte Carlo Transport

We present a strategy for parallelizing computations that use the transport method. It combines spatial domain decomposition with domain replication to realize the scaling benefits of replication while allowing for problems whose computational mesh will not fit in a single processor's memory. The mesh is decomposed into a small number of spatial domains—typically fewer domains than there are processors—and heuristics are used to estimate the computational effort required to generate the solution in each subdomain using Monte Carlo. That work estimate determines the number of times a subdomain is replicated relative to the others. Timing of runs for two problems show that the new method scales better than traditional domain decomposition.     

A parallel strategy for the multiparametric analysis of structures with large contact and friction surfaces

The objective of this work is to develop an efficient strategy for the resolution of many configurations of a quasi-static problem with multiple contacts. Our approach is based on the multiscale LATIN method with domain decomposition. Here we propose to take advantage of the capability of the LATIN method to reuse the solution of a given problem in order to solve many similar problems. We firstly introduce the LATIN method and compare our approach to different strategies commonly used to solve contact problems. Then, we illustrate the capabilities of our method through two examples.     

基于区域分解的并行动态LOD构建算法

面向大规模可视数据的高速绘制问题,提出了一种基于区域分解的并行动态LOD（level-of-detail,层次细节模型）构建算法。算法首先改进了传统的渐进网格方法,实现了基于二次误差测度网格简化算法的渐进网格方法;接着提出了一种基于模型包围盒的区域分解算法,实现了原始模型的自适应区域分解;在每个子区域上,并行地执行渐进网格方法,实现了模型的并行动态LOD构建。实验结果表明,该算法可生成高质量的LOD模型,具备理想的加速比和可扩放性;与串行算法相比,该算法有效地提高了算法的执行效率。     

On the use of XFEM within the Arlequin framework for the simulation of crack propagation

The Arlequin method is a generic numerical method that allows, by local superposition and coupling of models, to address multimodel and multiscale mechanical problems. In particular, this method has already been used to super-impose cracked patches on sound structures, reducing this way the global simulation resources a classical finite element approach would have required.In this paper, one of the key features of the extended-finite element method, namely the heaviside enrichment function, is used within the Arlequin framework to further reduce the costs of crack propagation simulations. The main goal of the paper is to describe the proposed methodology and to assess its performance through numerical experiments.     

Crack propagation analysis in civil engineering structures

A system for crack propagation analysis based on the finite element method is shown. The system is easily applied to the investigation of crack propagation behavior due to fatigue in arbitrary structural members of, for example, steel bridges. Moreover, the user can estimate the residual life of the structure with respect to the fatigue-crack. This paper also includes new mesh generation methods for this purpose, and several numerical examples show the efficiency of the mesh generation and the analysis system.     

A block LU-SGS implicit unsteady incompressible flow solver on hybrid dynamic grids for 2D external bio-fluid simulations

A hybrid dynamic grid generation technique for two-dimensional (2D) morphing bodies and a block lower-upper symmetric Gauss-Seidel (BLU-SGS) implicit dual-time-stepping method for unsteady incompressible flows are presented for external bio-fluid simulations. To discretize the complicated computational domain around 2D morphing configurations such as fishes and insect/bird wings, the initial grids are generated by a hybrid grid strategy firstly. Body-fitted quadrilateral (quad) grids are generated first near solid bodies. An adaptive Cartesian mesh is then generated to cover the entire computational domain. Cartesian cells which overlap the quad grids are removed from the computational domain, and a gap is produced between the quad grids and the adaptive Cartesian grid. Finally triangular grids are used to fill this gap. During the unsteady movement of morphing bodies, the dynamic grids are generated by a coupling strategy of the interpolation method based on ‘Delaunay graph’ and local remeshing technique. With the motion of moving/morphing bodies, the grids are deformed according to the motion of morphing body boundaries firstly with the interpolation strategy based on ‘Delaunay graph’ proposed by Liu and Qin. Then the quality of deformed grids is checked. If the grids become too skewed, or even intersect each other, the grids are regenerated locally. After the local remeshing, the flow solution is interpolated from the old to the new grid. Based on the hybrid dynamic grid technique, an efficient implicit finite volume solver is set up also to solve the unsteady incompressible flows for external bio-fluid dynamics. The fully implicit equation is solved using a dual-time-stepping approach, coupling with the artificial compressibility method (ACM) for incompressible flows. In order to accelerate the convergence history in each sub-iteration, a block lower-upper symmetric Gauss-Seidel implicit method is introduced also into the solver. The hybrid dynamic grid generator is tested by a group of cases of morphing bodies, while the implicit unsteady solver is validated by typical unsteady incompressible flow case, and the results demonstrate the accuracy and efficiency of present solver. Finally, some applications for fish swimming and insect wing flapping are carried out to demonstrate the ability for 2D external bio-fluid simulations.     

3D point of interest detection via spectral irregularity diffusion

This paper presents a method for detecting points of interest on 3D meshes. It comprises two major stages. In the first, we capture saliency in the spectral domain by detecting spectral irregularities of a mesh. Such saliency corresponds to the interesting portions of surface in the spatial domain. In the second stage, to transfer saliency information from the spectral domain to the spatial domain, we rely on spectral irregularity diffusion (SID) based on heat diffusion. SID captures not only the information about neighbourhoods of a given point in a multiscale manner, but also cues related to the global structure of a shape. It thus preserves information about both local and global saliency. We finally extract points of interest by looking for global and local maxima of the saliency map. We demonstrate the advantages of our proposed method using both visual and quantitative comparisons based on a publicly available benchmark.     

Fast and robust level set update for 3D non-planar X-FEM crack propagation modelling

In the X-FEM framework, the need to represent a discontinuity independently of the structural mesh relies on the level set technique. Hence crack propagation can be simulated by an update of two distinct level sets, the evolution of which is described by differential equations. The aim of this paper is to analyse the resolution of these equations in order to formulate a robust and fast numerical process allowing 3D crack propagation simulations even in presence of high kink angles occurring in mixed mode propagation. The numerical integration is accomplished by means of a robust finite difference upwind scheme applied to an auxiliary regular grid. An alternative level set update equation and a fast localisation of the integration domain, specifically developed for crack propagation problems, are formulated and proposed in the paper in order to gain in stability, robustness and performance.     

A local tangential lifting differential method for triangular meshes

In this note we present a local tangential lifting (LTL) algorithm to compute differential quantities for triangular meshes obtained from regular surfaces. First, we introduce a new notation of the local tangential polygon and lift functions and vector fields on a triangular mesh to the local tangential polygon. Then we use the centroid weights proposed by Chen and Wu [4] to define the discrete gradient of a function on a triangular mesh. We also use our new method to define the discrete Laplacian operator acting on functions on triangular meshes. Higher order differential operators can also be computed successively. Our approach is conceptually simple and easy to compute. Indeed, our LTL method also provides a unified algorithm to estimate the shape operator and curvatures of a triangular mesh and derivatives of functions and vector fields. We also compare three different methods : our method, the least square method and Akima’s method to compute the gradients of functions.     

Multiscale Representation and Compression of 3-D Point Data

A compact representation scheme is presented for 3-D point data. To describe underlying surface from raw point samples, we dyadically divide a 3-D domain enclosing whole points. Then, local points in each cube are approximated by a plane patch, yielding a multiscale representation of 3-D surface. To reduce the redundancy between different scale models, the geometry innovation is evaluated between different scale planes, which reveals the Euclidian distance between planes. Finally, the geometry innovation coefficients are compressed by a zerotree-based encoder. Based on the multiscale plane representation of 3-D geometry and the efficient plane decomposition method, the proposed scheme provides a desirable framework for 3-D point geometry processing.