RAJALAKSHMI INSTITUTE OF TECHNOLOGY

DEPARTMENT OF HUMANITIES AND SCIENCE

I YEAR EVEN SEM – (2021-2022)
ANNA UNIVERSITY QUESTIONS WITH SOLUTION
MA3251 – STATISTICS AND NUMERICAL METHODS
CO3 - UNIT – 3 (SOLUTION OF EQUATIONS AND EIGEN VALUE PROBLEMS)
PART – A
SL
QUESTIONS YEAR
NO.
1 Give Newton Raphson iterative formula.

NOV/DEC-
Solution:

2017
𝑓(𝑥𝑛)
𝑥𝑛+1 = 𝑥𝑛 − , 𝑛 = 0,1,2, … … …
𝑓 ′ (𝑥𝑛 )
2 Find a real of the equation 𝑥 = 𝑒 −𝑥 , using Newton Raphson method.
Solution:
𝑓(𝑥) = 𝑥 − 𝑒 −𝑥
𝑓 ′ (𝑥) = 1 + 𝑒 −𝑥
𝑓(0) = −1
𝑓(1) = 0.6321
The root lies between 0 and

NOV/DEC 2014
Take 𝑥0 = 1
𝑓(𝑥𝑛)
𝑥𝑛+1 = 𝑥𝑛 − , 𝑛 = 0,1,2, … … …
𝑓 ′ (𝑥𝑛 )
Put n=0,
𝑓(𝑥0) 𝑓(1) 0.6321
𝑥1 = 𝑥0 − ′
=1− ′ =1− = 0.5379
𝑓 (𝑥0 ) 𝑓 (1) 1.3679
𝑓(𝑥1 ) = 𝑓(0.5379) = −0.0461
𝑓(𝑥1) 𝑓(0.5379) (−0.461)
𝑥2 = 𝑥1 − = 1 − = 1 − = 0.5670
𝑓 ′ (𝑥1 ) 𝑓 ′ (0.5379) 1.584
The root is 𝒙 = 𝟎. 𝟓𝟔𝟕𝟎
3 How will you find a negative root of a polynomial equation by Iteration method?
APR/MAY-

Solution:
2017

Let 𝑓(𝑥) = 0 be the polynomial. The negative root of the polynomial can be obtained by finding
the positive root of 𝑓(−𝑥) = 0.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 1

4 State the order (rate) of convergence and convergence condition for Newton Raphson method.

APR/MAY-
Solution:

2017
The order of convergence of Newton Raphson method is 2 (quadratic) and convergence condition
is |𝑓(𝑥)𝑓"(𝑥)| < |𝑓 ′ (𝑥)|2
5 1 𝑎
Show the Newton Raphson formula to find √𝑎 can be expressed in the form 𝑥𝑛+1 = 2 (𝑥𝑛 + 𝑥 )
𝑛

Solution:
Let 𝑥 = √𝑎  𝑥 2 = 𝑎

NOV/DEC-2017
(ie) 𝑓(𝑥) = 𝑥 2 − 𝑎 𝑓(𝑥𝑛 ) = 𝑥𝑛2 − 𝑎, 𝑓 ′ (𝑥𝑛 ) = 2𝑥𝑛
By Newton Raphson method,
𝑓(𝑥𝑛 ) (𝑥𝑛2 − 𝑎)
𝑥𝑛+1 = 𝑥𝑛 − = 𝑥𝑛 −
𝑓 ′ (𝑥𝑛 ) 2𝑥𝑛
𝑛 𝑥 2 +𝑎 1 𝑎
= 2𝑥 =2 (𝑥𝑛 + 𝑥 )
𝑛 𝑛

6 Derive Newton’s algorithm for finding the 𝑝𝑡ℎ root of a number N.

Solution:
1
Let 𝑥 = 𝑁 𝑝

APR/MAY-2010
 𝑥𝑝 = 𝑁  𝑥𝑝 − 𝑁 = 0
(ie) 𝑓(𝑥) = 𝑥 𝑝 − 𝑁  𝑓(𝑥𝑛 ) = 𝑥𝑛𝑝 − 𝑁, 𝑓 ′ (𝑥𝑛 ) = 𝑝𝑥𝑛𝑝−1
By Newton Raphson method,
𝑓(𝑥𝑛 ) 𝑥𝑛𝑝 − 𝑁
𝑥𝑛+1 = 𝑥𝑛 − ′ = 𝑥𝑛 −
𝑓 (𝑥𝑛 ) 𝑝𝑥𝑛𝑝−1
𝑝−1
(𝑝−1)𝑥𝑛 +𝑁
= 𝑝−1
𝑝𝑥𝑛

7 Establish an iteration formula to find the reciprocal of a positive number N by Newton Raphson
method.
Solution:
1
Let 𝑥 = 𝑁
APR/MAY-2010

1 1
𝑁=𝑥  −𝑁 =0
𝑥
1 1 1
(ie) 𝑓(𝑥) = 𝑥 − 𝑁  𝑓(𝑥𝑛 ) = 𝑥 − 𝑁, 𝑓 ′ (𝑥𝑛 ) = − 𝑥 2
𝑛 𝑛

By Newton Raphson method,

1
𝑓(𝑥𝑛 ) −𝑁 1
𝑥
𝑥𝑛+1 = 𝑥𝑛 − ′ = 𝑥𝑛 − 𝑛 1 = 𝑥𝑛 + 𝑥𝑛2 ( − 𝑁) = 𝑥𝑛 (2 − 𝑁𝑥𝑛 )
𝑓 (𝑥𝑛 ) − 2
𝑥𝑛
𝑥𝑛

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 2

8 Solve the equation 5𝑥 − 2𝑦 = 1, 4𝑥 + 28𝑦 = 23 using the Gauss elimination method.
Solution:
Given 5𝑥 − 2𝑦 = 1……..(1)
4𝑥 + 28𝑦 = 23 … … . . (2)

[𝐴, 𝐵] = [5 −2 1
]
4 28 23
𝑅2 5 −2 1
Step1: 𝑅2 → = [1 7 23]
4
4

NOV/DEC 2016
Step 2: 𝑅2 → 5𝑅2 − 𝑅1
5 −2 1
=[ 111]
0 37
4
111
By back substitution 37𝑦 = 4
𝟑
𝒚=
𝟒
3
Put 𝑦 = 4 in (1)we get
(3) 3
5𝑥 − 2 = 1  5𝑥 = 1 +
4 2
𝟏
𝒙=
𝟐
9 Write the procedure involved in Gauss elimination method.

MAY/JUNE 2014
Solution:
In this method the given system is transformed into an equivalent system with upper-triangular
coefficient matrix. (ie) a matrix in which all elements below the diagonal elements are zero
which can be solved by back subsititution.
10 State the principle used in Gauss Jordan methods.

MAY/JUNE
Solution:
In the equation 𝐴𝑋 = 𝐵, the matrix A is transformed into a Diagonal matrix. Here we get the 2014
solution without using the back substitution method.
11 Give the sufficient condition of convergence of Gauss Seidel method (or) Gauss Jacobi method.
Solution:
The absolute value of the leading diagonal element is greater than the sum of the absolute values
of the other elements in that row, which is called diagonally dominant.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 3

12 Solve the equation 𝐴 + 𝐵 + 𝐶 = 6,
3𝐴 + 3𝐵 + 4𝐶 = 20,
2𝐴 + 𝐵 + 3𝐶 = 13
using Gauss elimination method.
Solution:
1 1 1 6
[𝐴, 𝐵] = (2 1 3 13)

MAY/JUNE 2013
3 3 4 20
𝑅2 → 𝑅2 − 2𝑅1 ; 𝑅3 → 𝑅3 − 3𝑅1
1 1 1 6
= (0 −1 1 1)
0 0 1 2
By back substitution,
𝐶=2
−𝐵 + 𝐶 = 1  𝐵 = 𝐶 − 1 = 1
𝐴+𝐵+𝐶 =6
𝐴+1+2= 6
𝐴 = 3, 𝐵 = 1, 𝐶 = 2
13 Write down the iterative formula of Gauss-seidel method.
Solution:
Let the rearranged form of a given set of equations be,
1
𝑥= (𝑑 − 𝑏1 𝑦 − 𝑐1 𝑧) … … … … (1)
𝑎1 1
1
𝑦= (𝑑 − 𝑎2 𝑥 − 𝑐2 𝑧) … … … … (2)

NOV/ DEC 2014

𝑏2 2
1
𝑧= (𝑑 − 𝑎3 𝑥 − 𝑏3 𝑦) … … … … (3)
𝑐3 3
We start with the initial values 𝑦 (0) , 𝑧 (0) , 𝑓𝑜𝑟 𝑦 𝑎𝑛𝑑 𝑧 𝑎𝑛𝑑 𝑔𝑒𝑡 𝑥 (1) from (1)
1
𝑥 (1) = 𝑎 (𝑑1 − 𝑏1 𝑦 (0) − 𝑐1 𝑧 (0) )
1

1
𝑦 (1) = (𝑑2 − 𝑎2 𝑥 (1) − 𝑐2 𝑧 (0) )
𝑏2
1
𝑧 (1) = 𝑐 (𝑑3 − 𝑎3 𝑥 (1) − 𝑏3 𝑦 (1) )
3

The process may be continued until convergence is assured to all the solutions.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 4

14 State Gauss Seidel method.

MAY/JUNE-
Solution:

2016
As soon as a new value for a variable is found by iteration it is used immediately in the following
equations. This method is called Gauss Seidal method.
15 Why Gauss Seidal method is a better method than Jacobi’s iterative method?

NOV/DEC-2015
Solution:
Since the immediately calculated values in Gauss Seidel of the unknowns are used, the
convergence in Gauss Seidel method will be more rapid than in Gauss Jacobi method. The rate of
convergence of Gauss Seidel method is roughly twice that of Gauss Jacobi method.
16 Write the first iteration values of x, y, z when the equations 27𝑥 + 6𝑦 − 𝑧 = 85, 6𝑥 + 15𝑦 +
2𝑧 = 72, 𝑥 + 𝑦 + 5𝑧 = 110 are solved by Gauss Seidel method.
Solution:
Here the coefficient matrix is diagonally dominant. Then
1
𝑥= (85 − 6𝑦 + 𝑧) … … … … … . (1)

NOV/DEC-2015
27
1
𝑦= (72 − 6𝑥 − 2𝑧) … … … … … . (2)
15
1
𝑧 = (110 − 𝑥 − 𝑦) … … … … … … … … . (3)
5
First iteration
Put y=0, z=0 in (1), we get x=3.148
Put x=3.148, z=0 in (2), we get y=3.451
Put x=3.148, y=3.451 in (3), we get z=20.662
17 Distinguish between direct and iteration method of solving simultaneous equations.

APR/MAY-2015
Solution:
Direct method Iterative method
i) We get exact solution i) Approsimates solution
ii) Simple, take less time ii) Time consuming
laborious
18 On what type of equation Newton’s method can be applicable?
NOV/DEC-

Solution:
2014

Newton’s method can be applicable to the solution of both algebraic and transcendental equation
and can be also used when the roots are complex

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 5

19 Compare Gauss Elimination and Gauss Jordan methods for solving linear systems of the form

MA 2266/NOV/DEC
AX=B
Solution:

