Scribd
Upload
24 views2 pages

Notes-And-Formula-Book Shape Functions

In finite element analysis, an approximate solution is assumed that satisfies the governing equations and boundary conditions. This approximate solution is represented as a linear combination of simpler functions called shape functions. The shape functions must satisfy the property of partition of unity, meaning the sum of all shape functions at any given point must be 1. The number and order of shape functions determines the accuracy of the solution, with more shape functions providing more accuracy but also requiring more computational power.

Uploaded by

Krishna Murthy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views2 pages

Notes-And-Formula-Book Shape Functions

In finite element analysis, an approximate solution is assumed that satisfies the governing equations and boundary conditions. This approximate solution is represented as a linear combination of simpler functions called shape functions. The shape functions must satisfy the property of partition of unity, meaning the sum of all shape functions at any given point must be 1. The number and order of shape functions determines the accuracy of the solution, with more shape functions providing more accuracy but also requiring more computational power.

Uploaded by

Krishna Murthy
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

https://www.scribd.

com/doc/220402636/FEA-QUESTION-WITH-CLASS-
NOTES-AND-FORMULA-BOOK

Shape Functions

In FEM the basic concept is to assume an approximate solution that satisfies the governing
differential equation and boundary conditions. The whole idea is to get this assumed or
approximate solution as close to the exact solution as possible. To do this we assume our
approximate solution to be a linear combination of simpler functions. These simpler
functions are called shape functions. For instance we take an approximate solution U*=
N1u1+ N2u2+.... here N1, N2, N3... are shape functions and u1, u2,.... are constants (which
are to be evaluated). How we choose the shape functions is governed by the rule that they
must be partitions of unity i.e. the sum of all shape functions at any given point (x,y,z) must
be 1. (N1 + N2+ N3+.... =1). The number and order of shape functions determine the
accuracy of solution. Ideally, more the shape functions the more accurate the solution and
more the computational power required.

You might also like