Elementary Differential Equations PDF Download – William F. Trench (Free Edition) BS Math

Students taking Differential Equations in a BS Mathematics or Engineering program can download the complete text of “Elementary Differential Equations” by William F. Trench, free as a PDF in its December 2013 Free Edition 1.01. Originally published by Brooks/Cole Thomson Learning in 2001, the book was released by Trench himself for open educational use once the commercial rights reverted to him, and it now covers the standard first course in ordinary differential equations across ten chapters — from first order equations and numerical methods through linear second order theory, series solutions, Laplace transforms and linear systems.

It is written for students who have finished calculus through partial differentiation, and it leans on worked examples over abstract proof, which makes it a practical companion for a fast-moving one-semester DE course. Chapters 1 through 9 need only single-variable and multivariable calculus; Chapter 10 on linear systems assumes some prior linear algebra, which the book flags clearly rather than assuming silently. Its exercise sets, described in the book’s own preface as ranging from routine to very challenging, give BS Math and engineering students substantial practice material to prepare thoroughly for both coursework and exams.

Book Overview

CourseDifferential Equations
Degree ProgramsBS Mathematics, Engineering — standard course after the calculus sequence
LevelUniversity — typically third or fourth semester, after Calculus I–III
EditionFree Edition 1.01 — released December 2013
AuthorWilliam F. Trench (Andrew G. Cowles Distinguished Professor Emeritus, Trinity University)
Structure10 chapters, from first order equations through linear systems of differential equations
ExercisesNumbered exercise sets in every section, ranging from routine to very challenging, plus optional computer-graphics and laboratory problems, per the book’s own preface
LanguageEnglish
LicenseCreative Commons Attribution-NonCommercial-ShareAlike (CC BY-NC-SA) 3.0 Unported — Model: Link-only
FormatFree PDF (7.8 MB); LaTeX source and graphics also available (3.2 MB)

Chapter List

Chapter 1: Introduction

Difficulty: Easy · Key topics: mathematical models, Malthusian and Verhulst population growth, Newton’s Law of Cooling, order and linearity, direction fields

The book opens by explaining that mathematical models often relate an unknown function to one or more of its derivatives, and that such an equation is called a differential equation. Section 1.1 builds intuition through concrete models before any formal theory: the Malthusian growth equation for populations, the Verhulst logistic equation that adds a limiting term, Newton’s Law of Cooling, a glucose-absorption model, and a Newton’s-second-law equation for motion under resistance. Section 1.2 then defines basic vocabulary — order, linearity, general and particular solutions — and Section 1.3 introduces direction fields as a way to sketch a first order equation’s solution behavior without solving it.

Key Points:

  • A differential equation relates an unknown function to one or more of its derivatives.
  • Malthusian growth: P′ = aP; Verhulst logistic growth adds a limiting term: P′ = aP(1 − αP).
  • Newton’s Law of Cooling: T′ = k(T − Tm), where Tm is the surrounding medium’s temperature.
  • The order of a differential equation is the order of its highest derivative.
  • A direction field plots short line segments showing a solution’s slope at each point, without solving the equation.
  • A particular solution satisfies both the equation and a given initial condition; a general solution is the whole family.

Memory Tip: Before assuming an equation is unfamiliar, check whether it is really just a Malthusian or logistic growth equation in disguise — the same P′ = aP(1 − αP) pattern reappears under different variable names throughout the applications chapters.

Common Mistake: Confusing a direction field’s line segments with an actual solution curve. The segments only show local slope; a real solution curve must be tangent to every segment it crosses, and sketching one by eye takes practice.

Important Questions:

  • What does it mean for an equation to be a “differential equation”? An equation that relates an unknown function to one or more of its derivatives.
  • Write the logistic growth equation and explain what the extra term (1 − αP) does compared to Malthusian growth. P′ = aP(1 − αP); the term slows growth as P approaches 1/α, modeling a population limited by resources instead of growing without bound.

Chapter 2: First Order Equations

Difficulty: Medium · Key topics: linear first order equations, integrating factor, separable equations, existence and uniqueness, exact equations, integrating factors for exactness

