Module 1: The Language of Change (Foundations)
Structure & Classification
Definitions
- Ordinary Differential Equations (ODE) vs Partial Differential Equations
- Order of an ODE (F(x,y,y′,…,y(n))=0)
The “Grammar” of ODEs
- Explicit vs Implicit: y(n)=G(...) vs F(...)=0
- Linearity: Linear vs Nonlinear
- Time Dependence: Autonomous (y′=f(y)) vs Non-autonomous (y′=f(t,y))
- Homogeneity: Homogeneous (g(x)=0) vs Inhomogeneous (g(x)=0)
The Geometric View
Slope Fields (Direction Fields)
- Visualizing y′=F(x,y) as a vector field
- Isoclines (lines of constant slope)
- Key Insight: Autonomous equations have slope fields invariant under x-translation
Existence & Uniqueness
Initial Value Problems (IVP)
- Formulation: ODE + Initial Condition y(x0)=y0
Picard-Lindelöf Theorem
- Requirements: Continuity + Lipschitz condition
- Consequence: Solution trajectories cannot cross in the phase space
- Dependence on initial conditions (Gronwall’s inequality concept)
Module 2: First-Order Dynamics (1D Systems)
Separable Equations
- Form: y′=g(x)h(y)
- Method: ∫h(y)1dy=∫g(x)dx
- Application: Logistic Growth N˙=kN(A−N)
Linear Equations (First Order)
- Form: y′+f(x)y=g(x)
- Method 1: Variation of Constants
- Method 2: Integrating Factor μ(x)=e∫f(x)dx
Exact Equations
- Form: M(x,y)+N(x,y)y′=0
- Condition: ∂y∂M=∂x∂N (Potential function ψ)
- Technique: Integrating factors for non-exact equations
Special Substitutions
- Bernoulli Equations: y′+g(x)y+h(x)yα=0
- Riccati Equations: y′+g(x)y+h(x)y2=k(x)
- Homogeneous type: y′=F(y/x) using u=y/x
Discrete Time Systems (1D)
Difference Equations
- Form: xn+1=f(xn)
- Cobweb Diagrams: Graphical analysis of iteration
- Application: Discrete Logistic Map xn+1=rxn(1−xn)
Module 3: Linear Theory & Oscillations (2nd Order)
Structure of Linear Solutions
Superposition Principle
- General Solution = Homogeneous Solution (yh) + Particular Solution (yp)
- Vector space structure of yh (Dimension = Order n)
Homogeneous Linear Equations (Constant Coefficients)
The Characteristic Polynomial
- P(λ)=λn+an−1λn−1+⋯+a0=0
Solution Cases
- Real Distinct Roots: y=C1eλ1t+C2eλ2t
- Repeated Roots: y=C1eλt+C2teλt
- Complex Roots: y=eαt(C1cos(βt)+C2sin(βt)) where λ=α±iβ
Inhomogeneous Linear Equations (Forced Systems)
Method of Undetermined Coefficients (Ansatz)
- Polynomials → Polynomials
- Exponentials → Exponentials (watch for Resonance!)
- Sin/Cos → Asin(ωt)+Bcos(ωt)
Variation of Constants
- General formula using the Wronskian logic
- Transfer function Y(s)=G(s)U(s)
Oscillation Problems (Physics)
Free Oscillations (Homogeneous)
- Undamped: Harmonic motion (ω0=k/m)
- Damped: Overdamped vs Underdamped vs Critically Damped
Forced Oscillations (Inhomogeneous)
- Amplitude response & Resonance catastrophe
- Beat effects (near-resonance)
Module 4: Systems & Phase Plane Geometry (2D)
Fundamentals of Systems
- Reducing high-order ODEs to 1st-order systems: y1=y,y2=y′
Vector Fields
- Phase Portraits for Autonomous systems x˙=f(x)
Linear Systems Analysis
Eigenvalues and Stability
- Real Eigenvalues: Nodes (Stable/Unstable) and Saddle Points
- Complex Eigenvalues: Spirals (Stable/Unstable) and Centers
- Repeated Eigenvalues: Degenerate Nodes / Stars
Analytical Solution
- Matrix Exponential: x(t)=eAtx0
- Decoupling via diagonalization
Module 5: Nonlinear Dynamics & Chaos
Linearization (Local Stability)
The Jacobian Matrix
- J=(∂f1/∂x1∂f2/∂x1∂f1/∂x2∂f2/∂x2) evaluated at fixed point x∗
Hartman-Grobman Theorem
- Linearization predicts behavior for Hyperbolic fixed points (Re(λ) =0)
- Trace-Determinant Plane classification
Global Behavior (2D)
Conservative Systems
- Energy functions E(x,y) = const
- Fixed points are centers or saddles (never nodes/spirals)
Limit Cycles
- Isolated closed orbits (Van der Pol Oscillator)
- Poincaré-Bendixson Theorem: Trapping regions imply closed orbits
Bifurcations
1D Bifurcations
- Saddle-Node (Creation/Destruction of fixed points)
- Transcritical (Stability exchange)
- Pitchfork (Symmetry breaking: Supercritical vs Subcritical)
2D Bifurcations
- Hopf Bifurcation: Birth of a limit cycle from a spiral point
Chaos (3D and Discrete)
Continuous Chaos (3D+)
- Lorenz Attractor (Butterfly effect)
- Rössler System
- Strange Attractors and fractal geometry
Discrete Chaos (1D Maps)
- Logistic Map: Period doubling cascade
- Feigenbaum Constant δ≈4.669
- Lyapunov Exponents (measuring sensitivity to initial conditions)
- Complex Dynamics: Mandelbrot & Julia Sets
Module 6: Numerical Methods
One-Step Methods
Explicit Euler
- xk+1=xk+hf(tk,xk)
- Error Order: O(h) (Global order 1)
Heun’s Method (Improved Euler)
- Predictor-Corrector approach
- Error Order: O(h2)
Runge-Kutta (RK4)
- Standard 4-stage method (The workhorse of ODEs)
- Error Order: O(h4)
Stability & Accuracy
Error Analysis
- Local Discretization Error (τk,h) vs Global Error (ek)
- Consistency: Local error →0 as h→0
Stiff Systems
- Problem: Multiple timescales (fast/slow dynamics) causing instability in explicit methods
- Solution: Implicit Methods (e.g., Implicit Euler)
- Region of Absolute Stability
- Step size control (Adaptive methods like ode45)