Study guide

6.12 Numerical Methods: Root Finding, Integration & ODE Solvers

Coal India Management Trainee CIL MT

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: CIL MT Exam Overview & Coal Sector Landscape

1.1 CIL MT Exam Pattern, Marking Scheme & Strategy 1.2 Coal India Limited: Corporate Structure, Maharatna Status & Subsidiaries 1.3 Indian Coal Mining Sector, Energy Mix & Environmental Regulations

2 Chapter 2: Paper-I General Awareness, Polity & Current Affairs

2.1 Indian Constitution, Governance & Statutory Bodies 2.2 Indian Economy, Union Budget & Economic Planning 2.3 Indian Geography, Mineral Belts & Environmental Ecology 2.4 Modern Indian History, Freedom Struggle & Cultural Heritage 2.5 General Science: Physics, Chemistry & Biology Fundamentals 2.6 Inventions, Discoveries & Scientific-Technological Development 2.7 Uses of Internet, Computer Awareness & Digital Governance 2.8 National & International Organisations 2.9 Awards, Honours & Sports 2.10 Books & Authors, Important Monuments & Places of India 2.11 Ports, Power Plants & Infrastructure of India 2.12 Climate Change, SDGs, National Parks & Wildlife Sanctuaries 2.13 Flagship Government Programmes & Current Affairs Method 2.14 World Physical, Social & Economic Geography

3 Chapter 3: Paper-I Reasoning & Logical Ability

3.1 Series Completion, Coding-Decoding & Semantic Analogies 3.2 Syllogisms, Logical Deduction & Venn Diagrams 3.3 Seating Arrangements, Linear/Circular Alignments & Puzzles 3.4 Direction Sense, Blood Relations & Order/Ranking 3.5 Alphabetical & Alphanumeric Series 3.6 Statement & Conclusions, Statement & Arguments 3.7 Clocks & Calendars 3.8 Cubes, Dice & Figure Counting 3.9 Mirror Images, Water Images, Embedded Figures & Non-Verbal Series 3.10 Decision Making & Data Analysis in Reasoning

4 Chapter 4: Paper-I Numerical Ability & Quantitative Aptitude

4.1 Arithmetic Foundations: Percentages, Profit & Loss, Ratio & Proportion 4.2 Averages, Simple/Compound Interest, Alligations & Mixtures 4.3 Time & Work, Pipes & Cisterns, Time, Speed & Distance 4.4 Algebra, Mensuration, Geometry & Data Interpretation (DI) 4.5 Number System, LCM, HCF & Decimal Fractions 4.6 Surds, Indices & Simplification 4.7 Problems on Ages 4.8 Boats & Streams and Problems on Trains 4.9 Permutations & Combinations 4.10 Probability for Quantitative Aptitude

5 Chapter 5: Paper-I General English & Verbal Ability

5.1 English Grammar, Error Spotting & Sentence Correction 5.2 Vocabulary Building: Synonyms, Antonyms, Idioms & Phrases 5.3 Reading Comprehension, Cloze Tests & Para Jumbles 5.4 Fill in the Blanks, Cloze Passages & Sentence Completion 5.5 Jumbled Sentences & Sentence Improvement

6 Chapter 6: Paper-II Engineering Mathematics

6.1 Matrix Algebra, Rank & Systems of Linear Equations 6.2 Eigenvalues, Eigenvectors & the Cayley-Hamilton Theorem 6.3 Limits, Continuity, Differentiability & Mean Value Theorems 6.4 Maxima-Minima, Indeterminate Forms & Taylor Series 6.5 Definite, Improper, Double & Triple Integrals 6.6 Partial Derivatives, Total Derivative & Multivariable Optimisation 6.7 First-Order Differential Equations: Linear & Non-Linear 6.8 Higher-Order Linear Differential Equations & Engineering Applications 6.9 Laplace Transforms & Transfer-Function Methods 6.10 Probability, Conditional Probability & Bayes' Theorem 6.11 Random Variables, Distributions & Descriptive Statistics 6.12 Numerical Methods: Root Finding, Integration & ODE Solvers

7 Chapter 7: Paper-II Engineering Mechanics & Statics-Dynamics

