Module 2 · GATE Engineering Mathematics

Numerical Methods

Root finding, interpolation, numerical integration, differential equations.

Root Finding · Interpolation · Numerical Integration · ODE

🎯 Take Mock Test

Learning Objectives

Understand the fundamental concepts of Numerical Methods
Apply key formulas and techniques to solve problems
Practice with exam-level questions to build speed and accuracy

Key Concepts

What are Numerical Methods?

Numerical methods provide techniques for solving mathematical problems using numerical approximation. GATE covers root-finding methods, interpolation, numerical differentiation and integration, and numerical solutions of ODEs. Weightage is typically 3-5% in GATE.

Key Concepts

1. Root Finding: Bisection method — repeatedly halve the interval [a,b] where f(a)f(b)<0. Convergence is linear, slow but guaranteed. Newton-Raphson method: x_{n+1} = x_n - f(x_n)/f'(x_n). Convergence is quadratic if initial guess is close. Secant method: x_{n+1} = x_n - f(x_n)(x_n-x_{n-1})/(f(x_n)-f(x_{n-1})) — no derivative needed.

2. Interpolation: Lagrange interpolation: polynomial passing through n+1 points. Newton's forward/backward difference formulas for equally spaced data. Error in interpolation depends on the (n+1)th derivative of the function.

3. Numerical Integration: Trapezoidal rule: ∫(a to b) f(x)dx ≈ h/2[f₀ + 2(f₁+...+f_{n-1}) + f_n], error ~ O(h²). Simpson's 1/3 rule: ∫(a to b) f(x)dx ≈ h/3[f₀ + 4(f₁+f₃+...) + 2(f₂+f₄+...) + f_n], requires even number of intervals, error ~ O(h⁴). Simpson's 3/8 rule for 3-interval blocks.

4. Numerical Solution of ODEs: Euler's method: y_{n+1} = y_n + hf(x_n,y_n) — first order accuracy. Modified Euler (Heun): predictor-corrector method. Runge-Kutta 4th order: y_{n+1} = y_n + (h/6)(k₁+2k₂+2k₃+k₄) where k₁ = f(x_n,y_n), k₂ = f(x_n+h/2, y_n+hk₁/2), k₃ = f(x_n+h/2, y_n+hk₂/2), k₄ = f(x_n+h, y_n+hk₃). RK4 is widely used due to its high accuracy.

Solved Examples

Example 1 (Newton-Raphson Method)

Find the root of f(x) = x² - 5 near x₀ = 2, correct to 3 decimal places using Newton-Raphson method.

a) 2.236 b) 2.238 c) 2.234 d) 2.230

Solution: a) 2.236. f(x)=x²-5, f'(x)=2x. Newton-Raphson: x₁ = x₀ - f(x₀)/f'(x₀) = 2 - (4-5)/4 = 2 - (-1/4) = 2.25. x₂ = 2.25 - (5.0625-5)/(4.5) = 2.25 - 0.0625/4.5 = 2.25 - 0.01389 = 2.23611. x₃ = 2.23611 - (5.00017-5)/(4.47222) ≈ 2.23607. So root ≈ 2.236 (which is √5).

Example 2 (Simpson's 1/3 Rule)

Using Simpson's 1/3 rule with n=4, approximate ∫(0 to 4) x² dx.

a) 21.33 b) 21.00 c) 22.67 d) 20.00

Solution: a) 21.33. n=4, h=1. x: 0,1,2,3,4. f(x)=x²: f₀=0, f₁=1, f₂=4, f₃=9, f₄=16. Simpson: ∫ ≈ h/3[f₀+4(f₁+f₃)+2f₂+f₄] = 1/3[0+4(1+9)+2(4)+16] = 1/3[0+40+8+16] = 64/3 = 21.333. Exact = x³/3|₀⁴ = 64/3 = 21.333 — since f(x)=x² is quadratic, Simpson's gives exact result (error ~ O(h⁴)f⁴(ξ), f⁴(x) = 0).

