NUMERICAL METHODS

Download as pdf or txt
Download as pdf or txt
You are on page 1of 33

DHANALAKSHMI SRINIVASAN ENGINEERING COLLEGE

PERAMBALUR
DEPARTMENT OF SCIENCE AND HUMANITIES
QUESTION BANK
NUMERICAL METHODS-MA1251
UNIT-I
(SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS)
PART-A
1 .State the iterative formula for regula falsi method to solve f(x)=0
Solution:
The iteration formula to find a root of the equation f(x)=0
Which lies between x = a and x = b is
X1 = ( a f(b) – b f(a)) / f(b) – f(a)
2. How to reduce the number of iterations while finding the root of an
equation by Regula falsi method.
Solution:
The number of iterations to get a good approximation to the real
root can be reduced ,if we start with a smaller interval for the root.
3. State the order of convergence and convergence condition for Newton
Raphson method.
Solution:
The order of convergence is 2
condition for convergence is ‫ ׀‬f(x)f”(x) ‫ ׀ < ׀‬f’(x)‫׀‬2
4. Write the iterative formula of Newton Raphson method.
Solution:
Xn+1= xn – f(xn) / f’(xn)
5. State the principle used in Gauss Jordan method.
Solution:
Coefficient matrix is transformed into diagonal matrix
6. For solving a linear system, compare Gaussian elimination method
and Gauss Jordan method.
Solution:

7. Write a sufficient condition for Gauss seidel method to converge


Solution:
Gaussian elimination Gauss Jordan method
The
method
Coefficient
matrix should be
Coefficient matrix is Coefficient matrix is
diagonally
transformed into upper transformed into diagonal
dominant
triangular matrix matrix
8. Compare Gauss –
Jacobi method and
Direct method Direct method
Gauss seidel
methods
We obtain the solutions by No need of back
Solution:
back substitution method substitution method

9. Is Gauss-Jacobi method Gauss -Seidel method the


iteration method,a
self - Convergence rate is slow The rate of convergence of correcting
method Gauss -Seidel method is always?
roughly twice that of Solution:
Gauss-jacobi. In general
,iteration Indirect method Indirect method is a self -
Condition for convergence Condition for convergence correcting
method, is the coefficient matrix is is the coefficient matrix is since the
round diagonally dominant diagonally dominant
off error is
smaller.
10. Why Gauss -Seidel method is a better method than Jacobi’s iterative
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 -Seidel method will be more rapid than in Gauss-Jacobi method.
11. Distinguish between direct and iterative (Indirect)method of solving
Simultaneous equations.

12. Direct method Indirect method Write the


two We get exact solution Approximate solution methods to
solve a system of
equation Simple, take less time Time consuming laborious
Solution:
(i) Direct method (ii) Indirect method
13. What is meant by diagonally dominant?
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 element in that row.
14. What is meant by self correcting method
Solution:
The error made in any computation is corrected in the subsequent
iterations.
15.When Gaussian elimination method fails ?
Solution:
This method fails if the element in the top of the first column is zero.
We can rectify this by interchanging the rows of the matrix.
PART-B
1. Find the positive root of x3 – 2x -5 = 0 by Regula falsi method.

2. Find an approximate root of x log10 x – 1.2 = 0 by Regula falsi method

3. Solve 3x-cosx =1 by Regula falsi method

4. Find by NR method ,the root of log10 x = 1.2

5. By Newton Raphson find a non –zero root of x2 + 4 sinx = 0

6. Obtain Newton’s iterative formula for finding N where N is a positive


real number. Hence evaluate 142

7. Find the iterative formula for finding the value of 1 / N where N is a real
number, using Newton Raphson method. Hence evaluate 1/26 correct to
4 decimal places

8. Find the negative root of x3 – sinx + 1 = 0 by using NR method

9. Solve the system of equations by Gauss elimination method


10 x – 2y +3z = 23
2x +10y -5z = -33
3x – 4y + 10 z = 41

10. Solve the system of equations by Gauss Jordan method

2x +3y -z = 5
4x +4y -5z = 3
2x –3y + 2 z = 2
11. Solve the system of equations by Gauss Jacobi method

2x -3y +20z = 25
20x +y -2z = 17
3x +20y - z = -18
12. Solve the system of equations by Gauss Jacobi method
2x -3y +20z = 25
20x +y -2z = 17
3x +20y - z = -18
13. Find the dominant eigen value and the corresponding eigen vector
⎛1 6 1⎞
Of the following matrix A= ⎜⎜ 1 2 0 ⎟⎟
⎜0 0 3⎟
⎝ ⎠

