Questions
2 questions per paper
Difficulty
Medium
Importance
Essential for scoring in technical sections of HPCL/NTPC/ONGC.
Overview
Numerical methods provide algorithmic techniques to approximate solutions for mathematical problems that are difficult or impossible to solve analytically. Mastering these methods is crucial for PSU exams as they allow for rapid calculation of roots, integrals, and differential equations within time-constrained MCQ environments.
Root Finding: Newton-Raphson Method
The Newton-Raphson method is an iterative process used to find the real roots of a non-linear equation f(x) = 0. It is highly valued in exams due to its quadratic convergence rate, making it faster than bisection or regula-falsi methods.
- Iterative formula: x_{n+1} = x_n - f(x_n) / f'(x_n)
- Requires initial guess x_0
- Convergence is quadratic if f'(x) is non-zero at the root
- Failure occurs if f'(x) = 0 (horizontal tangent)
- Geometrically represents the intersection of the tangent line with the x-axis
Numerical Integration
Numerical integration techniques approximate the definite integral of a function using discrete data points or polynomial interpolation. Exams frequently test the application of Newton-Cotes formulas like Trapezoidal and Simpson's rules.
- Trapezoidal Rule: I = (h/2)[y_0 + y_n + 2(y_1 + ... + y_{n-1})]
- Simpson's 1/3 Rule: I = (h/3)[(y_0 + y_n) + 4(sum of odd y) + 2(sum of even y)]
- Simpson's 3/8 Rule: I = (3h/8)[(y_0 + y_n) + 3(y_1 + y_2 + y_4 + y_5 ...)]
- Simpson's rules require an even number of intervals for 1/3 rule and multiple of 3 for 3/8 rule
- Higher order polynomials yield more accurate approximations
Linear and Differential Equations
These methods solve systems of linear algebraic equations or initial value problems in ordinary differential equations. The focus is on iterative approaches for linear systems and stepping methods for ODEs.
- Gauss-Seidel method is an iterative approach for linear systems
- Euler's method: y_{n+1} = y_n + h*f(x_n, y_n)
- Runge-Kutta 4th Order method is highly stable and accurate
- Jacobi iteration requires diagonal dominance of the coefficient matrix
- RK4 formula involves four slopes (k1, k2, k3, k4)
Formula Sheet
Newton-Raphson: x_{n+1} = x_n - f(x_n)/f'(x_n)
Trapezoidal Rule: Area = (h/2)[first + last + 2(sum of remaining)]
Simpson's 1/3 Rule: Area = (h/3)[(y_0+y_n) + 4(y_1+y_3+...) + 2(y_2+y_4+...)]
Simpson's 3/8 Rule: Area = (3h/8)[(y_0+y_n) + 3(y_1+y_2+y_4+y_5+...)]
Euler's Method: y_{n+1} = y_n + h*f(x_n, y_n)
RK4: y_{n+1} = y_n + (1/6)(k_1 + 2k_2 + 2k_3 + k_4)
Exam Tip
Always verify if your calculator is set to radian mode before computing roots or integrals involving trigonometric functions, as this is the most common source of error.
Common Mistakes
- Mixing up the multipliers in Simpson's 1/3 (4 and 2) and 3/8 (3 and 2) rules during exam pressure.
- Forgetting to check the 'diagonal dominance' condition before attempting to solve systems via iterative methods.
- Using degrees instead of radians in the calculator when evaluating trigonometric functions within iterations.
More Revision Notes
Ready to test yourself?
Play topic-wise Numerical Methods questions in Aspirant Arcade — gamified MCQ practice.
Download Free