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.30.60.91.21.5

Approximate ∫01.5 1/√(1 + x⁴) dx with the trapezoid rule using n = 5 strips. Give T.

f(x) = 1/√(1 + x⁴)[a, b] = [0, 1.5]n = 5
T =
2.Numerical methodsHard
00.511.501020ty(0, 1)

Solve y′ = 2y, y(0) = 1 with Euler's method and step h = 0.5 up to t = 1.5. The exact solution is y = y₀e2t. Find the global error |E| = |y(1.5) − y3|.

y′ = 2yy(0) = 1h = 0.5
|E| =
3.Sequences & seriesMedium
AΣ 2ᵏ/k!k = 1 … ∞BΣ 1/(3ᵏ + k)k = 1 … ∞CΣ 5/kk = 1 … ∞DΣ 1/k³k = 1 … ∞

Exactly one of the four series diverges. Click it.

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

Find the coefficient c₂ of (x − 4)² in the Taylor series of f(x) = 1/x about a = 4.

f(x) = 1/xa = 4k = 2
c₂ =
5.Matrices & determinantsMedium
A =02−41B =−13−1−3

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

A = [0 2; −4 1]B = [−1 3; −1 −3]
c11 =
6.Matrices & determinantsHard
A =−5−1−35b =−7−6

Solve the system −5x − y = −7 and −3x + 5y = −6. Find x.

−5x − y = −7−3x + 5y = −6
x =
7.Differential equationsMedium
tyy(0) = 4y(2) = ?

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

y″ + 6y′ + 5y = 0y(0) = 4y′(0) = 1
y(2) =
8.Differential equationsHard
xy13(1, 1)y(3) = ?

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

y′ + 2y/x = 2y(1) = 1
y(3) =

3Solutions

1.Numerical methods

Answer: T = 1.196

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.30.995974220.60.940887230.90.777064241.20.570396251.50.4061381

Nodes and values

h = 0.3
Σ wᵢfᵢ = 1 + 2·0.995974 + 2·0.940887 + 2·0.777064 + 2·0.570396 + 0.406138 = 7.974782

Trapezoid rule

T = (0.3/2)·7.974782 = 1.196

Answer

T = 1.196

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

2.Numerical methods

Answer: |E| = 12.09

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ₙ₊₁0012210.524421488

Euler steps

y3 = 8

Exact value

y(1.5) = 20.085537

Global error

|E| = |20.085537 − 8| = 12.09
00.511.501020ty

Graph

Answer

|E| = 12.09

Halving h roughly halves the error of Euler's method.

3.Sequences & series

Answer: C: Σ 5/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: Σ 2ᵏ/k! → Ratio test: L = lim 2/(k + 1) = 0 < 1, converges.
B: Σ 1/(3ᵏ + k) → Smaller than (1/3)ᵏ, a convergent geometric series: converges by comparison.
C: Σ 5/k → A multiple of the harmonic series (p = 1): diverges.
D: Σ 1/k³ → p-series with p = 3 > 1: converges.

The answer

C: Σ 5/k

Answer

C: Σ 5/k
4.Sequences & series

Answer: c₂ = 0.01563

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.

Derivative f⁽²⁾

f⁽²⁾(x) = 2/x³

Coefficient

c₂ = 2/(4³·2) = 0.01563
c₂ = 0.01563

Answer

c₂ = 0.01563
5.Matrices & determinants

Answer: c11 = −2

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

c11 = 0·(−1) + 2·(−1) = −2

Answer

c11 = −2
6.Matrices & determinants

Answer: x = 1.464

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 = (−5)·5 − (−1)·(−3) = −28

Replace the x column

det Aₓ = (−7)·5 − (−1)·(−6) = −41
x = −41/(−28) = 1.464

Answer

x = 1.464
y = −0.3214
7.Differential equations

Answer: y(2) = 0.7105

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 + 1)(r + 5) = 0 → r = −1, −5

Constants from the initial values

A + B = 4, −1A − 5B = 1
A = 5.25, B = −1.25

Evaluate

y(2) = 5.25·e−2 + (−1.25)·e−10 = 0.7105

Answer

y(2) = 0.7105
8.Differential equations

Answer: y(3) = 2.037

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∫2/x dx = x2

Integrate

(x2y)′ = 2x2 → x2y = 2x3/3 + C

Initial condition

1 = 2/3 + C → C = 0.3333

Evaluate

y(3) = (2·33/3 + 0.3333)/32 = 2.037

Answer

y(3) = 2.037

ExamProblems · examproblems.com/courses/numerical-methods