2012
In Gauss Elimination method, the coefficient matrix reduced to upper triangular matrix and we
get the solution by back substitution whereas in Gauss Jordan method, the coefficient matrix
reduces to an unit or identity matrix and we get the solution without using back substitution.
20 What are the merits of Newton’s method of iteration?

NOV/DEC 2017
Solution:
Newton’s method is successfully used to improve the result obtained by other methods. It is
applicable to the solution of equations involving algebraical functions as well as transcendental
function .
21 Compare Gauss Elimination with Gauss Seidel method.
Solution:
Sl.no Gausss elimination method Gauss-Seidel methods

NOV/DEC 2017
Direct method for solving linear Iterative method for solving linear
1
simultaneous equations simultaneous equations
Give the exact solution in finite number Successive approximations approach the
2
of steps solution
Applicable in the coefficient matrix is Applicable if the coefficient matrix is
3
non-singular diagonally dominant
22 Define a diagonally dominant system of equations.

APR/MAY-2014
Solution:
A matrix is diagonally dominant if the numerical value of the leading diagonal element in each
row, is greater than or equal to the sum of the numerical values of the other elements in that row.
5 1 −1
For example the matrix (1 4 2 ) is diagonally dominant.
1 −2 5
23 Compare Gauss elimination and Gauss Jacobi methods.
APR/MAY-2014

Solution:
Gauss Elimination Gauss Jacobi
i) It gives exact value i. It gives only
approximate solution
ii. Simple, takes less time ii. Time consuming and
labourious

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 6

24 Compare Gauss Jacobi and Gauss Jordan methods.
Solution:

MAY/JUNE-2013
Gauss Jordan Gauss Jacobi
1) It gives exact value 1. It gives only approximate
solution
2) Simple, takes less time 2. Time consuming and
labourious
3) This method determine 3. This method determine only
all the roots at the same one root at a time
time.
25 4 1
Find the dominant eigen value of the matrix [ ] by power method.

APR/M

2011
1 4

AY
Answer: The dominant eigen value is 5. (Use power or Jacobi method)
26 Arrive a formula to find the value of 3√𝑁, where 𝑁 ≠ 0, using Newton Raphson method.

MAY/JU
NE-2013
3 +𝑁
2𝑥𝑛
Answer: 2 .
3𝑥𝑛

27 Solve by Gauss-Jordan method the following system of equation 2𝑥1 + 𝑥2 = 3, 𝑥1 + 2𝑥2 = 3

NOV/D

2011
EC-
Answer: 𝑥1 = 1, 𝑥2 = 1
28 Explain the power method to determine the eigenvalue of a matrix.
Solution:
It is used to find the numerically largest and the corresponding eigen vector, eigen value. Let A
be a matrix and 𝑥0 be an arbitrary vector which is taken as the initial approximation to an eigen

NOV/DEC-2011
value suppose we normalize 𝑥0 by choosing one of its components as unity. We form the
product 𝐴𝑥0 and express it as 𝜆𝑥1 where 𝑥1 has been normalized in the same manner as 𝑥0
Now we have 𝐴𝑥1 = 𝜆𝑥2
Now we form 𝐴𝑥2 = 𝜆𝑥3
Here the approximate eigen value is 𝜆, and approximate eigen vector is 𝑥2
Clearly 𝜆 is an eigen value of the matrix and 𝑥 is the eigen vector,
Where 𝑥3 is normalized in the same manner. Thus we have the sequence of iterations.
29 Why Gauss-Seidel method is better than Jacobi’s iterative method?
NOV/DEC-2010

Solution:
In Jacobi’s method at each iteration the values of the variables in the previous iteration are used,
where as in Gauss-Seidel method in each iteration the latest available values of the variables are
used. Hence the convergence of Gauss –Seidel method is twice faster than Jacobi’s method.
30 4 1
Find the dominant eigen value of the matrix [ ] by power method
APR/MA
T 2011

1 3
1
Answer: the dominant eigenvalue is 4.62 and the corresponding eigen vector is ( )
0.62

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 7

31 Write down N-R formula for finding √𝑁 where N is a positive number and hence find √142.
Ans : To find: √142
Let 𝑥 = √𝑁 ⇒ 𝑥 2 = 𝑁 ⇒ 𝑥 2 − 𝑁 = 0 𝑓(𝑥) = 𝑥 2 − 142
Let (𝑥) = 𝑥 2 − 𝑁 = 0 , 𝑓 ′ (𝑥) = 2𝑥 The root lies between 11 & 12.
𝑓(𝑥 )
W.K.T 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′ (𝑥𝑛 ) Let 𝑥0 = 12
𝑛
2 −𝑁
𝑥𝑛
= 𝑥𝑛 − ( ) By the N-R Method
2𝑥𝑛
𝑥𝑛 𝑁 1 142 1 142
= 𝑥𝑛 − + 2𝑥 𝑥1 = 2 (𝑥0 + ) = 2 (12 + ) =11.9167
2 𝑛 𝑥0 12
𝑥𝑛 𝑁 1 142
= + 2𝑥 𝑥2 = 2 (𝑥1 + ) =11.9164
2 𝑛 𝑥1
𝑥𝑛 𝑁 1 142
∴ 𝑥𝑛+1 = + 2𝑥 𝑥3 = 2 (𝑥2 + ) =11.9164
2 𝑛 𝑥2

Hence √142 = 11.9164 correct to 4 decimal places.

32 For solving a linear system, compare Gaussian Elimination and Gaussian Jordan Method.
Ans :
Gauss Elimination Gauss Jordan
1.Co-efficient matrix is transformed Co-efficient matrix is transformed into
into upper triangular matrix. Diagonal matrix

2.Direct method Direct method

3.We obtain the solution by back No need of back substitution method
substitution method.
4.It is preferred for large systems of It is preferred for smaller system of equations
equations.
33 Explain the term “Pivot Element”
𝑎11 ⋯ 𝑎1𝑛 𝑏1
Ans : In an augumented matrix ( ⋮ ⋱ ⋮ )( . )
𝑎𝑛1 ⋯ 𝑎𝑛𝑛 𝑏𝑛
The elements 𝑎11 , 𝑎12 , … 𝑎𝑛𝑛 which have been assumed to be non-zero are called pivot
elements.
34 1 1
Determine the largest eigenvalue and the corresponding eigen vector of the matrix [ ]
1 1
corrrect to two decimal places using power method.
1 1 1 1 1 1 2 1 2 1
Ans : Let A=[ ] and Let 𝑋1 = [ ]; A𝑋1=[ ] [ ]=[ ]=2[ ]=2𝑋2; A𝑋2=[ ]=2[ ]=2𝑋3
1 1 1 1 1 1 2 1 2 1
1
Hence the largest eigenvalue is 2. The corresponding eigenvector is [ ].
1

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 8

35 Solve 𝑥 − 2𝑦 = 0, 2𝑥 + 𝑦 = 5 using Gauss elimination method.
1 −2 𝑥 0
Ans : The given equation can be written as 𝐴𝑋 = 𝐵 where 𝐴 = [ ] , 𝑋 = [𝑦] , 𝐵 = [ ]
2 1 5
1 −2 0
The Augmented matrix [𝐴/𝐵] = [ ]
2 1 5
1 −2 0
=[ ]
0 5 5 𝑅2 → 𝑅2 − 2𝑅1
By back substitution we have 5𝑦 = 5 ⇒ 𝑦 = 1, 𝑥 − 2𝑦 = 0 ⇒ 𝑥 = 2.
36 Why Gauss-Seidel method is better than Jacobi’s method?
Ans : In Jacobi’s method at each iteration the values of the variable in the previous iteration are
used, where as in Gauss-Seidel method in each iteration the last available values of the variables
are used. Hence the convergence of Gauss-Seidel method is twice faster than Jacobi’s method.
37 What are the merits of Newton’s method of iteration?
Ans : 1. It can be used for finding root of both algebraic and transcendental equations.
2. The convergence of Newton’s method is faster and so it is preferred compared to other
methods.
3. It is simple and easy to deal with and it is used to improve the results obtained by other
methods.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 9

 PART – B
SL
QUESTIONS YEAR
NO.
1 Solve 𝑒 𝑥 − 3𝑥 = 0 correct to 2 decimal places by fixed point iteration method.
Solution:
Let 𝑓(𝑥) = 𝑒 𝑥 − 3𝑥
𝑓(0) = 1
𝑓(1) = 𝑒 − 3 = −0.2817
The root lies between 0 and 1
𝑒𝑥 𝑒𝑥
Let 𝑔(𝑥) = then 𝑔′ (𝑥) =
3 3
1 2.7183
|𝑔′ (0)| = < 1 and |𝑔′ (1)| = <1
3 3

𝑔′ (𝑥) < 1 in[0, 1]

Let 𝑥0 = 1
𝑒1 2.72
𝑥1 = 𝑔(𝑥0 ) = = = 0.91
3 3
𝑒 0.91
𝑥2 = 𝑔(𝑥1 ) = = 0.82

APR/MAY-2010
3
𝑒 0.82
𝑥3 = 𝑔(𝑥2 ) = = 0.76
3
𝑒 0.76
𝑥4 = 𝑔(𝑥3 ) = = 0.71
3

𝑒 0.71
𝑥5 = 𝑔(𝑥4 ) = = 0.68
3

𝑒 0.68
𝑥6 = 𝑔(𝑥5 ) = = 0.66
3
𝑒 0.66
𝑥7 = 𝑔(𝑥6 ) = = 0.64
3
𝑒 0.64
𝑥8 = 𝑔(𝑥7 ) = = 0.63
3

𝑒 0.63
𝑥9 = 𝑔(𝑥8 ) = = 0.63
3
Since 𝑥8 = 𝑥9 = 0.63, the solution of 𝑒 𝑥 − 3𝑥 = 0 is 0.63

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 10

 2 Find by Newton-Raphson method, a positive root of the equation 3𝑥 − 𝑐𝑜𝑠𝑥 − 1 = 0, correct
to 4 places.
Solution:
Let 𝑓(𝑥) = 3𝑥 − 𝑐𝑜𝑠𝑥 − 1
Therefore 𝑓 ′ (𝑥) = 3 + 𝑠𝑖𝑛𝑥
𝜋 𝜋 𝜋
𝑓 ( ) = 3 × − 𝑐𝑜𝑠𝑥 − 1
3 3 3
=1.64 (+ve)
𝑓(0) = 0 − 1 − 1 = −2(−𝑣𝑒)
𝜋 𝜋
Here f( 3 ) 𝑖𝑠 (+𝑣𝑒), 𝑓(0) 𝑖𝑠(−𝑣𝑒). 𝑡ℎ𝑒𝑟𝑒𝑓𝑜𝑟𝑒 𝑡ℎ𝑒 𝑟𝑜𝑜𝑡 lies between 0 and 3 or 1.047

radians.
𝜋
Also the magnitude of f( 3 ) < 𝑓(0). here the root is nearer to 1.047.

There fore we take the initial approximation 𝑥0 = 1.047

Newton’s formula is
𝒇(𝒙𝒏 )
𝒙𝒏+𝟏 = 𝒙𝒏 −

