Skip to content

MATH3240

Numerical Methods for Differential Equations

Time stepping for initial value problems, Runge–Kutta and multistep methods, stiffness, finite differences, shooting for boundary value problems, advection schemes and variational methods.

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

Your progress

0/ 28 sections marked complete

Next section: 1.1 Euler's method: consistency and global error

Completion marks are saved in this browser.

This course in the web

In the MATH3240 notes

Theorem cards
56
Definitions
44
Counterexamples
27
Concept lenses
21
Histories of ideas
0
Proof X-rays
28

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 56 · Definitions 44 · Counterexamples 27 · Concept lenses 21 · Proof X-rays 28

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 · 1 section

Initial-value problems

Derive Euler's recurrence and distinguish exact-start defects, propagated perturbations and finite-time global error.

Theorems 2 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 1

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

  1. 1.1

    Euler's method: consistency and global error

    Derive Euler's recurrence and distinguish exact-start defects, propagated perturbations and finite-time global error.

Chapter 2 · 5 sections

Time integration

Compute stability functions, prove Heun's order, and compare decay, stiffness and implicit solvability.

Theorems 8 · Definitions 7Counterexamples 4Lenses 3Proof X-rays 5

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

  1. 2.1

    Stability, stiffness and Runge–Kutta time stepping

    Compute stability functions, prove Heun's order, and compare decay, stiffness and implicit solvability.

  2. 2.2

    Runge–Kutta order, RK4 and embedded error control

    Derive nonlinear order conditions through degree four, verify RK4, and interpret embedded and step-doubling local error indicators.

  3. 2.3

    An adaptive Euler algorithm with step doubling

    Specify a finite adaptive Euler controller and distinguish its step-doubling indicator from a rigorous error bound.

  4. 2.4

    Locating events inside a numerical step

    Bracket an interpolated event and distinguish bisection error from exact-event error.

  5. 2.5

    Event resets and numerical restart

    Track a transverse event through a reset and bound restart error.

Chapter 3 · 7 sections

Finite differences

Prove heat-scheme nonexpansiveness and a discrete elliptic maximum principle, with explicit boundary and residual calculations.

Theorems 14 · Definitions 13Counterexamples 7Lenses 6Proof X-rays 7

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

  1. 3.1

    Finite differences for heat and elliptic equations

    Prove heat-scheme nonexpansiveness and a discrete elliptic maximum principle, with explicit boundary and residual calculations.

  2. 3.2

    Two-dimensional grids: boundaries, maximum principles and energy

    Prove two-dimensional Poisson comparison and backward Euler heat convergence, assemble a four-node problem, and distinguish energy from positivity.

  3. 3.3

    Richardson extrapolation for a boundary-value grid

    Prove an even-power error expansion and use nested grids to cancel the leading error.

  4. 3.4

    Convection–diffusion: stability and boundary layers

    Compare centered and upwind differences for a two-point convection–diffusion problem, proving a discrete comparison bound and tracking the loss of monotonicity.

  5. 3.5

    Two-dimensional Poisson grids and Jacobi iteration

    Prove a discrete maximum principle and error bound for the five-point stencil, and analyze Jacobi convergence.

  6. 3.6

    Gauss–Seidel and relaxation for a Poisson system

    Construct sequential sweeps and prove convergence by following the discrete energy.

  7. 3.7

    Crank–Nicolson: second-order error and time-correct boundaries

    Prove a finite-time parabolic error bound, including compatible initial data and both endpoint-time boundary contributions.

Chapter 4 · 3 sections

Multistep methods

Derive AB2, trapezoidal AM2 and BDF2, prove root-condition stability and finite-time convergence, and account for starts and inexact solves.

