Engineering mathematics and dimensional analysis
Units, dimensions, vector quantities, scaling, error propagation and dimensional consistency in engineering models.
Two progressive pathways covering engineering, finance, actuarial science, economics, computing, data science, mathematical physics, control systems, decision science and environmental or biological modelling.
Undergraduate: develops mathematical foundations, standard analytical and computational techniques, model formulation, interpretation and applied problem solving.
Advanced postgraduate: develops deeper theory, proof-based reasoning, stochastic and optimisation methods, advanced computation, research literature skills and independent model evaluation.
These are broad international topic frameworks, not a claim that every university teaches every topic in this exact order. Institutions differ in prerequisites, course titles, depth, software and assessment. Match formal study to the current programme handbook and module descriptors.
20 core areas for bachelor's degree study and applied specialisation
Units, dimensions, vector quantities, scaling, error propagation and dimensional consistency in engineering models.
Differentiation and integration for rates, work, energy, optimisation, transient response and engineering design.
Vectors, matrices, eigenvalues, least squares, systems of equations and matrix methods in engineering and data analysis.
First- and second-order ODEs, coupled systems, initial/boundary conditions and introductory PDE models.
Root finding, interpolation, numerical differentiation/integration, ODE solvers, stability, error and computational simulation.
Descriptive and inferential statistics, design of experiments, regression, control charts, process capability and reliability.
Model formulation, resource allocation, networks, inventory, queuing, scheduling and decision models.
Feasible regions, simplex concepts, integer models, nonlinear constraints, sensitivity and optimisation software.
Simple and compound interest, discounting, annuities, amortisation, effective rates and time value of money.
Net present value, internal rate of return, bond and equity measures, portfolio returns and project cash flows.
Survival models, life tables, premiums, loss distributions, reserves, risk pooling and introductory ruin concepts.
Optimisation in economics, elasticity, comparative statics, regression, time series and causal inference foundations.
Asymptotic analysis, recurrence relations, algorithm correctness, complexity and mathematical foundations of computation.
Sets, relations, combinatorics, Boolean logic, trees, networks, graph traversal and shortest-path methods.
Divisibility, congruences, modular arithmetic, primes, Euclidean algorithm, RSA foundations and secure computation concepts.
Random variables, distributions, estimation, regression, classification, validation, uncertainty and statistical learning foundations.
Vector calculus, conservation laws, dimensional models, oscillations, waves, fields and mathematical formulation of physical systems.
Linear systems, state-space models, feedback, stability, transfer functions and introductory controller design.
Strategic-form games, Nash equilibrium, sequential decisions, utility, uncertainty, bargaining and multi-criteria decisions.
Compartment models, population growth, epidemiological dynamics, ecological interactions, parameter estimation and sensitivity.
20 advanced extensions for Master's, doctoral coursework and research preparation
Advanced dimensional analysis, perturbation methods, asymptotic expansions, tensor methods and model reduction for coupled engineering systems.
Vector and tensor calculus, integral theorems, calculus of variations, constrained functionals and optimal design.
Spectral theory for matrices, conditioning, sparse systems, Krylov methods, SVD, matrix perturbation and large-scale inverse problems.
Weak formulations, boundary-value problems, Green functions, nonlinear systems, bifurcation and analytical properties of PDE models.
Finite difference/element/volume methods, convergence and stability proofs, adaptive meshes, Monte Carlo simulation and uncertainty quantification.
Multivariate process control, sequential monitoring, robust design, Bayesian experiments, reliability growth and industrial data streams.
Markov decision processes, stochastic programming, queueing networks, robust decisions and dynamic optimisation.
Duality, KKT conditions, decomposition, branch-and-bound, cutting planes, nonconvex optimisation and convergence analysis.
Term-structure mathematics, duration/convexity, stochastic discounting, arbitrage-free pricing and interest-rate dynamics.
Mean-variance theory, factor models, CAPM foundations, option pricing, risk-neutral valuation and cash-flow optimisation.
Collective risk models, credibility, survival analysis, reserving, ruin probabilities, reinsurance and solvency capital.
Identification, simultaneous equations, panel data, time-series processes, causal inference and equilibrium modelling.
Randomised algorithms, complexity classes, approximation, optimisation algorithms, formal verification and computational number theory.
Extremal and algebraic graph theory, network flows, matching, matroids, spectral graphs and approximation algorithms.
Finite fields, elliptic curves, lattices, complexity assumptions, public-key constructions and cryptographic proof techniques.
Generalisation bounds, regularisation, Bayesian learning, high-dimensional statistics, causal machine learning and model uncertainty.
Operator methods, spectral problems, nonlinear waves, inverse problems, PDE-constrained inference and parameter identifiability.
Lyapunov stability, nonlinear feedback, controllability, observability, optimal control and robust/adaptive control.
Bayesian and evolutionary games, repeated games, auctions, mechanism design, information asymmetry and equilibrium refinements.
Reaction-diffusion systems, spatial ecology, infectious-disease dynamics, optimal harvesting, climate-risk models and parameter inference.
These are original, calculation-led university practice problems. Show equations, units, assumptions and interpretation. Unless a question states otherwise, give exact values before rounding and justify every modelling choice.
Select “Show answer” to reveal the solution; select again to hide it.
b=−1/2, a=1/2; T=k√(L/g), k dimensionless. Dimensional analysis cannot determine k (2π for the small-angle pendulum).
h=6/w²; for an open-top tank S=2w²+6wh=2w²+36/w. S′=0 gives w³=9, so w=∛9 m, length 2w, height 6/w²; S″=4+72/w³>0.
AᵀA=[[3,3],[3,5]], Aᵀb=[5,7]ᵀ; least-squares solution (a,b)=(2/3,1). Residual (1/3,1/3,−2/3)ᵀ and Aᵀr=0.
Eigenvalues −2,−3; x₂=C₂e⁻³ᵗ, x₁=C₁e⁻²ᵗ−C₂e⁻³ᵗ. Origin is an asymptotically stable node.
y_c=e⁻²ᵗ(C cos3t+D sin3t). Particular y_p=Acos2t+Bsin2t with A=90/145, B=80/145. Use y(0)=0 and y′(0)=0: C=−A, D=(2C−2B)/3.
Newton iterates: x₁=2.1, x₂≈2.094568121, x₃≈2.094551482; root ≈2.09455148.
x̄=2.5, ȳ=3.5, Sxx=5, Sxy=4; slope 0.8, intercept 1.5, R²=0.64. Association is not proof of causation.
Vertices (0,0),(4,0),(0,4),(8/3,8/3); P values 0,20,16,24. Maximum 24 at (8/3,8/3); both constraints bind.
i=.01,n=36; M=4800/[1−1.01⁻³⁶]≈KSh 15,929. Total interest ≈KSh 93,444 (rounding may vary).
Expected return 10%; variance .0124 and standard deviation √.0124≈11.14%. Covariance term is 2w₁w₂ρσ₁σ₂.
Count Σi=n(n+1)/2, hence Θ(n²); n log₂n is asymptotically smaller.
Shortest path A→C→B→D→E; distance 2+1+5+2=10. Settled order A,C,B,D,E.
7⁻¹≡15 mod26; x≡15·5≡23 mod26; 7·23≡5 mod26.
P(t)=1000/[1+9e⁻⁰·⁴ᵗ]; P=500 at t=ln9/.4≈5.493. Carrying capacity 1000.
Eigenvalues −1,−4; stable. (x+y)′=−x−y, so tracer total decays as e⁻ᵗ and is not conserved.
These problems require proof, derivation, computational design or critical model evaluation at Master's/doctoral level. State regularity and feasibility assumptions explicitly; numerical evidence alone is not a proof.
Select “Show answer” to reveal the solution; select again to hide it.
Outer solution begins y₀=e⁻ᵗ, y₁′+y₁=−e⁻ᵗ. Fast layer τ=t/ε has decaying e⁻ᵗ/ε mode to satisfy y′(0)=0; match inner/outer expansions for a uniform composite approximation.
det A=δ; as δ→0, σmin≈δ/2, σmax≈2, κ₂≈4/δ. Data perturbations are amplified and parameter uncertainty grows.
Fourier amplification G=1−4r sin²(kΔx/2); |G|≤1 for all modes gives 0≤r≤1/2. Consistency without stability does not ensure convergence.
KKT: 2x+λ−μ=0, 4y+λ−ν=0, x+y=3, μx=νy=0. Solution x=2,y=1, objective 6; strict convexity gives unique minimum.
Binary choice: A cost 40+5(10)=90; B cost 30+8(10)=110. Open A; capacity 12 covers demand 10.
Bellman: V(s)=minₐ[c(s,a)+βΣP(s′|s,a)V(s′)]. β<1 gives contraction in sup norm; policy iteration evaluates then improves until unchanged.
Call payoffs 15,0; q=(1.05−.9)/(1.2−.9)=.5; price=(.5·15)/1.05≈7.1429. No-arbitrage .9<1.05<1.2.
Surplus U(t)=u+ct−ΣXᵢ; net profit c>λE[X]. For exponential claims density βe⁻ᵝˣ, cψ′=λ[ψ−∫₀ᵘψ(u−x)βe⁻ᵝˣdx−e⁻ᵝᵘ].
Posterior precision τₙ⁻²=τ₀⁻²+nσ⁻²; mean τₙ²(μ₀/τ₀²+Σyᵢ/σ²). Variance decreases with n; choose observations by expected information gain or posterior variance reduction.
AR(1) stationary iff |φ|<1; variance σ²/(1−φ²), ACF φᵏ. For |φ|≥1 stationary AR inference is invalid.
Eigenvalues of A have real part −2.5, so Hurwitz. Solving Lyapunov gives P=[[.35,.05],[.05,.15]], positive definite; V=xᵀPx proves asymptotic stability.
Low is strictly dominant for each firm; unique Nash equilibrium (Low,Low), payoffs (4,4).
Linear growth rate σ(k)=f′(u*)−Dk². Positive diffusion suppresses high-frequency modes; scalar diffusion stabilises rather than destabilises a stable uniform state.
For a≠0,k>0, b=lim y(t), a=y(0)−b, k=−d/dt ln(y−b); degenerate a=0 makes k unidentifiable, k=0 identifies only a+b. Sample early and late times.
Delta method Var(Q)≈∇g(μ)ᵀΣ∇g(μ). Use Monte Carlo for nonlinear/non-Gaussian/tail cases; monitor batch standard errors and stability as sample size increases.
Use these official organisations for curriculum guidance, examinations and further learning information.