14. Find all the eigen value of the following matrix


⎛ 2 −1 0 ⎞
⎜ ⎟
⎜ −1 2 −1⎟
⎜ 0 −1 2 ⎟
⎝ ⎠
UNIT-II
(INTERPOLATION AND APPROXIMATION)
PART-A
1. State Interpolation and Extrapolation.
Solution:
The process of finding the value of a function inside the given range is
called Interpolation.
The process of finding the value of a function outside the given range is
called Extrapolation.
2. State Newton’s forward interpolation formula.
Solution:
y n = f ( x0 + nh)
n(n − 1) 2 n(n − 1)(n − 2) 3
= y 0 + ny 0 + ∆ y0 + ∆ y 0 + .....
2! 3!
3. State Newton’s backward interpolation formula.
Solution:
y n = f ( x n + nh)
n(n + 1) 2 n(n + 1)(n + 2) 3
= y n + ny n + ∆ yn + ∆ y n + .....
2! 3!
4. State Gauss forward interpolation formula.
Solution:
n(n − 1) 2 n(n − 1)(n + 1) 3
y ( x) = y0 + n∆y0 + ∆ y −1 + ∆ y −1
2! 3!
n(n − 1)(n − 2)(n + 1) 4
+ ∆ y −2 + .....
4!
5. State Gauss backward interpolation formula.
Solution:

n(n − 1) 2 n(n − 1)(n + 1) 3


y ( x) = y 0 + n∆y −1 + ∆ y −1 + ∆ y −2
2! 3!
n(n − 1)(n + 1)(n + 2) 4
+ ∆ y − 2 + .....
4!
6. State Newton’s divided difference formula.
Solution:
f ( x) = f ( x0 ) + ( x − x 0 ) f ( x 0 , x1 ) + ( x − x0 )( x − x1 ) f ( x0 , x1 , x 2 ) + ....

7. State Lagrange’s Interpolation formula.


Solution:
Let y = f(x) bea function such that f(x) takes the values y0,y1,…yn
corresponding to x0,x1,…xn
y = f ( x)
( x − x1 )( x − x 2 )...( x − x n ) ( x − x0 )( x − x 2 )...( x − x n )
= y0 + y1 + ....
( x0 − x1 )( x0 − x 2 )...( x 0 − x n ) ( x1 − x0 )( x1 − x 2 )...( x1 − x n )
( x − x0 )( x − x1 )...( x − x n −1 )
+ yn
( x n − x1 )( x n − x 2 )...( x n − x n −1 )

8. State Inverse Interpolation formula.


Solution:
x = f ( y)
( y − y1 )( y − y 2 )...( y − y n ) ( y − y 0 )( y − y 2 )...( y − y n )
= x0 + x1 + ....
( y 0 − y1 )( y 0 − y 2 )...( y 0 − y n ) ( y1 − y 0 )( y1 − y 2 )...( y1 − y n )
( y − y 0 )( y − y1 )...( y − y n −1 )
+ xn
( y n − y1 )( y n − y 2 )...( y n − y n −1 )

9. When will you use Newton’s backward interpolation formula.


Solution:
We can apply the Newton’s backward interpolation if the unknown value
lies near the end of the table.
10. Using Lagrange’s interpolation formula, find the polynomial for
x: 0 1 3 4
y: -12 0 0 12
Solution:

y = f ( x)
( x − x1 )( x − x 2 )...( x − x n ) ( x − x 0 )( x − x 2 )...( x − x n )
= y0 + y1 + ....
( x 0 − x1 )( x 0 − x 2 )...( x 0 − x n ) ( x1 − x 0 )( x1 − x 2 )...( x1 − x n )
( x − x 0 )( x − x1 )...( x − x n −1 )
+ yn
( x n − x1 )( x n − x 2 )...( x n − x n −1 )
( x − 1)( x − 3)( x − 4) ( x − 0)( x − 3)( x − 4)
= (−12) + 0
(0 − 1)(0 − 3)(0 − 4) (1 − 0)(1 − 3)(1 − 4)
( x − 0)( x − 1)( x − 4) ( x − 0)( x − 1)( x − 3)
+ 0+
(3 − 0)(3 − 1)(3 − 4) (4 − 0)(4 − 1)(4 − 3)
= 2 x 3 − 12 x 2 + 22 x − 12
11. Obtain the interpolation quadratic polynomial for the given data by using
Newton’s forward difference formula.
Solution:
The finite difference table is
x y ∆y ∆ 2y ∆ 3y
0 -3
8
2 5 8
16 0
4 21 8
24
6 45
x−0 x
n= =
2 2
n ( n − 1) 2
∴ f ( x) = y 0 + n∆y 0 + ∆ y0
2
= x2 + 2x − 3
12. Write down the range of n for which Gauss forward interpolation and Gauss
backward interpolation gives accuracy result.
Solution:
For Gauss forward interpolation the range for n is 0 < n < 1 and for Gauss
backward the range is -1 < n < 0.
13. Find the parabola of the form y = ax2 + bx + c passing through the points
(0,0) (1,1) and (2,20)
Solution:
By Lagrange’s formula
( x − 1)( x − 2) ( x − 0)( x − 2) ( x − 0)( x − 1)
y= 0+ 1+ 20
(0 − 1)(0 − 2) (1 − 0)(1 − 2) (2 − 0)(2 − 1)
= 9 x 2 − 8x

