Scribd
Upload
11 views2 pages

Matrices Practice Questions for MA 311

The document contains practice questions for a course on Numerical Methods, specifically focusing on matrices and systems of equations. It includes various problems such as writing equations in matrix form, performing Gauss elimination, Crout's decomposition, and solving systems using different techniques like Gauss-Jordan and iterative methods. Additionally, it addresses a practical problem involving suspended masses and their displacements.

Uploaded by

gladwellhamwiinga2
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
11 views2 pages

Matrices Practice Questions for MA 311

The document contains practice questions for a course on Numerical Methods, specifically focusing on matrices and systems of equations. It includes various problems such as writing equations in matrix form, performing Gauss elimination, Crout's decomposition, and solving systems using different techniques like Gauss-Jordan and iterative methods. Additionally, it addresses a practical problem involving suspended masses and their displacements.

Uploaded by

gladwellhamwiinga2
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

THE COPPERBELT UNIVERSITY

SCHOOL OF MINES AND MINERAL SCIENCES


DEPARTMENT OF CHEMICAL ENGINEERING

NUMERICAL METHODS: MA 311


MATRICES PRACTICE QUESTIONS
DATE: 18/02/2025
Q1. Consider the following system of equations:
7 x1  2 x2  3x3   12
2 x1  5 x2  3x3   20
x1  x2  6 x3   26

(i) Write the equation in the form Ax=b (ii) Compute the upper triangular matrix U using Gauss

Elimination. The end result of Gauss Elimination (without back-substitution) is matrix U. (iii)

Compute the lower triangular matrix L. The coefficients used in Gauss elimination to construct

the matrix U from the elements of matrix L. (iv) Find the solution of the system of equations using

forward and back substitution. Also solve the system for an alternative right-hand-side vector

[b]T = [12 18 -6].

Q 2. Perform Crout’s decomposition on:

2 x1  5 x2  x3  12
 x1  3x2  x3   8
3x1  4 x2  2 x3  16

1
Q 3. Solve the following system of equations using the Gauss elimination method
2 x1  x2  x3  2 x4  0
x1  2 x2  x3  4 x4  3
3x1  x2  2 x3  x4   6
 x1  2 x2  x3  2 x4  15

Q 4. Solve by Gauss-Jordan technique

 2 1 1  x1   2
5 2 2   x   9 
  2  
 3 1 1   x3   5 

Q 5. Three masses are suspended vertically by a series of identical springs where mass 1 is at the

top and mass 3 is at the bottom. If g = 9.81 m/s2, m1 = 2 kg, m2 = 3 kg, m3 = 2.5 kg, and the k’s =

10 kg/s2, solve for the displacements x.

Q 6. Solve using Gauss elimination technique


x1  x2  x3  3
6 x1  2 x2  2 x3  2
3x1  4 x2  x3  1

Q 7. For the following system of equations:


8 x1  2 x2  3x3  51
2 x1  5 x2  x3  23
3x1  x2  6 x3  20

(i) Use the Gauss–Seidel iterative method to εs ≤ 5%. (ii) Repeat with Jacobi iteration (iii) which

of the two methods is computationally efficient? NB: For the first guess of the solution, take the

value of all the unknowns to be zero.

THE END

Common questions

Powered by AI

Crout’s decomposition involves factorizing a matrix into L and U, where all diagonal elements of U are 1, distinguishing it from other LU decompositions that might not apply this condition. Crout's method can be particularly advantageous in situations where computation simplicity brings efficiency .

The Gauss-Jordan method is often chosen because it directly computes the inverse of a matrix, leading to straightforward solutions without needing back substitution. The main advantage is its ability to find solutions and inverses in one cohesive step .

The lower triangular matrix L is used alongside the upper triangular matrix U to facilitate forward and back substitution in solving linear equations. It is constructed using the coefficients from Gauss Elimination that transform the original matrix into an upper triangular form, essentially capturing the operations needed to do so while keeping them separate from U .

The Gauss-Seidel method is typically more computationally efficient than the Jacobi method, as it uses the most recently updated values, leading to faster convergence. The Jacobi method can be less efficient due to parallel use of outdated values from previous iterations. Efficiency varies based on the specific structure and properties of the matrix involved .

Backward substitution following Gauss Elimination may struggle in situations with near-singular matrices or when numerical instability arises due to round-off errors. In such cases, methods like LU decomposition with pivoting or singular value decomposition (SVD) might be more suitable to ensure stability and accurate solutions .

The Gauss-Seidel method ensures convergence by iteratively updating estimates for variables based on the most recent values obtained during iterations. It converges faster when the matrix has diagonal dominance or satisfies the conditions of positive definiteness. An initial guess, often set to zero for convenience, is necessary to start the iterations .

The system of equations can be rewritten in matrix form as Ax = b where A = [[1, 2, 3], [7, -2, 3], [12, 2, -1]] and b = [-1, -1, -6].

Altering the right-hand-side vector can influence numerical stability by affecting the condition number of the matrix, impacting solution multiplicity and sensitivity to perturbations. Systems reliant on condition numbers might demand using preconditioning techniques to optimize stability and ensure accurate, multiple potential solutions adhering to the system’s constraints .

The mass-spring system modelling applies matrices to represent forces and displacements in mechanical engineering, translating physical forces and constraints into a solvable format through systems of equations. Matrices efficiently capture relationships between forces (related to mass and spring constants) and their displacements, allowing the use of numerical methods for practical solving .

Computing an upper triangular matrix U using Gauss Elimination simplifies solving systems of equations since it allows the use of back substitution to find the solutions of the unknowns efficiently. This process reduces computation complexity and helps structure the solving method systematically .

You might also like