Module 2 · GATE Engineering Mathematics

Differential Equations

Updated 18 Nov 2026 · 2,831 words · illustrated
Updated 15 Nov 2026
First and second order ODEs, Laplace transforms, applications.
First Order ODE · Second Order ODE · Laplace Transform
🎯 Take Mock Test
DE Describes ChangeSeparate &IntegrateHomogeneousSubstitutionIntegrating FactorTraps & StrategiesMulti‑Step ProblemsPractice Zone→→↓→→↓Integrating Factor: IF = e^{∫P dx}Separation: ∫dy/g(y)=∫f(x)dxvlymbooq
Differential Equations Concept Map Methods Traps Strategies Practice — Shows the logical progression from basic DE definition through solution methods to exam‑focused practice. · Open the full diagram →
How a DE DescribesChangeSeparate Variables(dy/dx = f·g)HomogeneousSubstitution y=vxLinear Formdy/dx+P·y=QCommon Traps &Pitfalls→→Exam tip: Identify form before integratingRule: IF = e^{∫Pdx} for linear DEsvlymbooq
Key Concepts and Strategies for Solving Differential Equations — Shows the hierarchy of DE types, solution methods and common traps. · Open the full diagram →

Learning Objectives

  • Understand the fundamental concepts of Differential Equations
  • Apply key formulas and techniques to solve problems
  • Practice with exam-level questions to build speed and accuracy

What are Differential Equations?

Differential equations (DEs) describe relationships involving rates of change and are fundamental to engineering analysis. GATE covers first and second order ordinary differential equations (ODEs), methods of solution, and Laplace transforms. Weightage is typically 4-6% in GATE.

Key Concepts

1. First Order ODE: Variable separable: dy/dx = f(x)g(y) → ∫dy/g(y) = ∫f(x)dx. Homogeneous: dy/dx = f(y/x) → substitute y = vx. Linear: dy/dx + P(x)y = Q(x) → integrating factor IF = e^(∫P dx) → solution: y(IF) = ∫Q(IF) dx. Bernoulli: dy/dx + Py = Qyⁿ → substitute v = y^(1-n).

2. Exact Differential Equations: M dx + N dy = 0 is exact if ∂M/∂y = ∂N/∂x. Solution: ∫M dx + ∫(terms in N not containing x) dy = C. If not exact, find integrating factor.

3. Second Order Linear ODE: a d²y/dx² + b dy/dx + cy = f(x). Homogeneous (f=0): auxiliary equation ar² + br + c = 0. Roots: real distinct → y = C₁e^(r₁x) + C₂e^(r₂x). Real equal → y = (C₁ + C₂x)e^(rx). Complex → y = e^(αx)(C₁cosβx + C₂sinβx). Particular integral for f(x) using method of undetermined coefficients or variation of parameters.

4. Laplace Transforms: L{f(t)} = ∫(0 to ∞) e⁻ˢᵗ f(t) dt. Standard transforms: L{1} = 1/s, L{tⁿ} = n!/sⁿ⁺¹, L{e^(at)} = 1/(s-a), L{sinωt} = ω/(s²+ω²), L{cosωt} = s/(s²+ω²). Properties: linearity, first shifting theorem L{e^(at)f(t)} = F(s-a), second shifting theorem L{f(t-a)H(t-a)} = e⁻ᵃˢF(s). Inverse Laplace: partial fractions + standard forms.

Solved Examples

Example 1 (First Order Linear ODE)
Solve: dy/dx + 2xy = 2x, given y(0) = 1.

a) y = 1 b) y = 1 + e^(-x²) c) y = 1 - e^(-x²) d) y = e^(-x²)
Solution: a) y = 1. P(x) = 2x, Q(x) = 2x. IF = e^(∫2x dx) = e^(x²). Solution: y·e^(x²) = ∫2x·e^(x²) dx = e^(x²) + C. So y = 1 + Ce^(-x²). Using y(0)=1: 1 = 1 + C → C=0. Therefore y = 1.
Example 2 (Second Order ODE)
Solve: d²y/dx² + 4y = 0, y(0)=1, y'(0)=2.

a) y = cos2x + sin2x b) y = cos2x + 2sin2x c) y = 2cos2x + sin2x d) y = cos2x + 3sin2x
Solution: a) y = cos2x + sin2x. AE: r² + 4 = 0 → r = ±2i. Solution: y = C₁cos2x + C₂sin2x. y(0)=1: C₁=1. y' = -2C₁sin2x + 2C₂cos2x. y'(0)=2: 2C₂=2 → C₂=1. So y = cos2x + sin2x.
Example 3 (Laplace Transform)
Find the Laplace transform of f(t) = 3 + 2t - e^(-3t).

