Numerical Method 2071

Tribhuwan University
Institute of Science and Technology
2071
Bachelor Level / Third Semester / Science
Computer Science and Information Technology ( CSC-204 )
( Numerical Method )
Full Marks: 60
Pass Marks: 24
Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.

Attempt all questions:

1. How is the bisection method convergent to a root of an equation? Apply the bisection method to find a root of the equation (3 + 5)


8 marks view

2. Define interpolation. Find the Lagrange interpolation polynomial to fit the following data. Estimate the value (1 + 6 + 1)


8 marks view

3. Derive Simpson’s 1/3 rule to evaluate numerical integration. Using this formula evaluate (4 + 4)

        

8 marks view

4. What do you mean by ill-conditioned systems? Solve the following system using Dolittle LU decomposition method.(2 + 6)

        3x1 + 2x2 + x3 = 24

        2x1 + 3x2 + 2x3 = 14

        x1 + 2x2 + 3x3 = 14

8 marks view

5. Solve the following boundary value problem using shooting method.(8)


8 marks view

6. Write the finite difference formula for solving Poisson’s equation. Hence solve the Poisson’s equation∇2f = 2x2y2 over the domain 0 ≤ x ≤ 3 and 0 ≤ y ≤ 3 with f = 0 on the boundary and h = 1.        (1 + 7)

8 marks view

7. Write an algorithm and a C-program for the fixed point iteration method to find the roots of non-linear equation. (4+8)

OR

Write an algorithm and a C-program for the Lagrange’s interpolation to approximate the functional value at any given x from given n data. (4+8)

12 marks view