7.1 Force Systems, Coplanar Equilibrium & Lami's Theorem 7.2 Plane Trusses, Friction Mechanics & Screws/Wedges 7.3 Centroids, Center of Gravity & Moment of Inertia 7.4 Kinematics, Kinetics of Particles & Rigid Body Dynamics 7.5 Virtual Work & Lagrange's Equation 7.6 Rolling Friction, Belt-Pulley Drives, Brakes, Clutches & Vehicle Dynamics

8 Chapter 8: Paper-II Mechanics of Materials & Structural Integrity

8.1 Simple Stresses, Strains, Elastic Moduli & Thermal Stresses 8.2 Principal Stresses, Strain Energy & Mohr's Circle 8.3 Shear Force & Bending Moment Diagrams, Beam Bending & Shear Stresses 8.4 Torsion of Circular Shafts, Springs & Column Buckling 8.5 Thin Cylinders, Spheres & Thick-Walled Pressure Vessels 8.6 Deflection of Beams: Double Integration, Macaulay & Moment-Area 8.7 Shear Centre & Unsymmetrical Bending 8.8 Strain Gauges, Rosettes & Experimental Stress Analysis 8.9 Mechanical Testing: Universal Testing Machine, Hardness & Impact

9 Chapter 9: Paper-II Theory of Machines & Mechanical Vibrations

9.1 Simple Mechanisms, Kinematic Inversions & Velocity/Acceleration Diagrams 9.2 Cams & Followers, Toothed Gearing & Epicyclic Gear Trains 9.3 Flywheels, Centrifugal/Inertia Governors & Rotor Balancing 9.4 Free, Damped & Forced Single-Degree-of-Freedom Vibrations 9.5 Gyroscopic Couple & Gyroscopic Effects

10 Chapter 10: Paper-II Machine Design & Failure Theories

10.1 Static Failure Theories & Variable/Fatigue Loading 10.2 Design of Threaded Fasteners, Welded & Riveted Joints 10.3 Design of Shafts, Keys, Couplings & Rolling/Sliding Bearings 10.4 Design of Spur, Helical, Bevel & Worm Gears 10.5 Design of Helical, Leaf & Torsion Springs 10.6 Design of Brakes & Clutches: Energy, Lining Pressure & Heat

11 Chapter 11: Paper-II Fluid Mechanics & Hydraulic Machinery

11.1 Fluid Properties, Hydrostatic Forces & Buoyancy 11.2 Fluid Kinematics, Continuity & Bernoulli's Equation 11.3 Viscous Flow in Pipes, Boundary Layer & Minor Losses 11.4 Hydraulic Turbines, Centrifugal & Reciprocating Pumps 11.5 Dimensional Analysis, Similitude & Model Testing 11.6 Control-Volume Analysis: Continuity, Momentum & Energy

12 Chapter 12: Paper-II Thermodynamics, Thermal Cycles & Turbomachinery

12.1 Fundamental Concepts, First & Second Laws of Thermodynamics 12.2 Entropy, Availability, Exergy & Properties of Pure Substances 12.3 Air-Standard Gas Power Cycles: Otto, Diesel, Dual & Brayton 12.4 Vapour Power Cycles: Ideal, Reheat & Regenerative Rankine Cycles 12.5 Thermodynamic Relations: Maxwell, Clausius-Clapeyron & Joule-Thomson 12.6 Behaviour of Ideal & Real Gases and Equations of State 12.7 Air & Gas Compressors: Reciprocating, Rotary & Multi-Stage 12.8 Steam & Gas Turbines: Impulse, Reaction & Velocity Diagrams

13 Chapter 13: Paper-II Heat Transfer, Refrigeration & Air Conditioning

13.1 Steady & Unsteady Conduction, Extended Surfaces (Fins) 13.2 Forced/Natural Convection, Radiation & Heat Exchanger LMTD/NTU 13.3 Vapour Compression & Vapour Absorption Refrigeration Systems 13.4 Psychrometric Properties, Processes & Air Conditioning Systems 13.5 Gas Refrigeration, Heat Pump Cycles & Cryogenics

14 Chapter 14: Paper-II Materials Science, Metallurgy & Manufacturing Technology