a) 3/s + 2/s² - 1/(s+3) b) 3/s + 2/s² + 1/(s+3) c) 3/s - 2/s² - 1/(s-3) d) 1/s + 2/s² - 3/(s+3)
Solution: a) 3/s + 2/s² - 1/(s+3). L{3} = 3/s. L{2t} = 2·1/s² = 2/s². L{e^(-3t)} = 1/(s+3). By linearity: L{f(t)} = 3/s + 2/s² - 1/(s+3).

Shortcut Techniques

  • For variable separable, integrate both sides directly — no special method needed. For linear DE, always find IF first.
  • In second order ODE with constant coefficients, memorise the three cases of auxiliary equation roots.
  • For Laplace transforms, memorise the standard transform pairs and use partial fractions for inverse transforms.
  • Unit step function H(t-a) shifts the function: L{f(t-a)H(t-a)} = e^(-as)F(s).
  • Initial and final value theorems: lim(t→0) f(t) = lim(s→∞) sF(s), lim(t→∞) f(t) = lim(s→0) sF(s).
Pro Tip
In GATE, differential equations questions are highly formula-driven. Practice identifying the type of DE quickly — this determines the solution method. For Laplace transforms, focus on solving initial value problems by transforming the differential equation into an algebraic equation in s, which is then solved and inverse-transformed.

Advanced Applications

Modern exams feature questions combining multiple quantitative concepts. Master these by practicing previous year papers.

Shortcut Methods

Percentages: Use fraction table (12.5%=1/8, 20%=1/5, 25%=1/4). SI/CI: For 2 years, CI-SI = P(r/100)^2. Time Work: Use LCM of time periods. Average Speed: 2ab/(a+b) for equal distances.

Pro Tip
Write key formulas on rough sheet immediately after the exam bell while memory is fresh.

Higher-Order Linear ODEs with Variable Coefficients

When the coefficients of a linear ordinary differential equation are functions of the independent variable, the constant‑coefficient auxiliary‑equation method no longer applies. Two classical families admit closed‑form solutions: Cauchy‑Euler (equidimensional) equations and equations reducible to constant coefficients by a change of variable. A Cauchy‑Euler equation has the form aₙxⁿy⁽ⁿ⁾ + aₙ₋₁xⁿ⁻¹y⁽ⁿ⁻¹⁾ + … + a₁xy′ + a₀y = 0. Substituting y = xʳ converts it into an algebraic indicial equation aₙr(r‑1)…(r‑n+1) + aₙ₋₁r(r‑1)…(r‑n+2) + … + a₁r + a₀ = 0. Distinct real roots r₁,…,rₙ give the fundamental set {xʳ¹,…,xʳⁿ}. A repeated root r of multiplicity m contributes {xʳ, xʳln x, …, xʳ(ln x)ᵐ⁻¹}. Complex roots α ± iβ yield x^α cos(β ln x) and x^α sin(β ln x). For non‑homogeneous Cauchy‑Euler equations, variation of parameters or the method of undetermined coefficients (with trial functions expressed in powers of x and ln x) provides a particular integral.

Reduction of order is a general technique when one solution y₁(x) of a second‑order linear homogeneous ODE y″ + P(x)y′ + Q(x)y = 0 is known. Setting y = v(x)y₁(x) leads to a first‑order linear equation for v′: v″y₁ + 2v′y₁′ + v(y₁″ + Py₁′ + Qy₁) = 0. Since y₁ satisfies the original ODE, the term in v vanishes, leaving v″y₁ + 2v′y₁′ = 0. Dividing by y₁ and integrating gives v′ = C exp(‑∫2y₁′/y₁ dx) = C/y₁². A second independent solution is y₂ = y₁∫(dx/y₁²). This formula is indispensable for equations such as Bessel’s equation of order zero, where y₁ = J₀(x) is known from series methods.

Another important class arises from the substitution x = eᵗ (or t = ln x) which transforms a Cauchy‑Euler equation into a constant‑coefficient ODE in t. The derivatives transform as dy/dx = (1/x) dy/dt, d²y/dx² = (1/x²)(d²y/dt² – dy/dt), and similarly for higher orders. This mapping is frequently used in examinations to test whether the candidate recognises the hidden constant‑coefficient structure.