NOV/DEC 2017
𝒇′ (𝒙𝒏 )
1st approximation to the root is
𝑓(𝑥0 ) 3(1.047) − 𝑐𝑜𝑠(1.047) − 1
𝑥1 = 𝑥0 − ′
= 1.047 −
𝑓 (𝑥0 ) 3 + +𝑠𝑖𝑛(1.047)
3.141−1.5002
= 1.047 − 3.8659

𝒙𝟏 = 𝟎. 𝟔𝟐𝟐𝟔
2nd approximation to the root is
𝑓(𝑥1 ) 3(0.6226) − cos(0.6226) − 1
𝑥2 = 𝑥1 − ′
= 0.6226 −
𝑓 (𝑥1 ) 3 + sin(0.6226)
0.0554
= 0.6226 − 3.5831

𝒙𝟐 = 𝟎. 𝟔𝟎𝟕𝟏
3rd approximation to the root is

𝑓(2) 3(0.6071) − cos(0.6071) − 1

𝑥3 = 𝑥2 − ′
= 0.6071 −
𝑓 (2) 3 + sin(0.6071
1.8613 − 0.8213 − 1
= 0.6071 −
3.5705
𝒙𝟑 = 𝟎. 𝟔𝟎𝟕𝟏
The value of 𝒙𝟐 and 𝒙𝟑 are equal. Hence the real root is 0.6071.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 11

 3 Solve the equation 𝑥𝑙𝑜𝑔10 𝑥 = 1.2 using Newton Raphson method.
Solution:
Given 𝑓(𝑥) = 𝑥𝑙𝑜𝑔10 𝑥 − 1.2
Now 𝑓(2) = 2𝑙𝑜𝑔10 2 − 1.2 = 2(0.3010) − 1.2 = −0.5980 (– 𝑣𝑒)
𝑓(3) = 3𝑙𝑜𝑔10 3 − 1.2 = 3(0.4771) − 1.2 = −0.2313 (+𝑣𝑒)
Here 𝑓(2) 𝑎𝑛𝑑 𝑓(3) are opposite in sign, therefore the root of 𝑓(𝑥) = 0 lies between 2 and 3. Here
|𝑓(3)| < |𝑓(2)|. Therefore we can take the initial approximation to the root is 𝑥0 = 3
Now 𝑓(𝑥) = 𝑥𝑙𝑜𝑔10 𝑥 − 1.2
1 𝑑 1
𝑓 ′ (𝑥) = 𝑙𝑜𝑔10 𝑥 + 𝑥 𝑥 𝑙𝑜𝑔10 𝑒 [𝑑𝑥 𝑙𝑜𝑔𝑎 𝑥 = 𝑥 𝑙𝑜𝑔𝑎 𝑒]

= 𝑙𝑜𝑔10 𝑥 + 0.4343 [𝑙𝑜𝑔𝑎 𝑒 = 0.4343]

Newton’s formula is
𝑓(𝑥𝑛 )
𝑥𝑛+1 = 𝑥𝑛 −
𝑓 ′ (𝑥𝑛 )
The first approximation to the root is given by
𝑓(𝑥0 ) 𝑥0 𝑙𝑜𝑔10 𝑥0 − 1.2
𝑥1 = 𝑥0 − = 𝑥0 −
𝑓 ′ (𝑥0 ) 𝑙𝑜𝑔10 𝑥0 + 0.4343

NOV/DEC-2017
3𝑙𝑜𝑔10 3 − 1.2
=3−
𝑙𝑜𝑔10 3 + 0.4343
𝒙𝟏 = 𝟐. 𝟕𝟒𝟔
The second approximation to the root is given by
𝑓(𝑥1 ) 𝑥1 𝑙𝑜𝑔10 𝑥1 − 1.2
𝑥2 = 𝑥1 − ′
= 𝑥1 −
𝑓 (𝑥1 ) 𝑙𝑜𝑔10 𝑥1 + 0.4343
2.746𝑙𝑜𝑔10 2.746 − 1.2
= 2.746 −
𝑙𝑜𝑔10 2.746 + 0.4343
𝒙𝟐 = 𝟐. 𝟕𝟒𝟏
The third approximation to the root is given by
𝑓(𝑥2 ) 𝑥2 𝑙𝑜𝑔10 𝑥2 − 1.2
𝑥3 = 𝑥2 − ′
= 𝑥2 −
𝑓 (𝑥2 ) 𝑙𝑜𝑔10 𝑥2 + 0.4343
2.741𝑙𝑜𝑔10 2.741 − 1.2
= 2.741 −
𝑙𝑜𝑔10 2.741 + 0.4343
𝒙𝟑 = 𝟐. 𝟕𝟒𝟏
Hence the real root of 𝒇(𝒙) = 𝟎 correct to three decimal places is 2.741
Table
Iteration 𝒙𝒓 𝒇(𝒙𝒓 )
1 2.746 0.00467
2 2.741 0.000309
3 2.741 0.000309

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 12

 4 Solve the following system of equation by Gauss elimination method
2𝑥 + 𝑦 + 𝑧 = 10
3𝑥 + 2𝑦 + 3𝑧 = 18
𝑥 + 4𝑦 + 9𝑧 = 16
Solution:
Step 1: write the given system in augmented matrix form
2 1 1 10
𝐴 = (3 2 3 18)
1 4 9 16
Step 2:𝑖𝑛𝑡𝑒𝑟𝑐ℎ𝑎𝑛𝑔𝑒 𝑅1 𝑎𝑛𝑑 𝑅3
1 4 9 16
(3 2 3 18)
2 1 1 10
Step 3: 𝑅2 → 𝑅2 − 3𝑅1 ; 𝑅3 → 𝑅3 − 2𝑅1 ;
1 4 9 16
(0 −10 −24 −30)
0 −7 −17 −22
2 𝑅

NOV/DEC-2017
Step 4: 𝑅2 → −10
1 9 4 16
24
(0 1 3 )
10
0 −7 −17 −22
Step 5: 𝑅3 → 𝑅3 + 7𝑅2
1 4
9 16
24
0 1 3
10
−1
0 0 −1
( 5 )
Step 6: Use back substitute to find the solution the system,
−1
Here, 𝑧 = −1 𝑧 = 5
5

12 12
𝑦+ 𝑧 = 3  𝑦 + (5) = 3
5 5
 𝑦 = −9
𝑥 + 4𝑦 + 9𝑧 = 16
𝑥 − 36 + 45 = 16
𝑥 = 16 − 9
𝑥=7
𝑥 = 7, 𝑦 = −9, 𝑧 = 5

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 13

 5 Solve the following system of equation by Gauss elimination method
2𝑥 + 𝑦 + 4𝑧 = 12
8𝑥 − 3𝑦 + 2𝑧 = 20
4𝑥 + 11𝑦 − 𝑧 = 33
Solution:
Step1:
Write the given system of equations is augmented matrix form.
2 1 4 12
[8 −3 2 20]
4 11 −1 33
Step 2:𝑹𝟏 → 𝑹𝟏 ÷ 𝟐
1
1 2 6
[ 2 ]
8 −3 2 20
4 11 −1 33
Step 3: 𝑹𝟐 → 𝑹𝟐 − 𝟐𝑹𝟑
1
1 2 6
[ 2 ]
0 −25 4 −46
4 11 −1 33
Step 4: 𝑹𝟑 → 𝑹𝟑 − 𝟒𝑹𝟏
1
1 2 6

NOV/DEC-2016
[ 2 ]
0 −25 4 −46
0 9 −9 9
Step 5: 𝑹𝟑 → 𝑹𝟑 ÷ 9
1
1 2 6
[ 2 ]
0 −25 4 −46
0 1 −1 1
Step 6: 𝑹𝟐 → 𝑹𝟐 + 𝟐𝟓𝑹𝟑
1
1 2 6
[ 2 ]
0 0 −21 −21
0 1 −1 1
Step 7: Interchanging 𝑹𝟐 𝒂𝒏𝒅 𝑹𝟑
1
1 2 6
[ 2 ]
0 1 −1 1
0 0 −21 21
Step 8:
Use back substitution to find the solution to the system.
Here, −21𝑧 = −21
𝒛=𝟏
y-z=1
y-1=1
y=2
𝑦
𝑥 + 2 + 2𝑧 =6
𝑥+1+1= 6
𝒙=𝟑

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 14

 6 Solve the system of the following equations using Gauss Jordan method correct to two decimal places
2𝑥1 + 2𝑥2 − 𝑥3 + 𝑥4 = 4
4𝑥1 + 3𝑥2 − 𝑥3 + 2𝑥4 = 6
8𝑥1 + 5𝑥2 − 3𝑥3 + 4𝑥4 = 12
3𝑥1 + 3𝑥2 − 2𝑥3 + 2𝑥4 = 6
Solution :
Step1 : write the given eqn. in augmented matrix form :
2 2 −1 1 4
4 3 −1 2 6
[ ]
8 5 −3 4 12
3 3 −2 2 6
Step 2: make the element in the first row and first column as 1
𝑅1 → 𝑅1 ÷ 2
1 1 −0.5 0.5 2
4 3 −1 2 6
[ ]
8 5 −3 4 12
3 3 −2 2 6
Step 3: Add multiples of the first row to the other rows to make all the other components in the first column equal to
zero
𝑅2 → 𝑅2 − 4𝑅1 ; 𝑅3 → 𝑅3 − 8𝑅1 ; 𝑅4 → 𝑅4 − 3𝑅1
1 1 −0.5 0.5 2
0 −1 1 0 −2
[ ]
0 −3 1 0 −4
0 0 −0.5 0.5 0
Step 4: make the element in the second row and second column as 1.
𝑅2 → 𝑅2 (−1)
1 1 −0.5 0.5 2
0 1 −1 0 2
[ ]

NOV/DEC-2016
0 −3 1 0 −4
0 0 −0.5 0.5 0
Step 5: Add multiples of the second row to the other rows to make all the other components in the second column equal
to zero.
1 0 −0.5 0.5 0
0 1 −1 0 2
[ ]
0 0 −2 0 2
0 0 −0.5 0.5 0
Step 6: make the element in the third row and third column as 1.
𝑅3 → 𝑅3 ÷ (−2)
1 0 0.5 0.5 0
0 1 −1 0 2
[ ]
0 0 1 0 −1
0 0 −0.5 0.5 0
Step 7: Add multiples of the third row to the other rows to make all the other components in the third column equal to
zero.
𝑅1 → 𝑅1 − 0.5𝑅3 ; 𝑅2 → 𝑅2 + 𝑅3 ; 𝑅4 → 𝑅4 + 0.5𝑅3
1 0 0 0.5 0.5
0 1 0 0 1
[ ]
0 0 1 0 −1
0 0 0 0.5 −0.5
Step 8: make the element in the fourth row and fourth column as 1.
𝑅4 → 𝑅4 ÷ (0.5)

1 0 0 0.5 0.5
0 1 0 0 1
[ ]
0 0 1 0 −1
0 0 0 1 −1
Step 9: 𝑅1 → 𝑅1 − 0.5𝑅4
finally the matrix reduces to the form
1 0 0 0 𝑥1 1
0 1 0 0 𝑥2 1
( ) (𝑥 ) = ( )
0 0 1 0 3 −1
0 0 0 1 𝑥4 −1
Therefore the matrix 𝑥1 = 1, 𝑥2 − 1, 𝑥3 = −1, 𝑥4 = −1

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 15

 7 Solve the system of equations by Gauss-Jordan method
𝑥+𝑦+𝑧+𝑤 =2
2𝑥 − 𝑦 + 2𝑧 − 𝑤 = −5
3𝑥 + 2𝑦 + 3𝑧 + 4𝑤 = 7
𝑥 − 2𝑦 − 3𝑧 + 2𝑤 = 5
Solution:
Step1:
Write the given system of equations is augmented matrix form.

1 1 1 1 2
[𝐴, 𝐵] = [2 −1 2 −1 −5]
3 2 3 4 7
1 −2 −3 2 5
Step 2: 𝑅2 → 𝑅2 − 2𝑅1 ; 𝑅3 → 𝑅3 − 3𝑅1 ; 𝑅4 → 𝑅4 − 𝑅1
1 1 1 1 2
0 −3 0 −3 −9
 [ ]
0 −1 0 1 1
0 −3 −4 1 3
step 3: 𝑅3 → 3𝑅3 − 𝑅2 ; 𝑅4 → 𝑅4 − 𝑅2
1 1 1 1 2

MAY/JUNE-2016
0 −3 0 −3 −9
[ ]
0 0 0 6 2
0 0 −4 4 12
𝑅2 𝑅3 𝑅4
Step 4: 𝑅2 → −3 ; 𝑅3 → 6 ; 𝑅4 → 4 ; 𝑅3 → 𝑅4
1 1 1 1 2
0 1 0 1 3
[ ]
0 0 −1 1 3
0 0 0 1 2
Step 5: 𝑅3 → 𝑅3 − 𝑅4 ; 𝑅2 → 𝑅2 − 𝑅4 ; 𝑅1 → 𝑅1 − 𝑅4
1 1 1 0 0
0 1 0 0 1
[ ]
0 0 −1 0 1
0 0 0 1 2
Step 6: 𝑅1 → 𝑅1 + 𝑅3
1 1 0 0 1
0 1 0 0 1
[ ]
0 0 −1 0 1
0 0 0 1 2
Step 7: 𝑅1 → 𝑅1 − 𝑅2
1 0 0 0 0
0 1 0 0 1
[ ]
0 0 −1 0 1
0 0 0 1 2
By back substitution
𝒘 = 𝟐, 𝒛 = −𝟏, 𝒚 = 𝟏, 𝒙=𝟎

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 16

 8 Determine by power method the largest eigen values and the
1 3 −1
corresponding eigenvector of the matrix: [ 3 2 4 ]
−1 4 10
solution:
1
let the initial eigen vector be 𝑥0 = (1)
1
now
3
1 3 −1 1 3 13 0.231
𝐴𝑥0 = [ 3 2 4 ] [1] = [ 9 ] = 13 9 = 13 [0.692] = 13𝑥1
−1 4 10 1 13 13 1
[1]
1 3 −1 0.231 1.307 0.104
𝐴𝑥1 = ( 3 2 4 ) (0.692) = ( 6.077 ) = 12.537 (0.485) = 12.537𝑥2
−1 4 10 1 12.537 1

MAY/JUNE-2016
1 3 −1 0.104 0.559 0.047
𝐴𝑥2 = ( 3 2 4 ) (0.485) = ( 5.282 ) = 11.836 (0.446) = 11.836𝑥3
−1 4 10 1 11.836 1
1 3 −1 . 0470 0.385 0.032
𝐴𝑥3 = ( 3 2 4 ) ( 0.446 ) = ( 5.033 ) = 11.737 (0.429) = 11.737𝑥4
−1 4 10 1 11.737 1
1 3 −1 0.032 0.319 0.027
𝐴𝑥4 = ( 3 2 4 ) (0.429) = ( 4.954 ) = 11.684 (0.423) = 11.684𝑥5
−1 4 10 1 11.684 1

1 3 −1 0.027 0.296 0.025

𝐴𝑥5 = ( 3 2 4 ) (0.423) = ( 4.927 ) = 11.665 (0.422) = 11.665𝑥6
−1 4 10 1 11.665 1

1 3 −1 0.025 0.288 0.025

𝐴𝑥6 = ( 3 2 4 ) (0.422) = ( 4.919 ) = 11.737 (0.422) = 11.663𝑥7
−1 4 10 1 11.663 1
𝑥6 = 𝑥7
0.025
The dominant eigen value is 11.663 & its corresponding eigen vector is (0.422)
1

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 17

 9 1
Find the iterative formula by Newton’s formula for , where N is a positive integer. Hence
√𝑁
1
find
√15

Solution:
1 1 1
Let 𝑥 =  𝑥2 = 𝑁  𝑥2 − 𝑁 = 0
√𝑁
1
Let 𝑓(𝑥) = 𝑥 2 − 𝑁 then 𝑓 ′ (𝑥) = 2𝑥

Newton’s formula is
𝑓(𝑥𝑛)
𝑥𝑛+1 = 𝑥𝑛 = , 𝑛 = 0,1,2, … … …
𝑓 ′ (𝑥𝑛 )

MAY/JUNE-2016
1
(𝑥𝑛2 − 𝑁)
= 𝑥𝑛 −
2𝑥𝑛
1 1
2𝑥𝑛2 − 𝑥𝑛2 + 𝑁 𝑥𝑛2 + 𝑁 1 1
𝑥𝑛+1 = = = (𝑥𝑛 + ), 𝑛 − 0,1,2,3 ….
2𝑥𝑛 2𝑥𝑛 2 𝑁𝑥𝑛
1
To find , here N=15.
√15
1 1 1
Since close to = 4 = 0.25, we shall take 𝑥0 = 0.25 𝑡ℎ𝑒𝑛
√15 √16
1 1 1
𝑥1 = 2 (0.25 + 15×0.25) = 2 (0.25 + 0.26666=0.25833
1 1
𝑥2 = (0.25833 + )=0.25819
2 15×0.25833
1 1
𝑥3 = 2 (0.25819 + 15×0.25819)=0.25819889
1
The value of is 0.25819 to 5 places of decimals.
√15

10 Solve 5𝑥 − 𝑦 + 𝑧 = 10

APR/MA
Y-2015
2𝑥 + 4𝑦 = 12 𝑎𝑛𝑑
𝑥 + 𝑦 + 5𝑧 = −1 using Gauss seidel method
11 1 6 1
NOV/DEC
Find all the Eigen value of 𝐴 = [1 2 0]using power method, using 𝑥1 = (1 0 0)𝑇 as -2014
0 0 3
initial vector.
12 Find the positive root of 𝑥 3 + 𝑥 2 − 100 = 0 correct to 4 decimal places by fixed point
APR/MA
Y-2010

iteration method.
Answer: 𝑥 =4.33105

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 18

 13 Solve by Gauss Seidel method
28𝑥 + 4𝑦 − 𝑧 = 32,
𝑥 + 3𝑦 + 10𝑧 − 24,
2𝑥 + 17𝑦 + 4𝑧 = 35
Solution:
We note that the largest coefficient is attached to different variables I different equations.
The largest coefficient in each equation is numerically largest than the sum of the other two. So, iteration method
can be applied.
The diagonally dominant form is
1
28𝑥 + 4𝑦 − 𝑧 = 32  𝑥 = (32 − 4𝑦 + 𝑧)
28
1
2𝑥 + 17𝑦 + 4𝑧 = 35  𝑦 = (35 − 2𝑥 − 4𝑧)
17
1
𝑥 + 3𝑦 + 10𝑧 = 24  𝑧 = (24 − 𝑥 − 3𝑦)
10
Initially take 𝑦 (0) = 0, 𝑧 (0) = 0
I iteration:
1
𝑥 (1) = (32 − 4𝑦 (0) + 𝑧 (0) ) = 1.142857
28
1
𝑦 (1) = (35 − 2𝑥 (1) − 4𝑧 (0) ) = 1.92437
17
1
𝑧 (1) = (24 − 𝑥 (1) − 3𝑦 (1) ) = 1.708403
10
II iteration:
1
𝑥 (2) = (32 − 4𝑦 (1) + 𝑧 (1) ) = 0.928962
28
1
𝑦 (2) = (35 − 2𝑥 (2) − 4𝑧 (1) ) = 1.547557

APR/MAY-2015
17
1
𝑧 (2) = (24 − 𝑥 (2) − 3𝑦 (2) ) = 1.842837
10
III iteration
1
𝑥 (3) = (32 − 4𝑦 (2) + 𝑧 (2) ) = 1.075964
28
1
𝑦 (3) = (35 − 2𝑥 (3) − 4𝑧 (2) ) = 1.498631
17
1
𝑧 (3) = (24 − 𝑥 (3) − 3𝑦 (3) ) = 1.842814
10
IV iteration
1
𝑥 (4) = (32 − 4𝑦 (3) + 𝑧 (3) ) = 0.994582
28
1
𝑦 (4) = (35 − 2𝑥 (4) − 4𝑧 (3) ) = 1.508211
17
1
𝑧 (4) = (24 − 𝑥 (4) − 3𝑦 (4) ) = 1.848079
10
V iteration
1
𝑥 (5) = (32 − 4𝑦 (4) + 𝑧 (4) ) = 0.993401
28
1
𝑦 (5) = (35 − 2𝑥 (5) − 4𝑧 (4) ) = 1.507111
17
1
𝑧 (5) = (24 − 𝑥 (5) − 3𝑦 (5) ) = 1.84853
10
VI iteration
1
𝑥 (6) = (32 − 4𝑦 (5) + 𝑧 (5) ) = 0.9935745
28
1
𝑦 (6) = (35 − 2𝑥 (6) − 4𝑧 (5) ) = 1.50698
17
1
𝑧 (6) = (24 − 𝑥 (6) − 3𝑦 (6) ) = 1.84855
10
From the 5th and 6th iteration values we have
𝑥 = 𝟎. 𝟗𝟗𝟒, 𝒚 = 𝟏. 𝟓𝟎𝟕, 𝒛 = 𝟏. 𝟖𝟒𝟗

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 19

 14 Solve, by Gauss-Seidel method, the system of following equations, correct to three decimal places.
27𝑥 + 6𝑦 − 𝑧 = 85
𝑥 + 𝑦 + 54𝑧 = 110
6𝑥 + 15𝑦 + 2𝑧 = 72
Solution:
Interchanging the equations
27𝑥 + 6𝑦 − 𝑧 = 85 … … . (1)
6𝑥 + 15𝑦 + 2𝑧 = 72 … … (2)
𝑥 + 𝑦 + 54𝑧 = 110 … … . (3)
27 6 −1
Clearly the coefficient matrix ( 6 15 2 ) is diagonally dominant. Hence we can apply Gauss-Seidel method
1 1 54
without any difficulty.
From (1), (2) and (3) we get
1
𝑥= (85 − 6𝑦 + 𝑧) … … . (4)
27
1
𝑦= (72 − 6𝑥 − 2𝑧) … … . (5)
15
1
𝑧= (110 − 𝑥 − 𝑦) … … (6)
54
st
1 iteration:
85
Putting y=0, z=0 in (4) we get 𝑥 = = 3.148
27
Puttinh x=3.148, z=0 in (5) we get
1
𝑦= (72 − 6(3.148) − 2(0)) = 3.5408
15
Putting x=3.148, y=3.5408 in (6) we get
1
𝑧= (110 − 3.148 − 3.5408) = 1.913
54
st
In the 1 iteration:

NOV/DEC 2017
𝑥 = 3.148, 𝑦 = 3.5408, 𝑧 = 1.913
2nd iteration:
Putting 𝑦 = 3.5408, 𝑧 = 1.913 in (5) we get
1
𝑦= (72 − 6(2.4332) − 2(1.913)) = 3.572
15
Putting x=2.4322, y=3.572 in (6) we get
1
𝑧= (110 − 2.4322 − 3.572) = 1.9285
54
nd
In 2 iteration we get
𝒙 = 𝟐. 𝟒𝟑𝟐𝟐, 𝒚 = 𝟑. 𝟓𝟕𝟐, 𝒛 = 𝟏. 𝟗𝟐𝟓𝟖𝟓
3rd iteration:
Putting 𝒚 = 𝟑. 𝟓𝟕𝟐, 𝒛 = 𝟏. 𝟗𝟐𝟓𝟖𝟓 in(4) we get
1
𝑥= (85 − 6(3.572) + 1.92585) = 2.42569
27
Putting 𝑥 = 2.42569, 𝑧 = 1.92585 in (5) we get
1
𝑦= (72 − 6(2.42569) − 2(1.92585)) = 3.5729
15
Putting 𝑥 = 2.42569, 𝑦 = 3.5729 in (6) we get
1
𝑧= (110 − 2.42569 − 3.5769) = 1.92595
54
rd
In 3 iteration we get
𝑥 = 2.42569, 𝑦 = 3.5729, 𝑧 = 1.92565
4th iteration:
We get
𝒙 = 𝟐. 𝟒𝟐𝟓𝟓𝟎, 𝒚 = 𝟑. 𝟓𝟕𝟑, 𝒛 = 𝟏. 𝟗𝟐𝟓𝟗𝟓
5th iteration:
We get
𝒙 = 𝟐. 𝟒𝟐𝟓𝟒𝟕, 𝒚 = 𝟑. 𝟓𝟕𝟑𝟎, 𝒛 = 𝟏. 𝟗𝟐𝟓𝟗𝟓
6th iteration:
We get
𝒙 = 𝟐. 𝟒𝟐𝟓𝟒𝟕, 𝒚 = 𝟑. 𝟓𝟕𝟑𝟎, 𝒛 = 𝟏. 𝟗𝟐𝟓𝟗𝟓
Checking:
𝟐𝟕𝒙 + 𝟔𝒚 − 𝒛 = 𝟖𝟓
𝟐𝟕(𝟐. 𝟒𝟐𝟓𝟒𝟕) + 𝟔(𝟑. 𝟕𝟓𝟑𝟎) − 𝟏. 𝟗𝟐𝟓𝟗𝟓 = 𝟖𝟒. 𝟗𝟗𝟗

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 20

 15 Using Gauss-Seidel method solve the system of the following equations correction to a decimal places.
10𝑥1 − 2𝑥2 − 𝑥3 − 𝑥4 = 3
−2𝑥1 + 10𝑥2 − 𝑥3 − 𝑥4 = 15
−𝑥1 − 𝑥2 + 10𝑥3 − 2𝑥4 = 27
−𝑥1 − 𝑥2 − 2𝑥3 + 10𝑥4 = −9
Solution:
The coefficient matrix of the given system of equations is diagonally dominant. Therefore we can apply Gauss-Seidel
iteration method. From the given system we get
1
𝑥1 = (3 + 2𝑥1 + 𝑥3 + 𝑥4 ) … … . . (5)
10
1
𝑥2 = (15 + 2𝑥1 + 𝑥3 + 𝑥4 ) … … (6)
10
1
𝑥3 = (27 + 𝑥1 + 𝑥2 + 2𝑥4 ) … … . (6)
10
1
𝑥4 = (−9 + 𝑥1 + 𝑥2 + 2𝑥3 ) = 0.3 … … … . (8)
10
st
1 iteration:
Putting 𝑥2 = 𝟎, 𝑥3 = 0, 𝑥4 = 0 in(5) we get
3
𝑥1 = = 0.3
10
Putting 𝑥1 = 0.3, 𝑥3 = 0, 𝑥4 = 0 in (6) we get
15 + 2(0.3)
𝑥2 = = 1.56
10
Putting 𝑥1 = 0.3, 𝑥2 = 1.56, 𝑥4 = 0 in (7) we get
27 + 0.3 + 1.56 + 2(0)
𝑥3 = = 2.886
10

Putting 𝑥1 = 0.3, 𝑥2 = 1.56, 𝑥3 = 2.886 in(8) we get

APR/MAY 2017
−9 + 0.3 + 1.56 + 2(2.886)
𝑥4 = = −0.1368
10
𝒙𝟏 = 𝟎. 𝟑, 𝒙𝟐 = 𝟏. 𝟓𝟔, 𝒙𝟑 = 𝟐. 𝟖𝟖𝟔, 𝒙𝟒 = −𝟎. 𝟏𝟑𝟔𝟖
2nd iteration:
Putting 𝑥2 = 1.56, 𝑥3 = 2.886, 𝑥4 = −0.1368 we get
3 + 2(1.56) + 2.886 − 0.1368
𝑥1 = = 0.8869
10
putting 𝑥1 = 0.8869, 𝑥3 = 2.886, 𝑥4 = −0.1368 in (6) we get

15 + 2(0.8869) + 2.886 − 0.1368

x2 = = 1.9523
10
Putting 𝑥1 = 0.8869, 𝑥2 = 1.9523, 𝑥4 = −0.1368 in (7) we get

27 + 0.8869 + 1.9523 + 2(−0.1368)

𝑥3 = = 2.956
10
Putting 𝑥1 = 0.8869, 𝑥2 = 1.9523, 𝑥 = 2.9566 in (8) we get
−9 + 08869 + 1.9523 + 2(2.9566)
𝑥4 = = −0.0248
10
𝒙𝟏 = 𝟎. 𝟖𝟖𝟔𝟗, 𝒙𝟐 = 𝟏. 𝟗𝟓𝟐𝟑, 𝒙𝟑 = 𝟐. 𝟗𝟓𝟔𝟔, 𝒙𝟒 = −𝟎. 𝟎𝟐𝟒𝟖
3rd iteration; Putting 𝑥2 = 1.9523, 𝑥3 = 2.9566, 𝑥4 = −0.0248 in (5) we get
3 + 2(1.9523) + 2.9566 − 0.0248
𝑥1 = = 0.9836
10
Putting 𝑥1 = 0.9836, 𝑥3 = 2.9566, 𝑥4 = −0.0248 in (6) we get
15 + 2(0.9836) + 2.9566 − 0.0248
𝑥2 = = 1.989
10
Putting 𝑥1 = 0.9836, 𝑥2 = 1.9899, 𝑥4 = −0.0248 in (7) we get
27 + 0.9899 + 2(−0.0248)
𝑥3 = = 2.9924
10
Putting 𝑥1 = 0.9836, 𝑥2 = 1.9899, 𝑥3 = 2.9924 in (8) we get
−9 + 0.9836 + 1.9899 + 2(2.9924)
𝑥4 = = −0.0042
10
𝑥1 = 0.9836, 𝑥2 = 1.9899, 𝑥3 = 2.9924, 𝑥4 = −0.0042
4th iteration: We get 𝒙𝟏 = 𝟎. 𝟗𝟗𝟔𝟖, 𝒙𝟐 = 𝟏. 𝟗𝟗𝟖𝟐, 𝒙𝟑 = 𝟐. 𝟗𝟗𝟖𝟕, 𝒙𝟒 = −𝟎. 𝟎𝟎𝟎𝟖
5th iteration: We get 𝒙𝟏 = 𝟎. 𝟗𝟗𝟗𝟒, 𝒙𝟐 = 𝟏. 𝟗𝟗𝟗𝟕, 𝒙𝟑 = 𝟐. 𝟗𝟗𝟗𝟕, 𝒙𝟒 = −𝟎. 𝟎𝟎𝟎𝟏𝟓
6th iteration: We get 𝒙𝟏 = 𝟎. 𝟗𝟗𝟗𝟗, 𝒙𝟐 = 𝟏. 𝟗𝟗𝟗𝟗, 𝒙𝟑 = 𝟐. 𝟗𝟗𝟗𝟗, 𝒙𝟒 = −𝟎. 𝟎𝟎𝟎𝟎𝟒

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 21

 16 1 6 1
Find the dominant eigen value and the corresponding eigen vector of 𝐴 = (1 2 0). Find also the least latent
0 0 3
root and hence the third eigen value.
Solution:
1
Let 𝑥0 = (0) be an approximate eigen vector.
0
1 6 1 1 1 1
𝐴𝑥0 = (1 2 0) (0)=(1) = 1 (1) = 1𝑥1 (Largest value outside)
0 0 3 0 0 0
1 6 1 1 7 1
𝐴𝑥1 = (1 2 0) (1)=(3) = 7 (0.4286) = 7𝑥2
0 0 3 0 0 0
1 6 1 1 3.5716 1
𝐴𝑥2 = (1 2 0) (0.4286)=(1.8572) = 3.5716 (0.58000) = 3.5716𝑥3
0 0 3 0 0 0
1 6 1 1 4.1200 1
𝐴𝑥3 = (1 2 0) (0.58000)=(2.0400) = 4.1200 (0.4951) = 4.1200𝑥4
0 0 3 0 0 0
1 6 1 1 3.9706 1
𝐴𝑥4 = (1 2 0) (0.4951)=(1.9902) = 3.9706 (0.5012) = 3.9706𝑥5
0 0 3 0 0 0
1 6 1 1 4.0072 1
𝐴𝑥5 = (1 2 0) (0.5012)=(2.0024) = 4.0072 (0.4997) = 4.0072𝑥6
0 0 3 0 0 0
1 6 1 1 3.9982 1
𝐴𝑥6 = (1 2 0) (0.4997)=(1.9994) = 3.9982 (0.5001) = 3.9982𝑥7
0 0 3 0 0 0
1 6 1 1 4.0006 𝟏

NOV/DEC-2014
𝐴𝑥7 = (1 2 0) (0.5001)=(2.0002) = 𝟒. 𝟎𝟎𝟎𝟔 (𝟎. 𝟓) = 4.0006𝑥8
0 0 3 0 0 𝟎
1 6 1 1 4 𝟏
𝐴𝑥8 = (1 2 0) (0.5)=(2) = 𝟒 (𝟎. 𝟓) = 4𝑥9
0 0 3 0 0 𝟎
𝟏
Therefore dominant eigen value is 𝜆1 = 4 corresponding eigen vector is (𝟎. 𝟓)
𝟎
To find the least eigen value,
Let 𝐵 = 𝐴 − 4𝐼, 𝑠𝑖𝑛𝑐𝑒 𝜆1 = 4
1 6 1 4 0 0 −3 6 1
Therefore 𝐵 = (1 2 0) − (0 4 0) = ( 1 −2 2 )
0 0 3 0 0 4 0 0 −2
We will find the dominant eigen value of B.
1
Let 𝑦1 = (0)be the initial vector.
0
−3 6 1 1 −3 1
𝐵𝑦1 = ( 1 −2 2 ) (0) = ( 1 ) = −3 (−0.3333) = −3𝑦2
0 0 −2 0 0 0
−3 6 1 1 −4.9998 𝟏
𝐵𝑦2 = ( 1 −2 2 ) (−0.3333) = ( 1.6666 ) = −𝟒. 𝟗𝟗𝟗𝟖 (−𝟎. 𝟑𝟑𝟑𝟑) = −4.9998𝑦3
0 0 −2 0 0 𝟎
−3 6 1 1 −4.9998 𝟏
𝐵𝑦3 = ( 1 −2 2 ) (−0.3333) = ( 1.6666 ) = −𝟒. 𝟗𝟗𝟗𝟖 (−𝟎. 𝟑𝟑𝟑𝟑)
0 0 −2 0 0 𝟎
Therefore dominant eigen value of B is -5.
Smallest eigen value of of 𝑨 = −𝟓 + 𝟒 = −𝟏 = 𝝀𝟐
Trace of the matrix =sum of the eigen value.
1 + 2 + 3 = 4 − 1 + 𝜆3
6 = 3 + 𝜆3
𝜆3 = 3
All the eigen values are −𝟏, 𝟑, 𝟒

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 22

 17 Find the numerically target Eigen value and the corresponding eigenvector of a matrix 𝐴 =
25 1 2
[1 3 0]
2 0 −4
Solution:
1
Let 𝑥0 = (0) be the initial eigen vector.
0
Then,
25 1 2 1 25 1
𝐴𝑥0 = ⌈ 1 3 0 ⌉ ⌈0⌉ = ⌈ 1 ⌉ = 25 [0.04] = 25𝑥1
2 0 −4 0 2 0.08
25 1 2 1 25.2 1

NOV/DEC 2017
𝐴𝑥1 = ⌈ 1 3 0 ⌉ ⌈0.04⌉ = ⌈1.12⌉ = 25.2 [0.0444] = 25.2 𝑥2
2 0 −4 0.08 1.68 0.0667

25 1 2 1 25.1778 1
𝐴𝑥2 = ⌈ 1 3 0 ⌉ ⌈0.0444⌉ = ⌈ 1.1332 ⌉ = 25.1778 [ 0.0450 ] = 25.1778 𝑥3
2 0 −4 0.0667 1.7337 0.06884
25 1 2 1 25.1826 1
𝐴𝑥3 = ⌈ 1 3 0 ⌉ ⌈ 0.0450 ⌉ = ⌈ 1.135 ⌉ = 25.1826 [0.0450] = 25.1826 𝑥4
2 0 −4 0.06884 1.7248 0.0685
25 1 2 1 25.1821 1
𝐴𝑥4 = ⌈ 1 3 0 ⌉ ⌈0.0451⌉ = ⌈ 1.1353 ⌉ = 25.1821 [0.0450] = 25.1821𝑥5
2 0 −4 0.0685 1.7260 0.0685
Here 𝑥4 = 𝑥5
∴The dominant eigen value is 25.1821
1
The corresponding eigen vector is [0.0451]
0.0685

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 23

 18 2 −1 0
Find the smallest eigenvalue in magnitude of the matrix 𝐴 = (−1 2 −1)
0 −1 2
𝑥11 𝑥12𝑥 𝑥13
And 𝐵 = (𝑥21 𝑥22 𝑥23 ) be the inverse of A
𝑥31 𝑥32 𝑥33
So that, AA=1
Step 1: write the augmented system.
2 −1 0 1 0 0
(−1 2 −1 0 1 0)
0 −1 2 0 0 1
Step 2: 𝑅2 → 2𝑅2 + 𝑅1
2 −1 0 1 0 0
(0 3 −2 1 2 0)
0 −1 2 0 0 1
Step 3: 𝑅3 → 3𝑅3 + 𝑅2

2 −1 0 1 0 0
(0 3 −2 1 2 0)
0 0 4 1 2 0
Step 4: 𝑅1 → 3𝑅1 + 𝑅2
6 0 −2 4 2 0
(0 3 −2 1 2 0)
0 0 4 1 2 3
Step 5: 𝑅1 → 2𝑅1 + 𝑅3 ; 𝑅2 → 2𝑅2 + 𝑅3
12 0 0 9 6 3
(0 6 0 3 6 3)
0 0 4 1 2 3
Step 6: 𝑅1 → 𝑅1 ÷ 12; 𝑅2 → 𝑅2 ÷ 6; 𝑅3 → 𝑅3 ÷ 4
9 6 3
1 0 0
12 12 12
3 6 3

Apr/May 2015
0 1 0
6 6 6
1 2 3
(0 0 1
4 4 4)
Hence the inverse of the given matrix is

9 6 3
12 12 12
3 6 3 0.75 0.5 0.25
= ( 0.5 1 0.5 ) = 𝐵(𝑠𝑎𝑦)
6 6 6 0.25 0.5 0.75
1 2 3
(4 4 4)
Inverse power method:
0.75 0.5 0.25
Let 𝐵 = ( 0.5 1 0.5 )
0.25 0.5 0.75
1
and 𝑥0 = (1) be the initial eigen vector.
1
0.75 0.5 0.25 1 1.5 0.75
Then 𝑥1 = 𝐵𝑥′0 = ( 0.5 1 0.5 ) (1) = ( 2 ) = 2 ( 1 ) = 2𝑥1′
0.25 0.5 0.75 1 1.5 0.75
0.75 0.5 0.25 0.75 1.25 0.7143
𝑥2 = 𝐵𝑥1′ ( 0.5 1 0.5 ) ( 1 ) = (1.75) = 1.75 ( 1 ) = 1.75𝑥2′
0.25 0.5 0.75 0.75 1.25 0.7143
0.75 0.5 0.25 0.7143 1.2143 0.7083
𝑥3 = 𝐵𝑥′2 ( 0.5 1 0.5 ) ( 1 ) = (1.7143) = 1.7143 ( 1 ) = 1.7143𝑥3′
0.25 0.5 0.75 0.7143 1.2143 0.7083
0.75 0.5 0.25 0.7083 1.2083 0.7073
𝑥4 = 𝐵𝑥3′ ( 0.5 1 0.5 ) ( 1 ) = (1.7083) = 1.7083 ( 1 )
0.25 0.5 0.75 0.7.83 1.2083 0.7073
0.7073
Thus the dominant eigen values of 𝐵 = 𝐴−1 is 1.7083 and the corresponding eigen vector is ( 1 ). therefore, by
0.7073
0.7073
1
inverse power method, the least eigen value of A is = 0.5854 and its corresponding eigen vector is ( 1 )
1.7083
0.7073
PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 24
 19 Obtain by the power method, the dominant eigen value and the corresponding eigen vector correct
2 2 2
2 5 5 1
to two decimal places, for the matrix ( 3 3 3 ) taking (0) as the initial approximation to the
5 11
1 2 2 0
eigen vector.
1
Solution: Let the initial eigenvector be 𝑋0 = (0)
0
2 2 2 2 2 1
2 5 5 1 1
2 2
Now, 𝐴𝑋0 = ( 3 3 3 ) (0) = ( 3 ) = ( 3 ) = 2 ( 3 ) = 2𝑋1
5 11 1
1 0 1 1
2 2 2
11
2 2 2 1 3
2 5 5 1 3.67 0.80
37
𝐴𝑋1 = ( 3 3 3 ) (3) = 18
= (2.06) = 4.58 (0.45) = 4.58𝑋2
5 11 1
1 55 4.58 1
2 2 2
(12)
2 2 2
2 5 5 0.80 4.5 0.61
𝐴𝑋2 = ( 3 3 3 ) (0.45) = (2.95) = 7.43 (0.40) = 7.43𝑋3
5 11
1 2 1 7.43 1
2
2 2 2
2 5 5 0.61 4.02 0.57

APR/MAY-2014
𝐴𝑋3 = ( 3 3 3 ) (0.40) = (2.74) = 7.11 (0.39) = 7.11𝑋4
5 11
1 2 2 1 7.11 1
2 2 2
2 5 5 0.57 3.92 0.56
𝐴𝑋4 = ( 3 3 3 ) (0.39) = (2.70) = 7.05 (0.38) = 7.05𝑋5
5 11
1 2 2 1 7.05 1
2 2 2
2 5 5 0.56 3.88 0.55
𝐴𝑋5 = ( 3 3 3 ) (0.38) = (3.01) = 7.01 (0.43) = 7.01𝑋6
5 11
1 2 2 1 7.01 1
2 2 2
2 5 5 0.55 3.96 0.56
𝐴𝑋6 = ( 3 3 3 ) (0.43) = (2.75) = 7.13 (0.39) = 7.13𝑋7
5 11
1 2 2 1 7.13 1
2 2 2
2 5 5 0.56 3.9 0.55
𝐴𝑋7 = ( 3 3 3 ) (0.39) = (2.69) = 7.04 (0.38) = 7.04𝑋8
5 11
1 1 7.04 1
2 2
2 2 2
2 5 5 0.55 3.86 0.55
𝐴𝑋8 = ( 3 3 3 ) (0.38) = (2.67) = 7 (0.38) = 7𝑋9
5 11
1 1 7 1
2 2
2 2 2
2 5 5 0.55 3.86 0.55
𝐴𝑋9 = ( 3 3 3 ) (0.38) = (2.67) =7 (0.38)
5 11
1 1 7 1
2 2
0.55
Hence the dominant eigenvalue = 7 Corresponding eigenvector = (0.38)
1

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 25

 20 5 0 1
Apply Jacobi process to evaluate the eigenvalues and eigenvector of the matrix (0 −2 0)
1 0 5
Solution:
Step 1: choose the largest non-diagonal element of the given matrix.
Here the largest non-diagonal element is 𝑎13 = 1 = 𝑎31
𝑎11 = 5 = 𝑎33
1 2𝑎13 1 2(1)
𝜃 = 𝑡𝑎𝑛−1 ( ) = 𝑡𝑎𝑛−1 ( )
2 𝑎11 − 𝑎33 2 0
1
= 𝑡𝑎𝑛−1 ∞
2
𝜋
𝜃=
4
Step 2: choose appropriate orthogonal matrix
𝑐𝑜𝑠𝜃 0 −𝑠𝑖𝑛𝜃
𝑝=( 0 1 0 ).
𝑠𝑖𝑛𝜃 0 𝑐𝑜𝑠𝜃
Step 3:
1 1
0 −
√2 √2

NOV/DEC-2013
𝑃= 0 1 0 .
1 1
0
(√2 √2 )
1 1
0
√2 √2
𝑃𝑇 = 0 1 0 .
1 1
− 0
( √2 √2)
Step 4:
1 1 1 1
0 0 −
√2 √2 5 0 1 √2 √2
𝑇
𝐵 = 𝑃 𝐴𝑃 = 0 1 0 . (0 −2 0) . 0 1 0 .
1 1 1 0 5 1 1
− 0 0
( √2 √2) (√2 √2 )
6 0 0
𝐵 = (0 −2 0)
0 0 4
The eigen values are 6, −2, 4 and corresponding eigen vectors be the column of p matrix
1 1
−
√2 0 √2
𝑋1 = 0 , 𝑋 2 = (1) , 𝑋3 = 0
1 0 1
(√2) ( √2 )

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 26

 21 4 1 1
Apply Jacobi process to evaluate the eigenvalues and eigenvector of the matrix (1 1 2).
1 2 1
Solution:
Step 1: choose the largest non-diagonal element of the given matrix.
Here the largest non-diagonal element is 𝑎23 = 2 = 𝑎32
𝑎33 = 1 = 𝑎22
1 −1
2𝑎23 1 2(2)
𝜃 = 𝑡𝑎𝑛 ( ) = 𝑡𝑎𝑛−1 ( )
2 𝑎22 − 𝑎33 2 0
1
= 𝑡𝑎𝑛−1 ∞
2
𝜋
𝜃=
4
Step 2: choose appropriate orthogonal matrix
1 0 0
𝑝 = (0 𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 ).
0 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃
Step 3:
1 0 0 1 0 0
1 1 1 1
0 − 0
𝑝1 = √2 √2 ; 𝑝𝑇 1 = √2 √2 .
1 1 1 1
0 0 −
( √2 √2 ) ( √2 √2)
Step 4:
1 0 0 1 0 0
1 1 4 1 1 1 1
𝑇
0 0 −
𝐵1 = 𝑝 1 𝐴𝑝1 = √2 √2 . (1 1 2) . √2 √2 .
1 1 1 2 1 1 1
0 − 0

NOV/DEC-2013
( √2 √2) ( √2 √2 )
4 √2 0
𝐵1 = (√2 3 0 ) (non- diagonal matrix)
0 0 −1
Step 5: Repeat the step 1 to step 4 for matrix 𝐵1
4 √2 0
𝐵1 = (√2 3 0)
0 0 −1
choose the largest non-diagonal element of the given matrix.
Here the largest non-diagonal element is 𝑎12 = √2 = 𝑎21 & 𝑎11 = 4, 𝑎22 = 3
1 2𝑎12 1
𝜃 = 𝑡𝑎𝑛−1 ( ) = 𝑡𝑎𝑛−1 (2√2) = 35.26°
2 𝑎11 − 𝑎22 2
Step 6: choose appropriate orthogonal matrix
𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 0 0.817 −0.577 0 0.817 0.577 0
𝑝2 = ( 𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃 0) ⇒ 𝑝2 = (0.577 0.817 0) ; 𝑝2 𝑇 = (−0.577 0.817 0).
0 0 1 0 0 1 0 0 1

0.817 0.577 0 4 √2 0 0.817 −0.577 0

𝐵2 = 𝑝2 𝑇 𝐵1 𝑝2 = (−0.577 0.817 0) . (√2 3 0 ) (0.577 0.817 0)
0 0 1 0 0 −1 0 0 1

5 0 0
𝐵2 = (0 2 0)
0 0 −1
Here the eigen values are 5, 2, −1
To find the eigen vectors
1 0 0
1 1 2 −1 0
0 − 0.817 −0.577 0
𝑩 = 𝑝1 𝑝2 = √2 √2 . (0.577 0.817 0) = (1 1 −1).
1 1 0 0 1 1 1 1
0
( √2 √2 )
𝟐 −𝟏 𝟎
𝑿𝟏 = (𝟏), 𝑿𝟐 = ( 𝟏 ) , 𝑿𝟑 = (−𝟏)
𝟏 𝟏 𝟏

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 27

 22 Find a +ve root of 3𝑥 − √1 + 𝑠𝑖𝑛𝑥 = 0 by fixed point iteration method. Ans : 𝑥 =
1
3
√1 + 𝑠𝑖𝑛𝑥 = 0.3918
23
Obtain the positive roots of 2𝑥 3 − 3𝑥 − 6 = 0 that lies between 1 and 2 using Newton-
Raphson method.(Correct to three decimal places) Ans : 1.784
24 Solve the following system of equations by Gauss-Jordan method
3𝑥 + 4𝑦 + 5𝑧 = 18; 2𝑥 − 𝑦 + 8𝑧 = 13; 5𝑥 − 2𝑦 + 7𝑧 = 20.
Ans : 𝑥 = 3, 𝑦 = 1, 𝑧 = 1
25 Solve the following system of equations by Gauss Jacobi and Gauss-Seidal methods.
10𝑥1 + 2𝑥2 + 𝑥3 = 9 ; 𝑥1 + 10𝑥2 − 𝑥3 = −22 ; −2𝑥1 + 3𝑥2 + 10𝑥3 = 22
Ans : 3 DECIAL PLACES
GAUSS JACOBI METHOD
ITERATION X Y Z GAUSS SEIDAL METHOD
1 0.9 -2.2 2.2 ITERATION X Y Z
2 1.12 -2.07 3.04 1 0.9 -2.29 3.067
3.04
3 1.01 -2.008 2 1.051 -1.998 3.01
5
0.99 3.00 3 0.999 -1.999 3
4 -1.997 4 1 -2 3
7 4
0.99 2.99 5 1 -2 3
5 -1.999
9 9
6 1 -2 3
7 1 -2 3
26 Solve the following system of equations by Gauss Jacobi and Gauss-Seidal methods.
28𝑥 + 4𝑦 − 𝑧 = 32; 𝑥 + 3𝑦 + 10𝑧 = 24; 2𝑥 + 17𝑦 + 4𝑧 = 35
Ans : 3 DECIAL PLACES
GAUSS SEIDAL METHOD
GAUSS JACOBI METHOD ITERATION X Y Z
TERATION X Y Z 1 1.143 1.924 1.709
1 1.143 2.059 2.4 2 0.929 1.547 1.843
2 0.934 1.36 1.668 3 0.988 1.509 1.849
3 1.008 1.556 1.899 4 0.993 1.507 1.849
4 0.988 1.493 1.832 5 0.994 1.507 1.849
5 0.995 1.512 1.853 6 0.994 1.507 1.849
6 0.993 1.506 1.847
7 0.994 1.507 1.849
8 0.994 1.507 1.849

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 28

 27 −15 4 3
Find the smallest eigen value of the matrix [ 10 −12 6] , using power method.
20 −4 2
SMALLEST EIGEN VALUES
ITERATION
INVERSE OF A X (IN A) X E.V E.VE
1 0 -0.02 0.06 1 0.04 0.11
0.1 -0.09 0.12 1 0.13 0.36 0.36
0.2 0.02 0.14 1 0.36 1

2 0 -0.02 0.06 0.11 0.05 0.29

0.1 -0.09 0.12 0.36 0.1 0.17 0.59
0.2 0.02 0.14 1 0.17 1

3 0 -0.02 0.06 0.29 0.05 0.24

0.1 -0.09 0.12 0.59 0.1 0.21 0.48
0.2 0.02 0.14 1 0.21 1

4 0 -0.02 0.06 0.24 0.05 0.25

0.1 -0.09 0.12 0.48 0.1 0.2 0.5
0.2 0.02 0.14 1 0.2 1

0 -0.02 0.06 0.25 0.05 0.25

5 0.1 -0.09 0.12 0.5 0.1 0.2 0.5
0.2 0.02 0.14 1 0.2 1
1
Ans : 0.2 = 5

28 Using Jacobi method, find all the eigen values and eigen vectors of the matrix 𝐴 =
1 0 0 1 0 0 1 0 0
[0 3 −1]. Ans : 𝐵 = [ 0 1/√2 1/√2], 𝐶 = (0 4 0)
0 −1 3 0 −1/√2 1/√2 0 0 2

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 29

 29 Find the positive root of 𝑥 4 − 𝑥 = 10 correct to 3
decimal places by Newton – Raphson method.
Let 𝑓(𝑥) = 𝑥 4 − 𝑥 − 10 = 0, 𝑓(1) = −10, 𝑓(2) = 4
By intermediate value theorem the root lies between 1 & 2. Let 𝑥0 = 1.5
𝑓(𝑥 )
By Newton’s Method 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′ (𝑥𝑛 ) , 𝑓 ′ (𝑥) = 4𝑥 3 − 1
𝑛

ITERATION 𝑓(𝑥𝑛 ) 𝑓 ′ (𝑥𝑛 ) 𝑥𝑛+1

𝑛=1 -6.438 12.5 2.015
𝑛=2 4.47 31.725 1.874
𝑛=3 0.459 25.325 1.856
𝑛=4 0.01 24.574 1.856
∴ The the root of given equation is 1.856.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 30

 30 Solve the following system of equations by Gauss
Jordan method:
10𝑥 + 𝑦 + 𝑧 = 12;
2𝑥 + 10𝑦 + 𝑧 = 13;
𝑥 + 𝑦 + 5𝑧 = 7.
10 1 1 12
2 1 10 13
1 1 5 7

1 0.1 0.1 1.2 𝑅1 → 𝑅1 /10

1 0.5 5 6.5 𝑅2 → 𝑅2 /2
1 1 5 7

1 0.1 0.1 1.2

0 0.4 4.9 5.3 𝑅2 → 𝑅2 − 𝑅1
0 0.9 4.9 5.8 𝑅3 → 𝑅3 − 𝑅1

1 0.1 0.1 1.2

0 1 12.3 13.3 𝑅2 → 𝑅2 /0.4
0 1 5.44 6.44 𝑅3 → 𝑅3 /0.9

1 0.1 0.1 1.2

0 1 12.3 13.3
0 0 -6.8 -6.8 𝑅3 → 𝑅3 − 𝑅2

10 1 1 12 𝑅1 → 𝑅1 /0.1
0 0.08 1 1.08 𝑅2 → 𝑅2 /12.3
0 0 1 1 𝑅3 → 𝑅3 /−6.8

10 1 0 11 𝑅1 → 𝑅1 − 𝑅3
0 0.08 0 0.08 𝑅2 → 𝑅2 − 𝑅3
0 0 1 1

10 1 0 11
0 1 0 1 𝑅2 → 𝑅2 /0.08
0 0 1 1

10 0 0 10 𝑅1 → 𝑅1 − 𝑅2
0 1 0 1
0 0 1 1

1 0 0 1 𝑅1 → 𝑅1 /10
0 1 0 1
0 0 1 1

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 31

𝑥 𝑦 𝑧
=1 =1 =1
 31 Find the real positive root of 3𝑥 − 𝑐𝑜𝑠𝑥 − 1 = 0 by Newton’s method correct to 6 decimal
places.
Ans : Let 𝑓(𝑥) = 3𝑥 − 𝑐𝑜𝑠𝑥 − 1 = 0, 𝑓(0) = −1, 𝑓(2) = −0.59, 𝑓(1) = 1.4597
By intermediate value theorem the root lies between 0 & 1. Let 𝑥0 = 0.5
𝑓(𝑥 )
By Newton’s Method 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′ (𝑥𝑛 ) , 𝑓 ′ (𝑥) = 3 + 𝑠𝑖𝑛𝑥
𝑛

ITERATION 𝑓(𝑥𝑛 ) 𝑓 ′ (𝑥𝑛 ) 𝑥𝑛+1

𝑛=1 -0.377583 3.479426 0.608519
𝑛=2 0.005060 3.571653 0.607102
𝑛=3 0.000001 3.570490 0.607102
∴ The the root of given equation is 0.607102.
32 Solve the following system of equations by Gauss Elimination method 3𝑥 + 𝑦 − 𝑧 = 3; 2𝑥 −
8𝑦 + 𝑧 = −5; 𝑥 − 2𝑦 + 9𝑧 = 8.
Ans : The above system of equation can be written as 𝐴𝑋 = 𝐵, 𝑤ℎ𝑒𝑟𝑒 𝐴 =
3 1 −1 𝑥 3
[2 −8 1 ] , 𝑋 = [𝑦] , 𝐵 = [−5]
1 −2 9 𝑧 8
The augmented matrix is
3 1 -1 3
[𝐴⁄𝐵 ] = 2 -8 1 -5
1 -2 9 8

1 -2 9 8 𝑅1 ↔ 𝑅3
= 3 1 -1 3
2 -8 1 -5

1 -2 9 8
= 0 7 -28 -21 𝑅2 → 𝑅2 − 3𝑅1
0 -4 -17 -21 𝑅3 → 𝑅3 − 2𝑅1

1 -2 9 8
= 0 7 -28 -21
0 0 -231 -231 𝑅3 → 7𝑅3 + 4𝑅2
By back substitutions −231𝑧 = −231 ⇒ 𝑧 = 1; 7𝑦 − 28𝑧 = −21 ⟹ 7𝑦 = −21 + 28𝑦 =
1; 𝑥 − 2𝑦 + 9𝑧 = 8 ⇒ 𝑥 = 8 + 2 − 9 ⇒ 𝑥 = 1.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 32

 33 Solve the following system of equations by using Gauss Jacobi methods 8𝑥 − 3𝑦 + 2𝑧 =
20; 4𝑥 + 11𝑦 − 𝑧 = 33; 6𝑥 + 3𝑦 + 12𝑧 = 35.
Ans : Clearly the given equation is diagonally dominant
𝑥 = (1 ÷ 8)(20 + 3𝑦 − 2𝑧); 𝑦 = (1 ÷ 11)(33 − 4𝑥 + 𝑧); 𝑧 = (1 ÷ 12)(35 − 6𝑥 − 3𝑦)
By Gauss Jacobi method
𝑥𝑛+1 = (1 ÷ 8)(20 + 3𝑦𝑛 − 2𝑧𝑛 ); 𝑦𝑛+1 = (1 ÷ 11)(33 − 4𝑥𝑛 + 𝑧𝑛 ); 𝑧𝑛+1
= (1 ÷ 12)(35 − 6𝑥𝑛 − 3𝑦𝑛 )
ITERATION 𝑥𝑛+1 𝑦𝑛+1 𝑧𝑛+1
𝑛=1 2.5 3 2.917
𝑛=2 2.896 2.356 0.917
𝑛=3 3.154 2.03 0.88
𝑛=4 3.041 1.933 0.832
𝑛=5 3.017 1.97 0.913
𝑛=6 3.011 1.986 0.916
𝑛=7 3.016 1.988 0.915
𝑛=8 3.017 1.986 0.912
𝑛=9 3.017 1.986 0.912
34 4 1
Using Jacobi method, find the Eigen value and Eigen vector of the following matrix [ ]
1 4
4 1
Ans : Let the given matrix be 𝐴 = [ ]
1 4
The largest off diagonal element is 𝑎21 = 𝑎12 = 1
𝑎12 𝜋 𝜋
𝑡𝑎𝑛2𝜃 = 𝑎 ⟹ 𝑡𝑎𝑛2𝜃 = ∞ ⟹ 2𝜃 = ⟹𝜃=
11 −𝑎22 2 4
1 1
𝑐𝑜𝑠𝜃 −𝑠𝑖𝑛𝜃 −
Let the rotation matrix be 𝑅1 = [ ] ⟹ 𝑅1 = [√2
1 1
√2
]
𝑠𝑖𝑛𝜃 𝑐𝑜𝑠𝜃
√2 √2
1 1 1 1
√2 √2 4 1 √2 − √2
Now 𝐷 = 𝑅1𝑇 𝐴𝑅1 ⇒ 𝐷 = [ 1 1 ] [1 ][ 1 ]
− 4 1
√2 √2 √2 √2

11 1 4 1 1 −1
𝐷 = 2[ ][ ][ ]
−1 1 1 4 1 1
1 1 1 5 −3
𝐷 = 2[ ][ ]
−1 1 5 3
1 10 0 5 0
𝐷= [ ]⇒𝐷=[ ]
2 0 6 0 3
∴ 𝐷 is a diagonal matrix.
1 −1
The eigen values are 5 & 3 whose corresponding eigen vectors are 𝑋1 = [ ], 𝑋2 = [ ]
1 1

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 33

 35 Using Newton’s method, find a real root of x log10 x  1.2 correct to 4 decimals.

Ans : Let 𝑓(𝑥) = 𝑥𝑙𝑜𝑔10 𝑥 − 1.2 = 0, 𝑓(1) = 0, 𝑓(2) = −0.59, 𝑓(3) = 0.23
By intermediate value theorem the root lies between 2 & 3. Let 𝑥0 = 2.5
𝑓(𝑥 )
By Newton’s Method 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′ (𝑥𝑛 ) , 𝑓 ′ (𝑥) = 0.4343 + 𝑙𝑜𝑔10 𝑥
𝑛

ITERATION 𝑓(𝑥𝑛 ) 𝑓 ′ (𝑥𝑛 ) 𝑥𝑛+1

𝑛=1 -0.2051 0.8322 2.7465
𝑛=2 0.0051 0.8731 2.7406
𝑛=3 0.0000 0.8722 2.7406
∴ The the root of given equation is 2.7406.
36 Find the root of the equation 𝑥 𝑥 = 100, correct to 4 decimals, using Newton-Raphson method.
Ans : Let 𝑓(𝑥) = 𝑥 𝑥 − 100 = 0, 𝑓(1) = −99, 𝑓(2) = −96, 𝑓(3) =
−33, 𝑓(4) = 156
By intermediate value theorem the root lies between 3 & 4. Let 𝑥0 = 3.5
𝑓(𝑥 ) 1+𝑙𝑜𝑔𝑥
By Newton’s Method 𝑥𝑛+1 = 𝑥𝑛 − 𝑓′ (𝑥𝑛 ) , 𝑓 ′ (𝑥) =
𝑛 𝑥𝑥

ITERATION 𝑓(𝑥𝑛 ) 𝑓 ′ (𝑥𝑛 ) 𝑥𝑛+1

𝑛=1 -19.7882 123.8524 3.6598
𝑛=2 15.3756 180.3844 3.5745
𝑛=3 -5.0484 147.4807 3.6088
𝑛=4 2.6542 159.8694 3.5922
𝑛=5 -1.1607 153.7303 3.5997
𝑛=6 0.5554 156.4911 3.5962
𝑛=7 -0.2551 155.1870 3.5978
𝑛=8 0.1195 155.7897 3.5970
𝑛=9 -0.0554 155.5083 3.5974
𝑛 = 11 0.0258 155.6391 3.5972
𝑛 = 12 -0.0120 155.5781 3.5973
𝑛 = 13 0.0056 155.6065 3.5973
∴ The the root of given equation is 3.5073.

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 34

 37 Solve the following system of equations by Gauss elimination method:
1 2 3 4 𝑥1 10
𝑥
[ 7 10 5 2 ] [𝑥2 ] = [40]
13 6 2 −3 3 34
11 14 8 −1 𝑥4 64
Ans : The above matrix can be written as 𝐴𝑋 = 𝐵
The augumented matrix is [𝐴/𝐵]
1 2 3 4 10
7 10 5 2 40
13 6 2 -3 34
11 14 8 -1 64
1 2 3 4 10
1 10/7 5/7 2/7 40/7 𝑅2 → 𝑅2 ÷ 7
1 6/13 2/13 -3/13 34/13 𝑅3 → 𝑅3 ÷ 13
1 14/11 8/11 -1/11 64/11 𝑅4 → 𝑅4 ÷ 11
1 2 3 4 10
0 -4/7 -16/7 -26/7 -30/7 𝑅2 → 𝑅2 − 𝑅1
0 -20/13 -37/13 -55/13 -96/13 𝑅3 → 𝑅3 − 𝑅1
0 -8/11 -25/11 -45/11 -46/11 𝑅4 → 𝑅4 − 𝑅1
1 2 3 4 10
7
0 1 4/1 13/2 15/2 𝑅2 → 𝑅2 × (− )
4
13
0 1 37/20 11/4 24/5 𝑅3 → 𝑅3 × (− )
20
8
0 1 25/8 45/8 23/4 𝑅4 → 𝑅4 × (− )
11
1 2 3 4 10
0 1 4/1 13/2 15/2
0 0 -43/20 -15/4 -27/10 𝑅3 → 𝑅3 − 𝑅2
0 0 -7/8 -7/8 -7/4 𝑅4 → 𝑅4 − 𝑅2
1 2 3 4 10
0 1 4/1 13/2 15/2
20
0 0 1 75/43 54/43 𝑅3 → 𝑅3 × (− )
43
8
0 0 1 1 2 𝑅4 → 𝑅4 × (− )
7
1 2 3 4 10
0 1 4 13/2 15/2
0 0 1 75/43 54/43
0 0 0 -32/43 32/43 𝑅4 → 𝑅4 − 𝑅3
1 2 3 4 10
0 2 8 13 15 𝑅2 → 𝑅2 × 2
0 0 43 75 54 𝑅3 → 𝑅3 × 43
43
0 0 0 1 -1 𝑅4 → 𝑅4 × (− )
32
𝑥1 + 2𝑥2 +3𝑥3 +4𝑥4 = 10
2𝑥2 +8𝑥3 +13𝑥4 = 15
43𝑥3 +75𝑥4 = 54
𝑥4 = −1
By using back substitution method we get 𝑥4 = −1 ; 𝑥3 = 3 ; 𝑥2 = 2 ; 𝑥1 = 1

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 35

 38 Solve the system of equation correct to 3 decimal places using Jacobi method
x  17 y  2 z  48;
30 x  2 y  3z  75;
2 x  2 y  18 z  30.
39 Find the largest Eigenvalue and its corresponding Eigenvector using Power
 1 3 2 
method, for A   4 4 1 .
 6 3 5 
40 Apply Gauss-Jacobi method to solve the system of equation

20 x  y  2 z  17;
3 x  20 y  z  18;
2 x  3 y  20 z  25
41 1 √2 2
Find all the eigenvalues and eigenvectors of the matrix = [√2 3 √2] , by Jacobi’s
2 √2 1
method.

1 1
0 − 3 2 0
√2 √2
𝜋 𝜋
Ans : 𝜆 = 5,1, −1, 𝜃 = , 𝑆1 = [ 0 1 0 ] , 𝐵1 = [2 3 0 ] ,𝜃 = 4 ,
4 1 1
0 0 0 −1
√2 √2

1 1 1
1 1 − −
− 0 √2 √2 √2
√2 √2 5 0 0 1 1
𝑆2 = 1 1 , 𝐵2 = [0 1 0 ] 𝑆 = 𝑆1 𝑆2 = 0
0 0 0 −1 √2 √2
√2 √2 1 1 1
[0 0 1] −
[2 2 √2 ]

PREPARED BY : DEPARTMENT OF H&S (MATHEMATICS) RIT Page 36