14.1 Crystal Structures, Phase Diagrams & Iron-Iron Carbide Equilibrium 14.2 Heat Treatment Processes & Engineering Alloy Steels 14.3 Casting Processes, Metal Forming & Welding Metallurgy 14.4 Metal Cutting Mechanics, Tool Life & Machine Tools 14.5 Plastic Deformation, Yield Criteria & Load Estimation in Bulk Forming 14.6 Sheet Metal Forming: Shearing, Bending & Deep Drawing 14.7 Powder Metallurgy 14.8 Brazing, Soldering & Adhesive Bonding 14.9 Non-Traditional Machining: EDM, ECM, USM, AJM, LBM & EBM 14.10 Abrasive Machining, Grinding & Superfinishing 14.11 Principles of Work Holding, Jigs & Fixtures 14.12 Economics of Machining & Tool Life Optimisation

15 Chapter 15: Paper-II Metrology, Quality Control & Industrial Engineering / OR

15.1 Limits, Fits, Tolerances, Gauges & Surface Metrology 15.2 Production Planning, Forecasting & Inventory Control Models 15.3 Operations Research: Linear Programming & Transportation/Assignment 15.4 Project Management: CPM, PERT, Network Analysis & Crashing 15.5 Comparators & Interferometry 15.6 Coordinate Measuring Machines & Machine Tool Alignment Testing 15.7 Computer Integrated Manufacturing: CAD/CAM & Integration Tools 15.8 NC/CNC Machines & CNC Part Programming 15.9 Material Requirements Planning, Scheduling & Sequencing 15.10 Queuing Theory & Simple Queuing Models 15.11 Network Flow Models: Shortest Route, Maximal Flow & Spanning Tree

6.12 Numerical Methods: Root Finding, Integration & ODE Solvers

Key Takeaways Explain This Topic AI

The Newton-Raphson method converges quadratically but fails when the derivative at the current estimate is near zero, whereas bisection always converges though only linearly.

The trapezoidal rule needs any number of intervals and is exact for linear functions, while Simpson's one-third rule requires an even number of intervals and is exact up to cubics.

Simpson's one-third rule weights ordinates in the pattern 1, 4, 2, 4, ..., 4, 1 and the multiplier outside the bracket is h divided by 3.

Euler's method is a single-step first-order ODE solver, while the fourth-order Runge-Kutta method achieves far higher accuracy for the same step size at the cost of four function evaluations.

Last updated: August 2026

Why Numerical Methods Appear on a PSU Paper

Closed-form solutions run out quickly in engineering practice: the Colebrook equation for pipe friction, the transcendental frequency equation for a continuous beam, and most fin and radiation problems admit no algebraic solution. The syllabus therefore lists three numerical topics, and objective items on them are highly formulaic — recall the iteration formula, do two rounds of arithmetic.

Root Finding: Bisection Method

If f ( a ) f(a) f ( a ) and f ( b ) f(b) f ( b ) have opposite signs, a root lies between them. Repeatedly halve the interval, keeping the half in which the sign change persists: x mid = a + b 2 x_{\text{mid}} = \frac{a + b}{2} x mid ​ = 2 a + b ​

Bisection is always convergent but only linearly so: each iteration gains exactly one bit of accuracy, and after n n n steps the error bound is ( b − a ) / 2 n (b-a)/2^{n} ( b − a ) / 2 n . It cannot find roots of even multiplicity, where the function touches but does not cross the axis.

Root Finding: Newton-Raphson Method

The workhorse method, derived from a first-order Taylor expansion: x n + 1 = x n − f ( x n ) f ′ ( x n ) x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)} x n + 1 ​ = x n ​ − f ′ ( x n ​ ) f ( x n ​ ) ​

Convergence is quadratic near a simple root — the number of correct digits roughly doubles each iteration. The failure modes are equally examinable:

f ′ ( x n ) ≈ 0 f'(x_n) \approx 0 f ′ ( x n ​ ) ≈ 0 sends the next iterate far away (a near-horizontal tangent).

A poor initial guess can diverge or cycle between two values.

At a root of multiplicity greater than one, convergence degrades to linear.

Worked example. Find 10 \sqrt{10} 10 ​ by solving f ( x ) = x 2 − 10 = 0 f(x) = x^2 - 10 = 0 f ( x ) = x 2 − 10 = 0 with x 0 = 3 x_0 = 3 x 0 ​ = 3 . x 1 = 3 − 9 − 10 6 = 3 + 0.16667 = 3.16667 x_1 = 3 - \frac{9 - 10}{6} = 3 + 0.16667 = 3.16667 x 1 ​ = 3 − 6 9 − 10 ​ = 3 + 0.16667 = 3.16667 x 2 = 3.16667 − 10.0278 − 10 6.33333 = 3.16667 − 0.00439 = 3.16228 x_2 = 3.16667 - \frac{10.0278 - 10}{6.33333} = 3.16667 - 0.00439 = 3.16228 x 2 ​ = 3.16667 − 6.33333 10.0278 − 10 ​ = 3.16667 − 0.00439 = 3.16228

