Browse papers
A

Section A: Long Answer Questions

Attempt all / any as specified.

4 questions
1long12 marks

(a) Derive the iterative formula for the Newton-Raphson method for finding a real root of a nonlinear equation f(x)=0f(x)=0, and give a clear geometrical interpretation of the method. State two situations in which the method fails to converge. [7]

(b) A real root of the equation x35x+1=0x^3 - 5x + 1 = 0 lies between 0 and 1. Using the Newton-Raphson method, compute the root correct to four decimal places. [5]

roots-of-nonlinear-equationsnewton-raphson
2long12 marks

(a) Explain the construction of a natural cubic spline that interpolates a set of (n+1)(n+1) data points. Clearly state the continuity conditions imposed at the interior knots and the boundary conditions for the natural spline. [6]

(b) Using Newton's divided difference interpolation, estimate the value of f(3)f(3) from the following data:

xx01245
f(x)f(x)1393351
interpolationnewton-divided-differencecubic-spline
3long12 marks

(a) Describe the Gauss elimination method with partial pivoting for solving a system of linear equations. Explain why partial pivoting is necessary and how it improves numerical stability. [6]

(b) Solve the following system of equations using the Gauss-Seidel iterative method, performing three iterations and starting with the initial guess (0,0,0)(0,0,0):

20x+y2z=17,3x+20yz=18,2x3y+20z=2520x + y - 2z = 17,\quad 3x + 20y - z = -18,\quad 2x - 3y + 20z = 25

[6]

linear-systemsgauss-eliminationiterative-methods
4long12 marks

(a) Derive the standard five-point finite difference formula for the Laplace equation 2ux2+2uy2=0\dfrac{\partial^2 u}{\partial x^2} + \dfrac{\partial^2 u}{\partial y^2} = 0 over a rectangular region. [5]

(b) A square plate is divided into a mesh as shown, with the boundary values of uu specified. Set up the system of linear equations for the interior nodal values u1,u2,u3,u4u_1, u_2, u_3, u_4 using the five-point formula, and solve for the interior values by the Gauss-Seidel (Liebmann) iteration, taking the boundary on all four edges as u=100u = 100 on the top edge and u=0u = 0 on the remaining three edges. [7]

numerical-solution-of-pdeslaplace-equationfinite-difference
B

Section B: Short Answer Questions

Attempt all / any as specified.

8 questions
5short6 marks

Find a real root of the equation xex=2x e^{x} = 2 correct to three decimal places using the Bisection method, taking the initial interval as [0,1][0, 1]. Tabulate your iterations clearly.

roots-of-nonlinear-equationsbisection-method
6short6 marks

Evaluate the integral 01dx1+x2\displaystyle\int_{0}^{1} \frac{dx}{1+x^2} using Simpson's 1/3 rule with h=0.25h = 0.25, and compare your result with the exact value. Briefly explain how the accuracy could be improved using Romberg integration.

numerical-integrationsimpson-ruleromberg-integration
7short6 marks

Fit a straight line y=a+bxy = a + bx to the following data using the method of least squares:

xx12345
yy2.13.96.17.810.2

Hence estimate the value of yy when x=6x = 6.

curve-fittingleast-squares
8short6 marks

Derive the central difference formulae for the first and second derivatives of a function from Taylor's series expansion, and state their orders of accuracy. Using the data below, compute f(2.0)f'(2.0) and f(2.0)f''(2.0):

xx1.82.02.2
f(x)f(x)6.0507.3899.025
numerical-differentiationfinite-difference
9short6 marks

Using the fourth-order Runge-Kutta method, solve the initial value problem dydx=x+y\dfrac{dy}{dx} = x + y, with y(0)=1y(0) = 1, and find y(0.2)y(0.2) taking a step size h=0.1h = 0.1.

numerical-solution-of-odesrunge-kutta
10short4 marks

Using Lagrange's interpolation formula, find the value of f(2)f(2) from the following data:

xx0134
f(x)f(x)-1201224
interpolationlagrange-interpolation
11short4 marks

Explain the shooting method for solving a two-point boundary value problem of a second-order ordinary differential equation. How does it convert a boundary value problem into an initial value problem?

numerical-solution-of-odeseuler-methodshooting-method
12short4 marks

Explain the LU (Doolittle) decomposition method for solving a system of linear equations [A]{x}={b}[A]\{x\} = \{b\}. State its main advantage over Gauss elimination when the system must be solved for several different right-hand-side vectors {b}\{b\}.

linear-systemslu-decomposition