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
xy00.33330.666711.3331.6672

Approximate ∫02 e−x² dx with Simpson's rule using n = 6 strips. Give S.

f(x) = e−x²[a, b] = [0, 2]n = 6
S =
2.Numerical methodsHard
00.511.52−101ty(0, −1)

Use Euler's method with h = 0.5 for y′ = t − y, y(0) = −1 to estimate y4 ≈ y(2).

y′ = t − yy(0) = −1h = 0.5
y4 =
3.Sequences & seriesMedium
AΣ (−1)ᵏ/kk = 1 … ∞BΣ k/(k + 9)k = 1 … ∞CΣ 1/(3k + 4)k = 1 … ∞DΣ (7/4)ᵏk = 1 … ∞

Exactly one of the four series converges. Click it.

A: Σ (−1)ᵏ/kB: Σ k/(k + 9)C: Σ 1/(3k + 4)D: Σ (7/4)ᵏ
  1. 1A: Σ (−1)ᵏ/k
  2. 2B: Σ k/(k + 9)
  3. 3C: Σ 1/(3k + 4)
  4. 4D: Σ (7/4)ᵏ
4.Sequences & seriesHard

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

f(x) = eˣx = 2M = 8ε = 0.001
n =
5.Matrices & determinantsMedium
A =−34−2−5B =2−2−43

Let C = AB for the matrices shown. Find the entry c21 (row 2, column 1).

A = [−3 4; −2 −5]B = [2 −2; −4 3]
c21 =
6.Matrices & determinantsHard
A =3545b =−9−5

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

3x + 5y = −94x + 5y = −5
x =
7.Differential equationsMedium
t (min)T (°C)22Ta​T = ?

A cup of coffee at 85 °C is left in a room at 18 °C. It follows Newton's law of cooling, dT/dt = −k·(T − Tₐ). With k = 0.12 min⁻¹, find its temperature T after 22 min.

T0 = 85 °CTa = 18 °Ck = 0.12 min⁻¹t = 22 min
T = °C
8.Differential equationsHard
xy13(1, 4)y(3) = ?

Solve the initial value problem y′ + 3y/x = 5 for x > 0, with y(1) = 4. Find y(3).

y′ + 3y/x = 5y(1) = 4
y(3) =

3Solutions

1.Numerical methods

Answer: S = 0.882

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ᵢ)weight001110.3333330.894839420.6666670.641182310.367879441.3333330.169013251.6666670.06217654620.01831561

Nodes and values

h = 0.3333
Σ wᵢfᵢ = 1 + 4·0.894839 + 2·0.64118 + 4·0.367879 + 2·0.169013 + 4·0.0621765 + 0.0183156 = 7.938284

Simpson's rule

S = (0.3333/3)·7.938284 = 0.882

Answer

S = 0.882

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

2.Numerical methods

Answer: y4 = 1

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ₙf(tₙ, yₙ)yₙ₊₁00−11−0.510.5−0.51021010.531.50.511

Euler steps

y₁ = −1 + 0.5·(1) = −0.5
y₂ = −0.5 + 0.5·(1) = 0
y₃ = 0 + 0.5·(1) = 0.5
y₄ = 0.5 + 0.5·(1) = 1
00.511.52−101ty

Graph

y4 = 1

Answer

y4 = 1

The exact value is y(2) = 1.

3.Sequences & series

Answer: A: Σ (−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)ᵏ/k → Alternating, with 1/k decreasing to 0: converges (conditionally).
B: Σ k/(k + 9) → The terms tend to 1, not 0: diverges by the n-th term test.
C: Σ 1/(3k + 4) → Behaves like 1/(3k) for large k; compared with the harmonic series it diverges.
D: Σ (7/4)ᵏ → Geometric with r = 7/4 > 1: the terms grow, so it diverges.

The answer

A: Σ (−1)ᵏ/k

Answer

A: Σ (−1)ᵏ/k
4.Sequences & series

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

n(n + 1)!bound011612162610.673245.33341202.13357200.7111650400.20327403200.0507983628800.01129936288000.00225710399168000.0004105

Bounds for increasing n

n = 9: 0.002257 ≥ 0.001
n = 10: 0.0004105 < 0.001

Smallest degree

n = 10

Answer

n = 10
5.Matrices & determinants

Answer: c21 = 16

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.

Row times column

c21 = (−2)·2 + (−5)·(−4) = 16

Answer

c21 = 16
6.Matrices & determinants

Answer: x = 4

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 = 3·5 − 5·4 = −5

Replace the x column

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

Answer

x = 4
y = −4.2
7.Differential equations

Answer: T = 22.78 °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) = 18 + 67·e−0.12t

Substitute t

T(22) = 18 + 67·0.07136 = 22.78 °C

Answer

T = 22.78 °C
8.Differential equations

Answer: y(3) = 3.852

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

μ = e∫3/x dx = x3

Integrate

(x3y)′ = 5x3 → x3y = 5x4/4 + C

Initial condition

4 = 5/4 + C → C = 2.75

Evaluate

y(3) = (5·34/4 + 2.75)/33 = 3.852

Answer

y(3) = 3.852

ExamProblems · examproblems.com/courses/numerical-methods