Two iterations already give six-figure accuracy against the true value 3.162278. Note the special case: applying Newton-Raphson to x 2 − N x^2 - N x 2 − N gives the classical square-root iteration x n + 1 = 1 2 ( x n + N / x n ) x_{n+1} = \tfrac{1}{2}\left(x_n + N/x_n\right) x n + 1 ​ = 2 1 ​ ( x n ​ + N / x n ​ ) .

Root Finding: Secant and Regula Falsi

The secant method replaces the derivative by a finite difference: x n + 1 = x n − f ( x n ) x n − x n − 1 f ( x n ) − f ( x n − 1 ) x_{n+1} = x_n - f(x_n)\frac{x_n - x_{n-1}}{f(x_n) - f(x_{n-1})} x n + 1 ​ = x n ​ − f ( x n ​ ) f ( x n ​ ) − f ( x n − 1 ​ ) x n ​ − x n − 1 ​ ​

It needs two starting points and no derivative, converging at order about 1.618. Regula falsi (false position) uses the same formula but always retains a bracketing pair, trading some speed for guaranteed convergence.

Numerical Integration

Both rules divide [ a , b ] [a,b] [ a , b ] into n n n strips of width h = ( b − a ) / n h = (b-a)/n h = ( b − a ) / n with ordinates y 0 , y 1 , … , y n y_0, y_1, \ldots, y_n y 0 ​ , y 1 ​ , … , y n ​ .

Trapezoidal rule ∫ a b y d x ≈ h 2 [ ( y 0 + y n ) + 2 ( y 1 + y 2 + ⋯ + y n − 1 ) ] \int_a^b y\,dx \approx \frac{h}{2}\Big[(y_0 + y_n) + 2(y_1 + y_2 + \cdots + y_{n-1})\Big] ∫ a b ​ y d x ≈ 2 h ​ [ ( y 0 ​ + y n ​ ) + 2 ( y 1 ​ + y 2 ​ + ⋯ + y n − 1 ​ ) ]

Any number of intervals is allowed. The rule fits straight lines between points, so it is exact for linear integrands and its error is proportional to h 2 h^2 h 2 .

Simpson's one-third rule ∫ a b y d x ≈ h 3 [ ( y 0 + y n ) + 4 ( y 1 + y 3 + ⋯ ) + 2 ( y 2 + y 4 + ⋯ ) ] \int_a^b y\,dx \approx \frac{h}{3}\Big[(y_0 + y_n) + 4(y_1 + y_3 + \cdots) + 2(y_2 + y_4 + \cdots)\Big] ∫ a b ​ y d x ≈ 3 h ​ [ ( y 0 ​ + y n ​ ) + 4 ( y 1 ​ + y 3 ​ + ⋯ ) + 2 ( y 2 ​ + y 4 ​ + ⋯ ) ]

The weighting pattern is 1 , 4 , 2 , 4 , 2 , … , 4 , 1 1, 4, 2, 4, 2, \ldots, 4, 1 1 , 4 , 2 , 4 , 2 , … , 4 , 1 — odd-indexed ordinates get 4, even-indexed interior ordinates get 2 . It requires an even number of intervals (an odd number of ordinates) because it fits a parabola through each group of three points. It is exact up to cubic integrands and its error goes as h 4 h^4 h 4 .

Simpson's three-eighths rule ∫ a b y d x ≈ 3 h 8 [ ( y 0 + y n ) + 3 ( y 1 + y 2 + y 4 + y 5 + ⋯ ) + 2 ( y 3 + y 6 + ⋯ ) ] \int_a^b y\,dx \approx \frac{3h}{8}\Big[(y_0 + y_n) + 3(y_1 + y_2 + y_4 + y_5 + \cdots) + 2(y_3 + y_6 + \cdots)\Big] ∫ a b ​ y d x ≈ 8 3 h ​ [ ( y 0 ​ + y n ​ ) + 3 ( y 1 ​ + y 2 ​ + y 4 ​ + y 5 ​ + ⋯ ) + 2 ( y 3 ​ + y 6 ​ + ⋯ ) ]