Chapter 2 develops the main solution techniques for first order equations. It opens by defining a linear first order equation as one that can be written y′ + p(x)y = f(x), then solves it with an integrating factor to reach a general solution built from P(x) = ∫p(x)dx. Section 2.2 covers separable equations, where variables can be isolated on opposite sides before integrating. Section 2.3 states an existence-and-uniqueness theorem for nonlinear equations — the one specific result Chapter 3 depends on — and Sections 2.4–2.6 extend the toolkit to equations that become separable after a substitution, exact equations, and integrating factors that turn a non-exact equation into an exact one.

Key Points:

  • A first order equation is linear if it can be written y′ + p(x)y = f(x).
  • The integrating factor for a linear equation is e^P(x), where P(x) = ∫p(x)dx.
  • A separable equation can be arranged so all y-terms and all x-terms sit on opposite sides before integrating.
  • An equation M(x,y)dx + N(x,y)dy = 0 is exact when ∂M/∂y = ∂N/∂x.
  • Existence and uniqueness theorems guarantee a nonlinear initial value problem has exactly one solution near a point where the right side and its partial derivative are continuous.
  • Section 2.3 is the only part of this chapter that Chapter 3 (Numerical Methods) needs as a prerequisite.

Practice Tip: Before reaching for the integrating factor formula, check whether the equation is separable first — it is usually the faster path when both work, and recognizing which method applies is most of the difficulty at this stage.

Common Mistake: Forgetting the constant of integration when computing P(x) for the integrating factor, which silently drops a whole family of solutions rather than just one.

Important Questions:

  • Solve y′ + 2y = e−x using an integrating factor. Multiplying by e^(2x) gives (e^(2x)y)′ = e^x; integrating gives y = e−x + ce−2x.
  • What condition must M(x,y)dx + N(x,y)dy = 0 satisfy to be exact, and why does that condition matter? It must satisfy ∂M/∂y = ∂N/∂x; this guarantees a function F(x,y) exists with Fx = M and Fy = N, so the solution is simply F(x,y) = c.

Chapter 3: Numerical Methods

Difficulty: Medium · Key topics: Euler’s method, step size, local and global error, the Improved Euler method, the Runge-Kutta method

Not every differential equation has a solution expressible in closed form, so Chapter 3 develops methods to approximate a solution numerically instead. Euler’s Method builds an approximate solution curve step by step, using the slope at the current point to estimate the next point over a small step size h. Section 3.2 improves on this with the Improved Euler Method and related predictor-corrector methods, which average slope estimates to reduce error. Section 3.3 introduces the Runge-Kutta Method, a higher-order technique that achieves much better accuracy than Euler’s method through a weighted average of several slope evaluations per step. As the book’s own preface notes, Section 2.3 is the only specific prerequisite this chapter needs from Chapter 2.

Key Points:

  • Euler’s Method: y_(n+1) = y_n + h·f(x_n, y_n), stepping forward using the current slope.
  • Smaller step size h generally reduces error but increases the number of steps — and rounding error — needed.
  • The Improved Euler Method averages the slope at the start and the predicted end of each step for better accuracy.
  • The Runge-Kutta Method combines several slope evaluations per step with specific weights, giving much higher accuracy per step than Euler’s method.
  • Numerical methods trade an exact formula for an approximate table of (x, y) values.

Practice Tip: Run the same initial value problem through Euler’s Method with two different step sizes (say h = 0.1 and h = 0.01) and compare the results to the exact solution where one is known — watching the error shrink as h shrinks makes the trade-off concrete in a way the formula alone does not.

Common Mistake: Assuming a smaller step size always gives a strictly better answer without limit. In practice, extremely small steps increase the number of arithmetic operations and can accumulate more rounding error, especially by hand or with limited-precision calculation.