14. Write the Lagrange’s fundamental polynomial L0(x) and L1(x) that satisfy
the condition L0(x) + L1(x) =1 for the data [x0 ,f(x0)],[x1,f(x1)]

Solution:

x − x1
L0 ( x) =
x0 − x1
x − x0
L1 ( x) =
x1 − x0

15. State any two properties of divided difference.

Solution:

(i) The divided difference are symmetrical in all their arguments.

(ii) The divided difference of the sum or difference of two functions in


equal to the sum or difference of the corresponding separate divided
difference.

(iii)
16. What are the natural (or) free conditions in Cubic Spline.

Solution:

S ′′( x 0 () = 0, S ′′( x n ) = 0 are called free conditions.

17. Define natural spline.

Solution:

If S ′′( x0 () = 0, S ′′( x n ) = 0 the cubic spline is called an natural spline.

18. State the properties of cubic spline.

Solution:

(i) S(xi) = yi , i = 0,1,2,…n

(ii) S ( x), S ′( x), S ′′( x) are continuous in [a,b].

(iii) S(x) is a cubic polynomial.

19. State the order of convergence of cubic spline.

Solution:

Order of convergence = 4.

20. State the error in N.F.I.F

Solution:

u (u − 1)(u − 2)...(u − n)h n +11 f n +1


(c )
Error =
(n + 1)!
x − x0
u=
n
21. State the error in N.B.I.F

Solution:

u (u + 1)(u + 2)...(u + n)h n +1 y n +1 (c)


Error =
(n + 1)!
x − xn
u=
n

22. What is the assumption we make when Lagrange’s formula is used?

Solution:

Lagrange’s interpolation formula can be used whether the values of x, the


independent variable are equally spaced or not whether the difference of y
become smaller or not.

23. What advantage has Lagrange’s formula over Newton?

Solution:

The forward and backward interpolation formulae of Newton can be used


only when the values of the independent variable x are equally spaced can also be
used when the differences of the dependent variable y become smaller ultimately.
But Lagrange’s interpolation formula can be used whether the values of x, the
independent variable are equally spaced or not whether the difference of y
become smaller or not.
24. What is disadvantage in practice in applying Lagrange’s interpolation
formula?

Solution:

Though Lagrange’s formula is simple and easy to remember, its


application is not speedy. It requires close attention to sign and there is always a
chance of committing some error due to a number of positive and negative signs
in the numerator and the denominator.

⎛1⎞ 1
25. Show that ∆ ⎜⎝ a ⎟⎠ = − abcd
bcd

Solution:

x f(x) ∆ f(x) ∆ 2 f(x) ∆ 3 f(x)

a 1
a

−1
ab

b 1 1
b abc

−1 −1
bc abcd

c 1 1
c bcd

−1
cd

d 1
d
PART-B

1. From the following data estimate the number of persons earning weekly
wages between 60 and 70 rupees.

Wages in Rs. Below 40 40-60 60-80 80-100 100-120

No. of persons 250 120 100 70 50

2. For the given values evaluate f(9) using Lagrange’s formula.

x 5 7 11 13 17

f(x) 150 392 1452 2366 5202

3. Using Newton’s divided difference formula find u(3) given u(1) = -26,

u(2) = 12, u(4) =256 and u(6) = 844.

4. Using Lagrange’s interpolation, calculate the profit in the year 2000 from the
following data.

Year 1997 1999 2001 2003

Profit in lakhs of Rs. 43 65 159 248

5. Using Newton’s forward interpolation formula, find the polynomial f(x)


satisfying the following data. Hence find f(2)

x 0 5 10 15

f(x) 14 379 1444 3584

6. Obtain the root of f(x) = 0 by Lagrange Inverse Interpolation given that


f(30) = -30, f(34) = -13, f(38) = 3, f(42) = 18.

7. Find f(x) as a polynomial in x for the following data by Newton’s divided


difference formula.

x: -4 -1 0 2 5

f(x): 1245 33 5 9 1335

8. Find a polynomial of degree two for the data by Newton’s forward difference
method

x 0 1 2 3 4 5 6 7

y 1 2 4 7 11 16 22 29

9. Find f(8) by Newton’s divided difference formula for the data:

x: 4 5 7 10 11 13

f(x): 48 100 294 900 1210 2028

10. Find the polynomial f(x) by using Lagrange’s formula and hence find f(3) for

x: 0 1 2 5

f(x): 2 3 12 147

11. Find f(x) as a polynomial in x for the following data by Newton’s divided
difference formula.

x: -4 -1 0 2 5

f(x): 1245 33 5 9 1335


12. Using Newton’s divided difference formula find f(x) and f(6) from the
following data

x: 1 2 7 8

f(x): 1 5 5 4

13. From the following table, find the value of tan45º15´ by Newton’s forward
interpolation formula.

x º: 45 46 47 48 49 50

tan x º: 1.00000 1.03553 1.07237 1.11061 1.15037 1.19175

14. Fit the cubic spline for the data:

x: 0 1 2 3

f(x): 1 2 9 28

15. If f(0) = 0, f(1) = 0, f(2) = -12, f(4) = 0, f(5) = 600 and f(7) = 7308, find a
polynomial that satisfies this data using Newton’s divided difference
interpolation formula. Hence, find f(6).

16. Given the following table, find f(2.5) using cubic spline functions:

i 0 1 2 3

xi 1 2 3 7

f(xi) 0.5 0.3333 0.25 0.2


17. The following values of x and y are given:

x: 1 2 3 4

y: 1 2 5 11

Find the cubic spline and evaluate y(1.5)

18. Use Lagrange’s formula to fit a polynomial to the data:

x: -1 0 2 3

y: -8 3 1 2

and hence find y at x = 1

19. The following data are taken from the steam table:

Temp. ºC: 140 150 160 170 180

Pressure Kgf/cm2 3.685 4.854 6.302 8.076 10.225

Find the pressure at temperature t = 142 º and t = 175 º.


UNIT-III
(NUMERICAL DIFFERENTIATION AND INTEGRATION)
PART-A
1. What is the condition for Simpson’s 3/8 th rule and state the formula?
Solution:
The condition for Simpson’s 3/8 th rule is that the number of intervals should
be a multiple of 3.
x0+nh
∫ f(x)dx = 3h/8 {(y0+yn)+3(y1+y2+y4+y5+….+yn-1)+2(y3+y6+y9+…yn)}.
x0

2. What is the condition for Simpson’s 1/3 rd rule and state the formula?
Solution:
The condition for Simpson’s 3/8 th rule is that the number of intervals
should be even number
Xn
∫ f(x)dx = h/3{(y0+yn)+2(y2+y4+…)+4(y1+y3+…)}
x0
3. Write down trapezoidal formula.
Solution:
xn
∫ f(x) dx = h/2{(y0+yn)+2(y1+y2+y3+…yn-1)}
xo
4. What is the order of error in the trapezoidal rule?
Solution:
The error in the trapezoidal rule is of the order h2
5. What is the order of error in the Simpson’s 1/3 rd rule ?
Solution:
The error in the Simpson’s 1/3 rd rule is of the order h4
6. What are the errors in the trapezoidal and Simpson’s rules of numerical
integration?
Solution:
Error in trapezoidal rule = -(b-a)/12{h2y"(x)}
Error in Simpson’s rule = -(b-a)/180{h4y iv(x)}
7. When can numerical differentiation be used?
Solution:
When the function is given in the form of table of values instead of giving
analytical expression we use numerical differentiation.
8. Why Simpson’s one-third rule is called a closed formula?
Solution:
Since the end points y0 and yn are included in the simpson’s 1/3rd rule it is
called closed formula.
dy
9. Write the formula for at x ≠ xn using backward difference operator.
dx
Solution:
dy 1 2v + 1 2 3v 2 + 6v + 2 3
( )x ≠ xn = { ∇ yn+ ∇ yn+ ∇ yn+…}
dx h 2 6
dy
10. Write the formula for at x=x0 using forward difference operator
dx
Solution:
dy 1 1 1 1
( )x ≠ x0 = { ∆ y0- ∆ 2y0+ ∆3 y 0 - ∆4 y 0 -…}
dx h 2 3 4
dy
11.Find at x = 1 from the following table
dx

x 1 2 3 4
y 1 8 27 64

Solution:
The forward difference table is as follows.
x y ∆ ∆2 ∆3
1 1
7
2 8 12
19 6
3 27 1
37
4 64

⎛ dy ⎞ 1⎛ ∆2 ∆3 ⎞
⎜ ⎟ = ⎜⎜ ∆y 0 − y0 + y 0 ... ⎟⎟ -__________________ (1)
⎝ dx ⎠ x = x0 h ⎝ 2 3 ⎠

Here h=1,x 0 =1, ∆y 0 =7, ∆2 y 0 = 12, ∆3 y 0 = 6

⎛ dy ⎞ 1⎛ 12 6 ⎞
-------(1) ⇒ ⎜ ⎟ = ⎜ 7 − + ⎟ = 3
⎝ dx ⎠ x =1 1 ⎝ 2 3⎠
12. Using Newton’s backward difference formula, write the formulae for the first
and second order derivatives at the end values x = x n upto the fourth order

difference term.
Solution:
⎛ dy ⎞ 1⎡ 1 1 ⎤
⎜ ⎟ = ⎢∇y n + ∇ 2 y n + ∇ 3 y n + .......⎥
⎝ dx ⎠ x = xn h ⎣ 2 3 ⎦
⎛d2y⎞ 1 ⎡ 2 11 4 ⎤
⎜⎜ 2 ⎟⎟ = 2 ⎢∇ y n + ∇ y n + 12 ∇ y n + ........⎥
3

⎝ dx ⎠ x = xn h ⎣ ⎦
⎛d3y⎞ 1 ⎡ 3 3 4 ⎤
⎜⎜ 3 ⎟⎟ = 3 ⎢∇ y n + 2 ∇ y n + ........⎥
⎝ dx ⎠ x = xn h ⎣ ⎦

13. When does Simpson’s rule give exact result?


Solution:
Simpson’s rule will give exact result, if the entire curve y = f (x) is itself a parabola.
14. Six sets of values of x and y are given (x’s being equally spaced), write the
x6

formula to get ∫ ydx


x1

Solution:

x6

∫ ydx = 2 [( y + y 6 ) + 2( y 2 + y 3 + y 4 + y 5 )]
h
1
x1

15. What are the errors in Trapezoidal and Simpson’s rule of numerical
integration?
Solution:

Error in Trapezoidal rule E <


(b − a ) h 2 . M in the interval (a, b), h = b − a
12 n

Error in Simpson’s rule E <


(b − a ) h 4 M
180
xn

16. In order to evaluate ∫ ydx by Simpson’s 1/3 rule as well as by Simpson’s 3/8 rule,
x0

what is the restriction on the number of intervals?


Solution:
Let n = intervals
Rule: Simpson’s 1/3 rule = The number off ordinates is odd (or)
The intervals number is even.
Simpson’s 3/8 rule = n is a multiple of 3.

Π
17.Using Trapezoidal rule evaluate ∫ sin xdx by dividing the range into 6 equal
0

parts.
Solution:

∫ sin xdx = 2 [( y ( )]
Π
+ y n ) + 2 y1 + y 2 + ... + y n −1
h
0
0

Π
= 6 [(0 + 0 ) + 2(0.5 + 0.866 + 1 + 0.866 + 0.5)]
2
Π
= [7.464]
12
= 0.622
6
18. Write down the trapezoidal rule to evaluate ∫ f (x )dx with h = 0.5
1

Solution:
Here f(x) = h = 0.5
x 1 1.5 2 2.5 3 3.5 4 4.5 5 5.5 6
y=f(x) f(1) f(2) f(3) f(4) f(5) f(6) f(7) f(8) f(9) f(10) f(11)
6

∫ f (x )dx = 2 [(sum of the first and last ordinate) + 2(remaining ordinate)]


h
By formula,
1

h
[ f (1) + f (11)] + 2[ f (2) + f (3) + f (4) + f (5) + f (6) + f (7) + f (8) + f (9) + f (10)]
2
PART B

2
1. Evaluate the integral ∫ dx / 1+ x2 using Trapezoidal rule with two sub intervals.
1 π/2
2. Dividing the range into 10 equal parts, fine the value of ∫ sin x dx by
0
i) Trapezoidal rule ii )Simpson’s rule.
Π
3. By dividing the range into ten equal parts, evaluate ∫ sin x dx by
0
Trapezoidal rule and Simpson’s rule.Verify your answer with integration.

6
4. Evaluate ∫ (dx /1+x2 ) by i) Trapezoidal rule ii )Simpson’s rule. Also check up
0
the results by actual integration .
5
5. Evaluate ∫ (dx / 4x+5) by Simpson’s one – third rule and hence find the value of
0
Log e 5 ( n= 10).
2
6. Evaluate ∫ (dx/ x2 +4) using Romberg’s method . Hence obtain an
approximate
0
Value for π.
1
7. Using Romberg’s method evaluate ∫(dx/1+x) correct to three places of
decimals.
0
8. Using three – point Gaussian quadrature formula, evaluate
1
i) ∫ (1/ 1+x2) dx
-1