Theorems 6 · Definitions 3Counterexamples 3Lenses 2Proof X-rays 3

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

  1. 4.1

    Linear multistep methods: consistency, roots and convergence

    Derive AB2, trapezoidal AM2 and BDF2, prove root-condition stability and finite-time convergence, and account for starts and inexact solves.

  2. 4.2

    Absolute stability of two-step methods

    Derive the negative-real stability interval of AB2 and prove A-stability of BDF2, while distinguishing stability from accuracy.

  3. 4.3

    A predictor–corrector and its actual stability

    Derive and analyze one AB2 prediction followed by one trapezoidal correction.

Chapter 5 · 4 sections

Variational methods

Prove weak solvability, Galerkin best approximation and interval finite-element error bounds, with triangle assembly and sine spectral alternatives.

Theorems 10 · Definitions 8Counterexamples 4Lenses 4Proof X-rays 4

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

  1. 5.1

    Weak formulations, finite elements and spectral approximation

    Prove weak solvability, Galerkin best approximation and interval finite-element error bounds, with triangle assembly and sine spectral alternatives.

  2. 5.4

    Residual error bounds on an interval

    Prove an interval FEM residual upper bound and separate discretization, algebraic and data errors.

  3. 5.5

    Triangular finite elements: approximation, assembly and error

    Develop a conforming two-dimensional Galerkin error proof with named analytical prerequisites, affine scaling and a complete five-node assembly.

  4. 5.6

    Fourier collocation: derivatives, heat flow and aliasing

    Build a periodic spectral derivative from grid samples and distinguish interpolation, stability and unresolved frequencies.

Chapter 6 · 1 section

6. Advection schemes

Study upwind transport, CFL stability and smooth-solution error.

Theorems 2 · Definitions 1Counterexamples 1Proof X-rays 1

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

  1. 6.1

    Upwind transport and the CFL condition

    Prove periodic upwind stability and a finite-time error bound for smooth advection.

Chapter 9 · 2 sections

Boundary-value shooting

Turn a linear two-point problem into initial-value problems, prove a convergence bound, and diagnose resonance.

Theorems 4 · Definitions 2Counterexamples 2Lenses 1Proof X-rays 2

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

  1. 9.1

    Linear shooting: boundary matching and conditioning

    Turn a linear two-point problem into initial-value problems, prove a convergence bound, and diagnose resonance.

  2. 9.2

    Nonlinear shooting and endpoint sensitivity

    Use a variational equation to solve and understand nonlinear two-point boundary problems.

Chapter 10 · 1 section

Nonlinear implicit solves

Prove a local Newton guarantee, solve nonlinear implicit steps, and budget algebraic residuals separately from discretization error.

Theorems 2Counterexamples 1Lenses 1Proof X-rays 1

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

  1. 10.1

    Newton solves inside implicit time steps

    Prove a local Newton guarantee, solve nonlinear implicit steps, and budget algebraic residuals separately from discretization error.

Chapter 11 · 1 section

Derivative boundary methods

Build an actual boundary discretization, prove its compatibility and coercivity properties, and obtain second-order error from integrated residuals.

Theorems 2 · Definitions 2Counterexamples 1Lenses 1Proof X-rays 1

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

  1. 11.1

    Neumann and Robin grids: weighted energy and convergence

    Build an actual boundary discretization, prove its compatibility and coercivity properties, and obtain second-order error from integrated residuals.

Chapter 12 · 3 sections

Hyperbolic grid methods

Prove nonperiodic upwind error estimates, distinguish nodal and cell-average data, and account for the incoming flux residual in the correct norm.

Theorems 6 · Definitions 6Counterexamples 3Lenses 2Proof X-rays 3

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

  1. 12.1

    Waves: leapfrog, coercive energy and finite-time error

    Derive a proper second-order start, conserve a discrete cross-time energy, and prove convergence under a uniform strict CFL margin.

  2. 12.2

    Burgers' equation: conservation, numerical flux and entropy

    Construct a conservative finite-volume update, prove its maximum principle, and see why shocks need an entropy condition.

  3. 12.3

    Inflow transport and finite-volume cell-average convergence

    Prove nonperiodic upwind error estimates, distinguish nodal and cell-average data, and account for the incoming flux residual in the correct norm.

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