Numerical Methods: cram pack

Formula sheets, the key method steps for every topic and 8 practice problems, with full solutions at the back.

New problemsBack to the course

In the print window, choose “Save as PDF” to keep a copy on your device.

1Formulas and methods

Numerical methods

Bisection
c = (a + b)/2, width after n steps (b − a)/2ⁿ
Newton–Raphson
xn+1 = xₙ − f(xₙ)/f′(xₙ)
Linear interpolation
y = y₁ + (y₂ − y₁)(x − x₁)/(x₂ − x₁)
Trapezoid rule
T = (h/2)[f₀ + 2f₁ + … + 2fn−1 + fₙ], h = (b − a)/n
Simpson’s rule (n even)
S = (h/3)[f₀ + 4f₁ + 2f₂ + … + 4fn−1 + fₙ]
Trapezoid error bound
|E| ≤ (b − a)h²M/12, M = max|f″|
Euler
yn+1 = yₙ + h·f(tₙ, yₙ)
Heun
yn+1 = yₙ + (h/2)(k₁ + k₂), k₂ = f(tₙ + h, yₙ + hk₁)
RK4
yn+1 = yₙ + (h/6)(k₁ + 2k₂ + 2k₃ + k₄)

Method

  1. For a root: check the sign change for bisection, or compute f and f′ for Newton, and keep six or more digits in a table of iterates.
  2. For a table value: interpolate linearly between the two neighbouring points.
  3. For an integral: find h = (b − a)/n, list f at every node, apply the weights (1, 2, …, 2, 1 for trapezoid; 1, 4, 2, …, 4, 1 for Simpson with even n) and multiply by h/2 or h/3.
  4. For an ODE: step from t₀ with yₙ₊₁ = yₙ + h·f(tₙ, yₙ) (Euler) or the averaged slope (Heun), one row per step, until you reach the requested t.

Sequences & series

Arithmetic sequence
aₙ = a₁ + (n − 1)d, Sₙ = n(a₁ + aₙ)/2
Geometric sequence
aₙ = a₁rⁿ⁻¹, Sₙ = a₁(1 − rⁿ)/(1 − r)
Infinite geometric series
S = a₁/(1 − r), |r| < 1
p-series
Σ1/kᵖ converges only for p > 1
Ratio test
L = lim |ak+1/ak|: L < 1 converges, L > 1 diverges
Radius of convergence
R = lim |ck/ck+1|
Taylor polynomial
Pₙ(x) = Σ f⁽ᵏ⁾(a)(x − a)ᵏ/k!
Maclaurin series
eˣ = Σxᵏ/k!, sin x = x − x³/3! + …, cos x = 1 − x²/2! + …, ln(1 + x) = x − x²/2 + …
Lagrange error bound
|Rₙ| ≤ M·|x − a|ⁿ⁺¹/(n + 1)!

Method

  1. Identify the type: arithmetic (constant difference), geometric (constant ratio), a standard series, a power series or a Taylor polynomial.
  2. For sums use Sₙ = n(a₁ + aₙ)/2, Sₙ = a₁(1 − rⁿ)/(1 − r), or S = a₁/(1 − r) when |r| < 1, with a₁ the first term of the sum.
  3. For convergence: n-th term test first, then compare with Σ1/kᵖ or a geometric series, and use the ratio or root test for factorials and k-th powers.
  4. For Taylor polynomials list f(a), f′(a), f″(a), …, divide the k-th derivative by k!, and bound the error with M·|x − a|ⁿ⁺¹/(n + 1)!.

Matrices & determinants

2×2 determinant
det = ad − bc
2×2 inverse
A⁻¹ = (1/det)·[d −b; −c a]
Product
(AB)ij = Σk AikBkj
Eigenvalues
det(A − λI) = 0
Cramer’s rule
xi = det(Ai)/det(A)

Differential equations

Exponential growth/decay
dy/dt = ky → y = y0ekt
Half-life
k = ln 2 / t½
Newton's law of cooling
T(t) = Ta + (T0 − Ta)e−kt
Integrating factor
y′ + p(x)y = q(x): μ = e∫p dx, (μy)′ = μq
Mixing tank
dm/dt = r·c − (r/V)·m

2Practice problems

1.Numerical methodsMedium
xy012

Approximate ∫02 1/(1 + x³) dx with Simpson's rule using n = 2 strips. Give S.

f(x) = 1/(1 + x³)[a, b] = [0, 2]n = 2
S =
2.Numerical methodsHard
00.10.20.311.21.4ty(0, 1)

Use Heun's method (improved Euler) with h = 0.1 for y′ = 1 + sin(ty), y(0) = 1 to estimate y3 ≈ y(0.3).