Example 3 (Euler's Method)

Use Euler's method with h=0.1 to find y(0.2) for dy/dx = x + y, y(0)=1.

a) 1.22 b) 1.23 c) 1.21 d) 1.24

Solution: a) 1.22. Euler: y_{n+1} = y_n + h·f(x_n,y_n). f(x,y)=x+y. At x₀=0, y₀=1: y₁ = 1+0.1(0+1)=1+0.1=1.1 (at x=0.1). At x₁=0.1, y₁=1.1: y₂ = 1.1+0.1(0.1+1.1)=1.1+0.12=1.22 (at x=0.2). Exact solution: dy/dx - y = x. Linear DE: IF=e^(-x), y·e^(-x)=∫xe^(-x)dx = -xe^(-x)-e^(-x)+C, y = -x-1+Ce^x. y(0)=1 → 1=-1+C → C=2. y = 2e^x - x - 1. y(0.2) = 2×1.2214 - 0.2 - 1 = 2.4428-1.2=1.2428. Euler gives 1.22, error ≈ 0.0228.

Shortcut Techniques

For Newton-Raphson, choose initial guess close to the root — divergence can occur if f'(x) is small near the guess.
Trapezoidal rule is exact for linear functions. Simpson's 1/3 rule is exact for quadratic and cubic functions.
Bisection method is guaranteed to converge but slow — use it for initial bracketing then switch to Newton-Raphson for faster convergence.
For Euler's method, halving the step size roughly halves the error (first order). RK4 has fourth order accuracy — error reduces by factor 16 when step size is halved.
Lagrange interpolation for n+1 points gives a unique polynomial of degree ≤ n. For evenly spaced data, Newton's forward/backward formulas are more efficient.

Pro Tip

In GATE, numerical methods questions often ask about the order of accuracy, convergence conditions, or a single step of an iterative method. Focus on understanding the formulas and their error terms. RK4 is the most commonly tested ODE solver — memorise the k₁, k₂, k₃, k₄ formulas.

Advanced Applications

Modern exams feature questions combining multiple quantitative concepts. Master these by practicing previous year papers.

Shortcut Methods

Percentages: Use fraction table (12.5%=1/8, 20%=1/5, 25%=1/4). SI/CI: For 2 years, CI-SI = P(r/100)^2. Time Work: Use LCM of time periods. Average Speed: 2ab/(a+b) for equal distances.

Pro Tip

Write key formulas on rough sheet immediately after the exam bell while memory is fresh.

Advanced Applications

Modern exams feature questions combining multiple quantitative concepts. Master these by practicing previous year papers.

Shortcut Methods

Percentages: Use fraction table (12.5%=1/8, 20%=1/5, 25%=1/4). SI/CI: For 2 years, CI-SI = P(r/100)^2. Time Work: Use LCM of time periods. Average Speed: 2ab/(a+b) for equal distances.

Pro Tip

Write key formulas on rough sheet immediately after the exam bell while memory is fresh.

Advanced Applications

Modern exams feature questions combining multiple quantitative concepts. Master these by practicing previous year papers.

Shortcut Methods

Percentages: Use fraction table (12.5%=1/8, 20%=1/5, 25%=1/4). SI/CI: For 2 years, CI-SI = P(r/100)^2. Time Work: Use LCM of time periods. Average Speed: 2ab/(a+b) for equal distances.

Pro Tip

Write key formulas on rough sheet immediately after the exam bell while memory is fresh.

Advanced Applications

Modern exams feature questions combining multiple quantitative concepts. Master these by practicing previous year papers.

Shortcut Methods

Percentages: Use fraction table (12.5%=1/8, 20%=1/5, 25%=1/4). SI/CI: For 2 years, CI-SI = P(r/100)^2. Time Work: Use LCM of time periods. Average Speed: 2ab/(a+b) for equal distances.

Pro Tip

Write key formulas on rough sheet immediately after the exam bell while memory is fresh.

Practice Questions

← Probability & Statistics ← Course Home