首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
    
The discrete crack mechanics (DCM) method is a dislocation-based crack modeling technique where cracks are constructed using Volterra dislocation loops. The method allows for the natural introduction of displacement discontinuities, avoiding numerically expensive techniques. Mesh dependence in existing computational modeling of crack growth is eliminated by utilizing a superposition procedure. The elastic field of cracks in finite bodies is separated into two parts: the infinite-medium solution of discrete dislocations and an finite element method solution of a correction problem that satisfies external boundary conditions. In the DCM, a crack is represented by a dislocation array with a fixed outer loop determining the crack tip position encompassing additional concentric loops free to expand or contract. Solving for the equilibrium positions of the inner loops gives the crack shape and stress field. The equation of motion governing the crack tip is developed for quasi-static growth problems. Convergence and accuracy of the DCM method are verified with two- and three-dimensional problems with well-known solutions. Crack growth is simulated under load and displacement (rotation) control. In the latter case, a semicircular surface crack in a bent prismatic beam is shown to change shape as it propagates inward, stopping as the imposed rotation is accommodated.  相似文献   

2.
    
The edge‐based smoothed finite element method (ES‐FEM) was proposed recently in Liu, Nguyen‐Thoi, and Lam to improve the accuracy of the FEM for 2D problems. This method belongs to the wider family of the smoothed FEM for which smoothing cells are defined to perform the numerical integration over the domain. Later, the face‐based smoothed FEM (FS‐FEM) was proposed to generalize the ES‐FEM to 3D problems. According to this method, the smoothing cells are centered along the faces of the tetrahedrons of the mesh. In the present paper, an alternative method for the extension of the ES‐FEM to 3D is investigated. This method is based on an underlying mesh composed of tetrahedrons, and the approximation of the field variables is associated with the tetrahedral elements; however, in contrast to the FS‐FEM, the smoothing cells of the proposed ES‐FEM are centered along the edges of the tetrahedrons of the mesh. From selected numerical benchmark problems, it is observed that the ES‐FEM is characterized by a higher accuracy and improved computational efficiency as compared with linear tetrahedral elements and to the FS‐FEM for a given number of degrees of freedom. Copyright © 2013 John Wiley & Sons, Ltd.  相似文献   

3.
    
This work comprises a detailed theoretical and computational study of the boundary value problem for transversely isotropic linear elastic bodies. General conditions for well-posedness are derived in terms of the material parameters. The discrete form of the displacement problem is formulated for conforming finite element approximations. The error estimate reveals that anisotropy can play a role in minimising or even eliminating locking behaviour for moderate values of the ratio of Young's moduli in the fibre and transverse directions. In addition to the standard conforming approximation, an alternative formulation, involving under-integration of the volumetric and extensional terms in the weak formulation, is considered. The latter is equivalent to either a mixed or a perturbed Lagrangian formulation, analogously to the well-known situation for the volumetric term. A set of numerical examples confirms the locking-free behaviour in the near-incompressible limit of the standard formulation with moderate anisotropy, with locking behaviour being clearly evident in the case of near-inextensibility. On the other hand, under-integration of the extensional term leads to extensional locking-free behaviour, with convergence at superlinear rates.  相似文献   

4.
    
Many computational science tools employ finite element meshes as discretizations of the geometrical domains, and automatic mesh generation has become an indispensable part of the discretization process. Boundary representations (BRep) of solids are the means of describing the geometrical model to the mesher, thus enabling the generator to proceed without user intervention. Significant effort has been devoted in the past to BRep construction in the frame‐work of solid modelling systems. In this paper we consider the task of converting a tesselation (triangulation) of the surface of a solid into a BRep, and propose a robust and efficient set of algorithms for this purpose. Applications include, among others, remeshing of finite element discretizations during simulations involving not only geometric distortion but also changes in topology (coalescence and fragmentation of solids, flow, and so on). Copyright © 2001 John Wiley & Sons, Ltd.  相似文献   