Important Questions:

  • Using Euler’s Method with h = 0.1, estimate y(0.2) for y′ = y, y(0) = 1. y(0.1) ≈ 1 + 0.1(1) = 1.1; y(0.2) ≈ 1.1 + 0.1(1.1) = 1.21 (the exact value is e0.2 ≈ 1.2214, showing Euler’s method’s typical slight error for this equation).
  • Why does the Runge-Kutta method generally give more accurate results than Euler’s method for the same step size? It evaluates the slope at several points within each step and combines them with weights, better capturing how the slope changes across the interval instead of using only the slope at the start.

Chapter 4: Applications of First Order Equations

Difficulty: Medium · Key topics: growth and decay, cooling and mixing, elementary mechanics with resistance, autonomous second order equations, applications to curves

Chapter 4 puts Chapters 1–3’s methods to work on real problems, and its own preface states plainly that its five sections are independent of each other and are not prerequisites for any later chapter. Growth and Decay extends the Malthusian model to population and radioactive-decay problems solved explicitly. Cooling and Mixing applies Newton’s Law of Cooling to temperature problems and separately covers tank-mixing problems where a solute’s concentration changes as fluid flows in and out. Elementary Mechanics derives equations of motion from Newton’s second law, including cases with air resistance. Autonomous Second Order Equations introduces phase-plane analysis for nonlinear equations without requiring a linear algebra background, and Applications to Curves solves geometric problems where a curve’s own slope defines a differential equation.

Key Points:

  • The sections in this chapter are independent of each other and are not prerequisites for any later chapter.
  • Radioactive decay and simple population growth both use the same first order linear model, y′ = ky.
  • Newton’s Law of Cooling, T′ = k(T − Tm), models temperature approaching its surroundings exponentially.
  • A mixing problem’s rate of change equals the rate solute enters minus the rate solute leaves, usually giving a linear first order equation.
  • Motion with resistance proportional to velocity adds a −kv term to Newton’s second law.
  • Phase-plane analysis for autonomous second order equations studies solution behavior without needing linear algebra.

Memory Tip: Every mixing or growth/decay problem in this chapter reduces to the same skeleton — identify the rate in, the rate out, and the quantity itself — before it becomes a differential equation. Write that skeleton down first, and the equation almost writes itself.

Common Mistake: In mixing problems, forgetting that the outflow rate depends on the tank’s current concentration, not the initial one — the outflow term must use the current amount of solute divided by the current volume, which changes over time if inflow and outflow rates differ.

Important Questions:

  • A tank starts with 100 L of pure water; brine with 2 kg/L salt flows in at 5 L/min, and the well-mixed solution flows out at the same rate. Set up the differential equation for the amount of salt y(t). y′ = (5)(2) − (5)(y/100) = 10 − y/20, since the volume stays constant at 100 L.
  • Why can the five sections of Chapter 4 be read in any order, or skipped independently? Each section applies the earlier chapters’ methods to a separate real-world context without depending on results from the other application sections.

Chapter 5: Linear Second Order Equations

Difficulty: Medium · Key topics: homogeneous vs. nonhomogeneous equations, superposition, the characteristic equation, undetermined coefficients, reduction of order, variation of parameters

Chapter 5 builds the theory for the linear second order equation that the rest of the book’s applications rely on. Section 5.1 establishes the homogeneous case and the superposition principle. Section 5.2 solves the constant coefficient homogeneous case through its characteristic polynomial, handling real, repeated, and complex roots, with complex-root solutions expressed through real sines and cosines rather than complex exponentials. Sections 5.3–5.5 turn to nonhomogeneous equations, developing the Method of Undetermined Coefficients as a systematic way to guess a particular solution’s form from the forcing function. Sections 5.6–5.7 cover Reduction of Order, which builds a second solution from one known solution, and Variation of Parameters, a more general method that works even when Undetermined Coefficients does not apply.

Key Points:

  • Superposition: if y1 and y2 solve a linear homogeneous equation, so does c1y1 + c2y2 for any constants.
  • A constant coefficient equation ay″ + by′ + cy = 0 is solved through its characteristic equation ar² + br + c = 0.
  • Complex conjugate roots α ± βi give real solutions e^(αx)cos(βx) and e^(αx)sin(βx), not complex exponentials.
  • The Method of Undetermined Coefficients guesses a particular solution’s form directly from the forcing function f(x).
  • Reduction of Order builds a second independent solution from one known solution of a homogeneous equation.
  • Variation of Parameters finds a particular solution for any continuous forcing function, even when Undetermined Coefficients does not apply.

