UNIT-III

SOLUTION OF EQUATIONS AND EIGEN VALUE

PROBLEMS
PART-A

1. State the order of convergence and convergence condition for Newtons Raphson
method.
Solution:
The order of convergence is 2.

Condition for convergence is

¿ ¿
2. Write the iterative formula of Newton Raphson method.
Solution:
f ( xn )
x n+1=x n − .
f ' ( xn )

3. Drive a formula to find the value of √3 N ,where N≠0, using Newton-Raphson method.
Solution:
1
3
Let x=N
3
x =N
3
x −N =0
i. e . , f ( x )=x 3−N , f '( x )=3 x 2

`
f ( xn )
x n+1=x n − .
f ' ( xn )

1
 x 3−N
n
=x n − .
3x 2
n
3 x 3 −x 3 + N
n n
=
3x
n2
2 x 3+ N
n
=
3x
n2

x n+1 =
1
3
2 xn +
[N
x2 ]
, n=0 , 1 ,2 , .. . .. ..
n

4. Using Newton-Raphson method, find the iteration formula to compute √ N where N

is a positive number and hence find √ 5.
Solution:

If x=√ N , then x2 −N =0 is the equation to be solved.

2
let f ( x )=x −N , f ' (x )=2 x
f (x n )
x n+1=x n − .
By N.R formula, if
x n is the nth iterate f ' (x n )
x 2−N
n
=x n − .
2 xn
2 x 2− x 2+ N
n n
=
2 xn
x 2+N
n
=
2 xn

x n+1 =
1
[
x +
2 n xn
N
]
To Find √ 5
Put N=5. Also x=√ 5 lies between 2 and 3.

2
 x 0 =2

x n+1=
1
2 [
xn +
N
xn ]
x1 =
1
2 [ 5
]
x 0 + =2 . 25
x0

x2 =
1
2 [ 5
]
x 1 + =2. 2361
x1

Let
x3 =
1
2 [ 5
]
x 2 + =2. 2361
x2
Hence the approximate value of √ 5=2.2361 .

5. Find an iterative formula to find the reciprocal of a given number N.

Solution:
1 1
Let x = Therefore N =
N x
1 1
f ( x )= −N =0 ; f '( x )=− 2
x x
f ( xn )
x n+1=x n − .
f ' ( xn )

= x n−
1
xn( −N
)
( )
1
−
x2
n

=x n + x
n
2 ( 1
xn
−N
)
=2 x n−Nx 2 =x n ( 2−Nxn ) .
n
6. Give two direct and indirect methods to solve a system of equations.
Solution:
Direct method:

3
 (i) Gauss elimination method
(ii) Gauss Jordan method.

Indirect method:

(i) Gauss Jacobi method

(ii) Gauss seidel method
7. Solve the following system of equations, using Gaussian elimination method x-2y=0;
2x+y= 5.
Solution: The given is equivalent to
⌊ A , B ⌋= (
1 −2 0
2 1 5 |)
Now, we will make the matrix A as a upper triangular
¿ (
1 −2 0
0 5 5 2 |)
R ↔R2- 2R1

¿ (
1 −2 0
0 1 1 |) R
R2↔ 2
5
By back substitution y=1 and x-2y=0
Therefore x-2=0
x=2
Hence x=2, y=1.

8. Solve the following system of equations, using Gauss-Jordan elimination method

2x+y=3; x-2y=-1.
Solution: The given is equivalent to
⌊ A , B ⌋= (
2 1 3
1 −2 −1 | )
( 20 −5|−5 )
1 3
¿ R ↔2 R - R
2 2 1

¿(
2
0 |1 1) R ↔−5R
13
2
2

1|1 )
¿(
2 02
R ↔R - R
2 1 2
0

1|1)
¿(
1 01 R 1
R↔ 1
0 2
Hence x=1, y=1.
9. To which forms are the augmented matrix transformed in the Gauss Jordon and
Gauss Elimination method.
Solution:
Gauss Elimination : Co-efficient matrix is transformed into upper triangular matrix.
Gauss Jordan : Co-efficient matrix is transformed into diagonal matrix.

4
10. For solving a linear system, compare Gaussian elimination & Gauss-Jordan method

S. No. Gauss Elimination Gauss Jordan

1. Co efficient matrix is Co efficient matrix is
transformed into upper transformed into diagonal
triangular matrix. matrix.
2. We obtain the solution by We obtain the solution
back substitution method directly .
3. Direct method Direct method.

11. Compare Gauss-Jacobi with Gauss Jordan

Solution:
S. No. Gauss Jacobi Gauss Jordan
1. Inirect method Direct method.
2. The coefficient matrix Matrix need not be
should be diagonally diagonally dominant.
dominant

12. Write a sufficient condition for Gauss-Jacobi(or Gauss-Seidal) method to converge.

Solution:
The process of iteration by Gauss seidal method will converge if in each equation
of the system, the absoluted value of the largest co-efficient is greater than the sum of the
absolute value of the remaining co-efficient.

13. Compare Gauss-elimination and Gauss seidal(or Gauss Jacobi) method

Solution:

S. No. Gauss Elimination Gauss –Seidal(or Gauss Jacobi)

1. Direct method Indirect method.
2. Exact Solution Approximate Solution
3. Co efficient matrix is Co efficient matrix is diagonally
transformed into upper dominat.
triangular matrix.

14. Compare Gauss-Jacobi and Gauss seidal method

Solution:

S. No. Gauss Jacobi method Gauss –Seidal method

1. Indirect method Indirect method.

5
 2. Convergence rate is slow The rate of convergence of
Gauss seidal method is
roughly twice that of Gauss
Jacobi method.
3. Condition for convergence Condition for convergence
is the co -efficient matrix is the co -efficient matrix is
is diagonally dominant. diagonally dominant.

15. Why Gauss seidal method is a better method than Jacobi method.
Solution:
Since the current value of the unknowns at each stage of iteration are used in
proceeding to the next stage of iteration, the convergence in Gauss-seidal method will be
more rapid than in Gauss-Jacobi method.

16. Distinguish between direct and iterative(or indirect) method of solving simultaneous
equation.
Solution:

S. No. Direct method Indirect method

1. We get exact solution Approximate Solution
2. Simple, take less time. Time consuming laborious.

PART-B
Newton-Raphson Method:

1. Find the real positive root of 3 x−cos x−1=0 by Newton’s method correct to 6 decimal
places. [Pg. No.3.7: Eg: 3.1.3].
2. Solve by Newton’s method, a root of ex- 4x=0. [Pg. No.3.12: Eg: 3.1.7].
3. Find a root of
x log x−12=0 by N.R method correct to three decimal places.
10
[Pg. No.3.16: Eg: 3.1.10].
4. Using N – R method,solve
x log x=12 . 34
10 x
taking the initial value 0 as 10.
[Pg. No.3.18: Eg: 3.1.11].
5. Find the real root of x3-2x-5=0 using N.R. method. [Pg. No.3.19: Eg: 3.1.12].

Gauss Elimination and Gauss Jordan method:

6
 1. Solve the system of equations by (i) Gauss elimination method (ii) Gauss-Jordan method.
10x-2y+3z=23; 2x+10y-5z=-33; 3x-4y+10z=41.
[Pg. No.3.35: Eg: 3.2.1].
2. Using Gauss-Jordan, solve the following system
10x+y+z=12; 2x+10y+z=13; x+y+5z=7. [Pg. No.3.42: Eg: 3.2.6].

Gauss Jacobi and Gauss seidal method:

1. Solve the following system of equations by Gauss-Jacobi method & Gauss-Seidel

method. 27 x +6 y−z=85 , x + y +54 z=110, 6 x +15 y+2 z=72
[Pg. No.3.52: Eg: 3.3.1] .
2. Solve the following system of equations by Gauss-Seidel method.
4 x+2 y +z=14 , x+5 y −z=10 , x+ y +8 z=20
[Pg. No.3.56: Eg: 3.3.2] .

Inverse of a matrix Gauss-Jordan method:

( )
2 2 3
A= 2 1 1
1. Using Gauss-Jordan method, find the inverse of
1 3 5 .
[Pg. No.3.72: Eg: 3.4.1] .

( )
1 1 3
A= 1 3 −3
2. Using Gauss-Jordan method, find the inverse of
−2 −4 −4 .
[Pg. No.3.73: Eg: 3.4.2] .

Eigen value of a matrix by power method:

( )
1 −3 2
A= 4 4 −1
1. Find the numerically largest Eigen value of
6 3 5 by power method.
[Pg. No.3.78: Eg: 3.5.1] .

( )
1 6 1
A= 1 2 0
2. Find the dominant Eigen value and the corresponding Eigen vector of
0 0 3 .
Find also the least latent root and hence the third Eigen value also.
[Pg. No.3.82: Eg: 3.5.3] .

7
8