5.
Three-dimensional (3-D) finite element mesh generation has been the target of automation due to the complexities associated with generating and visualizing the mesh. A fully automatic 3-D mesh generation method is developed. The method is capable of meshing CSG solid models. It is based on modifying the classical ray-casting technique to meet the requirements of mesh generation. The modifications include the utilization of the element size in the casting process, the utilization of 3-D space box enclosures, and the casting of ray segments (rays with finite length). The method begins by casting ray segments into the solid. Based on the intersections between the segments and the solid boundary, the solid is discretized into cells arranged in a structure. The cell structure stores neighbourhood relations between its cells. Each cell is meshed with valid finite elements. Mesh continuity between cells is achieved via the neighbourhood relations. The last step is to process the boundary elements to represent closely the boundary. The method has been tested and applied to a number of solid models. Sample examples are presented.  相似文献   

6.
7.
8.
    
A novel scheme is presented for incorporating finite thickness cohesive interfaces in virtual grain structures for crystal plasticity finite element (CPFE) analyses of intergranular crack initiation and propagation. A Voronoi tessellation model is used to define the virtual grain structure, with automatically generated nonzero thickness cohesive zones (CZs) representing the grain boundaries and multiple junctions. An efficient grain boundary offsetting algorithm is presented, and issues related to automatically partitioning multiple junctions are discussed. Two feasible junction partitioning schemes are presented, the second of which has the advantage of partitioning junctions using uniform quadrilateral elements and naturally defining their normal and tangential directions. For the second scheme, a rule‐based method is presented that carries out the preliminary meshing of CZ junctions, including data representation, edge event processing, and cut and trim operations. A virtual grain structure modelling system, VGRAIN, is introduced to implement the proposed CZ junction partitioning method and directly generate meshed virtual grain structures with CZ grain boundaries for CPFE studies. To demonstrate the proposed junction partitioning and CZ representation schemes, two finite strain CPFE simulations are presented for plane strain uniaxial tension and three‐point bending, demonstrating large‐scale crack initiation and propagation under shear and opening modes. Copyright © 2012 John Wiley & Sons, Ltd.  相似文献   

9.
    
It is well known that solutions for linear partial differential equations may be given in terms of fundamental solutions. The fundamental solutions solve the homogeneous equation exactly and are obtained from the solution of the inhomogeneous equation where the inhomogeneous term is described by a Dirac delta distribution. Fundamental solutions are the building blocks of the boundary element method and of the method of fundamental solutions and are traditionally used to build boundary‐only global approximations in the domain of interest. In this work the same characteristic of the fundamental solutions, that of solving the homogeneous equation exactly, is used but not to build a global approximation. On the contrary, local approximations are built in such a manner that it is possible to construct finite difference operators that are free from any form of structured grid. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   

10.
有限元网格生成及节点编号优化是有限元分析的关键技术之一。在有限元计算过程中,可通过优化节点编号来减少整体刚度矩阵的带宽,从而节约存储空间,减少有限元分析的计算时间。通过分析有限元网格的拓扑关系,依据单元节点相关性,提出了构造单元节点拓扑阵和组装有限元网格整体节点拓扑阵的有效方法,为优化有限元网格节点编号,减小有限元方程组中总体刚度矩阵的带宽奠定了基础。  相似文献   

11.
    
We study the simultaneous analysis and design (SAND) formulation of the ‘classical’ topology optimization problem subject to linear constraints on material density variables. Based on a dual method in theory, and a primal‐dual method in practice, we propose a separable and strictly convex quadratic Lagrange–Newton subproblem for use in sequential approximate optimization of the SAND‐formulated classical topology design problem. The SAND problem is characterized by a large number of nonlinear equality constraints (the equations of equilibrium) that are linearized in the approximate convex subproblems. The availability of cheap second‐order information is exploited in a Lagrange–Newton sequential quadratic programming‐like framework. In the spirit of efficient structural optimization methods, the quadratic terms are restricted to the diagonal of the Hessian matrix; the subproblems have minimal storage requirements, are easy to solve, and positive definiteness of the diagonal Hessian matrix is trivially enforced. Theoretical considerations reveal that the dual statement of the proposed subproblem for SAND minimum compliance design agrees with the ever‐popular optimality criterion method – which is a nested analysis and design formulation. This relates, in turn, to the known equivalence between rudimentary dual sequential approximate optimization algorithms based on reciprocal (and exponential) intervening variables and the optimality criterion method. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