Practice Tip: Before choosing a method for a nonhomogeneous equation, check whether the forcing function is a polynomial, exponential, sine/cosine, or a product of these — if so, Undetermined Coefficients is faster; anything else calls for Variation of Parameters.

Common Mistake: Forgetting to multiply the guessed particular solution by an extra power of x when the guessed form duplicates a term already in the homogeneous solution — skipping this step produces a guess that cannot actually solve the equation.

Important Questions:

  • Solve y″ − 5y′ + 6y = 0. The characteristic equation r² − 5r + 6 = 0 factors to (r−2)(r−3) = 0, giving y = c1e^(2x) + c2e^(3x).
  • Why does a repeated root r of the characteristic equation give solutions e^(rx) and xe^(rx) instead of two copies of e^(rx)? Two identical solutions are linearly dependent and cannot span the full solution space; multiplying by x produces a genuinely independent second solution, verified by substitution back into the equation.

Chapter 6: Applications of Linear Second Order Equations

Difficulty: Medium · Key topics: spring-mass systems, damping, forced oscillation and resonance, RLC circuits, motion under a central force

Chapter 6 applies Chapter 5’s methods to the two classic linear second order systems of physics. Sections 6.1–6.2 build the spring-mass model from Hooke’s law and Newton’s second law, working through the undamped case, damped free vibration — underdamped, critically damped, and overdamped — and forced vibration, including the resonance that occurs when a periodic driving force matches the system’s natural frequency. Section 6.3 shows that the RLC electrical circuit obeys the exact same differential equation as the spring-mass system, once charge, resistance, inductance, and capacitance are substituted for displacement, damping, mass, and stiffness — a direct mechanical-electrical analogy. Section 6.4 turns to motion under a central force, deriving the equations governing orbital motion in a field where force depends only on distance from a fixed point.

Key Points:

  • The undamped spring equation is my″ + ky = 0, from Newton’s second law and Hooke’s law F = −ky.
  • Damped free vibration splits into three cases by the sign of the characteristic equation’s discriminant: underdamped, critically damped, and overdamped.
  • Resonance occurs in forced vibration when the driving frequency matches the system’s natural frequency.
  • The RLC circuit equation has the same form as the spring-mass equation, with charge, resistance, inductance, and capacitance playing the roles of displacement, damping, mass, and stiffness.
  • Motion under a central force depends only on distance from a fixed point, which is the basis of orbital mechanics.
  • All of Chapter 6 rests directly on the constant coefficient methods built in Section 5.2.

Memory Tip: Keep one table in mind for the whole chapter — spring displacement, velocity, mass, damping, and spring constant map one-to-one onto circuit charge, current, inductance, resistance, and inverse capacitance. Learning the spring model well means the circuit model is nearly free.

Common Mistake: Treating resonance as something that only happens in the undamped case. Real damped systems can still show a sharp amplitude peak near the natural frequency; students often assume damping removes resonance entirely rather than just bounding it.

Important Questions:

  • A mass on a spring satisfies y″ + 4y = 0. What is the system’s natural angular frequency, and what kind of motion results? Natural angular frequency ω = 2 rad/s; the motion is simple harmonic, y = c1cos(2t) + c2sin(2t), oscillating forever with no damping.
  • Explain why an RLC circuit and a spring-mass system can be described by the same differential equation. Both are governed by a linear second order equation relating a quantity, its rate of change, and its second derivative to an external input, with charge/current/voltage in the circuit playing the same structural roles as displacement/velocity/force in the spring.

Chapter 7: Series Solutions of Linear Second Order Equations

Difficulty: Hard · Key topics: power series review, ordinary points, regular singular points, the Euler equation, the Method of Frobenius, the indicial equation

