Zahri-Edu › Math-University › Numerical Analysis

MATH 441

Numerical Methods for PDEs & SDEs

Finite differences, finite elements and domain decomposition for PDEs; Euler–Maruyama and Milstein schemes and strong/weak convergence for SDEs.

In preparation

The lecture notes for this course are being written. Below is the planned table of contents; chapters will be published one by one.

Table of contents

7 chapters · 23 sections

1

Finite Differences for Elliptic Problems

  1. 1.1Discrete Laplacian
  2. 1.2Consistency and convergence
  3. 1.3Solving the linear systems
2

Parabolic Problems

  1. 2.1Explicit and implicit schemes
  2. 2.2Crank–Nicolson
  3. 2.3Von Neumann stability
  4. 2.4CFL condition
3

Hyperbolic Problems

  1. 3.1Upwind schemes
  2. 3.2Lax–Wendroff
  3. 3.3Numerical dispersion and dissipation
4

Finite Element Method

  1. 4.1Weak formulation
  2. 4.2Galerkin method
  3. 4.3Piecewise-linear elements
  4. 4.4Error estimates
5

Domain Decomposition

  1. 5.1Schwarz alternating method
  2. 5.2Overlapping and non-overlapping methods
  3. 5.3Parallel implementation
6

Numerical Methods for SDEs

  1. 6.1Euler–Maruyama
  2. 6.2Milstein scheme
  3. 6.3Strong and weak convergence
  4. 6.4Monte Carlo and variance reduction
7

Stochastic PDEs

  1. 7.1Space–time white noise
  2. 7.2Discretisation of SPDEs