Scribd
Upload
126 views13 pages

Development of Code For 1D FEA

In finite element analysis, the domain is discretized using elements and nodes. The problem is then formulated as a linear system involving stiffness and force matrices derived from integrating element operators over the domain. Essential boundary conditions are enforced by modifying the linear system. The solution provides the values of the unknown field at nodes, from which it can be approximated over the entire domain using shape functions.

Uploaded by

N S Vijay Vignesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
126 views13 pages

Development of Code For 1D FEA

In finite element analysis, the domain is discretized using elements and nodes. The problem is then formulated as a linear system involving stiffness and force matrices derived from integrating element operators over the domain. Essential boundary conditions are enforced by modifying the linear system. The solution provides the values of the unknown field at nodes, from which it can be approximated over the entire domain using shape functions.

Uploaded by

N S Vijay Vignesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

DEVELOPMENT OF CODE FOR 1D FINITE ELEMENT

ANALYSIS & VALIDATION


A typical finite element program consists of the following
sections

1. Preprocessing section – finite element discretization,


material properties, solution parameters, etc.

2. Processing section – stiffness matrices, force vectors


computed, boundary conditions enforced, system solved

3. Post-processing section – Results are analyzed & visualized

VIJAYVIGNESH N S; 2020606042; M.E. MANUFACTURING ENGINEERING;


MN5201 – FINITE ELEMENT APPLICATIONS IN MANUFACTURING; SEMINAR
1) Nodal Co-ordinate Matrix:-
Dimensions is given as “nn x sdim” where nn – number of nodes ;
sdim – spacial dimensions of the problem. A nodal coordinate matrix nodes
the y-coordinate of the nth node is “nodes(n,2)”
2) Element Connectivity Matrix:-
The element definitions are stored, a matrix of node numbers where
each row of the matrix contains the connectivity of an element. Consider the
connectivity matrix elements that describes a mesh of 4-node quadrilaterals
the 36th element is defined by the connectivity vector elements(36,:) which for
example may be [ 36 42 13 14] or that the elements connects nodes 36 -> 42 ->
13 -> 14

3
3) Boundary Conditions:-
They are used to either form force vectors (natural or Neumann boundary
conditions) or to specify the value of the unknown field on a boundary (essential or
Dirichlet boundary conditions). The dimension of this mesh will be one order less that
the spacial dimension of the problem.

Note:- The numbers in the boundary


connectivity matrix refer to the same node
coordinate matrix as do the numbers in the
connectivity matrix of the interior elements.
In order to apply an essential boundary
conditions (like Force) on this edge we need a
list of the node numbers on the edge,
nodesOnBoundary = unique(rightEdge);

Then loop over the elements &integrate any


finite element operators on the domain
interior i.e. the stiffness matrix ‘K’.
4) DOF Mapping:-
Universally for all finite element programs a linear algebraic system is
solved which is of the form Kd = f, d – vector. The vector d contains the nodal
unknowns for that defines the finite element approximation,

where NI(x) are the finite element shape functions, dI are the nodal unknowns
for the node I which may be scalar or vector quantities (if uh(x) is a scalar or
vector) and ‘nn’ is the number of nodes in the discretization.

For scalar fields the location of the nodal unknowns in d is most obviously as
follows
dI = d(I)

But for vector fields the location of the nodal unknown dIi, where ‘I’ refers to
the node number and ‘I’ refers to the component of the vector nodal
unknown dI, there is some ambiguity.
Hence, we define a mapping from the node number and the vector
component to the index of the nodal unknown vector d,
f : {I,i} -> n
where f is the mapping, I is the node number, i is the component and n is the
index in d. So the location of unknown uIi in d is as follows
uIi = df(I:i)

To alternate between each spacial component in the nodal unknown vector


d
To group all the like components of the nodal unknowns in a contiguous
portion of d,

Note:- Which ever mapping is chosen the stiffness matrix and force vectors
should have the same structure
5) Computation of Finite Element Operators:-
The heart of the finite element program is the computation of finite
element operators.

The global operators are evaluated by looping over the elements in the
discretization, integrating the operator over the element and then to scatter
the local element operator into the global operator. This procedure is written
mathematically with the Assembly operator A,
A) Quadrature:- (the process of determining area)
The integration of an element operator is performed with an appropriate
quadrature rule which depends on the element and the function being
integrated. In general a quadrature rule is as follows,

where f() is the function to be integrated, q are the quadrature points and
Wq the quadrature weights. The function quadrature generates a vector of
quadrature points and a vector of quadrature weights for a quadrature rule.
The syntax of this function is as follows
B) Operator ‘Scattering’:-
Once the element operator is computed it needs to be scattered into the
global operator. The scattering is dependent on the element connectivity and the
dof mapping chosen.
6) Enforcement of Essential Boundary Condition:-
The final issue before solving the linear algebraic system of finite element
equations is the enforcement of the essential boundary conditions. Typically
this involves modifying the system, Kd = f. So that the essential boundary
condition dn = d’n is satisfied while retaining the original finite element
equations on the unconstrained dofs.

Modify nth row of the K matrix so that,

Unfortunately, this destroys the symmetry of K which is a very important


property for many efficient linear solvers. By modifying the nth column of
K as follows,
The modified kth equation

where fixedDofs is a vector of the indicies in d that are fixed, fixedDofValues


is a vector of the values that fixedDofs are assigned to and bcwt is a
weighing factor to retain the conditioning of the stiffness matrix (typically
bcwt = trace(K)=N).
SUMMARY
In finite element analysis we approximate a function defined
in a Domain with a set of orthogonal basis functions with
coefficients corresponding to the functional values at some
node points.

The solution for the values at the nodes for some partial
differential equations can be obtained by solving a linear
system of equations involving the inversion of (sometimes
sparse) matrices.

Boundary conditions are inherently satisfied with this


formulation which is one of the advantages compared to
finite differences.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy