1. Overview
Mathematical formulation refers to the rigorous process of translating physical, biological, economic, or social phenomena into precise mathematical language. It serves as the foundational step in theoretical modeling, enabling quantitative analysis, prediction, and simulation across scientific disciplines.
Unlike empirical description, a mathematical formulation establishes a closed system of symbols, operators, and relationships that can be manipulated using formal logic. This process typically involves identifying state variables, defining governing laws, and specifying boundary or initial conditions.
1.1 Standard Notation
Consistent notation is critical for reproducibility. Below are conventional symbols used in continuum mechanics and dynamical systems:
- \( \mathbf{x}(t) \in \mathbb{R}^n \): State vector at time \( t \)
- \( \dot{\mathbf{x}} = \frac{d\mathbf{x}}{dt} \): Time derivative
- \( \nabla \cdot \mathbf{F} \): Divergence of a vector field
- \( \mathcal{L}\{f(t)\} = F(s) \): Laplace transform
2. Core Mathematical Framework
A complete mathematical formulation consists of three components: variables, operators, and constraints. The general structure can be expressed as:
Where \( \mathcal{D} \) represents linear differential operators, \( \mathcal{N} \) captures nonlinear terms, \( \mathbf{f} \) is a source function, and \( \mathcal{B} \) enforces boundary conditions on the domain boundary \( \partial\Omega \).
2.1 Differential Equations
Most physical systems are governed by partial differential equations (PDEs). The canonical heat equation illustrates parabolic behavior:
Hyperbolic formulations, such as the wave equation \( u_{tt} - c^2 \nabla^2 u = 0 \), describe propagation phenomena, while elliptic forms like Laplace's equation \( \nabla^2 \phi = 0 \) model equilibrium states.
2.2 Algebraic Structures
Discrete and network-based systems often rely on matrix formulations. A linear system can be compactly written as:
Solution existence depends on rank conditions \( \text{rank}(\mathbf{A}) = \text{rank}([\mathbf{A}|\mathbf{b}]) \). Nonlinear algebraic systems require iterative solvers such as Newton-Raphson:
3. Computational Implementation
Modern formulations are discretized for numerical solution. The finite element method (FEM) approximates the weak form:
Discretization yields a sparse linear system solved via direct factorization (LU, Cholesky) or iterative methods (Conjugate Gradient, GMRES). Stability is governed by the Courant–Friedrichs–Lewy (CFL) condition for explicit time-stepping.
4. Applications
Mathematical formulation underpins:
- Physics & Engineering: Navier-Stokes equations, Maxwell's equations, structural dynamics
- Biological Systems: Reaction-diffusion models, epidemiological compartment models (SIR, SEIR)
- Economics & Finance: Stochastic differential equations, Black-Scholes PDE, agent-based formulations
- Machine Learning: Optimization landscapes, gradient flow equations, kernel methods
5. References
- Evans, L. C. (2010). Partial Differential Equations (2nd ed.). American Mathematical Society.
- Stakgold, I. (2011). Greenwich Mathematics: Boundary Value Problems of Mathematical Physics. Dover Publications.
- Trefethen, L. N. (2000). Spectral Methods in MATLAB. SIAM.
- Press, W. H., et al. (2007). Numerical Recipes: The Art of Scientific Computing (3rd ed.). Cambridge University Press.