Skip to Content
PrepPath logoPrepPath

Questions

Practice and exam questions for Numerical Analysis with MATLAB.

1. Newton's Forward Difference Interpolation

Question 1.1: Concept of Interpolation and Extrapolation

  1. Define the mathematical concept of interpolation and contrast it with extrapolation.
  2. Given a discrete set of observations {(xi,yi)}i=0n\{(x_i, y_i)\}_{i=0}^n, state the condition under which an estimation of yy at xx is termed interpolation versus extrapolation.
  3. Define the forward difference operator Δ\Delta and write down the expressions for the first, second, and nn-th forward differences of a sequence y0,y1,y2,…,yny_0, y_1, y_2, \dots, y_n.

Question 1.2: Difference Operator Identities and Difference Tables

  1. Prove algebraically that the second forward difference can be expressed directly in terms of functional ordinates as: Δ2y2=y4−2y3+y2\Delta^2 y_2 = y_4 - 2y_3 + y_2

  2. Construct the symbolic forward difference table for a function given at six equidistant nodes x0,x1,x2,x3,x4,x5x_0, x_1, x_2, x_3, x_4, x_5.

  3. Given the following data table:

    xx2020232326262929
    yy0.34200.34200.39070.39070.43840.43840.48480.4848

    Construct the full forward difference table up to third-order forward differences Δ3y0\Delta^3 y_0.


Question 1.3: Newton's Forward Interpolation Numerical Evaluation

  1. State Newton's Forward Interpolation Formula for a set of (n+1)(n+1) equispaced points with step size hh, defining the normalized variable uu.

  2. Using the data from Question 1.2:

    xx2020232326262929
    yy0.34200.34200.39070.39070.43840.43840.48480.4848

    Calculate the value of yy at x=21x = 21. Explain why Newton's forward formula is the appropriate choice for this specific query point.


Question 1.4: Polynomial Reconstruction via Forward Differences

A second-degree polynomial f(x)f(x) passes through the points (0,1)(0, 1), (1,3)(1, 3), (2,7)(2, 7), and (3,13)(3, 13).

  1. Construct the forward difference table for the given coordinate points.
  2. Determine the step size hh, base value x0x_0, and normalized parameter u(x)u(x).
  3. Use Newton's forward interpolation formula to find the explicit analytic polynomial f(x)=ax2+bx+cf(x) = ax^2 + bx + c.

Question 1.5: Higher-Order Polynomial Reconstruction & Point Estimation

Given the discrete dataset: (1,1),  (2,8),  (3,27),  (4,64),  (5,125),  (6,216),  (7,343),  (8,512)(1, 1),\; (2, 8),\; (3, 27),\; (4, 64),\; (5, 125),\; (6, 216),\; (7, 343),\; (8, 512)

  1. Construct the forward difference table up to third differences.
  2. What does the constancy of the third forward difference indicate regarding the degree of the underlying polynomial?
  3. Find the explicit closed-form polynomial f(x)f(x).
  4. Estimate the value of ss where the point (10,s)(10, s) lies on the reconstructed polynomial curve.

Question 1.6: Village Census Population Estimation

The census records of a rural village over six consecutive decades are recorded as follows:

Year (xx)194119411951195119611961197119711981198119911991
Population (yy)250025002800280032003200370037004350435052255225
  1. Construct the complete forward difference table.
  2. Formulate the normalized step parameter uu for the target year x=1945x = 1945.
  3. Estimate the village population in the year 19451945 using Newton's forward difference interpolation formula up to fifth differences.

Question 1.7: Trigonometric Table Interpolation

The values of the trigonometric sine function are tabulated below at 5∘5^\circ intervals:

xx15∘15^\circ20∘20^\circ25∘25^\circ30∘30^\circ35∘35^\circ40∘40^\circ
y=sin⁡(x)y = \sin(x)0.25881900.25881900.34202010.34202010.42261830.42261830.50000000.50000000.57357640.57357640.64278760.6427876
  1. Construct the forward difference table up to Δ5y0\Delta^5 y_0.
  2. Calculate the value of sin⁡(18∘)\sin(18^\circ) using Newton's forward difference interpolation formula.