Key Points for Quick Identification

  • Equation contains terms xᵏy⁽ᵏ⁾ with the same power of x as the derivative order → Cauchy‑Euler.
  • One known solution is given or can be guessed (e.g., y = x, y = eˣ) → reduction of order.
  • Presence of ln x in the non‑homogeneous term suggests a repeated root in the indicial equation.

Systems of First Order Linear ODEs and Matrix Exponential

A system of n first‑order linear ODEs can be written compactly as d𝐱/dt = A𝐱 + 𝐟(t), where 𝐱(t) is an n‑vector, A is an n×n constant matrix, and 𝐟(t) is a forcing vector. The homogeneous system d𝐱/dt = A𝐱 has the fundamental matrix solution Φ(t) = eᴬᵗ, defined by the convergent series eᴬᵗ = I + At + A²t²/2! + … . If A is diagonalizable, A = PDP⁻¹ with D = diag(λ₁,…,λₙ), then eᴬᵗ = P eᴰᵗ P⁻¹ where eᴰᵗ = diag(eλ₁t,…,eλₙt). The general homogeneous solution is 𝐱ₕ(t) = eᴬᵗ𝐜, 𝐜 constant vector.

For non‑homogeneous systems, the variation‑of‑parameters formula gives a particular solution 𝐱ₚ(t) = eᴬᵗ∫e‑Aτ𝐟(τ)dτ. When 𝐟(t) = 𝐛 eμt with constant vector 𝐛, a trial particular solution of the form 𝐱ₚ = 𝐯 eμt leads to (μI – A)𝐯 = 𝐛, provided μ is not an eigenvalue of A. If μ coincides with an eigenvalue, the trial must be multiplied by t (or higher powers) exactly as in the scalar method of undetermined coefficients.

Phase‑plane analysis for n = 2 classifies equilibrium at the origin according to the eigenvalues of A: real distinct same sign → node (stable if negative, unstable if positive); real opposite signs → saddle; complex with non‑zero real part → spiral (stable/unstable); pure imaginary → centre. The trace τ = tr(A) and determinant Δ = det(A) give a quick discriminant: τ² – 4Δ > 0 → real eigenvalues; τ² – 4Δ < 0 → complex. This classification is a favourite in multiple‑choice questions because it requires only τ and Δ, not the full eigen‑decomposition.

When A is not diagonalizable (defective), the Jordan form introduces terms t eλt in the matrix exponential. For a 2×2 defective matrix with eigenvalue λ of algebraic multiplicity 2 and geometric multiplicity 1, eᴬᵗ = eλt(I + t(A‑λI)). The presence of the polynomial factor t is a hallmark that examiners test by asking for the explicit form of the fundamental matrix.

Worked Example: Matrix Exponential for a Defective System
Consider the system d𝐱/dt = A𝐱 with A = [[2,1],[0,2]]. Find the fundamental matrix Φ(t) = eᴬᵗ and the solution satisfying 𝐱(0) = [1,‑1]ᵀ.
The matrix A has eigenvalue λ = 2 with algebraic multiplicity 2. It is defective because A‑2I = [[0,1],[0,0]] has rank 1. Using the Jordan‑form formula for a 2×2 defective matrix: eᴬᵗ = e2t(I + t(A‑2I)). Compute A‑2I = [[0,1],[0,0]]. Then I + t(A‑2I) = [[1, t],[0,1]]. Hence Φ(t) = e2t[[1, t],[0,1]]. The solution is 𝐱(t) = Φ(t)𝐱(0) = e2t[[1, t],[0,1]] [1,‑1]ᵀ = e2t[1‑t, ‑1]ᵀ. Therefore x₁(t) = e2t(1‑t), x₂(t) = ‑e2t.
Exam‑Day Strategy for Matrix Exponential
When a 2×2 constant‑coefficient system appears, first compute trace τ and determinant Δ. If τ²‑4Δ ≥ 0, eigenvalues are real; write the general solution using exponentials. If τ²‑4Δ < 0, eigenvalues are complex; write the solution in terms of eαtcos βt and eαtsin βt. For defective cases, remember the extra factor t multiplying the eigenvector term. Sketching the phase portrait from τ and Δ alone can earn partial marks even if the full matrix exponential is not required.

Laplace Transform of Periodic Functions and Convolution Theorem

