Skip to content

MATH3270

Ordinary Differential Equations

Initial value problems, series solutions and boundary value problems, dynamics and stability, and periodic linear systems.

4 chapters · 28 sectionsEN · 繁 · 简
My course notes

Your progress

0/ 28 sections marked complete

Next section: 1.1 Initial value problems, explicit methods, and linear systems

Completion marks are saved in this browser.

This course in the web

In the MATH3270 notes

Theorem cards
77
Definitions
33
Counterexamples
33
Concept lenses
14
Histories of ideas
0
Proof X-rays
32

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 28 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

In the webTheorem cards 77 · Definitions 33 · Counterexamples 33 · Concept lenses 14 · Proof X-rays 32

No concept lens from this course is recorded in the web yet.

Open this course in the knowledge map

Counts cover the 28 public sections of this course and what is written in them, not recorded connections. 0 of these sections are indexed into the web in detail so far.

Chapter 1 · 14 sections

Initial value problems

Initial value problems

Theorems 38 · Definitions 18Counterexamples 17Lenses 7Proof X-rays 16

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 1.1

    Initial value problems, explicit methods, and linear systems

    Connect explicit solution methods with local uniqueness, maximal intervals, fundamental matrices, and variation of constants.

  2. 1.2

    Riccati equations, linearization and poles

    Transform a Riccati equation into a second-order linear equation, track maximal intervals, and use a known particular solution.

  3. 1.3

    Osgood's uniqueness criterion

    Use an integral modulus of continuity to prove uniqueness beyond a Lipschitz bound.

  4. 1.4

    Orthogonal trajectories of a family of curves

    Derive perpendicular trajectories while tracking excluded axes and vertical tangents.

  5. 1.5

    Direction fields and isoclines

    Read direction fields and distinguish an isocline from a solution graph.

  6. 1.6

    Exact equations and integrating-factor domains

    Construct potentials for exact first-order equations, derive one-coordinate integrating-factor tests, and keep the solution domain and graph conditions visible.

  7. 1.7

    Bernoulli equations and reversible power substitutions

    Linearize Bernoulli equations on their reversible domains, determine maximal positive branches, recover integer-power signs, and distinguish blow-up from arrival at zero.

  8. 1.8

    Homogeneous equations and logarithmic scale

    Reduce ratio-dependent first-order equations to scalar autonomous flow, recover invariant straight lines, track maximal domains, derive a classical homogeneous-form integrating factor, and reduce affine slope ratios by translation or a parallel-line substitution.

  9. 1.9

    Continuation and the blow-up alternative

    Distinguish local uniqueness from global existence and prove what a finite maximal time entails.

  10. 1.10

    Differentiable dependence and variational equations

    Prove how initial states and parameters change a solution on a common finite interval, and compute sensitivities.

  11. 1.11

    Second-order variation of parameters and reduction of order

    Construct solutions for variable coefficients, using the Wronskian and keeping track of zeros of a known solution.

  12. 1.12

    Constant-coefficient operators and resonant forcing

    Prove the full higher-order homogeneous solution basis, derive the multiplicity rule for resonant polynomial-exponential forcing, and construct the correctly normalized convolution for continuous inputs.

  13. 1.13

    Laplace transforms and delayed forcing

    Derive the half-line transform rules and solve an initial-value problem with a delayed step.

  14. 1.14

    Modeling with first-order equations

    Translate balance laws into first-order differential equations for cooling, mixing, logistic growth and harvesting, solve them, and interpret the solutions together with their domains of validity.

Chapter 2 · 6 sections

Series and boundary problems

Series and boundary problems

Theorems 19 · Definitions 6Counterexamples 6Lenses 3Proof X-rays 8

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 2.1

    Series solutions and regular Sturm–Liouville problems

    Derive power and Frobenius recurrences, distinguish ordinary from regular singular points, and prove eigenvalue reality, orthogonality, and energy bounds.

  2. 2.2

    Regular Sturm–Liouville problems: energy and expansions

    Track separated boundary conditions through Green's identity, Robin energy, resonant solvability and a rigorously justified Dirichlet eigenfunction expansion.

  3. 2.3

    Sturm separation and comparison of zeros

    Prove interlacing and zero-comparison theorems for regular self-adjoint second-order equations.

  4. 2.4

    Green functions for Dirichlet boundary problems

    Construct the inverse kernel of a regular second-order boundary problem, detect resonance and establish positivity under a sign condition.

  5. 2.5

    Bessel's equation: Frobenius series and logarithms

    Construct convergent Frobenius solutions of Bessel's equation, analyze integer resonance and build a logarithmic second solution at order zero.

  6. 2.6

    Legendre polynomials and singular endpoints

    Derive Rodrigues' formula, orthogonality, recurrence, zeros and L² completeness while tracking the endpoint degeneracy.

Chapter 3 · 5 sections

Dynamics and stability

Dynamics and stability

Theorems 13 · Definitions 6Counterexamples 6Lenses 4Proof X-rays 5

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 3.1

    Flows, linearization, and Lyapunov stability

    Distinguish stability from attraction, use phase lines and linearization with correct hypotheses, and prove stability through Lyapunov functions.

  2. 3.2

    Variation of constants and forced nonlinear stability

    Prove quantitative linearization and forcing bounds, justify the nonlinear trapping argument, and distinguish decay, transient growth and persistent response.

  3. 3.3

    Planar periodic orbits and the Bendixson–Dulac criterion

    Use uniqueness, flux and a Dulac multiplier to exclude periodic trajectories, and examine what happens when the domain has a hole.

  4. 3.4

    LaSalle's invariance principle and long-time motion

    Use compact trapping and invariant subsets to deduce convergence when a Lyapunov derivative is only nonpositive.

  5. 3.5

    Scalar bifurcations and saddle-node equilibria

    Use the implicit function theorem and phase-line stability to analyze a nondegenerate saddle-node bifurcation.

Chapter 4 · 3 sections

Periodic linear systems

Periodic linear systems

Theorems 7 · Definitions 3Counterexamples 4Proof X-rays 3

Chapter outline →See this chapter on the web →Not yet indexed in the web

  1. 4.1

    Liouville's formula and periodic linear systems

    Track the determinant of a fundamental matrix, construct a complex Floquet representation, and classify stability from the monodromy matrix.

  2. 4.2

    Jordan chains and real solutions of linear systems

    Construct solutions of constant-coefficient systems when eigenvectors do not form a basis.

  3. 4.3

    Two-dimensional linear flows: trace, determinant and repeated roots

    Derive the real matrix exponential and classify planar linear flows without losing repeated-eigenvalue cases.

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details