Numerical methods: roots, integration and ODEs
Mathematical methods · 62 questions and templates for CSIR NET Physics, in order from warm-up to top rank. Check each answer, then read the full solution.
New to this topic? Read the lesson first: Numerical methods: roots, integration and ODEs.
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
The Newton-Raphson iteration for solving isAnswer and solution
Answer: A
Replace by its tangent at : . Setting this to zero gives , where the tangent crosses the axis. -
MCQWarm-up
The composite Simpson's 1/3 rule needs the number of sub-intervals to be- odd
- even
- a multiple of 3
- any whole number
Answer and solution
Answer: B
Simpson's 1/3 rule fits a parabola through each pair of adjacent sub-intervals (three points), so the sub-intervals must come in pairs: an even number, giving the weights . A multiple of 3 is needed by Simpson's 3/8 rule. -
NATWarm-up
The bisection method starts with an interval of length 1 that brackets a root. The smallest number of bisections that makes the interval shorter than is ______.Answer and solution
Answer: 10
Each bisection halves the interval: after steps its length is . We need , i.e. , so (). -
MCQWarm-up
The trapezoidal rule gives the exact integral for all polynomials of degree up toAnswer and solution
Answer: C
It replaces the function by straight lines between the points, so it is exact for straight lines (degree 1). For it already errs: the error is , which vanishes only when . -
MCQWarm-up
For with step , the (explicit) Euler method isAnswer and solution
Answer: D
Explicit Euler follows the slope at the start of the step: , the first two terms of the Taylor series. Using the slope at the end is implicit (backward) Euler; averaging the two slopes is the trapezoidal (Crank-Nicolson) method. -
NATWarm-up
For with , one Euler step of size gives ______.Answer and solution
Answer: 1.1 (±0.001)
. The exact value is ; Euler always undershoots this growing curve, because the slope keeps increasing during the step. -
NATStandard
Newton-Raphson is used on starting from . The second iterate is ______.Answer and solution
Answer: 1.4167 (±0.0005)
The iteration is (the Babylonian square root). , . : already 3 correct figures. -
NATStandard
The composite trapezoidal rule with step estimates as ______.Answer and solution
Answer: 0.375 (±0.001)
. The exact value is ; the error matches . The chords lie above a convex curve, so the rule overestimates. -
NATStandard
Simpson's 1/3 rule with (two sub-intervals) estimates as ______.Answer and solution
Answer: 6.667 (±0.005)
. The exact value is . Simpson is exact up to cubics; a quartic shows its error, . -
MCQStandard
Near a simple root, the order of convergence of the Newton-Raphson method isAnswer and solution
Answer: C
Expanding about the root with error : . The error is squared each step (quadratic convergence): the number of correct digits roughly doubles. 1.618 is the secant method; 1 is bisection. -
MCQStandard
The order of convergence of the secant method (near a simple root) isAnswer and solution
Answer: B
The secant error obeys . Trying gives , so , the golden ratio. It is slower per step than Newton but needs only one new function value per step and no derivative. -
MCQStandard
When an ODE is integrated over a fixed interval with the explicit Euler method, the global error scales with the step size asAnswer and solution
Answer: A
Each step makes a local error (the neglected Taylor term). Over a fixed interval there are steps, so the errors accumulate to : Euler is a first-order method.Why people get this wrong: is the local (per step) error, not the global one.
-
MCQStandard
The global error of the classical fourth-order Runge-Kutta method scales asAnswer and solution
Answer: D
RK4 matches the Taylor series up to , so its local error is and the global error, after steps, is . Halving cuts the error about 16 times, at the cost of 4 function evaluations per step. -
MCQStandard
The iteration converges to a fixed point , for starting values close enough, ifAnswer and solution
Answer: D
With : . The error shrinks by the factor each step, so we need it below 1. If (as for Newton's method, viewed as a fixed-point iteration) the convergence is faster than linear. -
MSQStandard
Which of these rules integrate every cubic polynomial exactly (on a single panel)?- Simpson's 1/3 rule
- Simpson's 3/8 rule
- The trapezoidal rule
- Two-point Gauss-Legendre quadrature
Answer and solution
Answer: A, B, D
Simpson's 1/3 rule is built for quadratics but by symmetry also integrates exactly. The 3/8 rule fits a cubic. An -point Gauss rule is exact up to degree for . The trapezoidal rule is exact only for straight lines. -
NATStandard
The central difference with estimates the derivative of at as ______.Answer and solution
Answer: 3.01 (±0.001)
. The exact value is 3, and the error matches: the central difference is second-order accurate. -
MCQStandard
Which root-finding method must start from an interval on which the function changes sign, and then can never fail to converge?- Bisection
- Newton-Raphson
- Secant
- Fixed-point iteration
Answer and solution
Answer: A
Bisection keeps a bracket with and halves it every step; for a continuous function a root always stays inside, so it converges (linearly, gaining one binary digit per step). The other methods are faster but can diverge or cycle. -
NATExam level
Newton-Raphson for the cube root of 10 uses . Starting from , the first iterate is ______.Answer and solution
Answer: 2.1667 (±0.0005)
. The true value is . -
MCQExam level
Newton-Raphson is applied to , whose root is a double root. Starting from , the iterates- converge quadratically
- converge linearly, the error halving each step
- diverge
- reach the root in one step
Answer and solution
Answer: B
: the error halves each step, which is linear convergence. At a root of multiplicity Newton converges linearly with ratio ; the modified step restores quadratic convergence.Why people get this wrong: Quadratic convergence needs ; at a multiple root .
-
NATExam level
The explicit Euler method is used on . The largest step size for which the numerical solution does not grow is ______.Answer and solution
Answer: 0.04 (±0.0005)
Euler gives . The solution stays bounded when , i.e. . For it oscillates in sign while decaying; beyond 0.04 it blows up, although the true solution decays. Such "stiff" problems call for implicit methods. -
NATExam level
Heun's method (improved Euler, a second-order Runge-Kutta method) is used for , , with one step . It gives ______.Answer and solution
Answer: 1.105 (±0.0005)
Predictor: , so . Corrector slope . . Exact: ; the error dropped from 0.005 (Euler) to 0.00017. -
MCQExam level
For a smooth integrand, halving the step size in the composite Simpson's 1/3 rule reduces the error by a factor of aboutAnswer and solution
Answer: D
The composite Simpson error is , so it scales as : halving divides it by . (The trapezoidal rule, , gains only a factor 4.) -
NATExam level
A root of lies in . The number of bisection steps needed to shrink the bracketing interval below is ______.Answer and solution
Answer: 20
After steps the interval is . We need : , so (). Bisection gains about 3.3 steps per decimal digit, regardless of the function. -
MCQExam level
The interpolating polynomial through 4 data points with distinct values- is unique and has degree at most 3
- has degree exactly 4
- is unique only if the points are equally spaced
- can have any degree up to 4, depending on the method
Answer and solution
Answer: A
A polynomial of degree has 4 coefficients, fixed by 4 conditions through a Vandermonde system that is invertible for distinct . Lagrange, Newton divided differences and the direct solve give the same polynomial. Its degree can be below 3 if the data happen to lie on a lower-degree curve. -
NATExam level
The quadratic through the points , , is used to extrapolate. Its value at is ______.Answer and solution
Answer: 13
Forward differences: and . Newton's form: . Then . (Continuing the difference table, the next first difference is , so .) -
MCQExam level
For the Jacobi and Gauss-Seidel iterations for , a simple sufficient condition for convergence from any starting vector is that is- symmetric
- strictly diagonally dominant
- upper triangular with zeros on the diagonal
- singular
Answer and solution
Answer: B
If for every row, the iteration matrix has norm below 1, so both methods converge. Symmetric positive-definite matrices also guarantee Gauss-Seidel convergence, but symmetry alone does not. -
NATExam level
Simpson's 1/3 rule with two sub-intervals () estimates as ______.Answer and solution
Answer: 2.0944 (±0.002)
. The exact value is 2, so the error is 4.7% with only three points; four sub-intervals bring it to 0.23%. -
MSQExam level
Which statements about the Newton-Raphson method are correct?- It can diverge from a poor starting point
- It needs the derivative of the function (or an approximation of it)
- It converges quadratically to roots of any multiplicity
- For starting from , it cycles between 0 and 1 forever
Answer and solution
Answer: A, B, D
Divergence and the need for are standard. At a multiple root the convergence is only linear. For the cubic: , then : a 2-cycle. -
NATExam level
The trapezoidal rule gives and for . Richardson extrapolation, using the error law, gives ______.Answer and solution
Answer: 0.3333 (±0.0005)
With : , exact here (it is Simpson's rule in disguise). Repeating the idea at higher orders is Romberg integration. -
NATExam level
A straight line is fitted by least squares to the points , , . The slope is ______.Answer and solution
Answer: 1.5 (±0.001)
with , . Numerator: ; denominator . So and .