Scribd
Upload
192 views3 pages

ESO 208A: Computational Methods in Engineering: Tutorial 4

This document provides problems related to solving systems of linear equations using various computational methods. It includes problems involving Gauss elimination, Gauss-Jordan elimination, Doolittle and Crout decomposition, Gaussian elimination with and without pivoting, matrix decomposition, and computing the inverse, determinant and condition number of a matrix using LU decomposition.

Uploaded by

jana.elmasry.9277
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
192 views3 pages

ESO 208A: Computational Methods in Engineering: Tutorial 4

This document provides problems related to solving systems of linear equations using various computational methods. It includes problems involving Gauss elimination, Gauss-Jordan elimination, Doolittle and Crout decomposition, Gaussian elimination with and without pivoting, matrix decomposition, and computing the inverse, determinant and condition number of a matrix using LU decomposition.

Uploaded by

jana.elmasry.9277
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/ 3

ESO 208A: Computational Methods in Engineering

Tutorial 4

System of linear equations

1. For the circuit shown in the figure, find the currents through the elements using (a) Gauss
elimination (b) Gauss Jordan methods.

(Use R1=10 Ohm; R2=20 Ohm; R3=40 Ohm; VA-VC = 200 Volt; VB-VC = 100 Volt)

R1 R2
B
A
i1 i2
i3
R3

2. In the above problem, how much will be the change in current in R3 due to unit change in voltage
difference (VA-VC)? Which of the currents is the most sensitive to a change in voltage at B?

Round-errors and partial pivoting

3. Without pivoting, use Gauss elimination method and four-digit floating point arithmetic with
rounding to solve:

0.003x  59.14 y  59.17


5.291x  6.130 y  46.78

Perform calculations more precisely but round-off to 3 significant digits when storing a result, and
use this rounded-off value for further calculations.

4. Solve the previous problem by using Gauss elimination with partial pivoting and four-digit
rounding arithmetic.

Matrix Decomposition

5. Solve the following set of equations using (a) Doolittle and (b) Crout decomposition
4x1 + x2 = 6
x1 + 4x2 + x3 = 12
x2 + 4x3 = 14
Practice Problems

6. Consider the following set of equations:

10−5 10−5 1 𝑥1 2 × 10−5


[10−5 −10−5 1] [𝑥2 ] = [−2 × 10−5 ]
1 1 2 𝑥3 1

a) Solve the system using Gaussian elimination, without pivoting, using 3-digit floating-point
arithmetic with round-off.

b) Perform complete pivoting and carry out Gaussian elimination steps once again using 3-digit
floating-point arithmetic with round-off. Explain the results.

c) Rewrite the set of equations after scaling according to x3 = 105  x3 and equilibration. Solve the
system with the same precision for floating point operations.

7. Consider the following matrix:

9 3 −2
𝑨=[ 3 6 1 ]
−2 1 9

a) Reduce it to an upper triangular matrix using Gauss Elimination Procedure.

b) Synthesize a lower triangular matrix L and an upper triangular matrix U from the steps of (a) above
such that A = LU.

c) Compute A-1 using the LU decomposition obtained in (b).

d) Using the above results, compute the determinant and condition number of A. Use row sum norms
for the matrices.

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