1
ii ) ∫ ( 1 / 1+t2 ) dt
0
1.5
9.Evaluate ∫ e- x2
dx using the three point Gaussian quadrature.
0.2

2 2
10. Evaluate ∫ ∫ f (x, y ) dx dy by Trapezoidal Rule for the following data :
0 0

y/ x 0 0.5 1 1.5 2
0 2 3 4 5 5
1 3 4 6 9 11
2 4 6 8 11 14

11
11. Using Simpson’s 1/ 3 rule evaluate ∫ ∫ ( 1 / 1+ x+ y) dx dy taking h =k = 0.5
0 0
22
12. Evaluate ∫ ∫ ( dx dy/ x2 + y2 ) numerically with h= 0.2 along x- direction and
11

k= 0.25 along y- direction.


5.2
13. Compute ∫ log e x dx using Simpson’s 1/ 3 and 3/8 rule.
4
3
14. Evaluate ∫ x4 dx using (i)Trapezoidal rule (ii)Simpson’s rule. Verify your
results by
-3
actual integration.
15. The velocity v of a particle “s” from a point on its path is given by the table.
Estimate
the time taken to travel 60 feet by using Simpson’s 1/ 3 rule

S(m) 0 10 20 30 40 50 60
V(m/s) 47 58 64 65 61 52 38