2. Newton's Backward Difference Interpolation

Question 2.1: Backward Difference Operator and Table Construction

  1. Define the backward difference operator ∇\nabla. Show the relationship between the backward difference ∇yk\nabla y_k and the forward difference Δyk−1\Delta y_{k-1}.
  2. Define higher-order backward differences ∇2yn,∇3yn,…,∇kyn\nabla^2 y_n, \nabla^3 y_n, \dots, \nabla^k y_n.
  3. Construct the symbolic backward difference table for a table with nodes x0,x1,x2,x3,x4x_0, x_1, x_2, x_3, x_4.

Question 2.2: Newton's Backward Interpolation Formula

  1. State Newton's Backward Interpolation Formula for evaluating a function near the end of a tabular dataset.
  2. Define the normalized backward parameter pp in terms of the query point xx, terminal node xnx_n, and uniform spacing hh.
  3. When is Newton's backward interpolation formula preferred over Newton's forward formula?

Question 2.3: Numerical Evaluation using Backward Differences

A physical experiment yields the following measurements:

xx202025253030353540404545
f(x)f(x)354354332332291291260260231231204204
  1. Construct the complete backward difference table up to fifth differences ∇5y5\nabla^5 y_5.
  2. Identify the terminal values xnx_n, yny_n, and step size hh.
  3. Calculate the normalized parameter pp for evaluating f(42)f(42).
  4. Estimate f(42)f(42) by substituting all difference terms into Newton's backward interpolation formula.

Question 2.4: Advantages, Disadvantages & Computer Science Applications

  1. Enumerate the key advantages and disadvantages of Newton's backward interpolation method in practical computation.
  2. Explain how interpolation principles are applied in:
    • Digital Image Processing: Bilinear and bicubic image resizing / super-resolution.
    • Game Development & Computer Graphics: Linear interpolation (lerp) and trajectory interpolation for physics animations.

3. Lagrange Interpolation for Unequal Intervals

Question 3.1: Derivation of the Lagrange Interpolation Formula

  1. State the limitation of Newton's forward and backward interpolation formulas regarding node spacing.
  2. Given (n+1)(n+1) distinct points (x0,y0),(x1,y1),…,(xn,yn)(x_0, y_0), (x_1, y_1), \dots, (x_n, y_n) where xi+1−xix_{i+1} - x_i is not necessarily uniform:
    • Assume an approximating polynomial Pn(x)=∑i=0nAi∏j≠i(x−xj)P_n(x) = \sum_{i=0}^n A_i \prod_{j \ne i} (x - x_j).
    • Prove algebraically that the coefficients AiA_i are given by: Ai=yi∏j≠i(xi−xj)A_i = \frac{y_i}{\prod_{j \ne i} (x_i - x_j)}
    • Formulate the classical Lagrange Interpolation Polynomial: Pn(x)=∑i=0nyiLi(x),where Li(x)=∏j=0,j≠inx−xjxi−xjP_n(x) = \sum_{i=0}^n y_i L_i(x), \quad \text{where } L_i(x) = \prod_{j=0, j \ne i}^n \frac{x - x_j}{x_i - x_j}
  3. State the property satisfied by the Lagrange cardinal basis functions Li(xj)L_i(x_j) at the nodes.

Question 3.2: Lagrange Evaluation with Unequally Spaced Nodes

Given the following table of unequally spaced observations:

xx5577111113131717
yy150150392392145214522366236652025202
  1. Verify that the nodes are non-uniformly spaced.
  2. Calculate the individual Lagrange basis coefficients L0(10),L1(10),L2(10),L3(10),L4(10)L_0(10), L_1(10), L_2(10), L_3(10), L_4(10) for evaluating the function at x=10x = 10.
  3. Compute the weighted contributions yiLi(10)y_i L_i(10) for each node.
  4. Determine the interpolated value f(10)f(10).
  5. Formulate the Lagrange basis values to evaluate yy at x=9x = 9.

4. Central Difference Interpolation Methods