This requires the number of intervals to be a multiple of 3 .

  • Rule Intervals required Exact for Error order
  • Trapezoidal Any n n n Degree 1 h 2 h^2 h 2
  • Simpson 1/3 Even n n n Degree 3 h 4 h^4 h 4
  • Simpson 3/8 Multiple of 3 Degree 3 h 4 h^4 h 4

Worked example. Evaluate ∫ 0 2 x 3 d x \int_0^2 x^3 dx ∫ 0 2 ​ x 3 d x with n = 2 n = 2 n = 2 , so h = 1 h = 1 h = 1 and ordinates y 0 = 0 y_0 = 0 y 0 ​ = 0 , y 1 = 1 y_1 = 1 y 1 ​ = 1 , y 2 = 8 y_2 = 8 y 2 ​ = 8 .

Simpson: 1 3 [ ( 0 + 8 ) + 4 ( 1 ) ] = 12 3 = 4 \dfrac{1}{3}\left[(0 + 8) + 4(1)\right] = \dfrac{12}{3} = 4 3 1 ​ [ ( 0 + 8 ) + 4 ( 1 ) ] = 3 12 ​ = 4 — the exact answer, since Simpson is exact for cubics.

Trapezoidal: 1 2 [ ( 0 + 8 ) + 2 ( 1 ) ] = 5 \dfrac{1}{2}\left[(0+8) + 2(1)\right] = 5 2 1 ​ [ ( 0 + 8 ) + 2 ( 1 ) ] = 5 , an error of 25%. This contrast is a favourite examination point.

Numerical Solution of Differential Equations

For d y d x = f ( x , y ) \dfrac{dy}{dx} = f(x,y) d x d y ​ = f ( x , y ) with y ( x 0 ) = y 0 y(x_0) = y_0 y ( x 0 ​ ) = y 0 ​ :

Euler's method (single-step, first order): y n + 1 = y n + h f ( x n , y n ) y_{n+1} = y_n + h\,f(x_n, y_n) y n + 1 ​ = y n ​ + h f ( x n ​ , y n ​ )

Simple but crude; the error per step is proportional to h 2 h^2 h 2 and accumulates.

Modified Euler / Heun (predictor-corrector, second order): y n + 1 = y n + h 2 [ f ( x n , y n ) + f ( x n + 1 , y n + 1 ∗ ) ] y_{n+1} = y_n + \frac{h}{2}\left[f(x_n,y_n) + f(x_{n+1}, y^{*}_{n+1})\right] y n + 1 ​ = y n ​ + 2 h ​ [ f ( x n ​ , y n ​ ) + f ( x n + 1 ​ , y n + 1 ∗ ​ ) ]

Fourth-order Runge-Kutta , the standard multi-stage method: k 1 = h f ( x n , y n ) , k 2 = h f ⁣ ( x n + h 2 , y n + k 1 2 ) k_1 = hf(x_n,y_n), \quad k_2 = hf\!\left(x_n + \tfrac{h}{2}, y_n + \tfrac{k_1}{2}\right) k 1 ​ = h f ( x n ​ , y n ​ ) , k 2 ​ = h f ( x n ​ + 2 h ​ , y n ​ + 2 k 1 ​ ​ ) k 3 = h f ⁣ ( x n + h 2 , y n + k 2 2 ) , k 4 = h f ( x n + h , y n + k 3 ) k_3 = hf\!\left(x_n + \tfrac{h}{2}, y_n + \tfrac{k_2}{2}\right), \quad k_4 = hf(x_n + h, y_n + k_3) k 3 ​ = h f ( x n ​ + 2 h ​ , y n ​ + 2 k 2 ​ ​ ) , k 4 ​ = h f ( x n ​ + h , y n ​ + k 3 ​ ) y n + 1 = y n + 1 6 ( k 1 + 2 k 2 + 2 k 3 + k 4 ) y_{n+1} = y_n + \frac{1}{6}\left(k_1 + 2k_2 + 2k_3 + k_4\right) y n + 1 ​ = y n ​ + 6 1 ​ ( k 1 ​ + 2 k 2 ​ + 2 k 3 ​ + k 4 ​ )

Four function evaluations per step buy fourth-order accuracy, which is why RK4 is the default in almost every engineering solver. Euler's method is the special case obtained by keeping only k 1 k_1 k 1 ​ .