16. The table given below reveals the velocity v of a body during the time “t”
specided. Find its acceleration at t = 1.1

t 1.0 1.1 1.2 1.3 1.4


v 43.1 47.7 52.1 56.1 60.8

17. Find the first and second derivate of the function tabulated below at x = 0.6

x 0.4 0.5 0.6 0.7 0.8


y 1.5836 1.7974 2.0442 2.3275 2.6511
1
18.Evaluate ∫(dx/1+x) by two point Gaussian quadrature.
0
UNIT-IV
(INITIAL VALUE PROBLEM FOR ORDINARY DIFFERENTIAL
EQUATIONS)
PART-A
1. State the disadvantage of Taylor series method.
dy
In the differential equation =f(x,y), the function f(x,y) may have a
dx

complicated algebraical structure. Then the evaluation lf higher order derivatives may
become tedious. This is the demerit of the method.

2. Write down the fourth order Taylors Algorithm.


h2 h3 h4
Ym+1 = ym+hym’+ ym’’+ ym’’’+ ym’’’’
2 3 4

Here ynm denotes the rth derivatives of y w.r.to x at the point (xm ,ym).

3. Which is better Taylor’s method or R.K. Method?

R.K. methods do not require prior calculation of higher derivatives of y(x), as


the Taylor method does. Since the differential equations using in applications are
often complicated, the calculation of derivatives may be difficult.