y′ = 1 + sin(ty)y(0) = 1h = 0.1
y3 =
3.Sequences & seriesMedium
AΣ 1/(3k + 4)k = 1 … ∞BΣ 1/k⁴k = 1 … ∞CΣ (4k + 1)/(k + 2)k = 1 … ∞DΣ ln k / kk = 1 … ∞

Exactly one of the four series converges. Click it.

A: Σ 1/(3k + 4)B: Σ 1/k⁴C: Σ (4k + 1)/(k + 2)D: Σ ln k / k
  1. 1A: Σ 1/(3k + 4)
  2. 2B: Σ 1/k⁴
  3. 3C: Σ (4k + 1)/(k + 2)
  4. 4D: Σ ln k / k
4.Sequences & seriesHard

f(x) = eˣ is approximated by its Maclaurin polynomial of degree 5 at x = −0.5. Use the Lagrange error bound M·|x|ⁿ⁺¹/(n + 1)! with M = 1 to find the largest possible error |R₅|.

f(x) = eˣn = 5x = −0.5M = 1
|R₅| =
5.Matrices & determinantsMedium
A =−5−11−45−42−51

Find the determinant det A of the 3×3 matrix A shown.

A = [−5 −1 1; −4 5 −4; 2 −5 1]
det A =
6.Matrices & determinantsHard
A =6−132

Find the larger eigenvalue λ of the matrix A shown.

A = [6 −1; 3 2]
λ =
7.Differential equationsMedium
tyy(0) = 1y(2) = ?

Solve y″ + 8y′ + 15y = 0 with y(0) = 1 and y′(0) = 6. Find y(2).

y″ + 8y′ + 15y = 0y(0) = 1y′(0) = 6
y(2) =
8.Differential equationsHard
t (min)m (kg)t = ?38 kg

A tank holds 400 L of water in which 10 kg of salt is dissolved. Brine with 0.2 kg of salt per litre flows in at 20 L/min, and the well-mixed solution flows out at the same rate. After how many minutes t does the tank contain 38 kg of salt?

V = 400 Lm0 = 10 kgc = 0.2 kg/Lr = 20 L/min
t = min

3Solutions

1.Numerical methods

Answer: S = 1.037

Numerical integration: split [a, b] into n strips of width h = (b − a)/n with nodes x₀ … xₙ. Trapezoid rule: T = (h/2)[f₀ + 2f₁ + 2f₂ + … + 2fn−1 + fₙ]. Simpson's rule (n even): S = (h/3)[f₀ + 4f₁ + 2f₂ + 4f₃ + … + 4fn−1 + fₙ]. The trapezoid error shrinks like h² (bound (b − a)h²·M/12 with M = max|f″|), Simpson's like h⁴, so Simpson is usually far more accurate for the same nodes.

ixᵢf(xᵢ)weight0011110.54220.1111111

Nodes and values

h = 1
Σ wᵢfᵢ = 1 + 4·0.5 + 0.111111 = 3.111111

Simpson's rule

S = (1/3)·3.111111 = 1.037

Answer

S = 1.037

This integral has no elementary antiderivative, which is exactly when a numerical rule is needed.

2.Numerical methods

Answer: y3 = 1.355

Numerical solution of y′ = f(t, y): Euler's method steps along the slope at the start of each step: yn+1 = yₙ + h·f(tₙ, yₙ). Heun's method (improved Euler) averages the slope at the start and at an Euler prediction: k₁ = f(tₙ, yₙ), k₂ = f(tₙ + h, yₙ + h·k₁), yn+1 = yₙ + (h/2)(k₁ + k₂). The classical Runge–Kutta method (RK4) combines four slopes: yn+1 = yₙ + (h/6)(k₁ + 2k₂ + 2k₃ + k₄). The global error of Euler is proportional to h, Heun's to h², RK4's to h⁴.

ntₙyₙk₁k₂yₙ₊₁00111.1097781.10548910.11.1054891.1103241.2409111.22305120.21.2230511.2421781.3932651.354823

Heun steps

y₁ = 1 + (0.1/2)(1 + 1.109778) = 1.105489
y₂ = 1.105489 + (0.1/2)(1.110324 + 1.240911) = 1.223051
y₃ = 1.223051 + (0.1/2)(1.242178 + 1.393265) = 1.354823
00.10.20.311.21.4ty

Graph

y3 = 1.355

Answer

y3 = 1.355
3.Sequences & series

Answer: B: Σ 1/k⁴

Convergence: if the terms do not tend to 0 the series diverges (n-th term test). Σ1/kᵖ converges only for p > 1, and Σrᵏ only for |r| < 1. Compare a series with one of these when its terms behave like them for large k. Ratio test: L = lim |ak+1/ak|; root test: L = lim |ak|1/k. L < 1 converges, L > 1 diverges, L = 1 decides nothing. A power series Σck(x − x₀)ᵏ converges for |x − x₀| < R with R = lim |ck/ck+1|; an alternating series with terms decreasing to 0 converges.