Question 4.1: Gauss's Forward Central Difference Formula

  1. Describe the motivation for using central difference interpolation formulas when estimating values near the center of a tabular dataset.

  2. Express the displacement operator EE in terms of the forward difference operator Δ\Delta.

  3. Using the operator identity yp=Epy0=(1+Δ)py0y_p = E^p y_0 = (1 + \Delta)^p y_0 and expanding in terms of central ordinates, derive Gauss's Forward Interpolation Formula: yp=y0+p Δy0+p(p−1)2! Δ2y−1+(p+1)p(p−1)3! Δ3y−1+(p+1)p(p−1)(p−2)4! Δ4y−2+⋯y_p = y_0 + p\,\Delta y_0 + \frac{p(p-1)}{2!}\,\Delta^2 y_{-1} + \frac{(p+1)p(p-1)}{3!}\,\Delta^3 y_{-1} + \frac{(p+1)p(p-1)(p-2)}{4!}\,\Delta^4 y_{-2} + \cdots

  4. Given the tabular data:

    xx2.52.53.03.03.53.54.04.04.54.5
    yy24.14524.14522.04322.04320.22520.22518.64418.64417.64417.644
    • Select the central origin x0x_0 and compute pp for evaluating f(3.6)f(3.6).
    • Construct the central difference table.
    • Calculate f(3.6)f(3.6) using Gauss's forward formula.

Question 4.2: Gauss's Backward Central Difference Formula

  1. Derive Gauss's Backward Interpolation Formula: yp=y0+p Δy−1+p(p+1)2! Δ2y−1+(p+1)p(p−1)3! Δ3y−2+(p+2)(p+1)p(p−1)4! Δ4y−2+⋯y_p = y_0 + p\,\Delta y_{-1} + \frac{p(p+1)}{2!}\,\Delta^2 y_{-1} + \frac{(p+1)p(p-1)}{3!}\,\Delta^3 y_{-2} + \frac{(p+2)(p+1)p(p-1)}{4!}\,\Delta^4 y_{-2} + \cdots

  2. The population of a town (in thousands) over six decades is given below:

    Year190119011911191119211921193119311941194119511951
    Population121215152020272739395252
    • Designate the base year x0=1931x_0 = 1931 and compute pp for x=1936x = 1936.
    • Construct the central difference table up to fifth differences.
    • Estimate the population in 19361936 using Gauss's backward formula.

Question 4.3: Stirling's Central Difference Formula

  1. Explain how Stirling's Formula is obtained from the arithmetic mean of Gauss's forward and backward interpolation formulas.
  2. State the explicit algebraic formula for Stirling's interpolation up to fourth differences.
  3. Given the data points: f(20)=512,f(30)=439,f(40)=346,f(50)=243f(20) = 512, \quad f(30) = 439, \quad f(40) = 346, \quad f(50) = 243
    • Set the origin at x0=30x_0 = 30 with h=10h = 10, and compute pp for x=35x = 35.
    • Construct the difference table.
    • Evaluate f(35)f(35) using Stirling's formula.

Question 4.4: Bessel's Central Difference Formula

  1. Formulate Bessel's Central Difference Formula, indicating which terms represent mean differences between adjacent rows.

  2. State the optimal range of the normalized parameter pp for which Bessel's formula provides maximum accuracy.

  3. The temperature θ\theta (in ∘C^\circ\text{C}) of a chemical reaction is measured at regular hourly intervals:

    Time tt (hr)2233445566
    Temp θ\theta61.8761.8754.0854.0847.0347.0340.6540.6534.8834.88
    • Choose origin t0=4t_0 = 4 and determine pp for t=4.3t = 4.3.
    • Construct the central difference table.
    • Evaluate the temperature θ(4.3)\theta(4.3) using Bessel's formula.

5. Numerical Quadrature: Trapezoidal & Simpson's Rules

