Professional Documents
Culture Documents
A Study on
n Mesh Free Methods: A Different Form of FEM
Vimalkumar P. Palsanawala
L
Lecturer-Mechanical Engineering,
Dr. S. & S. S. Ghandhy College of Engineering & Technology, Surat, Gujarat,
Gujarat India
ABSTRACT
Roots of Mesh-freefree methods go back to the seventies. In FDM, the meshes used are also often called grids;
The major difference to finite element methods is that in the FVM, the meshes are called
cal volumes or cells;
the domain of interest is discretized only with nodes, and in FEM, the meshes are called elements. The
often called particles. These particles interact via terminologies of grids, volumes, cells, and elements
mesh-free
free shape functions in a continuum framework carry sometimes certain physical meanings as they are
similar as finite elements do although particle defined for different physical problems. All these
“connectivity” can change over the course of a grids, volumes, cells, and elements
lements can be termed
simulation. This flexibility of mesh-free
free methods has meshes in accordance with the definition of mesh.
been exploited in applications with large deformations The mesh must be predefined to provide a certain
inn fluid and solid mechanics, e.g. to name a few, free
free- relationship between the nodes, which becomes the
surface flow, metal forming, fracture and building blocks of the formulation procedure of the
fragmentation, to name a few. Though there are a few well known conventional numerical methods.
publications on mesh-freefree methods formulated in an
Eulerian (or ALE) description, e.g. Fries 2005, most The mesh-free
free methods establish a system of
mesh-free
free methods are pure Lagrangian in character. algebraic equations for the whole problem domain
The non negligible advantages of meshmesh-free methods without the use of a predefined mesh, or use easily
as compared to finite elements are: their higher order generable meshes in a much more flexible or ‘‘freer’’
continuous shape functions that can be exploited e.g. manner. Mesh-free
free methods essentially use a set
se of
for thin shells; higher smoothness; certain adv
advantages nodes scattered within the problem domain as well as
in crack propagation problems. The most unhidden on the boundaries to represent the problem domain
drawback of mesh-free free methods is probably their and its boundaries. The field functions are then
higher computational cost, regardless of some approximated locally using these nodes.
instabilities that certain mesh-free
free methods have. The
paper deals with the basic methodology of meshmesh-free Some of the mesh-freefree methods are often termed
methods along with the mathematics involved. mesh-less method.
ethod. The ideal requirement for a
‘‘mesh-less’’ method is:
KEYWORD: discretization, FDM, FEM, FVM, No mesh is necessary at all throughout the process
Eigen-value,
value, triangulation, shape function, of solving the problem of given arbitrary
collocation, SPH geometry governed by partial differential system
equations subject to all kinds of boundary
I. INTRODUCTION conditions.
In the traditional FEM [1, 3], the FDM [5], and the The work published so far conclude that the mesh-
mesh
FVM [6], the spatial domain in problem is discretized free methods developed so far are not entirely
into meshes. A mesh is defined as any of the open ‘‘mesh-less’’
less’’ and fall in one of the following
spaces or interstices between the strands of a net that categories:
is formed by connecting nodes in a predefined Methods that require background cells for the
manner. integration of system matrices derived from the
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2355
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN:
ISSN 2456-6470
(1)
Where,
Sn is the set of local nodes included in a ‘‘small local
domain’’ of the point x, such a local domain is called
support domain, and the set of local nodes are called
support nodes
Figure - 2: a tetrahedral mesh of elements or
ui is the nodal field variable at the ith node in the
background cells for a complicated
cated 3D domain
support domain
III. BASIC TECHNIQUES FOR MESH MESH-FREE ds is the vector that collects all the nodal field
METHODS: variables at these support nodes
The general procedure and basic steps for mesh
mesh-free
methods are presented here under through an example
ɸi(x) is the shape function of the ith node created using
of structural problem.
all the support nodes in the support domain and is
often called nodal shape function
A. Basic steps:
Step 1: Domain representation or discretization:
A support domain of a point x determines the number
The geometry of the solid or structure is first created
of nodes to be used to approximate the function value
in a CAE code or pre processor, and is triangulated to
at x. A support domain can be weighted using
produce a set of triangular type cells with a set of
functions that vanish on the boundary of the support
nodes scattered in the problem domain and its
domain, as shown in Figure--3. It can have different
boundary. Boundary conditions and loading
shapes and its dimension and shape can be different
conditions
ns are then specified for the model. The
for different points of interest x, as shown in Figure-4.
Figure
density of the nodes depends on the presentation
The shapes most often used are circular or
accuracy of the geometry, the accuracy requirement of
rectangular, or any shape to include desired
the solution, and the limits of the computer resources
supporting nodes. The concept of support domain
available.. The nodal distribution is usually not
works well ll if the nodal density does not vary too
uniform and a denser distribution of nodes is often
drastically in the problem domain. However, in
used in the area where the displacement gradient is
solving practical problems, such as problems with
larger. Because adaptive algorithms can be used in
stress singularity, the nodal density can vary
mesh-free
free methods, the density is eventually
drastically. The use of a support domain based on the
controlled automatically and adaptively in the code of
current point of interest can lead to spatially biased
the mesh-free
free method, we do not have to worry too
selection of nodes for the construction of shape
much about the distribution quality of the initial nodes
functions.
used in usual situations. In addition, as a mesh
mesh-free
method, it should not demand too much for the pattern
of nodal distribution. It should be workable withiwithin
reason for arbitrarily distributed nodes. Because the
nodes shall carry the values of the field variables in a
mesh-free
free formulation, they are often called field
nodes.
Step 3: Formation of system equations: For computational fluid dynamics problems, the
The discrete equations of a mesh-free method can be discretized system equations are basically nonlinear,
formulated using the shape functions and weak or and one needs an additional iteration loop to obtain
weakened-weak forms. These equations are often the results.
written in nodal matrix form and are assembled into
the global system matrices for the entire problem B. Triangulation:
domain. The procedures for forming system equations Consider a d-dimensional problem domain of Ω Є Rd
are different for different mesh-free methods. bounded by Γ. By default, we speak of ‘‘open’’
domain that does not include the boundary of the
Step 4: Solving the global mesh-free equations: domain. When we refer to a ‘‘closed’’ domain we will
Solving the set of global mesh-free equations, we specifically use a box: Ω = Ω ∩ Γ.
obtain solutions for different types of problems.
Triangulation is the most flexible way to create
1. For static problems, the displacements at all the background triangular cells for mesh-free operations.
nodes in the entire problem domain are first The process can be almost fully automated for 2D and
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2357
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN:
ISSN 2456-6470
even 3D domains with complicated geometry.
Therefore, it is used in most commercial pre
processors using
sing processes such as the widely used
Delaunay triangulation. (2)
T3-Scheme:
In the T3-scheme,
scheme, we simply select three nodes of the
home cell of the point of interest. As illustrated in
Fig-77 (a), no matter the point of interest x located in
an interior home cell (cell i) or a boundary home cell
(cell j), only the three nodes of the home cell (i1_i3 or
j1_j3) are selected. T3-scheme iss used only for
creating linear PIM (Point Interpolation Method)
shape functions by using polynomial basis functions.
Note that the linear PIM shape functions so
constructed are exactly the same as those in FEM
using linear triangular elements.
T4-Scheme:
scheme, but of
T4-scheme is the analogy of the T3-scheme,
node selection for 3D domains with tetrahedral
background cells.
Figure - 7 (a) T3 Scheme, (b) T6/3-Scheme, (c) T6-
T6/3-Scheme: Scheme , (d) & (e) T2L-Scheme
scheme selects six nodes to interpolate a
The T6/3-scheme
point of interest located in an interior cell and three T6-Scheme:
nodes for those located
ated in boundary home cells. As Similar to T6/3-scheme,
scheme, T6-scheme,
T6 as shown in
illustrated in Figure-77 (b), when the point of interest Figure-77 (c), also selects six nodes for an interior
xQ is located in an interior home cell (cell i), we select home cell: three nodes of the home cell and three
six nodes: three nodes of the home cell (i1_i3) and vertexes at the remote vertices of the three neigh
another three nodes located at the remote vertices of boring cells (i1_i6 for cell i). However, for a boundary
the three neighboring cells (i4_i6). When the point of cell (cell j), T6-scheme
scheme still selects six nodes: three
interest at xQ is located in a boundary home cell (cell nodes of the home cell (j1_j3), two remote nodes of
j), we select only three nodes of the home cell, i.e., the neigh boring cells (j4 and j5), and one field node
j1_j3. (j6) which is nearest to the centroid of the home cell
excepting the five nodes that have been selected.
T6/3-scheme
scheme was purposely devised for creating high
high-
order PIM shape functions, where quadratic T6-scheme
scheme is purposely devised for constructing
interpolations are performed for the interior home radial PIM (RPIM) shape functions on considering
cells and linear interpolations for boundary home both accuracy and efficiency. Different
Dif from T6/3-
cells. This scheme was first used in the NS
NS-PIM [11]. scheme, this scheme selects six nodes for all home
It can not only successfully overcome the singular cells containing the point of interest.
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2360
International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
20. Lancaster, P. and Salkauskas, K., Surfaces 24. Krongauz, Y. and Belytschko, T., Enforcement of
generated by moving least squares methods, Math. essential boundary conditions in mesh less
Comput., 37, 141–158, 1981. approximations using finite elements, Comput.
Methods Appl. Mech. Eng., 131(1–2), 133–145,
21. Cleveland, W. S., Visualizing Data, AT&T Bell
Laboratories, Murray Hill, NJ, 1993. 1996.
25. Belytschko, T., Gu, L., and Lu, Y. Y., Fracture
22. Nayroles, B., Touzot, G., and Villon, P.,
and crack growth by element free Galerkin
Generalizing the finite element method: Diffuse
methods, Model. Simulations Mater. Sci. Eng., 2,
approximation and diffuse elements, Comput.
519–534, 1994.
Mech., 10, 307–318, 1992.
23. Belytschko, T., Lu, Y. Y., and Gu, L., Element-
free Galerkin methods, Int. J. Numerical Methods
Eng., 37, 229–256, 1994.
@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 2361