Numerical methods: roots, integration and ODEs
Mathematical methods · 13 questions and templates for IIT JAM Physics, in order from warm-up to top rank. Check each answer, then read the full solution.
Loading questions… (they need JavaScript; nothing you type is sent anywhere)
Written questions with solutions
The same questions as a list, so you can print them or read without the practice box. Templates (fresh numbers) appear only in the practice box above.
-
MCQWarm-up
Which root-finding method needs the derivative at every step?- Bisection
- Secant
- Newton-Raphson
- Regula falsi (false position)
Answer and solution
Answer: C
Newton-Raphson uses . The secant method replaces by the slope through the last two points; bisection and false position use only values of at the ends of a bracket.Why people get this wrong: The secant method looks like Newton's but needs no derivative.
-
NATStandard
The secant method is applied to with and . The next iterate is ______ (three decimal places).Answer and solution
Answer: 1.667 (±0.002)
, . . (The root is .)Why people get this wrong: Using in the denominator flips the correction and gives 2.333.
-
MCQStandard
The forward difference approximates with truncation error of order- (it does not improve as )
Answer and solution
Answer: A
Taylor: , so the forward difference is : error . The central difference cancels the term and is .Why people get this wrong: Mixing up the forward difference with the central one, which is second order.
-
MCQExam level
For a smooth integrand on small panels, the error of the composite midpoint rule compared with that of the composite trapezoidal rule (same panels) is about- the same size and sign
- half the size and of opposite sign
- twice the size and of the same sign
- zero for every cubic
Answer and solution
Answer: B
On one panel of width : trapezoidal error , midpoint error . So the midpoint rule is about twice as accurate and errs the other way; this is why Simpson's rule, , cancels both leading errors.Why people get this wrong: Both rules are exact only for straight lines; neither integrates every cubic exactly.
-
NATExam level
The composite midpoint rule with two panels () estimates as ______ (one decimal place).Answer and solution
Answer: 3.5 (±0.01)
Midpoints and : . The exact value is 4; the trapezoidal rule gives . Errors and : half the size and opposite sign.Why people get this wrong: Using the end points of the panels instead of their midpoints.
-
MSQExam level
Which statements about solving ( dense, ) are true?- Partial pivoting (choosing the largest available pivot) improves numerical stability
- Gaussian elimination takes of order operations
- Once is known, each new right-hand side costs only of order operations
- Computing and then is the most efficient way to solve one system
Answer and solution
Answer: A, B, C
Small pivots amplify rounding errors; swapping rows to use the largest one keeps multipliers at most 1. Elimination costs about multiplications. With and stored, forward and back substitution cost about each. Forming costs about three times more than one elimination and is usually less accurate.Why people get this wrong: Writing is fine on paper but wasteful in code.
-
MSQExam level
Which statements about polynomial interpolation are true?- High-degree interpolation of at equally spaced points on oscillates wildly near the ends
- Clustering the nodes near the ends (Chebyshev points) tames that oscillation
- A cubic spline has continuous first and second derivatives at the nodes
- Raising the degree of an equally spaced interpolant always improves its accuracy
Answer and solution
Answer: A, B, C
This is Runge's phenomenon: the error near grows with the degree for equally spaced nodes. Chebyshev nodes, , minimise the node polynomial and make the interpolant converge for smooth functions. Cubic splines join cubic pieces with matching value, slope and curvature. The last statement is exactly what Runge's example disproves.Why people get this wrong: "More points, more accuracy" fails for equally spaced polynomial interpolation.
-
NATHard
One step of the implicit (backward) Euler method with is applied to , . The result is ______ (three decimal places).Answer and solution
Answer: 0.167 (±0.002)
, so . It decays, as the true solution does (). Explicit Euler with the same step gives and blows up: backward Euler is stable for every on decaying problems.Why people get this wrong: Evaluating at the old point (explicit Euler) gives .
-
MCQHard
The iteration has fixed points and . Started from , it- converges to 2
- oscillates between 1 and 2
- runs off to infinity
- converges to 1
Answer and solution
Answer: D
With , : (attracting) and (repelling). From 1.5: , , ... decreasing towards 1. (Starting above 2 it would run off to infinity.)Why people get this wrong: Being a fixed point is not enough; the iteration converges only to points where .
-
NATHard
The heat equation with m/s is solved by the explicit scheme (forward in time, central in space) with grid spacing m. It is stable for . The largest stable time step is ______ s (one decimal place).Answer and solution
Answer: 0.5 s (±0.01)
s. Halving would cut the allowed step by four, which is why implicit schemes (e.g. Crank-Nicolson) are used for fine grids.Why people get this wrong: Using instead of gives 50 s, a hundred times too large.