Differential Equations: cram pack

Second-order linear equations: for y″ + b·y′ + c·y = 0 try y = e^rt: this gives the characteristic equation r² + b·r + c = 0. Two real roots r₁ ≠ r₂ give y = A·e^r₁t + B·e^r₂t (overdamped); a double root r gives y = (A + Bt)·e^rt (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.

First-order differential equations: dy/dt = k·y has the solution y = y₀·e^kt (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.

Definite integrals: ∫ₐᵇ f(x) dx is the signed area between the graph and the x-axis from a to b. Find an antiderivative F (with F′ = f) and evaluate F(b) − F(a). Power rule: ∫xⁿ dx = xⁿ⁺¹/(n + 1). The area between two curves is ∫(upper − lower) dx.

Volumes of revolution: rotating the region under y = f(x) from x = a to x = b about the x-axis makes a solid whose cross-section at x is a disc of radius f(x). Adding the discs gives V = π∫ₐᵇ f(x)² dx. When the region lies between an outer curve R(x) and an inner curve r(x), each slice is a washer: V = π∫ₐᵇ (R(x)² − r(x)²) dx. Square the radii before you subtract them.

Differentiation: the derivative f′(x) is the slope of the graph at x. Power rule: (xⁿ)′ = n·xⁿ⁻¹. Product rule: (uv)′ = u′v + uv′. Chain rule: (f(g(x)))′ = f′(g(x))·g′(x). Where f′(x) = 0 the graph has a horizontal tangent: a maximum, minimum or saddle point.

Differentiation: the derivative f′(x) is the slope of the graph at x. Power rule: (xⁿ)′ = n·xⁿ⁻¹. Product rule: (uv)′ = u′v + uv′. Chain rule: (f(g(x)))′ = f′(g(x))·g′(x). Where f′(x) = 0 the graph has a horizontal tangent: a maximum, minimum or saddle point.

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₂ + … + 2f_n−1 + fₙ]. Simpson's rule (n even): S = (h/3)[f₀ + 4f₁ + 2f₂ + 4f₃ + … + 4f_n−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.

Numerical solution of y′ = f(t, y): Euler's method steps along the slope at the start of each step: y_n+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₁), y_n+1 = yₙ + (h/2)(k₁ + k₂). The classical Runge–Kutta method (RK4) combines four slopes: y_n+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⁴.