Question 5.1: Composite Trapezoidal Rule

  1. State the mathematical formula for the composite Trapezoidal Rule approximating ∫abf(x) dx\int_a^b f(x)\,dx over nn equal subintervals.
  2. Derive the step size hh and grid points xix_i for the limits [a,b][a, b].
  3. Apply the Trapezoidal Rule with n=10n = 10 to evaluate: ∫121x dx\int_1^2 \frac{1}{x}\,dx
    • List the eleven grid coordinates x0,x1,…,x10x_0, x_1, \dots, x_{10} and their corresponding functional values f(xi)=1xif(x_i) = \frac{1}{x_i} rounded to four decimal places.
    • Group the boundary ordinates and intermediate ordinates.
    • Compute the numerical approximation T10T_{10}.
    • Compare T10T_{10} with the exact analytical value ln⁡(2)≈0.69315\ln(2) \approx 0.69315 and determine the absolute error.

Question 5.2: Simpson's 1/3 Rule

  1. State Simpson's 1/3 Rule for approximating ∫abf(x) dx\int_a^b f(x)\,dx.
  2. State the essential restriction on the number of subintervals nn for Simpson's 1/3 rule and explain its geometric origin (quadratic polynomial interpolation through node triplets).
  3. Evaluate the integral: ∫0121+x3 dxwith n=6\int_0^1 \frac{2}{1 + x^3}\,dx \quad \text{with } n = 6
    • Compute the step size hh and coordinate nodes x0,…,x6x_0, \dots, x_6.
    • Evaluate yi=f(xi)=21+xi3y_i = f(x_i) = \frac{2}{1 + x_i^3} to four decimal places.
    • Group terms into boundary points, odd-indexed points (weight 4), and even-indexed points (weight 2).
    • Compute the final numerical approximation.

Question 5.3: Simpson's 3/8 Rule

  1. State Simpson's 3/8 Rule for numerical quadrature.
  2. State the structural constraint on nn for Simpson's 3/8 rule (cubic polynomial interpolation through node quadruplets).
  3. Using the exact same function and grid nodes from Question 5.2 (f(x)=21+x3f(x) = \frac{2}{1 + x^3}, a=0a = 0, b=1b = 1, n=6n = 6):
    • Group the ordinates according to weights: boundary ordinates, ordinates with index not divisible by 3 (weight 3), and ordinates with index divisible by 3 (weight 2).
    • Substitute into Simpson's 3/8 formula and compute the numerical approximation.
    • Compare the results obtained from Simpson's 1/3 rule and Simpson's 3/8 rule.

Question 5.4: Comparison of Newton-Cotes Quadrature Methods

Construct a comprehensive comparative summary table comparing:

  1. Trapezoidal Rule
  2. Simpson's 1/3 Rule
  3. Simpson's 3/8 Rule

Address:

  • Degree of approximating interpolating polynomial mm.
  • Interval partition constraint on nn.
  • Local and global truncation error order in terms of step size hh.
  • Degree of exactness (highest polynomial degree integrated without error).

6. Systems of Linear Equations: Iterative Methods

Question 6.1: Strictly Diagonally Dominant Systems

  1. Define what it means for a square matrix A=[aij]n×nA = [a_{ij}]_{n \times n} to be strictly diagonally dominant (SDD).
  2. State the mathematical condition for row diagonal dominance: ∣aii∣>∑j≠i∣aij∣∀i∈{1,2,…,n}|a_{ii}| > \sum_{j \ne i} |a_{ij}| \quad \forall i \in \{1, 2, \dots, n\}
  3. Why is diagonal dominance a sufficient condition to guarantee convergence for both Gauss-Jacobi and Gauss-Seidel iterations?
  4. Given the system: 25=−4x1−2x2+11x3−11=7x1−3x2−4x33=−3x1+6x2−2x3\begin{aligned} 25 &= -4x_1 - 2x_2 + 11x_3 \\ -11 &= 7x_1 - 3x_2 - 4x_3 \\ 3 &= -3x_1 + 6x_2 - 2x_3 \end{aligned} Rearrange the equations so that the coefficient matrix satisfies strict diagonal dominance.

Question 6.2: Gauss-Jacobi Method Iterative Solution

For the rearranged diagonally dominant system from Question 6.1:

