Questions
1 question per paper
Difficulty
Medium
Importance
Moderate yield for PSU technical papers
Overview
Numerical Methods provide algorithmic techniques to solve mathematical problems that are difficult or impossible to solve analytically. In PSU exams, this topic is vital for its direct application to solving complex equations and integrals using iterative approximations. Mastery of this area involves memorizing standardized formulas to solve numerical problems quickly under exam constraints.
Root Finding: Newton-Raphson Method
The Newton-Raphson method is a powerful iterative technique used to find the roots of a non-linear algebraic or transcendental equation. It converges quadratically, making it faster than many other methods, provided the initial guess is close to the actual root.
- Iterative formula: x(n+1) = x(n) - f(x(n)) / f'(x(n))
- Converges quadratically near the root
- Requires the function to be differentiable
- Fails if f'(x) equals zero at any iteration
- Most common method asked in competitive exams
Numerical Integration: Trapezoidal and Simpson Rules
These methods approximate the definite integral of a function when an exact antiderivative is unknown or difficult to compute. They rely on dividing the interval of integration into smaller sub-intervals to calculate the area under the curve.
- Trapezoidal Rule: Integral = (h/2) * [y0 + yn + 2(y1 + y2 + ... + yn-1)]
- Simpson's 1/3 Rule: Integral = (h/3) * [y0 + yn + 4(sum of odd ordinates) + 2(sum of even ordinates)]
- Simpson's 3/8 Rule: Integral = (3h/8) * [y0 + yn + 3(y1 + y2 + y4 + y5 + ...) + 2(y3 + y6 + ...)]
- Simpson's 1/3 rule requires an even number of sub-intervals
- Simpson's 3/8 rule requires the number of intervals to be a multiple of 3
Numerical Solution of ODEs
Ordinary Differential Equations that lack analytical solutions can be solved numerically by marching forward from an initial condition. The Euler and Runge-Kutta methods are the most prevalent techniques for finding the value of a dependent variable over discrete steps.
- Euler's Method: y(n+1) = y(n) + h * f(x(n), y(n))
- Runge-Kutta 2nd Order (RK2): Uses intermediate slopes
- Runge-Kutta 4th Order (RK4): y(n+1) = y(n) + (1/6)*(k1 + 2k2 + 2k3 + k4)
- RK4 is highly accurate but computationally intensive
- Step size 'h' determines the trade-off between speed and accuracy
Formula Sheet
Newton-Raphson: x(n+1) = x(n) - f(x(n))/f'(x(n))
Trapezoidal Rule: (h/2)[y0 + yn + 2(y1 + ... + yn-1)]
Simpson's 1/3 Rule: (h/3)[y0 + yn + 4(sum odd) + 2(sum even)]
Simpson's 3/8 Rule: (3h/8)[y0 + yn + 3(y1+y2+y4+y5...) + 2(y3+y6...)]
Euler's Method: y(n+1) = y(n) + h*f(x(n), y(n))
RK4 k1: h*f(x(n), y(n))
RK4 k2: h*f(x(n) + h/2, y(n) + k1/2)
RK4 k3: h*f(x(n) + h/2, y(n) + k2/2)
RK4 k4: h*f(x(n) + h, y(n) + k3)
Exam Tip
Memorize the coefficients for Simpson's 1/3 and 3/8 rules thoroughly, as these are frequently tested via 'fill in the blank' or calculation-based MCQs.
Common Mistakes
- Using Simpson's 1/3 rule on a dataset with an odd number of intervals without splitting the last interval.
- Forgetting to switch the calculator to Radian mode when evaluating transcendental functions like sin(x) or cos(x).
- Confusing the coefficients in Simpson's 3/8 rule (multiplying odd ordinates by 3 and multiples of 3 by 2).
More Revision Notes
Ready to test yourself?
Play topic-wise Numerical Methods questions in Aspirant Arcade — gamified MCQ practice.
Download Free