12.
    
Methods to compute the stress intensity factors along a three-dimensional (3D) crack front often display a tenuous rate of convergence under mesh refinement or, worse, do not converge, particularly when applied on unstructured meshes. In this work, we propose an alternative formulation of the interaction integral functional and a method to compute stress intensity factors along the crack front which can be shown to converge. The novelty of our method is the decoupling of the two discretizations: the bulk mesh for the finite element solution and the mesh along the crack front for the numerical stress intensity factors, and hence we term it the multiple mesh interaction integral (MMII) method. Through analysis of the convergence of the functional and method, we find scalings of these two mesh sizes to guarantee convergence of the computed stress intensity factors in a variety of norms, including maximum pointwise error and total variation. We demonstrate the MMII on four examples: a semiinfinite straight crack with the asymptotic displacement fields, the same geometry with a nonuniform stress intensity factor along the crack front, a spherical cap crack in a cylinder under tension, and the elliptical crack under far-field tension and shear.  相似文献   

13.
    
Optimal design of structures for fracture resistance is a challenging subject. This appears to be largely due to the strongly nonlinear governing equations associated with explicitly modeling fracture propagation. We propose a topology optimization formulation, in which low weight structures are obtained with significantly increased resistance to brittle fracture, in which crack propagation is explicitly modeled with the phase field approach. By contrast to our previous work, several important features are included which greatly assist the optimizer in dealing with the strongly discontinuous brittle fracture process, including a new objective function, which provides additional path information to the optimizer. Increased local control of the topology is introduced via a smoothed threshold function in the phase field fracture formulation and a constraint relaxation continuation scheme is proposed to alleviate some difficulty during the initial optimization iterations. The derivation of the analytical, path-dependent sensitivities for the relevant functions is provided and the results from two benchmark numerical examples are presented which demonstrate the effectiveness of the proposed method.  相似文献   

14.
This paper describes an efficient algorithm for fully automated three-dimensional finite element meshing which is applicable to non-convex geometry and non-manifold topology. This algorithm starts with sparsely placed nodes on the boundaries of a geometric model and a corresponding 3-D Delaunay triangulation. Nodes are then inserted incrementally by checking the tetrahedral mesh geometry and topological compatibility between Delaunay triangulation and the geometric model. Topological compatibility is checked in a robust manner by a method which relies more on a mesh's topology than its geometry. The node placement strategy is tightly coupled to an incremental Delaunay triangulation algorithm, and results in a low growth rate of computational time.  相似文献   

15.
16.
    
A new generalized damage model for quasi‐incompressible hyperelasticity in a total Lagrangian finite‐strain framework is presented. A Kachanov‐like reduction factor (1 ? D) is applied on the deviatoric part of the hyperelastic constitutive model. Linear and exponential softening are defined as damage evolution laws, both describable in terms of only two material parameters. The model is formulated following continuum damage mechanics theory such that it can be particularized for any hyperelastic model based on the volumetric–isochoric split of the Helmholtz free energy. However, in the present work, it has been implemented in an in‐house finite element code for neo‐Hooke and Ogden hyperelasticity. The details of the hybrid formulation used are also described. A couple of three‐dimensional examples are presented to illustrate the main characteristics of the damage model. The results obtained reproduce a wide range of softening behaviors, highlighting the versatility of the formulation proposed. The damage formulation has been developed to be used in conjunction with mixing theory in order to model the behavior of fibered biological tissues. As an example, the markedly different behaviors of the fundamental components of the rectus sheath were reproduced using the damage model, obtaining excellent correlation with the experimental results from literature. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