The Laplace transform of a periodic function f(t) with period T > 0 is given by L{f(t)} = (1/(1‑e‑sT)) ∫₀ᵀ e‑st f(t) dt, provided the integral converges. This formula follows from splitting the infinite integral into a sum over periods and recognising a geometric series in e‑sT. It is particularly useful for square waves, sawtooth waves, and rectified sinusoids that appear in electrical‑engineering problems. For a square wave of amplitude A and period 2π defined by f(t)=A for 0<t<π and f(t)=‑A for π<t<2π, the transform reduces to (A/s) tanh(πs/2).</p>

The convolution theorem states that L{(f * g)(t)} = F(s)G(s), where (f * g)(t) = ∫₀ᵗ f(τ)g(t‑τ)dτ. Conversely, the inverse transform of a product F(s)G(s) is the convolution of the individual inverse transforms. This property converts difficult inverse transforms involving rational functions into integrals of known functions. For example, L⁻¹{1/(s(s²+ω²))} = ∫₀ᵗ 1·sin ωτ dτ = (1‑cos ωt)/ω².

Convolution also provides a systematic way to solve linear ODEs with arbitrary forcing: if the ODE is aₙy⁽ⁿ⁾+…+a₀y = f(t) with zero initial conditions, taking Laplace transforms gives Y(s) = F(s)/P(s) where P(s) is the characteristic polynomial. The inverse transform is the convolution of f(t) with the impulse response h(t) = L⁻¹{1/P(s)}. The impulse response is precisely the solution of the homogeneous ODE with initial conditions y(0)=…=y⁽ⁿ⁻²⁾(0)=0, y⁽ⁿ⁻¹⁾(0)=1/aₙ.

An important corollary is the differentiation of transforms: L{t f(t)} = ‑dF/ds. Combined with convolution, this yields formulas for transforms of integrals and derivatives of periodic functions. Examiners often ask for the Laplace transform of t·f(t) where f is a standard periodic waveform, testing both the periodic‑function formula and the derivative property.

Typical Examination Patterns

  • Given a piecewise‑defined periodic function, write its Laplace transform using the period formula.
  • Compute the inverse transform of a product like (s/(s²+ω²))·(1/(s²+α²)) by identifying the factors as transforms of cos ωt and (1/α) sin αt and writing the convolution integral.
  • Use the convolution theorem to solve an initial‑value problem with a non‑standard forcing term (e.g., f(t)=t²e‑t).

Partial Differential Equations: Separation of Variables for Heat and Wave Equations

The one‑dimensional heat equation ∂u/∂t = α ∂²u/∂x² on a finite rod 0<x<L with homogeneous Dirichlet boundary conditions u(0,t)=u(L,t)=0 and initial temperature u(x,0)=f(x) is solved by assuming u(x,t)=X(x)T(t). Substitution yields X T′ = α X″ T, or T′/(αT) = X″/X = ‑λ (separation constant). The spatial problem X″+λX=0, X(0)=X(L)=0 gives eigenvalues λₙ = (nπ/L)² and eigenfunctions Xₙ(x)=sin(nπx/L), n=1,2,…. The temporal problem T′+αλₙT=0 gives Tₙ(t)=e<sup>‑αλₙt. Superposition yields u(x,t)=∑n=1^∞ Bₙ sin(nπx/L) e‑α(nπ/L)²t, where Bₙ = (2/L)∫₀ᴸ f(x) sin(nπx/L) dx are the Fourier sine coefficients of the initial data.

For the wave equation ∂²u/∂t² = c² ∂²u/∂x² with the same boundary conditions and initial displacement u(x,0)=f(x), initial velocity ∂u/∂t(x,0)=g(x), separation gives X″+λX=0 as before, but the temporal equation becomes T″+c²λT=0. The solution is Tₙ(t)=Aₙ cos(c nπ t/L)+Bₙ sin(c nπ t/L). The full series is u(x,t)=∑n=1^∞ sin(nπx/L)[Aₙ cos(c nπ t/L)+Bₙ sin(c nπ t/L)], with Aₙ = (2/L)∫₀ᴸ f(x) sin(nπx/L) dx and Bₙ = (2/(c nπ/L))∫₀ᴸ g(x) sin(nπx/L) dx.

Neumann (insulated) boundary conditions ∂u/∂x(0,t)=∂u/∂x(L,t)=0 lead to cosine eigenfunctions Xₙ(x)=cos(nπx/L) with n=0,1,2,… and λₙ = (nπ/L)². The n=0 mode gives a constant spatial eigenfunction, which for the heat equation yields a steady‑state term that does not decay. For the wave equation, the n=0 temporal solution is A₀+B₀t, representing a rigid translation of the string.

