Questions
2 questions per paper
Difficulty
Medium
Importance
High yield for HPCL/NTPC/ONGC
Overview
Numerical Methods provide algorithmic techniques to solve complex mathematical problems that lack analytical solutions, primarily through iterative approximations. For PSU exams, mastering these methods is essential as they frequently appear as high-accuracy, calculative questions. Focus on the convergence rates and the underlying iterative formulas to solve equations, integrate functions, and approximate ODE solutions.
Root Finding Methods
These methods are used to determine the zeros of a function f(x) = 0 by iterative refinement. Newton-Raphson is particularly favored in competitive exams due to its fast quadratic convergence compared to the slower, linear convergence of the Bisection method.
- Bisection Method: x_n+1 = (a + b) / 2
- Newton-Raphson Formula: x_n+1 = x_n - [f(x_n) / f'(x_n)]
- Newton-Raphson converges quadratically
- Bisection Method is guaranteed to converge if f(a)*f(b) < 0
- Secant Method: x_n+1 = x_n - f(x_n) * [(x_n - x_n-1) / (f(x_n) - f(x_n-1))]
Numerical Integration
Numerical integration, or quadrature, involves approximating the definite integral of a function when an antiderivative cannot be found. Trapezoidal and Simpson’s rules are the standard techniques tested in engineering exams.
- Trapezoidal Rule: (h/2) * [y_0 + 2(y_1 + y_2 + ... + y_n-1) + y_n]
- Simpson's 1/3 Rule: (h/3) * [y_0 + 4(sum of odd ordinates) + 2(sum of even ordinates) + y_n]
- Simpson's 3/8 Rule: (3h/8) * [y_0 + 3(y_1 + y_2 + y_4 + y_5) + 2(y_3) + y_n]
- Simpson's 1/3 Rule requires an even number of sub-intervals
- Simpson's 3/8 Rule requires sub-intervals to be a multiple of 3
Solution of Ordinary Differential Equations
These techniques solve initial value problems of the form dy/dx = f(x, y) where y(x0) = y0. Euler's method is the simplest approach, while Runge-Kutta methods offer much higher precision by calculating weighted averages of slopes.
- Euler Method: y_n+1 = y_n + h * f(x_n, y_n)
- Runge-Kutta 2nd Order (Heun's): y_n+1 = y_n + (1/2) * (k_1 + k_2)
- Runge-Kutta 4th Order: y_n+1 = y_n + (1/6) * (k_1 + 2*k_2 + 2*k_3 + k_4)
- RK4 is the most popular for high-accuracy numerical simulations
- h represents the step size in all ODE iterations
Formula Sheet
Newton-Raphson: x_n+1 = x_n - f(x_n)/f'(x_n)
Trapezoidal: Integral = (h/2) * (y_0 + y_n + 2 * sum(y_i))
Simpson's 1/3: Integral = (h/3) * (y_0 + y_n + 4 * sum(y_odd) + 2 * sum(y_even))
Simpson's 3/8: Integral = (3h/8) * (y_0 + y_n + 3 * sum(y_non_multiples_of_3) + 2 * sum(y_multiples_of_3))
Euler: y_n+1 = y_n + h * f(x_n, y_n)
RK4: k_1 = h*f(x_n, y_n); k_2 = h*f(x_n + h/2, y_n + k_1/2); k_3 = h*f(x_n + h/2, y_n + k_2/2); k_4 = h*f(x_n + h, y_n + k_3)
Exam Tip
Memorize the order of accuracy and convergence rates; PSU examiners love testing whether you know that Newton-Raphson converges quadratically versus the slower Bisection method.
Common Mistakes
- Confusing the coefficients for Simpson's 1/3 and 3/8 rules, especially the requirement for sub-interval counts.
- Forgetting to switch the calculator to Radian mode when performing trigonometric iterations in Newton-Raphson.
- Errors in calculating the intermediate step size 'h' or the first-order derivative f'(x) during manual calculation.
More Revision Notes
Ready to test yourself?
Play topic-wise Numerical Methods questions in Aspirant Arcade — gamified MCQ practice.
Download Free