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

Approximate ∫02 eˣ dx with the trapezoid rule, n = 4, and compare it with the exact value. Find the absolute error |E| = |T − I|.

f(x) = eˣ[a, b] = [0, 2]n = 4
|E| =
2.Numerical methodsHard
00.20.40.60.40.5ty(0, 0.5)

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

y′ = t − yy(0) = 0.5h = 0.2
y3 =
3.Sequences & seriesMedium
k|aₖ₊₁/aₖ|123456789101112

Apply the ratio test to Σk=1∞ k²·2ᵏ/5ᵏ. Find L = lim |ak+1/ak|.

ak = k²·2ᵏ/5ᵏ
L =
4.Sequences & seriesHard

Find the coefficient c₂ of (x − 16)² in the Taylor series of f(x) = √x about a = 16.

f(x) = √xa = 16k = 2
c₂ =
5.Matrices & determinantsMedium
A =−5−1−2−4−20−4−5−3

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

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

Find the larger eigenvalue λ of the matrix A shown.

A = [0 1; 1 0]
λ =
7.Differential equationsMedium
tyy(0) = 4y(1) = ?

Solve y″ + 7y′ + 10y = 0 with y(0) = 4 and y′(0) = 1. Find y(1).

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

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

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

3Solutions

1.Numerical methods

Answer: |E| = 0.1326

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 = 6.389056

Trapezoid rule

T = (0.5/2)·(1 + 2·1.648721 + 2·2.718282 + 2·4.481689 + 7.389056) = 6.52161

Error

|E| = |6.52161 − 6.389056| = 0.1326

Answer

|E| = 0.1326

Relative error: 2.075%.

2.Numerical methods

Answer: y3 = 0.368

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ₙ₊₁000.5−0.50.410.20.4−0.20.3620.40.360.040.368

Euler steps

y₁ = 0.5 + 0.2·(−0.5) = 0.4
y₂ = 0.4 + 0.2·(−0.2) = 0.36
y₃ = 0.36 + 0.2·(0.04) = 0.368
00.20.40.60.40.5ty

Graph

y3 = 0.368

Answer

y3 = 0.368

The exact value is y(0.6) = 0.423217.

3.Sequences & series

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

Ratio of consecutive terms

|ak+1/ak| = ((k + 1)/k)²·2/5 → 2/5

Conclusion

L = 0.4 < 1

Answer

L = 0.4

L < 1, so the series converges.

4.Sequences & series

Answer: c₂ = −0.001953

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) = −0.25·x1/2 − 2

Coefficient

c₂ = −0.25·161/2 − 2/2! = −0.001953
c₂ = −0.001953

Answer

c₂ = −0.001953
5.Matrices & determinants

Answer: det A = −42

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₁₁ = 6, M₁₂ = 12, M₁₃ = 12

Cofactor expansion

det A = (−5)·6 − (−1)·12 + (−2)·12 = −42

Answer

det A = −42
6.Matrices & determinants

Answer: λ = 1

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

λ² − (0)λ + (−1) = 0

Solve

λ = (0 ± √(4))/2 → λ = −1, 1
λ = 1

Answer

λ = 1
7.Differential equations

Answer: y(1) = 0.9271

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

Constants from the initial values

A + B = 4, −2A − 5B = 1
A = 7, B = −3

Evaluate

y(1) = 7·e−2 + (−3)·e−5 = 0.9271

Answer

y(1) = 0.9271
8.Differential equations

Answer: y(3) = 8.333

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∫1/x dx = x1

Integrate

(x1y)′ = x3 → x1y = 1x4/4 + C

Initial condition

5 = 1/4 + C → C = 4.75

Evaluate

y(3) = (1·34/4 + 4.75)/31 = 8.333

Answer

y(3) = 8.333

ExamProblems · examproblems.com/courses/numerical-methods