Some linear second order equations, especially ones with variable coefficients, have no solution expressible in elementary functions, so Chapter 7 builds solutions as infinite power series instead. Section 7.1 reviews the power series tools needed. Sections 7.2–7.3 find series solutions near an ordinary point by substituting an unknown series into the equation and solving a recurrence relation for its coefficients. Section 7.4 introduces regular singular points and the Euler equation as preparation for the general theory. Sections 7.5–7.7 develop the Method of Frobenius for regular singular points, which the book’s own preface says is presented in a way that “systematizes the computations” and avoids re-deriving the method from scratch for every new equation, including the more delicate case where the indicial equation’s roots differ by an integer.

Key Points:

  • A point x0 is an ordinary point of y″ + p(x)y′ + q(x)y = 0 when p and q are both analytic there.
  • Near an ordinary point, a series solution is built by substituting a power series and matching coefficients to get a recurrence relation.
  • A regular singular point requires (x−x0)p(x) and (x−x0)²q(x) to both be analytic, even when p or q itself is not.
  • The Euler equation x²y″ + αxy′ + βy = 0 is the simplest case with a regular singular point at x = 0.
  • The Method of Frobenius seeks solutions of the form y = x^r·Σa_n·x^n, where r solves the indicial equation.
  • When the indicial equation’s two roots differ by a positive integer, the second solution sometimes needs an extra logarithmic term.

Memory Tip: Before starting a Frobenius series, always solve the indicial equation first and check the gap between its two roots — that single number decides which of the three Frobenius cases the rest of the computation follows.

Common Mistake: Applying the ordinary-point series method to an equation that actually has a singular point at the expansion point, which produces a recurrence relation that never resolves cleanly — the type of point must be checked before choosing a method.

Important Questions:

  • What distinguishes an ordinary point from a regular singular point of y″ + p(x)y′ + q(x)y = 0? At an ordinary point, p and q are both analytic; at a regular singular point p or q may fail to be analytic, but (x−x0)p(x) and (x−x0)²q(x) must still be analytic there.
  • Why does the Method of Frobenius assume a solution of the form y = x^r·Σa_n·x^n rather than a plain power series? The extra factor x^r, with r found from the indicial equation, accounts for the singular behavior at the regular singular point that an ordinary power series (r = 0, 1, 2, …) cannot capture on its own.

Chapter 8: Laplace Transforms

Difficulty: Medium · Key topics: the Laplace transform, the inverse transform, initial value problems, the unit step function, piecewise continuous forcing, convolution, impulses

Chapter 8 introduces the Laplace transform as an alternative solution method that converts a linear differential equation with constant coefficients into an algebraic equation. Section 8.1 defines the transform and its basic properties, and Section 8.2 develops the inverse transform needed to convert an algebraic solution back into a function of t. Section 8.3 applies both directly to solving initial value problems. Sections 8.4–8.5 extend the method to discontinuous forcing functions using the unit step function. Section 8.6 covers convolution, which lets the transform of a product of functions be computed from the transforms of the individual factors, and Section 8.7 covers equations with impulsive forcing. Section 8.8 closes the chapter with a reference table of common transform pairs.

Key Points:

  • The Laplace transform converts a linear constant coefficient differential equation into an algebraic equation in the transform variable s.
  • L{f′(t)} = sF(s) − f(0), which is why the method builds initial conditions directly into the algebra.
  • The unit step function u(t−a) lets a single formula represent a forcing function that “switches on” at t = a.
  • Convolution: L{f*g} = F(s)G(s), turning transform multiplication into an integral in the time domain.
  • Impulsive forcing — a very large force over a very short time — is modeled using the Dirac delta function.
  • Section 8.8’s transform table is the fastest way to look up a standard transform once the method’s logic is understood.

Practice Tip: Keep the short table of common transform pairs open while working problems until the standard ones — e^(at), sin(bt), cos(bt), polynomials — are memorized; the method’s power comes from pattern-matching a transformed equation back to the table, not from re-deriving each transform by integration every time.

Common Mistake: Forgetting to apply the initial conditions inside the transform of the derivative terms before solving for F(s), and instead trying to apply them at the very end as if solving a normal integration constant problem.

