Zahri-Edu University › Numerical Analysis

MATH 342

Numerical Analysis II

Numerical methods for ODEs: one-step and multistep methods, Runge–Kutta, stiffness, stability and convergence, plus iterative linear solvers.

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

6 chapters · 18 sections

1

Initial Value Problems

  1. 1.1Euler's method
  2. 1.2Consistency, stability, convergence
  3. 1.3Taylor methods
2

Runge–Kutta Methods

  1. 2.1Explicit RK methods
  2. 2.2Order conditions and Butcher tableaux
  3. 2.3Adaptive step size
3

Multistep Methods

  1. 3.1Adams–Bashforth and Adams–Moulton
  2. 3.2Predictor–corrector
  3. 3.3BDF methods
  4. 3.4Zero-stability (Dahlquist)
4

Stiff Problems

  1. 4.1Stiffness
  2. 4.2A-stability and L-stability
  3. 4.3Implicit methods
5

Boundary Value Problems

  1. 5.1Shooting method
  2. 5.2Finite differences for BVPs
6

Iterative Solvers

  1. 6.1Convergence of stationary methods
  2. 6.2Conjugate gradient
  3. 6.3Newton for nonlinear systems