Test each series

A: Σ 1/(3k + 4) → Behaves like 1/(3k) for large k; compared with the harmonic series it diverges.
B: Σ 1/k⁴ → p-series with p = 4 > 1: converges.
C: Σ (4k + 1)/(k + 2) → The terms tend to 4, not 0: diverges by the n-th term test.
D: Σ ln k / k → Larger than 1/k for k ≥ 3: diverges by comparison with the harmonic series.

The answer

B: Σ 1/k⁴

Answer

B: Σ 1/k⁴
4.Sequences & series

Answer: |R₅| = 2.17 × 10⁻⁵

Taylor polynomials: near x = a a smooth function is approximated by Pₙ(x) = f(a) + f′(a)(x − a) + f″(a)(x − a)²/2! + … + f⁽ⁿ⁾(a)(x − a)ⁿ/n!; for a = 0 this is the Maclaurin polynomial. Standard series: eˣ = Σxᵏ/k!, sin x = x − x³/3! + x⁵/5! − …, cos x = 1 − x²/2! + x⁴/4! − …, ln(1 + x) = x − x²/2 + x³/3 − …, 1/(1 − x) = Σxᵏ. Lagrange error bound: |f(x) − Pₙ(x)| ≤ M·|x − a|ⁿ⁺¹/(n + 1)!, where M is the largest value of |f⁽ⁿ⁺¹⁾| between a and x.

Bound on the derivative

M = 1

Lagrange bound

|R₅| ≤ 1·0.5⁶/6! = 2.17 × 10⁻⁵

Answer

|R₅| = 2.17 × 10⁻⁵

The true error is smaller: |f(−0.5) − P₅(−0.5)| = 2.024 × 10⁻⁵.

5.Matrices & determinants

Answer: det A = 89

Matrices: the determinant of a 2×2 matrix is ad − bc. For 3×3, expand along a row: each entry times the determinant of the 2×2 matrix left after removing its row and column, with alternating signs + − +. Eigenvalues λ solve det(A − λI) = 0; for 2×2 that is λ² − (trace)·λ + det = 0.

2×2 minors of the first row

M₁₁ = −15, M₁₂ = 4, M₁₃ = 10

Cofactor expansion

det A = (−5)·(−15) − (−1)·4 + 1·10 = 89

Answer

det A = 89
6.Matrices & determinants

Answer: λ = 5

Matrices: the determinant of a 2×2 matrix is ad − bc. For 3×3, expand along a row: each entry times the determinant of the 2×2 matrix left after removing its row and column, with alternating signs + − +. Eigenvalues λ solve det(A − λI) = 0; for 2×2 that is λ² − (trace)·λ + det = 0.

Characteristic equation

λ² − (8)λ + (15) = 0

Solve

λ = (8 ± √(4))/2 → λ = 3, 5
λ = 5

Answer

λ = 5
7.Differential equations

Answer: y(2) = 0.01343

Second-order linear equations: for y″ + b·y′ + c·y = 0 try y = ert: this gives the characteristic equation r² + b·r + c = 0. Two real roots r₁ ≠ r₂ give y = A·er₁t + B·er₂t (overdamped); a double root r gives y = (A + Bt)·ert (critically damped); complex roots −α ± jω give y = e−αt(A cos ωt + B sin ωt) (underdamped, oscillating). The initial values y(0) and y′(0) fix A and B. Written as y″ + 2ζωny′ + ωn²y = 0, ωn is the natural frequency and ζ the damping ratio: ζ < 1 oscillates. With a constant input, y″ + by′ + cy = c·K, the solution is the steady value K plus the free response.

Characteristic roots

(r + 3)(r + 5) = 0 → r = −3, −5

Constants from the initial values

A + B = 1, −3A − 5B = 6
A = 5.5, B = −4.5

Evaluate

y(2) = 5.5·e−6 + (−4.5)·e−10 = 0.01343

Answer

y(2) = 0.01343
8.Differential equations

Answer: t = 10.22 min

First-order differential equations: dy/dt = k·y has the solution y = y₀·ekt (growth for k > 0, decay for k < 0); a half-life T gives k = ln 2/T. Newton's law of cooling, dT/dt = −k·(T − Tₐ), gives T(t) = Tₐ + (T₀ − Tₐ)·e−kt. A linear equation y′ + p(x)·y = q(x) is solved with the integrating factor μ = e∫p dx: (μy)′ = μq, so μy = ∫μq dx + C.

Result

m(t) = 80 + (−70)·e−t/20

Solve for t

e−t/20 = (80 − 38)/(80 − 10) = 0.6
t = 20·ln(1.667) = 10.22 min

Answer

t = 10.22 min

ExamProblems · examproblems.com/courses/numerical-methods