Also the R.K. formulas involve the computation of f(x,y) at various positions,
instead of derivatives and this function occurs in the given equation.
4. State modified algorithm to solve y’= f(x,y), y(x0)= y0 at x=x0+h.

h h
Yn+1=yn+hf ( xn+ , yn+ f(xn,yn))
2 2

h h
Y1=y0+hf (x0+ , y0+ f(x0,y0))
2 2

dy
5. Write down the Runge-Kutta formula of fourth order to solve =f(x,y) with
dx

y(x0)=y0 .

Let h denotes the interval between equidistant values of x. If the initial values
are (x0,y0), the first increment in ‘y’ is computed from the formulas

K1 = hf(x0,y0)

h k
K2 = hf(x0+ ,y0+ 1 )
2 2

h k
K3 = hf(x0+ ,y0+ 2 )
2 2

K4 = hf(x0+ h,y0+k3)

1
And ∆y= (k1+k2+2k3+k4)
6

Then x1=x0+h, y1=y0+∆y

The increment in y in the second interval is computed in a similar manner

Using the same four formulas, using the values x1,y1 in the place of x0,y0
respectively.

5. State the special advantage of Runge-Kutta method over Taylor series method.
Runge-Kutta methods do not require prior calculation of higher
derivatives of y(x), as the Taylor method does. Since the differential equations
using in applications are often complicated, the calculation of derivatives may be
difficult.

