M-6-1-CAD of Machine

Elements
BITS Pilani Prof. Srinivasa Prakash Regalla
Professor, Department of Mechanical Engineering
Hyderabad Campus

ME G611: COMPUTER AIDED ANALYSIS AND DESIGN

 BITS Pilani
Hyderabad Campus

<Course Number, Course Title>

Lecture No.
STATIC ANALYSIS

 Static analysis of mechanical systems is relevant when there is no

change in magnitude and/or direction of the load(s) with time
 The mathematical model of the design problem of static analysis
results in a set of linear simultaneous algebraic equations:

 Here [A] and {b} are known and {x} is to be determined

 If [A] is constant matrix, then the problem is linear problem
 If [A] depends on {x}, then the problem becomes nonlinear

BITS Pilani, Hyderabad Campus

Methods of solution

 Based on the coefficient matrix [A], the solution the

matrix equation of static analysis may be found by one of
the two methods:

1. Direct Solution Method

 This is used when the [A] is well-conditioned, means, it is
symmetric or has all the elements in the same order of magnitude
etc.
2. Iterative Solution Method
 This method is used when [A] is ill-conditioned

BITS Pilani, Hyderabad Campus

 GAUSSIAN ELIMINATION
METHOD
 This is the one of the most effective and widely used
direct methods of solution for static problems
 Consider a set of simultaneous algebraic equations:

 The first step is to eliminate the terms with ai1, i=2,3,4,…n. The
a11 is the pivot element and it is assumed that a11≠0.
BITS Pilani, Hyderabad Campus
 The next step is to eliminate ai2:
where i=3,4,5,…,n. Again a22≠0.

where

BITS Pilani, Hyderabad Campus

 After (n-1) steps, the transformed simultaneous algebraic
equations are:
 The last equation contains
only one unknown, which is xn,
and it can be straightaway
solved for:

 Knowing xn, substituting it in

 If we write these equation
again as [A]{x}={b}, it results
in an upper triangular matrix.
(n-1)th equation, the xn-1 can
be called, and so on, all xi can
be determined. This process is
called as “back-substitution”.
BITS Pilani, Hyderabad Campus
Exercise:

Using the Gauss Elimination method, solve the following

equations representing the static analysis of a
mechanical system:

BITS Pilani, Hyderabad Campus

 Solution:
Step-1: Eliminate x1 from 2nd Step-2: Interchange 2nd to 4th
to 4th equation by columns to get pivot element
Row2=Row2 - 4*Row1; in 2nd equation:
Row3=Row3 - Row1;
Row4=Row4 – 2*Row1;

BITS Pilani, Hyderabad Campus

Step-3: Eliminate x4 in the Step-4: Solve for x2 and then x3, x4
3rd equation: and x1 by back-substitution:
Row3=Row3 + (1/5)*Row1*3;

BITS Pilani, Hyderabad Campus

Exercise:

Solve the following linear matrix equation that resulted from

static analysis modelling of a mechanical system:

2 1  3  x1   11 
 4  2 3 x    8 
  2   
 2 2  1  x3   6

BITS Pilani, Hyderabad Campus

Exercise:

Solve the static equillibrium set of equations using

Gaussian Elimination method.

BITS Pilani, Hyderabad Campus

 Gauss-Jordan Method
 Given the system of linear algebraic equations in matrix form
[A]nn{x}n1={b}n1, the Gauss-Jordan method begins by
generating an augmented matrix [G] n(n+1)by combining [A]
and {b}. For example, for [A] 33 matrix:

Since [I]{x}=[A]-1{b}={}, which is the solution, a series of row

and column operations are carried out on the [G] until it is
converted to the form:

BITS Pilani, Hyderabad Campus

Exercise:

Solve the following linear equations by Gauss-Jordan

method:

BITS Pilani, Hyderabad Campus

 Solution:
Step-1: The augmented Step-3:
matrix is:

Step-2: Row1=(Row1)/2: Step-4:

BITS Pilani, Hyderabad Campus

Step-5: Step-7:

Step-8: Hence the final

solution is:
Step-6:

BITS Pilani, Hyderabad Campus

 Cholesky’s Factorization
Method
 It is another direct solution method like Gaussian Elimination
and Gauss-Jordan methods to solve [A]{x}={b}
 In Cholesky’s method, the coefficient matrix [A] is factorized
into the product of one lower triangular matrix [L] and one
upper triangular matrix [U]
 The solution {x} is obtained in two stages: first the equation
[L]{y}={b} is solved and then the equation [U]{x}={y} is solved
 A coefficient matrix of order “n”, [A]nn can be factorized into
non-trivial [L] and [U] only if the determinant of every “p<n”
order square matrix has determinant greater than zero.
[ A]{x}  {b}  [ L][U ]{x}  {b}
Let [U ]{x}  { y}, then solve : [ L]{ y}  {b}
Next solve : [U ]{x}  { y}
BITS Pilani, Hyderabad Campus
The structure of [L] and [U]

Then we can equate [A] and the product [L]*[U] element by

elment, which yields a total of n*n equations in as many
unknowns, which can be easily solved for all lij and uij.

BITS Pilani, Hyderabad Campus

Exercise:

Solve the following system of linear equations using

Cholesky’s factorization method.

BITS Pilani, Hyderabad Campus

Solution:
[A]{x}={b}

BITS Pilani, Hyderabad Campus

The product of [L][U] gives:

Equating to the corresponding elements of [A] gives:

BITS Pilani, Hyderabad Campus

By solving these sixteen equations, we obtain:

By forward substitution, we get:

BITS Pilani, Hyderabad Campus

Now we can solve the equation [U]{x}={y}

The back-substitution process gives:

BITS Pilani, Hyderabad Campus

Exercise:

Using Cholesky’s method, solve the following linear set of

equations.
(a) (b)

BITS Pilani, Hyderabad Campus

THANK YOU! ANY QUESTIONS!

BITS Pilani, Hyderabad Campus