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 eˣ dx with the trapezoid rule, n = 2, and compare it with the exact value. Find the absolute error |E| = |T − I|.

f(x) = eˣ[a, b] = [0, 2]n = 2
|E| =
2.Numerical methodsHard
00.10.20.30.4−1−0.8−0.6ty(0, −1)

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

y′ = t − yy(0) = −1h = 0.2
y2 =
3.Sequences & seriesMedium
xx₀ = 3??R

The power series Σk=1∞ (2k)!·(x − 3)ᵏ/(k!)² converges on an interval around x₀ = 3. Find the left end x of that interval.

Σ (2k)!·(x − 3)ᵏ/(k!)²x₀ = 3
x =
4.Sequences & seriesHard

f(x) = cos x 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) = cos xn = 5x = −0.5M = 1
|R₅| =
5.Matrices & determinantsMedium
A =4140−3045−4

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

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

Solve the system −x − 2y = −1 and −6x − 5y = 12. Find x.

−x − 2y = −1−6x − 5y = 12
x =
7.Differential equationsMedium
tyy(0) = 2y(1.5) = ?

Solve y″ + 2y′ + y = 0 with y(0) = 2 and y′(0) = -2. Find y(1.5).

y″ + 2y′ + y = 0y(0) = 2y′(0) = -2
y(1.5) =
8.Differential equationsHard
tyy(0) = 1y(0.25) = ?

Solve y″ + 4y′ + 13y = 0 with y(0) = 1 and y′(0) = 0 (released from rest). Find y(0.25); angles in radians.

y″ + 4y′ + 13y = 0y(0) = 1y′(0) = 0
y(0.25) =

3Solutions

1.Numerical methods

Answer: |E| = 0.5238

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 = (1/2)·(1 + 2·2.718282 + 7.389056) = 6.91281

Error

|E| = |6.91281 − 6.389056| = 0.5238

Answer

|E| = 0.5238

Relative error: 8.198%.

2.Numerical methods

Answer: y2 = −0.6

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ₙ₊₁00−111−0.810.2−0.811−0.6

Heun steps

y₁ = −1 + (0.2/2)(1 + 1) = −0.8
y₂ = −0.8 + (0.2/2)(1 + 1) = −0.6
00.10.20.30.4−1−0.8−0.6ty

Graph

y2 = −0.6

Answer

y2 = −0.6

The exact value is y(0.4) = −0.6.

3.Sequences & series

Answer: x = 2.75

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.

Coefficients

ck+1/ck = (2k + 2)(2k + 1)/(k + 1)² → 4, so R = 1/4

Radius

R = 0.25

Interval

2.75 < x < 3.25
x = 2.75

Answer

x = 2.75

The ratio test says nothing at the two end points; they have to be checked separately.

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.16 × 10⁻⁵.

5.Matrices & determinants

Answer: det A = 96

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

Cofactor expansion

det A = 4·12 − 1·0 + 4·12 = 96

Answer

det A = 96
6.Matrices & determinants

Answer: x = −4.143

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 = (−1)·(−5) − (−2)·(−6) = −7

Replace the x column

det Aₓ = (−1)·(−5) − (−2)·12 = 29
x = 29/(−7) = −4.143

Answer

x = −4.143
y = 2.571
7.Differential equations

Answer: y(1.5) = 0.4463

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.

Double root

(r + 1)² = 0 → r = −1

Constants

A = y(0) = 2
y′(0) = B − 1A → B = -2 + 2 = 0

Evaluate

y(1.5) = (2 + 0·1.5)·e−1.5 = 0.4463

Answer

y(1.5) = 0.4463
8.Differential equations

Answer: y(0.25) = 0.7194

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.

Complex roots

r = −2 ± 3j

Constants

A = 1, B = 2·1/3 = 0.6667

Evaluate

y(0.25) = e−0.5(1·cos 0.75 + 0.6667·sin 0.75) = 0.7194

Answer

y(0.25) = 0.7194

ExamProblems · examproblems.com/courses/numerical-methods