Also the Runge-Kutta formulas involve the computation of f(x,y) at


various positions, instead of derivatives and this function occurs in the given
equation.

6. Write down Adams-Bashforth predictor formula.

Adam’s predictor corrector formulas are

h
Yk+1,p= yk+ (55yk’-59yk’-1+37yk-2’-9yk-3’)
24

h
Yk+1,c= yk+ (9yk+1’+19yk’-5yk-1’+9yk-2’)
24

7. How many prior values are required to predict the next value in Adam’s method?

Four prior values.

8. What is a Predictor-Corrector method of solving a differential equation?

Predictor-Corrector methods are methods which require the values of y at


xn,xn- 1,xn-2,…… for computing the value of y at xn+1.

We first use a formula to find the value of y at xn+1 and this is known as a
predictor formula. The value of y so got is improved or corrected by another formula
known as corrector formula.
PART-B

dy 2
1. Using Taylor series method find y at x=0.1 if =x y-1,Y(0)=1.
dx

2.Solve y’ = x + y ; y(0)=1 by Taylors series method. Find the values y at

x = 0.1 and 0.2.

dy
3.Solve = y2 + x2 with y ( 0) =1. Use Taylor Series at x = 0.2 and 0.4. Find x =
dx

0.1.

4. i) Using Taylor Series method find y at x = 0.1correct to four decimal places from

dy
= x2- y, y (0) = 1, with h= 0.1. Compute terms upto x4.
dx

ii) Using Taylor’s Series method , find y ( 1.1 ) given y’ = x+y, y (1) = 0.

5. Using Taylor series method with the first five terms in the expansion find y ( 0.1 )
dy
correct to three decimal places, given that = ex –y2, y(0) ==1.
dx

6. i)By Taylor’s series method find y ( 0.1 ) given that y ’’ = y+ xy’ ,y(0) = 1, y’ ( 0)
=0.

ii)Using Taylor’s series method find y (1.1) and y ( 1.2 ) correct to four decimal
places given y’ = xy 1/3 and y(1) =1.

7. Using modified Euler’s method solve; given that y’= 1-y, y (0) = 0 find y(0.1),
y(0.2) and y (0.3 ).
dy
8.Solve =log10( x+y), y(0) =2 by Euler’s modified methgod and find the values of
dx

y (.2), y (.4), and y (.6) by taking h=0.2

9. i) Using modified Euler’s method solve; given that y’ = y-x2+1, y(0) = 0.5 find y
(0.2).

ii) Using modified Euler’s method; find y(0.1), y (0.2); given

dy
= x2+y2, y(0) =1.
dx

y2 − x2
10. Compute y (0.2 )and y (0.4) from y’ = given that y (0)=1
y2 + x2

11. Apply Runge – Kutta method to find approximate value of y for x =0.2 in steps
dy
of 0.1 if = x +y2 given that y=1 when x =0.
dx

12.Compute y (0.2 ) ,y (0.4 ) and y (0.6) ,given y’ =x3 + y, y (0) =2 by using Runge –
Kutta fourth order method.

13.Given y ’’- 2y’ + 2y = e 2x sinx with y (0) = -0.4 and y’ (0) = 0.6, using fourth
order Runge – Kutta method find y(0.2 ).

14. Solve y’ = 1/2 ( 1+ x2 )y2, y (0) =1, y (0.1 ) = 1.06, y ( 0.2 ) = 1.12, y(0.3) = 1.21
compute y ( 0.4 ), using Milne’s predictor corrector formula.

15. Solve 5xy’+y2 =2, y (4) = 1, y (4.1) = 1.0049, y (4.2) = 1.0097, y (4.3) =1.0143,
compute y (4.4) Milne’s methods.
16. Given y’ = xy + y2, y (0) = 1.0, find y (0.1 ) by Taylors method y (0.2) by Euler’s
method y (0.3) by Runge – Kutta and y ( 0.4) by Milne’s method.

17. Solve y’ = x-y2, 0 ≤ x ≤1, y(0) = 0, y(0.2) =0.02, y (0.4) =0.0795, y(0.6) = 0.1762, by
Milne’s method to find y (0.8 )and y ( 1).

dy x− y
18. Compute the first 3 steps of the initial value problem =
dx 2

y (0) = 1.0 by Taylor series method and next step by Milen’s method with step
length

h =0.1.

dy
19. Given = x3 + y, y (0) =2, y(0.2) =2.073, y (0.4 ) = 2.452, y (0.6) = 3.023
dx

compute y (0.8) by Milen’s predictor – corrector method by h =0.2.

