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
xy11.752.53.254

Approximate ∫14 1/x dx with the trapezoid rule, n = 4, and compare it with the exact value. Find the absolute error |E| = |T − I|.

f(x) = 1/x[a, b] = [1, 4]n = 4
|E| =
2.Numerical methodsHard
00.20.40.60.960.981ty(0, 1)

Use Heun's method (improved Euler) with h = 0.2 for y′ = cos t − y, y(0) = 1 to estimate y3 ≈ y(0.6).

y′ = cos t − yy(0) = 1h = 0.2
y3 =
3.Sequences & seriesMedium
AΣ 3ᵏ/k!k = 1 … ∞BΣ 1/(k² + 8)k = 1 … ∞CΣ (7/4)ᵏk = 1 … ∞DΣ (4/5)ᵏk = 1 … ∞

Exactly one of the four series diverges. Click it.

A: Σ 3ᵏ/k!B: Σ 1/(k² + 8)C: Σ (7/4)ᵏD: Σ (4/5)ᵏ
  1. 1A: Σ 3ᵏ/k!
  2. 2B: Σ 1/(k² + 8)
  3. 3C: Σ (7/4)ᵏ
  4. 4D: Σ (4/5)ᵏ
4.Sequences & seriesHard

f(x) = cos x is approximated at x = 1.5 by its Maclaurin polynomial of degree n. With the Lagrange bound M·|x|ⁿ⁺¹/(n + 1)! and M = 1, find the smallest degree n that guarantees an error below 0.0001.

f(x) = cos xx = 1.5M = 1ε = 0.0001
n =
5.Matrices & determinantsMedium
A =0−353−54−1−2−1

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

A = [0 −3 5; 3 −5 4; −1 −2 −1]
det A =
6.Matrices & determinantsHard
A =−4−454b =10−5

Solve the system −4x − 4y = 10 and 5x + 4y = −5. Find x.

−4x − 4y = 105x + 4y = −5
x =
7.Differential equationsMedium
t (min)T (°C)12Ta​T = ?

A can of soda at 3 °C is taken out of the fridge into a room at 26 °C. It follows Newton's law of cooling, dT/dt = −k·(T − Tₐ). With k = 0.04 min⁻¹, find its temperature T after 12 min.

T0 = 3 °CTa = 26 °Ck = 0.04 min⁻¹t = 12 min
T = °C
8.Differential equationsHard
ty2y(2) = ?

Solve y′ + 3y = 7e−0.5t with y(0) = 2. Find y(2).

y′ + 3y = 7e−0.5ty(0) = 2
y(2) =

3Solutions

1.Numerical methods

Answer: |E| = 0.0418

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.

Exact value

I = 1.386294

Trapezoid rule

T = (0.75/2)·(1 + 2·0.571429 + 2·0.4 + 2·0.307692 + 0.25) = 1.428091

Error

|E| = |1.428091 − 1.386294| = 0.0418

Answer

|E| = 0.0418

Relative error: 3.015%.

2.Numerical methods

Answer: y3 = 0.9671

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ₙ₊₁0010−0.01993340.99800710.20.998007−0.0179401−0.07335760.98887720.40.988877−0.0678159−0.1499780.967097

Heun steps

y₁ = 1 + (0.2/2)(0 − 0.0199334) = 0.998007
y₂ = 0.998007 + (0.2/2)(−0.0179401 − 0.0733576) = 0.988877
y₃ = 0.988877 + (0.2/2)(−0.0678159 − 0.149978) = 0.967097
00.20.40.60.960.981ty

Graph

y3 = 0.9671

Answer

y3 = 0.9671
3.Sequences & series

Answer: C: Σ (7/4)ᵏ

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: Σ 3ᵏ/k! → Ratio test: L = lim 3/(k + 1) = 0 < 1, converges.
B: Σ 1/(k² + 8) → Smaller than 1/k², a convergent p-series: converges by comparison.
C: Σ (7/4)ᵏ → Geometric with r = 7/4 > 1: the terms grow, so it diverges.
D: Σ (4/5)ᵏ → Geometric with r = 4/5, |r| < 1: converges.

The answer

C: Σ (7/4)ᵏ

Answer

C: Σ (7/4)ᵏ
4.Sequences & series

Answer: n = 9

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.

n(n + 1)!bound011.5121.125260.56253240.210941200.0632857200.01582650400.003397403200.000635683628800.0001059936288001.589 × 10⁻⁵

Bounds for increasing n

n = 8: 0.0001059 ≥ 0.0001
n = 9: 1.589 × 10⁻⁵ < 0.0001

Smallest degree

n = 9

Answer

n = 9
5.Matrices & determinants

Answer: det A = −52

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₁₁ = 13, M₁₂ = 1, M₁₃ = −11

Cofactor expansion

det A = 0·13 − (−3)·1 + 5·(−11) = −52

Answer

det A = −52
6.Matrices & determinants

Answer: x = 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.

Determinant of the coefficient matrix

det A = (−4)·4 − (−4)·5 = 4

Replace the x column

det Aₓ = 10·4 − (−4)·(−5) = 20
x = 20/4 = 5

Answer

x = 5
y = −7.5
7.Differential equations

Answer: T = 11.77 °C

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.

Solution of the cooling law

T(t) = 26 + (−23)·e−0.04t

Substitute t

T(12) = 26 + (−23)·0.6188 = 11.77 °C

Answer

T = 11.77 °C
8.Differential equations

Answer: y(2) = 1.028

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.

Integrating factor

μ = e3t
(e3ty)′ = 7e2.5t

General solution

y = 7/2.5·e−0.5t + C·e−3t = 2.8·e−0.5t + C·e−3t

Initial condition

2 = 2.8 + C → C = −0.8

Evaluate

y(2) = 2.8·0.3679 + (−0.8)·0.002479 = 1.028

Answer

y(2) = 1.028

ExamProblems · examproblems.com/courses/numerical-methods