Differential Equations

The Geometric View of ODEs

01Direction Fields and the Geometric View of ODEs 02Integral Curves and the Isocline Method 03Perpendicular Isoclines: The Circles of y' = -x/y 04Isocline Corridors and a Trap for Solutions 05Existence and Uniqueness: One Curve Through a Point 06Where Existence and Uniqueness Fail Problem set0/10 Problem set 20/10 MIT problem set0/3

Numerical Methods

01Euler's Method and Its Three Equations 02Euler's Method by Hand: Building the Table 03Convexity and the Sign of Euler's Error 04First Order Error: Halve the Step, Halve the Error 05Improved Euler (RK2): Averaging Two Slopes 06Runge-Kutta 4 and the Price of Accuracy 07Singular Points: Where Every Method Fails Problem set0/10 Problem set 20/10 MIT problem set0/1

First-Order Linear Equations

01First Order Linear: Standard Form and the Sign of p 02The Conduction-Diffusion Model: Newton's Law of Cooling 03The Integrating Factor and the Four-Step Method 04Integrating Factors: Two Mistakes and a Trick Question 05Constant Coefficients: Steady State and Transient Problem set0/10 Problem set 20/10 MIT problem set0/1

Substitution Methods

01Scaling a First Order ODE: The Fourth-Power Cooling Law 02The Bernoulli Equation and the Substitution v = y^(1-n)03A Worked Bernoulli Example: The Substitution v = 1/y 04Homogeneous Equations: The Zoom Test and y = zx 05Modelling the Lighthouse Chase: A 45-Degree Heading 06The Boat's Path: A Logarithmic Spiral in Polar Coordinates Problem set0/10 Problem set 20/10

Autonomous Equations

01Autonomous Equations and Time-Translation Invariance 02Critical Points: Constant Solutions as Barriers 03The Embezzler Model dy/dt = ry - w: One Unstable Balance 04The Logistic Equation: Carrying Capacity Without Solving 05Stable, Unstable and Semi-Stable Critical Points 06Maximum Sustainable Harvest: Why h = a^2/4b Problem set0/10 Problem set 20/10 MIT problem set0/3

Complex Numbers

01Complex Division, Polar Form and the Definition of e^(iθ)02Why e^(iθ) Earns Its Name: Multiply Moduli, Add Angles 03Integrating e^(-x) cos x by Complexifying 04The nth Roots of Unity: Zeta on the Unit Circle Problem set0/10 Problem set 20/10 MIT problem set0/4

Input and Response

01Steady-State and Transient Solutions of y' + ky = q(t)02Input, Response and the Superposition Principle 03Solving y' + ky = k cos ωt by Complexification 04Amplitude and Phase Lag of a Sinusoidal Response Problem set0/10 Problem set 20/10 MIT problem set0/2

01Cartesian Method: Rationalise, Then Take the Real Part 02The Sinusoidal Identity and Its Right Triangle 03Three Proofs of the Sinusoidal Identity 04The Mixing Tank: Salt Balance and k = r/V 05RC Circuits, Decay Chains and Negative k Problem set0/10 Problem set 20/10 MIT problem set0/2

Second-Order Linear Equations

01Second-Order Linear ODEs and the Spring–Mass–Dashpot 02The Characteristic Equation and Overdamped Motion 03Complex Roots a ± bi and Underdamped Oscillation 04Critical Damping and Reduction of Order: t e^(−at)Problem set0/10 Problem set 20/10 MIT problem set0/2

01One Complex Root Is Enough: Conjugates and Real Solutions 02When a Damped Spring Oscillates: p Below ω₀ 03Damped Oscillations: Pseudo-Period and ω₁² + p² = ω₀² Problem set0/10 Problem set 20/10 MIT problem set0/1

01Superposition: Why Linearity Makes c₁y₁ + c₂y₂ a Solution 02The Wronskian and Abel's Theorem: Fitting Any Initial Values 03Normalized Solutions: Why cosh x and sinh x Solve y'' − y = 0 04Uniqueness: Why c₁y₁ + c₂y₂ Is Every Solution Problem set0/10 Problem set 20/10

Euler's Method and Its Three Equations

How does following one line element at a time turn a direction field into the three recursive equations a computer actually runs?

Loading…

←Previous Where Existence and Uniqueness Fail Next Euler's Method by Hand: Building the Table →

Your summary note

1. The initial value problem (IVP)
  Write the pair $y' = f(x,y)$ and $y(x_0) = y_0$ , name the two parts, and note that numerical methods are how such problems are actually solved in practice.
2. Euler's method geometrically
  Describe starting at $(x_0, y_0)$ , following the line element of slope $f(x,y)$ for one step of size $h$ , recomputing the slope at the new point, and repeating to produce a broken-line approximation.
3. Deriving the three Euler equations
  Complete the triangle at $(x_n, y_n)$ with slope $A_n$ , horizontal side $h$ and vertical side $h A_n$ , then write out $h$ , $y_{n+1} = y_n + h A_n$ , and $A_n = f(x_n, y_n)$ .
Attempt 1 of 2