17.
    
Uniform grid solvers of the periodic Lippmann–Schwinger equation have been introduced by Moulinec and Suquet for the numerical homogenization of heterogeneous materials. Based on the fast Fourier transform, these methods use the strain as main unknown and usually do not produce displacement fields. While this is generally not perceived as a restriction for homogenization purposes, some tasks might require kinematically admissible displacement fields. In this paper, we show how the numerical solution to the periodic Lippmann–Schwinger equation can be post‐processed to reconstruct a displacement field. Our procedure applies to any variant of the Moulinec–Suquet solver. The reconstruction is formulated as an auxiliary elastic equilibrium problem of a homogeneous material, which is solved with displacement‐based finite elements. Taking advantage of periodicity, uniformity of the grid and homogeneity of the material, the resulting linear system is formulated and solved efficiently in Fourier space. The cost of our procedure is lower than that of one iteration of the Lippmann–Schwinger solver. Two applications are proposed, in two and three dimensions. In the first application, the reconstructed displacement field is used to compute a rigorous upper bound on the effective shear modulus. In the second application, the quality of the reconstruction is assessed quantitatively. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

18.
    
This paper presents a novel compact adjacency‐based topological data structure for finite element mesh representation. The proposed data structure is designed to support, under the same framework, both two‐ and three‐dimensional meshes, with any type of elements defined by templates of ordered nodes. When compared to other proposals, our data structure reduces the required storage space while being ‘complete’, in the sense that it preserves the ability to retrieve all topological adjacency relationships in constant time or in time proportional to the number of retrieved entities. Element and node are the only entities explicitly represented. Other topological entities, which include facet, edge, and vertex, are implicitly represented. In order to simplify accessing topological adjacency relationships, we also define and implicitly represent oriented entities, associated to the use of facets, edges, and vertices by an element. All implicit entities are represented by concrete types, being handled as values, which avoid usual problems encountered in other reduced data structures when performing operations such as entity enumeration and attribute attachment. We also extend the data structure with the use of ‘reverse indices’, which improves performance for extracting adjacency relationships while maintaining storage space within reasonable limits. The data structure effectiveness is demonstrated by two different applications: for supporting fragmentation simulation and for supporting volume rendering algorithms. Copyright © 2005 John Wiley & Sons, Ltd.  相似文献   

19.
    
A new way of describing the density field in density‐based topology optimization is introduced. The new method uses finite elements constructed from Bernstein polynomials rather than the more common Lagrange polynomials. Use of the Bernstein finite elements allows higher‐order elements to be used in the density‐field interpolation without producing unrealistic density values, ie, values lower than zero or higher than one. Results on several test problems indicate that using the higher‐order Bernstein elements produces optimal designs with sharper estimates of the optimal boundary on coarse design meshes. However, higher‐order elements are also required in the structural analysis to prevent the appearance of unrealistic material distributions. The Bernstein element density interpolation can be combined with adaptive mesh refinement to further improve design accuracy even on design domains with complex geometry.  相似文献   

20.
In this paper an incremental constitutive theory for the deformation due to switching in ferroelectrics is applied to predict the fracture toughness anisotropy in these materials after mechanical poling. Mechanical poling of an initially unpoled specimen differs from electrical poling in that only mechanical stresses are applied to the material. Therefore, no electrical polarization can develop. After mechanical poling, for example by a uniaxial applied stress, the fracture toughness of a ferroelectric ceramic for cracks running parallel or orthogonal to the poling direction will differ. Finite element computations of the steady crack growth process have been carried out to quantify these differences. Results are generated for a range of constitutive properties for three crack growth directions with respect to the initial mechanical poling direction. The results are discussed in relation to available experimental data and to the toughness anisotropy due to electrical poling.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号