Important Questions:

  • Solve y′ + 3y = 0, y(0) = 2, using the Laplace transform. Transforming gives sY(s) − 2 + 3Y(s) = 0, so Y(s) = 2/(s+3), and taking the inverse transform gives y(t) = 2e^(−3t).
  • What advantage does the Laplace transform have over direct methods when the forcing function is discontinuous? The unit step function lets a piecewise forcing function be written and transformed as a single expression, avoiding the need to solve the equation separately on each interval and match solutions at the break points.

Chapter 9: Linear Higher Order Equations

Difficulty: Medium · Key topics: nth order linear equations, the nth-degree characteristic polynomial, undetermined coefficients for higher order, variation of parameters for higher order

Chapter 9 extends Chapter 5’s second order theory to linear equations of any order n. Section 9.1 restates the existence-and-uniqueness theorem, superposition, and the Wronskian test for independence for the general nth order linear equation. Section 9.2 solves the constant coefficient homogeneous case through an nth degree characteristic polynomial, handling the same real, repeated, and complex root cases as Chapter 5 but with more roots to track at once. Section 9.3 extends the Method of Undetermined Coefficients to higher order nonhomogeneous equations, and Section 9.4 extends Variation of Parameters the same way, generalizing its second order formula to an n×n Wronskian-based system. The book’s own preface notes this chapter can be covered in any order relative to Chapters 7 and 8, once the needed material from Chapter 5 has been selected.

Key Points:

  • The general theory — existence, uniqueness, superposition, independence via the Wronskian — extends directly from second order to nth order equations.
  • A constant coefficient homogeneous equation of order n has an nth degree characteristic polynomial with n roots, counted with multiplicity.
  • A repeated root of multiplicity k contributes solutions e^(rx), xe^(rx), …, x^(k−1)e^(rx).
  • Undetermined Coefficients extends to higher order equations the same way it works for second order ones, matched against the forcing function’s form.
  • Variation of Parameters for order n uses an n×n system built from the Wronskian, generalizing the second order formula.
  • Chapters 7, 8, and 9 can be studied in any order once the relevant parts of Chapter 5 are covered.

Practice Tip: When factoring a higher-degree characteristic polynomial, look for small integer roots first with the rational root theorem, then reduce the polynomial’s degree by synthetic division — trying to factor a degree-4 or degree-5 polynomial directly is usually the slow path.

Common Mistake: For a repeated root of multiplicity k, writing only e^(rx) and xe^(rx) regardless of k, instead of continuing the pattern up through x^(k−1)e^(rx) — this under-counts the solution space whenever k is 3 or more.

Important Questions:

  • Solve y”’ − 3y″ + 3y′ − y = 0. The characteristic equation r³ − 3r² + 3r − 1 = (r−1)³ = 0 has a triple root r = 1, giving y = c1e^x + c2xe^x + c3x²e^x.
  • How does the Wronskian generalize from two functions to n functions when testing independence of solutions to an nth order equation? It becomes the determinant of the n×n matrix whose rows are the n functions and their derivatives up to order n−1; the solutions are independent on an interval exactly where this determinant is nonzero there.

Chapter 10: Linear Systems of Differential Equations

Difficulty: Hard · Key topics: systems of differential equations, matrix form, eigenvalues and eigenvectors, homogeneous linear systems, variation of parameters for systems

The book’s final chapter reformulates everything from single equations to systems, and its own preface states plainly that students need “some preparation in linear algebra” before starting it. Section 10.1 motivates systems through coupled physical models, and Section 10.2 shows how any single nth order linear equation can be rewritten as an equivalent first order system, unifying this chapter’s methods with everything built earlier in the book. Section 10.3 develops the basic theory of homogeneous linear systems in matrix form, including the matrix Wronskian test for independent solutions. Sections 10.4–10.6 solve constant coefficient homogeneous systems using the coefficient matrix’s eigenvalues and eigenvectors, working through the real-distinct, complex, and repeated eigenvalue cases — the direct system-level analogue of Chapter 5’s characteristic-root cases. Section 10.7 closes with Variation of Parameters for nonhomogeneous systems, generalizing Chapter 5’s formula to matrix form.

