共查询到20条相似文献,搜索用时 15 毫秒
1.
J.‐C. Passieux J.‐N. Périé M. Salaün 《International journal for numerical methods in engineering》2015,102(10):1670-1682
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. 相似文献
2.
The reproducing kernel element method is a hybrid between finite elements and meshfree methods that provides shape functions
of arbitrary order and continuity yet retains the Kronecker-δ property. To achieve these properties, the underlying mesh must meet certain regularity constraints. This paper develops
a precise definition of these constraints, and a general algorithm for assessing a mesh is developed. The algorithm is demonstrated
on several mesh types. Finally, a guide to generation of quasi-uniform meshes is discussed. 相似文献
3.
This work presents a novel iterative approach for mesh partitioning optimization to promote the efficiency of parallel nonlinear
dynamic finite element analysis with the direct substructure method, which involves static condensation of substructures'
internal degrees of freedom. The proposed approach includes four major phases – initial partitioning, substructure workload
prediction, element weights tuning, and partitioning results adjustment. The final three phases are performed iteratively
until the workloads among the substructures are balanced reasonably. A substructure workload predictor that considers the
sparsity and ordering of the substructure matrix is used in the proposed approach. Several numerical experiments conducted
herein reveal that the proposed iterative mesh partitioning optimization often results in a superior workload balance among
substructures and reduces the total elapsed time of the corresponding parallel nonlinear dynamic finite element analysis.
Received 22 August 2001 / Accepted 20 January 2002 相似文献
4.
R. Piltner R. L. Taylor 《International journal for numerical methods in engineering》1995,38(11):1783-1808
An improved plane strain/stress element is derived using a Hu–Washizu variational formulation with bilinear displacement interpolation, seven strain and stress terms, and two enhanced strain modes. The number of unknowns of the four-node element is increased from eight to ten degrees of freedom. For linear and non-linear applications, the two unknowns associated with the enhanced strain terms can be eliminated by static condensation so that eight displacement degrees of freedom remain for the proposed element, which is denoted by QE2. The excellent performance of the proposed element is demonstrated using several linear and non-linear examples. 相似文献
5.
Adaptive generation of hexahedral element meshes for finite element analysis of metal plastic forming process 总被引:1,自引:0,他引:1
A method for the adaptive generation of hexahedral element mesh based on the geometric features of solid model is proposed. The first step is to construct the refinement information fields of source points and the corresponding ones of elements according to the surface curvature of the analyzed solid model. A thickness refinement criterion is then used to construct the thickness-based refinement information field of elements from digital topology. The second step is to generate a core mesh through removing all the undesired elements using even and odd parity rules. Then the core mesh is magnified in an inside–out manner method through a surface node projection process using the closest position approach. Finally, in order to match the mesh to the characteristic boundary of the solid model, a threading method is proposed and applied. The present method was applied in the mesh construction of different engineering problems. The resulting meshes are well-shaped and capture all the geometric features of the original solid models. 相似文献
6.
G. Legrain R. Allais P. Cartraud 《International journal for numerical methods in engineering》2011,86(6):717-743
This paper describes the use of the extended finite element method in the context of quadtree/octree meshes. Particular attention is paid to the enrichment of hanging nodes that inevitably arise with these meshes. An approach for enforcing displacement continuity along hanging edges and faces is proposed and validated on various numerical examples (holes, material interfaces, and singularities) in both 2D and 3D. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
7.
Cengiz Yeker Ibrahim Zeid 《International journal for numerical methods in engineering》1995,38(15):2573-2601
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. 相似文献
8.
Charbel Farhat Po-Shu Chen Franck Risler Francois-Xavier Roux 《International journal for numerical methods in engineering》1998,42(2):257-288
The FETI algorithms are a family of numerically scalable substructuring methods with Lagrange multipliers that have been designed for solving iteratively large-scale systems of equations arising from the finite element discretization of structural engineering, solid mechanics, and structural dynamics problems. In this paper, we present a unified framework that simplifies the interpretation of several of the previously presented FETI concepts. This framework has enabled the improvement of the robustness and performance of the transient FETI method, and the design of a new family of coarse operators for iterative substructuring algorithms with Lagrange multipliers. We report on both of these new developments, discuss their impact on the iterative solution of large-scale finite element systems of equations by the FETI method, and illustrate them with a few static and dynamic structural analyses on an IBM SP2 parallel processor. © 1998 John Wiley & Sons, Ltd. 相似文献
9.
David O. Potyondy Paul A. Wawrzynek Anthony R. Ingraffea 《International journal for numerical methods in engineering》1995,38(16):2677-2701
A new hybrid algorithm for automatically generating either an all-quadrilateral or an all-triangular element mesh within an arbitrarily shaped domain is described. The input consists of one or more closed loops of straight-line segments that bound the domain. Internal mesh density is inferred from the boundary density using a recursive spatial decomposition (quadtree) procedure. All-triangular element meshes are generated using a boundary contraction procedure. All-quadrilateral element meshes are generated by modifying the boundary contraction procedure to produce a mixed element mesh at half the density of the final mesh and then applying a polygon-splitting procedure. The final meshes exhibit good transitioning properties and are compatible with the given boundary segments which are not altered. The algorithm can support discrete crack growth simulation wherein each step of crack growth results in an arbitrarily shaped region of elements deleted about each crack tip. The algorithm is described and examples of the generated meshes are provided for a representative selection of cracked and uncracked structures. 相似文献
10.
Comparison of finite element reliability methods 总被引:7,自引:0,他引:7
The spectral stochastic finite element method (SSFEM) aims at constructing a probabilistic representation of the response of a mechanical system, whose material properties are random fields. The response quantities, e.g. the nodal displacements, are represented by a polynomial series expansion in terms of standard normal random variables. This expansion is usually post-processed to obtain the second-order statistical moments of the response quantities. However, in the literature, the SSFEM has also been suggested as a method for reliability analysis. No careful examination of this potential has been made yet. In this paper, the SSFEM is considered in conjunction with the first-order reliability method (FORM) and with importance sampling for finite element reliability analysis. This approach is compared with the direct coupling of a FORM reliability code and a finite element code. The two procedures are applied to the reliability analysis of the settlement of a foundation lying on a randomly heterogeneous soil layer. The results are used to make a comprehensive comparison of the two methods in terms of their relative accuracies and efficiencies. 相似文献
11.
This paper describes an efficient, accurate and simple implementation of an algorithm for generation of quadrilateral finite element meshes. An original algorithm by Talbert and Parkinson [J.A. Talbert, A. Parkinson, Development of an automatic two-dimensional finite element mesh generator using quadrilateral elements and Bezier curve boundary definition, Int. J. Numer. Meth. Eng., 29 (1990) 1551–1567], has been substantially redeveloped and modified and presented in greater detail. We cover several important issues omitted in publication mentioned and we will provide interested readers with fully documented source code of the program. 相似文献
12.
Peng Liu Chao‐Fu Wang 《International journal for numerical methods in engineering》2013,93(7):770-794
This paper presents a bubble‐inspired algorithm for partitioning finite element mesh into subdomains. Differing from previous diffusion BUBBLE and Center‐oriented Bubble methods, the newly proposed algorithm employs the physics of real bubbles, including nucleation, spherical growth, bubble–bubble collision, reaching critical state, and the final competing growth. The realization of foaming process of real bubbles in the algorithm enables us to create partitions with good shape without having to specify large number of artificial controls. The minimum edge cut is simply achieved by increasing the volume of each bubble in the most energy efficient way. Moreover, the order, in which an element is gathered into a bubble, delivers the minimum number of surface cells at every gathering step; thus, the optimal numbering of elements in each subdomain has naturally achieved. Because finite element solvers, such as multifrontal method, must loop over all elements in the local subdomain condensation phase and the global interface solution phase, these two features have a huge payback in terms of solver efficiency. Experiments have been conducted on various structured and unstructured meshes. The obtained results are consistently better than the classical kMetis library in terms of the edge cut, partition shape, and partition connectivity. Copyright © 2012 John Wiley & Sons, Ltd. 相似文献
13.
The conventional finite element method has been modified to allow the elastic stresses along the free boundaries of a structure to be determined with improved accuracy. The results obtained by this 'modified' method are compared with both a photo-elastic and some traditional finite element solutions. 相似文献
14.
Panayiotis Papadopoulos Reese E. Jones Jerome M. Solberg 《International journal for numerical methods in engineering》1995,38(15):2603-2617
This article advocates a new methodology for the finite element solution of contact problems involving bodies that may undergo finite motions and deformations. The analysis is based on a decomposition of the two-body contact problem into two simultaneous sub-problems, and results naturally in geometrically unbiased discretization of the contacting surfaces. A proposed two-dimensional contact element is specifically designed to unconditionally allow for exact transmission of constant normal traction through interacting surfaces. 相似文献
15.
16.
A. Schwarz J. Schröder G. Starke 《International journal for numerical methods in engineering》2010,81(3):286-306
The main goal of this contribution is to provide an improved mixed finite element for quasi‐incompressible linear elasticity. Based on a classical least‐squares formulation, a modified weak form with displacements and stresses as process variables is derived. This weak form is the basis for a finite element with an advanced fulfillment of the momentum balance and therefore with a better performance. For the continuous approximation of stresses and displacements on the triangular and tetrahedral elements, lowest‐order Raviart–Thomas and linear standard Lagrange interpolations can be used. It is shown that coercivity and continuity of the resulting asymmetric bilinear form could be established with respect to appropriate norms. Further on, details about the implementation of the least‐squares mixed finite elements are given and some numerical examples are presented in order to demonstrate the performance of the proposed formulation. Copyright © 2009 John Wiley & Sons, Ltd. 相似文献
17.
In this paper we present a mixed stabilized finite element formulation that does not lock and also does not exhibit unphysical
oscillations near the incompressible limit. The new mixed formulation is based on a multiscale variational principle and is
presented in two different forms. In the first form the displacement field is decomposed into two scales, coarse-scale and
fine-scale, and the fine-scale variables are eliminated at the element level by the static condensation technique. The second
form is obtained by simplifying the first form, and eliminating the fine-scale variables analytically yet retaining their
effect that results with additional (stabilization) terms. We also derive, in a consistent manner, an expression for the stabilization
parameter. This derivation also proves the equivalence between the classical mixed formulation with bubbles and the Galerkin
least-squares type formulations for the equations of linear elasticity. We also compare the performance of this new mixed
stabilized formulation with other popular finite element formulations by performing numerical simulations on three well known
test problems. 相似文献
18.
19.
In this contribution, we deal with a posteriori error estimates and adaptivity for mixed finite element discretizations of
second-order elliptic equations, which are applied to the Poisson equation. The method proposed is an extension to the one
recently introduced in [10] to the case of inhomogeneous Dirichlet and Neumann boundary conditions. The residual-type a posteriori
error estimator presented in this paper relies on a postprocessed and therefore improved solution for the displacement field
which can be computed locally, i.e. on the element level. Furthermore, it is shown that this discontinuous postprocessed solution
can be further improved by an averaging technique. With these improved solutions at hand, both upper and lower bounds on the
finite element discretization error can be obtained. Emphasis is placed in this paper on the numerical examples that illustrate
our theoretical results. 相似文献