@ozair
1b500718-fb9a-40e5-a9f8-8cc3e51fe41e-image.png
29811036-84e6-4aa3-bf59-06ec0fbca461-image.png
Which of the following is a reason due to which the LU decomposition of the system of linear equations; x+y = 1, x+y =2 is not possible?
In Jacobi’s Method, We assume that the …………elements does not vanish.
Diagonal
Off-diagonal
Row
Column
@zaasmi said in MTH603 Quiz 2 Solution and Discussion:
While solving a system of linear equations, which of the following approach is economical for the computer memory?
Direct
Iterative (Page 69)
Analytical
Graphical
While solving a system of linear equations, which of the following approach is economical for the computer memory?
Direct
Iterative (Page 69)
Analytical
Graphical
Back substitution procedure is used in …………….
Gaussian Elimination Method
Jacobi’s method
Gauss-Seidel method
None of the given choices
@zaasmi said in MTH603 Quiz 2 Solution and Discussion:
While solving a system of linear equations by Gauss Jordon Method, after all the elementary row operations if there lefts also zeros on the main diagonal then which of the is true about the system?
System may have unique solutions
System has no solution
System may have multiple numbers of finite solutions
System may have infinite many solutions
While solving a system of linear equations by Gauss Jordon Method, after all the elementary row operations if there lefts also zeros on the main diagonal then which of the is true about the system?