]]>

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**

**Gaussian Elimination Method**

Jacobi’s method

Gauss-Seidel method

None of the given choices

Direct

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

**Diagonal**

Off-diagonal

Row

Column

]]>Any solution of the linear equation 2x + 0y + 9 = 0 in two variables is of the form

(a) The given linear equation is

2x + 0y + 9 = 0

⇒ 2x + 9 = 0

⇒ 2x = -9

⇒ x= - 9/2 and y can be any real number.

Hence, (-9/2 , m) is the required form of solution of the given linear equation.

5x–2y–2z=9, x–3y+z= –2, –6x+4y+11z=1

–6x+4y+11z=1, x–3y+z= –2, 5x–2y–2z=9

5x–2y–2z=9, –6x+4y+11z=1, x–3y+z= –2

No need to rearrange as system is already in diagonal dominant form.

]]>2x+3y = 1, 3x +2y = - 4 ? ]]>

……………. MTH603

Stable

![0_1592208804427_990b1741-55b2-422c-923d-19f41007b0a3-image.png](Uploading 100%)

Known

![0_1592208904558_cebc8797-7190-4a5a-b290-abe496d4a5ad-image.png](Uploading 100%) ]]>

MTH603

Gauss-Seidel method ]]>

2x+3y = 1, 3x +2y = - 4 ? ]]>

MTH603

(2,3) ]]>

If the determinant of a matrix A is not equal to zero then the system of equations will have……….

A nxn homogeneous system of linear equations has a unique solution (the trivial solution) if and only if its determinant is non-zero. If this determinant is zero, then the system has an infinite number of solutions.

]]>MTH603

Gauss-Seidel

Crout’s ReductionMethod ]]>

In ………… method, matrix [A] of the system of equations is decomposed into the product of two matrices [L] and [U], where [L] is a lower-triangular matrix and [U] is an upper-triangular matrix with 1’s on its main diagonal.

MTH603

Gauss-Seidel

Crout’s ReductionMethod

Crout’s ReductionMethod

Here the coefficient matrix [A] of the system of equations is decomposed into the product of two matrices

[L] and [U], where [L] is a lower-triangular matrix and [U] is an upper-triangular matrix with 1’s on its

main diagonal.

Order of ‘L’ = 3

f(x) = -(2/x) in the interval:[1,4] exits? ]]>