Scribd
Upload
12 views2 pages

Numerical Methods-Tute 1

This document is a tutorial for the course FC 21342 - Inferential Statistics & Numerical Methods at Sabaragamuwa University, focusing on solving systems of linear equations using various methods including Gaussian Elimination, Doolittle’s LU-factorization, and Crout’s factorization. It includes specific problems to solve, demonstrates the failure of Gaussian Elimination in certain cases, and discusses the advantages and disadvantages of different methods. Additionally, it covers the principles of Gauss elimination, potential computational errors, and pivoting techniques.

Uploaded by

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

Numerical Methods-Tute 1

This document is a tutorial for the course FC 21342 - Inferential Statistics & Numerical Methods at Sabaragamuwa University, focusing on solving systems of linear equations using various methods including Gaussian Elimination, Doolittle’s LU-factorization, and Crout’s factorization. It includes specific problems to solve, demonstrates the failure of Gaussian Elimination in certain cases, and discusses the advantages and disadvantages of different methods. Additionally, it covers the principles of Gauss elimination, potential computational errors, and pivoting techniques.

Uploaded by

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

Dept.

of Surveying & Geodesy - Faculty of Geomatics


Sabaragamuwa University of Sri Lanka
FC 21342 - Inferential Statistics & Numerical Methods
Solutions of systems of linear equations - Tutorial 03

Answer All the questions Due Date :

1. Solve the following linear systems using Gaussian Elimination Method:

x1 + x2 + x3 + x4 = 2, 1
x1 − x2 + x3 = 4,
x1 + x2 + 3x3 − 2x4 = −6, 2
i. 2x1 − x2 − x3 + x4 = 5,
2x1 + 3x2 − x3 + 2x4 = 7
iii. 1
x1 + 2x2 + x3 − x4 = −2. x1 + x2 + x3 = 2,
2
1
x1 − x2 + x3 + x4 = 5.
x1 + x2 + x4 = 2, 2
2x1 + x2 − x3 + x4 = 1, x1 − x2 + 3x3 = 2,
ii.
4x1 − 3x2 − 2x3 + 2x4 = 0,
3x1 − x2 − x3 + 2x4 = −3.
S
−3x1 + 2x2 − 6x3 = 3,
L iv. 3x1 − 3x2 + x3 = −1,
x1 + x2 = 3.

2. Show that the Gaussian Elimination Algorithm fails for the following system of equations:

i. 5x1 − 5x3 = −5,


SU
x1 − x3 = 4.

3. Perform Doolittle’s LU-factorization for the following matrices.


   
1 −1 2 −1 7 1 −1 2
1 0 −1 1  1 8 0 −2
i. A =   iii. C =  
2 1 3 −4   −1 0 4 −1
0 −1 1 −1 2 −2 −1 6
 
1 2 3
ii. B = 2 −4 6 

3 −9 −3

Use the above your results to solve the following systems of equations

x1 − x2 + 2x3 − x4 = 6, 7x1 + x2 − x3 + 2x4 = 3,


x1 − x3 + x4 = 4, x1 + 8x2 − x4 = −5,
(a) (b)
2x1 + 2x2 + 3x3 − 4x4 = −2, −x1 + x3 − x4 = 4,
−x2 + x3 − x4 = 5. 2x1 − 2x2 − x3 + 6x4 = −3.
x1 + 2x2 + 3x3 = 5,
(c) 2x1 − 4x2 + 6x3 = 18,
3x1 − 9x2 − 3x3 = 6.
4. Use Crout’s factorization method to solve the following linear systems.

2x1 − x2 = 3, 3x1 + x2 = −1,


(a) −x1 + 2x2 − x3 = −3, (c) 2x1 + 4x2 + x3 = 7,
−x2 + 2x3 = 1. 2x2 + 5x3 = 9.
x1 − 2x2 + x3 − 2x4 = 5,
2x1 − 5x2 − x3 − 9x4 = 10,
(b)
−x1 + 7x2 + 16x3 + 25x4 = 9,
x2 + 7x3 + 4x4 = 19.
 
1 −1 2
5. Find A−1 using Gauss Jordan and Gauss Elimination methods. Here A = 3 2 1
2 −3 −2
Using your results, solve the following linear system.
x1 − x2 + 2x3 = 5,
3x1 + 2x2 + x3 = 10,
2x1 − 3x2 − 2x3 = −10.
6. Use Gauss-Jordan method to solve the following systems of linear equations.

−2x1 + x2 + x3 = −3, x1 + x2 + x3 = 5,
(a) 4x1 − x2 = −9,
x1 − x2 − x3 = −3.
S L (b) 2x1 + 3x2 + 5x3 = 8,
4x1 + 5x3 = 2.

7. State the advantages and disadvantages of the three methods Gaussian Elimination, Gauss-Jordan
and LU factorization in solving the system of linear equations.
SU
8. (a) Describe the principle involved in the Gauss elimination method.
(b) When does the Gauss elimination method fail?
(c) How do we avoid computational errors in Gauss elimination?
(d) Define complete pivoting in Gauss elimination.
(e) Can we use partial pivoting in Gauss-Jordan method?

You might also like