Scribd
Upload
157 views21 pages

Beam With Uvl

The document discusses a beam element with a uniformly varying load. It provides the governing differential equation for the beam and shows how to evaluate the element stiffness matrix terms (T1-T3) for the varying load case. It also demonstrates how to assemble the global stiffness matrix, apply boundary conditions, and solve for reactions, deflections, bending moments and shear forces at various points on the beam. Additionally, it discusses the concept of bandwidth reduction in stiffness matrices and how proper node numbering can minimize bandwidth to reduce computational time.

Uploaded by

eafz111
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
157 views21 pages

Beam With Uvl

The document discusses a beam element with a uniformly varying load. It provides the governing differential equation for the beam and shows how to evaluate the element stiffness matrix terms (T1-T3) for the varying load case. It also demonstrates how to assemble the global stiffness matrix, apply boundary conditions, and solve for reactions, deflections, bending moments and shear forces at various points on the beam. Additionally, it discusses the concept of bandwidth reduction in stiffness matrices and how proper node numbering can minimize bandwidth to reduce computational time.

Uploaded by

eafz111
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/ 21

Beam Element with uniformly

varying load
Consider beam element with a
uniformly varying load as shown

The term f is not constant, it is


variable and is a function of x .

If the variable load varies from f = 0 at x = 0 to f = f


at x = he, then variable load at any section x is given by

Governing differential equation in local coordinates can be


written as
The boundary conditions and the solution remain same as for
udl

Terms T1 and T2 remain unchanged while term T3 will now change


to

Evaluate T3 for all values of i from 1 to 4.


Solution to the governing differential equation is given by

w1 and w3 are deflections at node 1 and 2 respectively.


w2and w4 are slopes at node 1 and 2 respectively.
Q1 and Q3 are shear forces at node 1 and 2 respectively.
Q2and Q4 are bending moments at node 1 and 2 respectively.
For the beam shown in the figure, find the reactions at supports
and B.M, S.F and deflection at midpoint.

Number the elements and nodes.


Mark all DOF, two at each node as shown
Element matrix equation for element no. 1 is
Element matrix equation becomes
For element no. 2

Element matrix equation becomes


On assembly, global matrix equation is given as
Impose global boundary conditions
w1 = w5 = 0 ; Q2 = Q6 = 0 ; Q3 = -1. From balance of secondary
variables Q4 = 0.
On solving
By method of elimination, we get

Solving the equations, we get

On back substitution we get


To find B.M and S.F at centre of beam
Consider E.M.E for element no. 1
BANDWIDTH

Global stiffness matrix is a symmetric matrix having some


elements away from the diagonal as zero.

More the elements, more the number of zeros in global stiffness


matrix.

The number of non-zero elements from the diagonal of the


matrix represent the half bandwidth as shown below.

a represents
the half
bandwidth.
•The elements outside the bandwidth are all zero elements
and remain zero throughout the solution.
•Hence these elements need not be stored thus saving a lot of
computing time.

•For e.g. in the matrix shown above it can be seen that we


have to deal with only nine elements instead of twenty-five
elements.
•Bandwidth is minimum if nodes are numbered properly.
•If numbering is not proper then the bandwidth is likely to be
much greater as shown in example below

Consider a set of four springs each of stiffness three units in


series as shown in fig

We can write assembled matrix as


Now consider the same problem with a different mode of
numbering.

The assembled matrix will now be given as


•This shows the significance of proper mode of numbering the
nodes.
•The computation time varies with the size of bandwidth.
•However, it does not make any difference on the solution if
numbering of elements is changed.

You might also like