Scribd
Upload
51 views

Solution of Linear System of Equations

This document discusses methods for solving systems of linear equations that arise in finite element analysis problems in manufacturing. It describes direct methods like Gaussian elimination and Gauss-Jordan elimination that directly solve the system. It also describes iterative methods like Gauss-Seidel that iteratively update the solution estimates until convergence. Gaussian elimination works by eliminating variables one by one to obtain an upper triangular system that can be solved using back substitution. Gauss-Jordan elimination transforms the system into reduced row echelon form directly without back substitution. Gauss-Seidel converges faster than Jacobi iterative method by using the latest estimates in each iteration.

Uploaded by

Ashok Kumar
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
51 views

Solution of Linear System of Equations

This document discusses methods for solving systems of linear equations that arise in finite element analysis problems in manufacturing. It describes direct methods like Gaussian elimination and Gauss-Jordan elimination that directly solve the system. It also describes iterative methods like Gauss-Seidel that iteratively update the solution estimates until convergence. Gaussian elimination works by eliminating variables one by one to obtain an upper triangular system that can be solved using back substitution. Gauss-Jordan elimination transforms the system into reduced row echelon form directly without back substitution. Gauss-Seidel converges faster than Jacobi iterative method by using the latest estimates in each iteration.

Uploaded by

Ashok Kumar
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/ 5

ASSIGNMENT

FINITE ELEMENT ANALYSIS IN MANUFACTURING

Submitted by

ASHOK KUMAR R
ROLL NO. 3
S1 M.TECH CIM
TKMCE KOLLAM

SOLUTION OF LINEAR SYSTEM OF EQUATIONS

Solutions of simultaneous algebraic equations are very much useful for solving
problems in engineering and mathematical physics . The stress analysis , heat transfer ,
fluid transfer and vibrational analysis are engineering problems for which finite element
formulations for solutions typically involves the solving of simultaneous linear equations.
The following two methods are generally used for solving the simultaneous linear
equations and they are
1.Direct method
2. Indirect method or Iterative method
Gauss Elimination and Gauss- Jordan methods belongs to direct method and GaussSeidal iterative method and relational method belongs ton indirect method.

Gauss elimination
The Gaussian elimination method is an eliminationtechnique for solving a system of
linear equationsthrough two series of steps. The method works bestcoefficient matrix is
not singular; sothat the solution obtained is unique. The Gaussian elimination
methodconsists of two main steps. The first step is the row operations for eliminating
theelements in the coefficient matrix so as to reduce thematrix into its upper triangular
form. If all elements inthis triangular matrix have nonzero values, then thematrix
definitely has a unique solution. The secondstep, which is backward substitutions,
follows directlyfrom the triangular matrix relationship for producingthe solution
Consider the system of n equations
a11 x 1+a12 x 2 ++a1 n xn =b1
a21 x 1 +a 22 x2 ++a 2 n x n=b 2
:
:

an 1 x1 +a n 2 x 2+ + ann x n=bn
Applying Gauss elimination method
1.
2.
3.
4.

Assume that a11 is not equal to zero.


Subtract (a21/a11) times the first equation from the second equation.
Subtract (a31/ a11) times the first equation from the third equation etc.
So x1 can be eliminated from second, third up to nth equation.
The resulting new system of linear equation will be

a11 x 1+a12 x 2 ++a1 n xn =b1


'

'

'

a 22 x 2 ++ a 2 n x n=b 2
:
:
a' n 2 x 2 ++a' nn x n=b' n

5. Eliminate x2from third, fourth up to nth equation by subtracting

a'
'
( 33/a 22)

'

times the second equation from the third equation. Subtract

a
'
( 43 /a 22)

times

the second equation from the fourth equation and so on.


6. Continue the eliminating one variable at a time until we get a single equation of
one variable xn.
7. Solution of xn is then used to find the value of xn-1. Retrace the path and we can
find the x1 at the end.
At the end of elimination step the system of linear equations takes the form:
c 11 x1 +c 12 x 2 ++c 1 n x n=d 1
c 22 x 2+ + c 2n x n=d 2
:
:
c nn x n=d n

Gauss-Jordan Method

The GaussJordan elimination method is named after the German mathematicianCarl


Friedrich Gauss (17771885) and the German geodesist Wilhelm Jordan(18421899).
Gauss, one of the greatest mathematicians of all time, used a methodof solving systems of
equations that was later generalized by Jordan to solve problemsin large-scale surveying.
The GaussJordan method is another eliminationtechnique for solving the Ax = b
problem involvingrow operations. Unlike the Gaussian eliminationmethod, the Gauss
Jordan method is wholly based onrow operations and does not involve backwardsubstitutions. The method assumes the coefficientmatrix to be nonsingular and fails
to produce thedesired result if the matrix is singular.
In gauss method eliminations are carried out only in the equations following it. But in the
Jordan method eliminations are also performed in the equations proceeding it.
The Gauss-Jordan elimination method to solve a system of linear equations is described
in thefollowing steps.
1. Write the augmented matrix of the system.
2. Use row operations to transform the augmented matrix in the form described below,
which iscalled the reduced row echelon form (RREF).
(a) The rows (if any) consisting entirely of zeroes are grouped together at the bottom of
thematrix.
(b) In each row that does not consist entirely of zeroes, the leftmost nonzero element is a
1(called a leading 1 or a pivot).
(c) Each column that contains a leading 1 has zeroes in all other entries.
(d) The leading 1 in any row is to the left of any leading 1s in the rows below it.
3. Stop process in step 2 if you obtain a row whose elements are all zeroes except the last
one onthe right. In that case, the system is inconsistent and has no solutions. Otherwise,
finish step2 and read the solutions of the system from the final matrix.

Gauss- Seidel method


The Gauss- Seidel method is an iterative method that updates the value of an variable
based on the latest values in the system. Because of the latest values , convergence to the
solution takeplace faster than the Jacobi method . this is modified iterative method .the
first step is same as Jacobi method and then initialize the iterative procedure with

x11,x21,x31,.xn1 in RHS and get x12. Now using x11,x21,x31,.xn1 in second


equation and get x22.
Then continues the process till the required accuaracy in the solution is achieved .

REFRENCES:

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