Non‑homogeneous boundary conditions are handled by splitting u = v + w, where w(x,t) satisfies the boundary conditions (often a linear function in x for Dirichlet data) and v satisfies homogeneous boundary conditions with a modified forcing term. This technique is a standard examination question because it tests both the method of separation and the ability to construct a suitable auxiliary function.

Key Formulas to Memorise

  • Heat equation Fourier sine coefficients: Bₙ = (2/L)∫₀ᴸ f(x) sin(nπx/L) dx.
  • Wave equation coefficients: Aₙ = (2/L)∫₀ᴸ f(x) sin(nπx/L) dx, Bₙ = (2L/(c nπ))∫₀ᴸ g(x) sin(nπx/L) dx.
  • Eigenvalues for Dirichlet: λₙ = (nπ/L)²; for Neumann: λₙ = (nπ/L)² with n≥0.

Numerical Methods for ODEs: Runge‑Kutta and Stability Analysis

When analytical solutions are unavailable, numerical integration of initial‑value problems dy/dt = f(t,y), y(t₀)=y₀ is essential. The classical fourth‑order Runge‑Kutta (RK4) method advances the solution by a step h using four slope evaluations: k₁ = f(tₙ, yₙ); k₂ = f(tₙ+h/2, yₙ+h k₁/2); k₃ = f(tₙ+h/2, yₙ+h k₂/2); k₄ = f(tₙ+h, yₙ+h k₃); yₙ₊₁ = yₙ + (h/6)(k₁+2k₂+2k₃+k₄). The local truncation error is O(h⁵), giving a global error O(h⁴). RK4 is the workhorse for non‑stiff problems because it balances accuracy and computational cost.

Stiff equations, characterised by eigenvalues of the Jacobian ∂f/∂y with large negative real parts, require implicit methods to avoid prohibitively small step sizes. The backward Euler method yₙ₊₁ = yₙ + h f(tₙ₊₁, yₙ₊₁) is A‑stable: its region of absolute stability contains the entire left half‑plane. The trapezoidal rule (Crank‑Nicolson) yₙ₊₁ = yₙ + (h/2)[f(tₙ,yₙ)+f(tₙ₊₁,yₙ₊₁)] is also A‑stable and second‑order accurate. For linear test equation y′ = λy, the amplification factor of a one‑step method is a rational function R(z) with z = λh. The method is stable if |R(z)| ≤ 1. Plotting the stability region in the complex z‑plane is a standard examination task.

Adaptive step‑size control uses embedded Runge‑Kutta pairs (e.g., RK4(5) Dormand‑Prince) that produce two estimates of different orders; their difference estimates the local error. The step is accepted if the error is below a tolerance, and h is adjusted by a factor (tolerance/error)1/(p+1) where p is the lower order. This strategy is implemented in most scientific computing libraries and is occasionally tested conceptually.

For systems, the same formulas apply component‑wise. The Jacobian matrix J = ∂f/∂y determines stiffness. If the eigenvalues of J are widely separated in magnitude, explicit methods require h < 2/|λ_max| for stability, while implicit methods allow much larger h. Examination questions may ask to identify stiffness from a given Jacobian or to choose an appropriate method (explicit vs implicit) for a described problem.

Practical Checklist for Numerical Questions

  • Write the RK4 update formulas explicitly; do not just name the method.
  • For stability analysis, compute the amplification factor R(z) for the given method applied to y′ = λy.
  • State the order of the method and the expected global error behaviour.
  • When asked about adaptive step size, mention error estimation via embedded pairs and the step‑size adjustment formula.
  • Confusing the indicial equation of a Cauchy‑Euler ODE with the auxiliary equation of a constant‑coefficient ODE.
  • Forgetting the factor t in the second solution when the indicial equation has a repeated root.
  • Applying the matrix exponential formula eᴬᵗ = P eᴰᵗ P⁻¹ without verifying that A is diagonalizable.
  • Misusing the convolution theorem by convolving the wrong pair of inverse transforms.
  • Neglecting the n=0 cosine mode in Neumann problems, leading to missing steady‑state terms.
  • Using an explicit Runge‑Kutta method on a stiff problem without checking the stability restriction.
  • Omitting the factor 2/L in Fourier coefficient formulas for heat and wave equations on [0,L].

Practice Questions

← Calculus Probability & Statistics →