Key Points:

  • Any nth order linear equation can be rewritten as an equivalent first order system of n equations — the two viewpoints describe the same solutions.
  • A homogeneous linear system is written in matrix form as y′ = A(x)y.
  • For a constant coefficient system, solutions have the form y = ve^(λx), where λ is an eigenvalue and v its eigenvector of the coefficient matrix A.
  • Real distinct eigenvalues, complex conjugate eigenvalues, and repeated eigenvalues each require a different construction of the general solution, mirroring the three root cases in Chapter 5.
  • The matrix Wronskian tests whether a set of solution vectors is independent, the system-level analogue of the ordinary Wronskian.
  • This is the only chapter in the book that explicitly requires prior linear algebra preparation.

Memory Tip: Every case in this chapter is a direct translation of a case already learned in Chapter 5 — real roots become real eigenvalues, complex roots become complex eigenvalues, repeated roots become repeated eigenvalues. Reviewing Section 5.2’s three cases side by side with Sections 10.4–10.6 makes the pattern, not three separate new techniques, visible.

Common Mistake: Finding an eigenvalue correctly but then reusing an eigenvector computed for a different eigenvalue, or skipping the step of solving (A − λI)v = 0 separately for each eigenvalue — each eigenvalue has its own eigenvector(s), and mixing them up produces a solution that does not actually satisfy the system.

Important Questions:

  • Rewrite the second order equation y″ − 5y′ + 6y = 0 as an equivalent first order system. Let x1 = y, x2 = y′; then x1′ = x2 and x2′ = −6x1 + 5x2, a first order system equivalent to the original equation.
  • Why does a constant coefficient homogeneous system’s general solution depend on the coefficient matrix’s eigenvalues and eigenvectors? Substituting the trial solution y = ve^(λx) into y′ = Ay reduces the system to Av = λv, the defining equation for an eigenvalue λ and eigenvector v of A, so every solution of this form corresponds to an eigenpair.

Download Elementary Differential Equations PDF (Free)

This book is free from its official source. Click below to open Trinity University’s Digital Commons repository and download the complete Free Edition 1.01 PDF directly — the LaTeX source and graphics files are also available there for instructors who want to adapt the text.

↓ Download PDF

How to Study This Book

Read Chapters 1 and 2 in order — they are the foundation every later chapter assumes. Chapter 1 sets up vocabulary and direction fields; Chapter 2 builds the linear and separable equation techniques used constantly from here on. Do not skip Section 2.3 (existence and uniqueness) even if your course does not test it directly — it is the one specific result Chapter 3 depends on.

Chapter 3 (Numerical Methods) can follow immediately after Section 2.3, since the book’s own preface states that section is its only prerequisite. If your course emphasizes computation, work through it before Chapter 4; if it does not, it is safe to read later or skip, since nothing past Chapter 3 depends on it.

Chapter 4’s five application sections — Growth and Decay, Cooling and Mixing, Elementary Mechanics, Autonomous Second Order Equations, and Applications to Curves — are independent of each other and are not prerequisites for anything later in the book. Read only the sections your syllabus covers, in any order, and treat the rest as optional practice.

Chapter 5 is the hinge of the whole book. Everything in Chapters 6 through 10 leans on its constant coefficient methods, especially Section 5.2’s characteristic equation. Budget real time here, particularly on the Method of Undetermined Coefficients (5.4–5.5) versus Variation of Parameters (5.7) — knowing which to reach for is most of the chapter’s difficulty.

Once Section 5.2 is solid, Chapters 6, 7, 8, and 9 can be studied in almost any order — the book’s own preface says as much about Chapters 7, 8, and 9 directly, and Chapter 6 needs nothing beyond Section 5.2. A typical one-semester course covers Chapter 6 (applications) for physical intuition and Chapter 8 (Laplace transforms) as the two most commonly examined topics after Chapter 5; Chapter 7 (series solutions) is the most computationally demanding and is often the first to be trimmed from a tight syllabus.