7x1−3x2−4x3=−11−3x1+6x2−2x3=3−4x1−2x2+11x3=25\begin{aligned} 7x_1 - 3x_2 - 4x_3 &= -11 \\ -3x_1 + 6x_2 - 2x_3 &= 3 \\ -4x_1 - 2x_2 + 11x_3 &= 25 \end{aligned}
  1. Derive the iterative formulas for x1(k+1),x2(k+1),x3(k+1)x_1^{(k+1)}, x_2^{(k+1)}, x_3^{(k+1)}.
  2. Starting from the initial guess vector x(0)=[0,0,0]T\mathbf{x}^{(0)} = [0, 0, 0]^T:
    • Compute the first three iterations k=1,2,3k = 1, 2, 3 step-by-step showing full arithmetic.
    • Present the summary table of iteration vectors x(k)\mathbf{x}^{(k)} up to iteration k=10k = 10.
    • Verify the stopping criterion EA≤0.0001E_A \le 0.0001.

Question 6.3: Gauss-Seidel Method Iterative Solution

Using the same diagonally dominant system:

7x1−3x2−4x3=−11−3x1+6x2−2x3=3−4x1−2x2+11x3=25\begin{aligned} 7x_1 - 3x_2 - 4x_3 &= -11 \\ -3x_1 + 6x_2 - 2x_3 &= 3 \\ -4x_1 - 2x_2 + 11x_3 &= 25 \end{aligned}
  1. Write down the Gauss-Seidel iterative updating equations, explicitly showing how newly calculated values are immediately reused within the current iteration.
  2. Beginning with x(0)=[0,0,0]T\mathbf{x}^{(0)} = [0, 0, 0]^T:
    • Calculate iterations k=1k = 1 and k=2k = 2 step-by-step.
    • Present the complete iteration summary table from k=1k = 1 to k=6k = 6.
    • Verify convergence under the stopping condition EA≤0.001E_A \le 0.001.

Question 6.4: Comparison: Gauss-Jacobi vs. Gauss-Seidel

  1. Compare the memory and computational characteristics of the Gauss-Jacobi method versus the Gauss-Seidel method.
  2. Explain why Gauss-Seidel typically converges roughly twice as fast as Gauss-Jacobi.
  3. Discuss the suitability of each method for parallel and distributed computing hardware architectures (e.g., GPU computing).

On this page

1. Newton's Forward Difference InterpolationQuestion 1.1: Concept of Interpolation and ExtrapolationQuestion 1.2: Difference Operator Identities and Difference TablesQuestion 1.3: Newton's Forward Interpolation Numerical EvaluationQuestion 1.4: Polynomial Reconstruction via Forward DifferencesQuestion 1.5: Higher-Order Polynomial Reconstruction & Point EstimationQuestion 1.6: Village Census Population EstimationQuestion 1.7: Trigonometric Table Interpolation2. Newton's Backward Difference InterpolationQuestion 2.1: Backward Difference Operator and Table ConstructionQuestion 2.2: Newton's Backward Interpolation FormulaQuestion 2.3: Numerical Evaluation using Backward DifferencesQuestion 2.4: Advantages, Disadvantages & Computer Science Applications3. Lagrange Interpolation for Unequal IntervalsQuestion 3.1: Derivation of the Lagrange Interpolation FormulaQuestion 3.2: Lagrange Evaluation with Unequally Spaced Nodes4. Central Difference Interpolation MethodsQuestion 4.1: Gauss's Forward Central Difference FormulaQuestion 4.2: Gauss's Backward Central Difference FormulaQuestion 4.3: Stirling's Central Difference FormulaQuestion 4.4: Bessel's Central Difference Formula5. Numerical Quadrature: Trapezoidal & Simpson's RulesQuestion 5.1: Composite Trapezoidal RuleQuestion 5.2: Simpson's 1/3 RuleQuestion 5.3: Simpson's 3/8 RuleQuestion 5.4: Comparison of Newton-Cotes Quadrature Methods6. Systems of Linear Equations: Iterative MethodsQuestion 6.1: Strictly Diagonally Dominant SystemsQuestion 6.2: Gauss-Jacobi Method Iterative SolutionQuestion 6.3: Gauss-Seidel Method Iterative SolutionQuestion 6.4: Comparison: Gauss-Jacobi vs. Gauss-Seidel