dy
20. Given = x2 (1+y), y (1)= 1, y(1.1) = 1.233, y (1.2 ) = 1.548,y (1.3 ) = 1.979,
dx

evaluate y (1.4 ) by Adam’s Bashforth method.

21. Consider dy /dx = y- x2 +1, y (0) =0.5

i) using the modified Euler method find y ( 0.2)

ii) using R-K method fourth order method find y (0.4 ) and y (0.6)

iii)using Adam’s Bashforth predictor- corrector method find y (0.8)

22. Evaluate y (1.4 ): given y’ = 1/x2 – y/x, y (1) =1, y (1.1) = 0.996, y (1.2) =0.986, y
(1.3 ) = 0.972 by Adam’s Bashforth formula.
UNIT-V
(BOUNDARY VALUE PROBLEM IN ORDINARY AND PARTIAL
DIFFERENTIAL EQUATIONS)
PART-A
1. State the conditions for the equation . Auxx+Buyy+Cuyy+Dux+Euy+Fu=G
Where A,B,C,D,E,F,G are function of x and y to be (i) elliptic (ii)
parabolic(iii)hyperbolic

Solution: The given equation is said to be


(i) Eliptic at a point (x,y) in the plane if B2-4AC <0
(ii) Parabolic if B2-4AC =0
(iii) Hyperbolic if B2-4AC >0
2. State the condition for the equation Auxx+2Buxy+Cuyy=f(ux,uy,x,y) to be
(i) elliptic (ii) parabolic(iii)hyperbolic when A,B,C are functions of
x and y
solution:
The equation is elliptic if (2B2)-4AC<0
i.e. B2-AC <0 . It is parabolic if B2-AC =0 and hyperbolic if B2-AC>0
3. What is the classification of fx-fyy=0
Solution:
Here A=0 ,B=0,C=-1
B2-4AC=0-4*0*-1=0
So the equation is parabolic
4. What type of equations can be soled by using Crank-Nickolson’s difference
formula?
Solution:
Crank-Nickolson’s difference formula is used solve parabolic
equations of the form.
u xx = au t

5. For what purpose Bender-Schmidt recurrence relation is used?


Solution:
To solve one dimensional heat equation.
6. Write a note on the stability and convergence of the solution of the difference
equation corresponding to the hyperbolic equation u tt = a 2 u xx
Solution:
1
For λ = , the solution of the difference equation is stable and coincides with the s
a
1
olution of the differential equation. For λ > , the solution is unstable.
a
1
For λ < , the solution is stable but not convergent.
a
7. What is the purpose of Liebmann’s process?
Solution:
The purpose of Liebmann’s process is to find the solution of the Laplace equation
u xx + u yy = 0 by iteration.

8. Define a difference quotient.


Solution:
A difference quotient is the quotient obtained by dividing the difference between two
values of a function by the difference between two corresponding values of the
independent variable.
PART – B

∂ 2u ∂ 2u
1. Solve the Poisson’s equation + = −10( x 2 + y 2 + 10) over the square
∂x 2 ∂y 2
with sides x=0=y, x=3=y with u=0 on the boundary and mesh length is 1.

2. Solve the Poisson equation u xx + u yy = −81xy, 0 < x < 1, 0 < y < 1 given that

u(0,y)=0, u(x,0)=0, u(1,y)=100, u(x,1)=100 and h=1/3.

3. Solve u xx + u yy = 0 , 0 ≤ x, y ≤ 1 with u(0,y)=10=u(1,y) and u(x,0)=20=u(x,1).

Take h=0.25 and apply Liebmann method to 3 decimal accuracy.


4. Solve y tt = y xx upto t=0.5 with a spacing of 0.1 subject to y(0,t)=0, y(1,t)=0,

yt(x,0)=0 and y(x,0)=10+x(1-x)


5. Solve 32u t = u xx , 0 < x < 1, t > 0, u ( x,0) = 0, u (0, t ) = 0, u (1, t ) = t choose

h=0.25
6. Using Crank-Nickolson’s Implicit scheme, Solve
16u t = u xx , 0 < x < 1, t > 0, given that u(x,0)=0, u(0,t)=0, u(1,t)=100t

7. Approximate the solution to the following elliptic partial differential


equation

∂ 2u ∂ 2u
+ 2 = e xy ( x 2 + y 2 ),0 < x < 1,0 < y < 1, u (0, y ) = 1, u (1, y ) = e y ,0 ≤ y ≤ 1 & u ( x,0) = 1, u ( x,1) = e x ,
∂x 2
∂y
1
0 ≤ x ≤ 1, u sin g h = k =
3

You might also like