Numerical Methods VTU — Solved Examples (Newton-Raphson, Simpson’s, Runge-Kutta)

Numerical methods close out VTU Engineering Maths 2, and they’re often the most immediately practical module in the entire two-semester sequence — every technique here exists because real engineering problems frequently can’t be solved with a clean, closed-form answer. This guide works through solved examples across the three main categories: root-finding, interpolation, and numerical integration, with free calculators to check your own working against.

Root-Finding: Newton-Raphson

Newton-Raphson refines a guess using the tangent line at that point: xₙ₊₁ = xₙ − f(xₙ)/f'(xₙ). For f(x) = x³ − 5, starting at x₀ = 1: f(1) = −4, f'(1) = 3, giving x₁ = 1 − (−4/3) = 2.333. f(2.333) ≈ 7.7, f'(2.333) ≈ 16.33, giving x₂ ≈ 1.862. Continuing this converges toward the actual cube root of 5, ≈ 1.710. The method converges fast when the initial guess is reasonable and f'(x) doesn’t approach zero along the way. Verify any polynomial’s iterations with the Newton-Raphson Calculator →

Root-Finding: Bisection Method

Where Newton-Raphson needs a derivative, bisection only needs a sign change: if f(a) and f(b) have opposite signs, a root lies between them. Each step halves the interval by checking the midpoint. It’s slower than Newton-Raphson but never fails to converge once a valid bracket exists — which is why it’s often used first, to get a reliable starting guess for a faster method. Practise with the Bisection Method Calculator →

Interpolation: Newton’s Forward Difference Formula

Given a table of equally-spaced data points, Newton’s forward difference formula estimates a value between known points without needing the underlying function’s actual formula. It builds a difference table from the given y-values, then uses those differences in a polynomial approximation — genuinely useful when you have measured or tabulated data and need to estimate an in-between value that wasn’t directly recorded.

Numerical Integration: Trapezoidal Rule

The trapezoidal rule approximates the area under a curve by treating each subinterval as a trapezoid rather than a rectangle: ∫f(x)dx ≈ (h/2)[f(a) + 2f(x₁) + 2f(x₂) + … + f(b)]. For f(x) = x² on [0,4] with 4 subintervals, this gives 22 against the exact value of 21.33 — close, with the small error typical of approximating a curve with straight-line segments. Try the Trapezoidal Rule Calculator →

Numerical Integration: Simpson’s 1/3 Rule

Simpson’s rule fits a parabola across each pair of subintervals instead of a straight line, requiring an even number of subintervals: ∫f(x)dx ≈ (h/3)[f(a) + 4f(x₁) + 2f(x₂) + 4f(x₃) + … + f(b)]. For the same f(x) = x² example, Simpson’s rule gives exactly 21.33 — matching the true value, since it’s exact for any polynomial up to degree 3. Try Simpson’s Rule Calculator →

Choosing the Right Method for a Given Problem

Use Newton-Raphson when you can differentiate the function easily and have a good initial guess. Use bisection when you need guaranteed convergence and don’t mind more steps. Use the trapezoidal rule for a quick integral estimate; use Simpson’s rule when you need better accuracy for the same number of subintervals — the improvement from parabolic fitting is usually worth the extra weighting arithmetic.

Where Marks Are Actually Lost

Mistake 1 — Using an odd number of subintervals for Simpson’s rule. The method requires an even n by construction — using an odd number makes the formula invalid, not just less accurate.

Mistake 2 — Stopping Newton-Raphson iterations too early or too late. VTU questions usually specify the number of iterations or a convergence tolerance explicitly — follow it precisely rather than guessing when to stop.

Mistake 3 — Confusing the weighting pattern between trapezoidal (all interior points ×2) and Simpson’s (alternating ×4, ×2). Mixing these up produces a plausible-looking but wrong final estimate.

Frequently Asked Questions

Q: Which numerical method is most heavily tested in VTU papers?
Newton-Raphson and one of the two integration rules (trapezoidal or Simpson’s) are the most consistently paired question types across recent papers.

Q: Can I use a calculator to check my numerical methods homework?
Yes — every method in this guide has a matching free calculator linked above, showing full working so you can compare step by step, not just the final answer.

Numerical methods close out Module 5 of Engineering Maths 2. Return to the full module guide →

See how Daniel Classes teaches VTU Engineering Mathematics →

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top