Save Chapter 10 for last unless you already have linear algebra under your belt — the book’s own preface asks for it explicitly. If your course requires Chapter 10, review eigenvalues and eigenvectors before starting it; Sections 10.4–10.6 will otherwise feel like new material instead of Chapter 5’s characteristic-root cases in matrix form, which is really all they are.

For exam preparation, work each chapter’s two Important Questions above without looking at the answer first, then check the book’s own end-of-section exercises for more of the same type — the book leans on worked examples over abstract proof throughout, so practicing problems in the book’s own style is the most direct preparation for both coursework and exams.


Used In These Programs

This book is used for the Differential Equations course in: BS Mathematics and Engineering degree programs. Browse all Differential Equations books or all Mathematics books.

Who Should Read This

This book is written for BS Mathematics and Engineering students taking a first course in ordinary differential equations, immediately after finishing the calculus sequence — the book’s own preface states its prerequisite as “calculus through partial differentiation.” Students who have not yet completed Calculus Volume 2 or an equivalent second-semester calculus course should work through that first; the integration techniques and sequences/series material there are used constantly from Chapter 2 onward. It is not written for students still working through first-semester calculus, and Chapter 10 specifically is not suited to a student with no linear algebra background at all — that one chapter should wait until a linear algebra course is at least underway.


Applicable Universities

This book is useful for students at Pakistani universities offering BS Mathematics and engineering degrees, including Punjab University, Virtual University, COMSATS, FAST, UET, NUST, and other HEC-recognized institutions.

FAQs

Is Elementary Differential Equations free to download?

Yes. The book’s own front matter states it is released under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License, for any valid noncommercial educational, mathematical, or scientific purpose. It was originally published commercially by Brooks/Cole Thomson Learning in 2001; William F. Trench released it free once the rights reverted to him.

Which edition is this, and is it different from “Elementary Differential Equations with Boundary Value Problems”?

This is Trench’s Free Edition 1.01, released December 2013, and it is the shorter of his two free differential equations texts. Trinity University’s Digital Commons also hosts a longer sibling title, “Elementary Differential Equations with Boundary Value Problems,” which contains everything in this book plus three additional chapters on boundary value problems and Fourier expansions. If your course only covers the standard first-order-through-systems material, this 10-chapter edition is the right one.

How many chapters does this book have?

Ten. They run from Introduction and First Order Equations through Numerical Methods, Linear Second Order Equations and their applications, Series Solutions, Laplace Transforms, Linear Higher Order Equations, and finally Linear Systems of Differential Equations.

Is this book good for complete beginners in differential equations?

It assumes you have already completed calculus through partial differentiation — it is not a calculus book and does not re-teach derivatives or integrals. Within that assumption, yes: the book leans heavily on worked examples over abstract proof, which makes it approachable for a first course in the subject.

Does it cover Laplace transforms and systems of differential equations?

Yes. Chapter 8 covers the Laplace transform in full, including the unit step function, convolution, and impulsive forcing, and Chapter 10 covers linear systems of differential equations using eigenvalues and eigenvectors.

Do I need linear algebra to read this book?

For Chapters 1 through 9, no. Chapter 10 (Linear Systems of Differential Equations) is the exception — the book’s own preface states directly that students need “some preparation in linear algebra” before starting it, since that chapter solves systems using eigenvalues and eigenvectors.

Related Books

Elementary Differential Equations is the natural next step once the calculus sequence is done, and its worked-example-first approach makes it a practical bridge from computing derivatives and integrals to modeling real systems with them. Browse more Mathematics books for the rest of your semester.

Elementary Differential Equations, Free Edition 1.01 (December 2013), by William F. Trench (Andrew G. Cowles Distinguished Professor Emeritus, Trinity University). Originally published by Brooks/Cole Thomson Learning, 2001; released free for valid noncommercial educational, mathematical, or scientific purposes under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported licence. Official source: https://digitalcommons.trinity.edu/mono/8/

Leave a Comment