Kevin Silberberg
  • Home
  • Photos
  • Study

Numerical Methods for the Solution of Differential Equations

AM 213B

This course introduces the numerical solutions of ordinary and partial differential equations (ODEs and PDEs). Focuses on the derivation of discrete solution methods for a variety of differential equations, and their stability and convergence. Also provides hands-on experience in implementing such numerical algorithms for the solution of engineering and scientific problems using MATLAB software. The class consists of lectures and hands-on programming sections. Basic mathematical knowledge of ODEs and PDEs is assumed, and a basic working knowledge of programming in MATLAB is expected.
Author

Javier Gonzalez-Rocha

Published

March 30, 2025

Course Notes

Title Description Author Date
Polynomial approximation of functions and derivatives Polynomial approximation theory for numerical methods in ODEs and PDEs, focusing on interpolation techniques (particularly Lagrangian interpolation), error analysis, and numerical differentiation methods including finite differences and pseudo-spectral methods using various grid point distributions like evenly-spaced and Gauss-Chebyshev-Lobatto nodes. Prof. Daniele Venturi May 25, 2024
Initial value problems for ODEs Initial value problems for ordinary differential equations (ODEs) that covers the theoretical foundations including Lipschitz continuity conditions for well-posedness, existence and uniqueness theorems for both single ODEs and systems of ODEs, numerical solution methods like Euler forward and Crank-Nicolson schemes, and applications to discretizing partial differential equations. Prof. Daniele Venturi Mar 28, 2022
Overview of numerical methods for ODEs Solving ordinary differential equations (ODEs), covering elementary methods like Euler and Crank-Nicolson, multistep methods such as Adams-Bashforth and Adams-Moulton, backward differentiation formulas (BDF), and Runge-Kutta methods, along with their derivations, stability properties, and implementation considerations. Prof. Daniele Venturi Apr 20, 2024
Consistency of numerical methods for ODEs Consistency for numerical methods solving ordinary differential equations (ODEs), showing that a numerical scheme is consistent if its local truncation error approaches zero as the time step approaches zero, and derives conditions and order analysis for various methods including linear multistep methods, Runge-Kutta methods, and backward differentiation formulas. Prof. Daniele Venturi Apr 20, 2024
Stability and convergence of numerical methods for ODEs Establishes the fundamental equivalence between convergence, consistency, and zero-stability for numerical methods solving ordinary differential equations, proving that a numerical scheme converges if and only if it is both consistent (truncation error approaches zero) and zero-stable (satisfies the root condition that all characteristic polynomial roots lie within or on the unit circle with simple multiplicity). Prof. Daniele Venturi Apr 18, 2024
Absolute stability of numerical methods for ODEs Analysis of absolute stability for numerical methods solving ordinary differential equations (ODEs), examining when numerical solutions decay to zero like their analytical counterparts by studying prototype linear systems and deriving stability conditions for various methods including Euler, Crank-Nicolson, linear multistep, and Runge-Kutta schemes. Prof. Daniele Venturi Apr 25, 2024
Boundary value problems for ODEs Boundary value problems (BVPs) for ordinary differential equations, demonstrating through examples like the second-order linear ODE with Dirichlet conditions how such problems can have unique solutions (as shown with Green functions and the maximum principle), infinite solutions, or no solutions depending on the boundary conditions and whether the equations are linear or nonlinear. Prof. Daniele Venturi Apr 30, 2024
Numerical methods to solve boundary value problems for ODEs Overview of numerical methods for solving boundary value problems (BVPs) for ordinary differential equations, covering three main approaches: the shooting method (which converts BVPs to initial value problems solved iteratively), finite difference methods (which discretize the domain and approximate derivatives), and weighted residual methods like Galerkin, collocation, and least squares (which use polynomial approximations and minimize residuals in different ways). Prof. Daniele Venturi May 20, 2024
Numerical methods for the heat equation Numerical methods for solving the heat equation and related partial differential equations, covering finite difference discretization schemes, stability analysis, time integration methods, and spectral approaches like Galerkin and collocation methods. Prof. Daniele Venturi Jun 12, 2024
Convergence analysis of finite difference methods for PDEs Lax-Richtmyer stability theory, which establishes that for consistent finite difference schemes approximating linear PDEs, stability (uniform boundedness of matrix powers) is both necessary and sufficient for convergence, and demonstrates how this can be analyzed using either matrix norms in physical space or Von-Neumann analysis in Fourier space for periodic boundary conditions. Prof. Daniele Venturi May 26, 2024
Finite-difference methods for the advection equation Stability and convergence of various finite-difference schemes (Euler-forward, Leapfrog, Lax-Friedrichs, and Lax-Wendroff) for solving the linear advection equation, analyzing their consistency, stability conditions (particularly the CFL condition), and convergence properties using Von-Neumann analysis and the method of characteristics. Prof. Daniele Venturi May 31, 2024
Fourier spectral methods Introduction to Fourier spectral methods for solving partial differential equations with periodic boundary conditions, covering trigonometric approximation theory, discrete Fourier expansions, and both Fourier-Galerkin and Fourier-collocation computational approaches. Prof. Daniele Venturi Jun 6, 2024
No matching items

Course Work

Title Author Date
Homework 0 Kevin Silberberg Apr 29, 2025
Homework 1 Kevin Silberberg Apr 18, 2025
Homework 2 Kevin Silberberg Apr 27, 2025
Homework 3 Kevin Silberberg May 7, 2025
Homework 4 Kevin Silberberg May 14, 2025
Homework 6 Kevin Silberberg May 28, 2025
Final Exam Kevin Silberberg Jun 10, 2025
No matching items

© Copyright 2025 Kevin Silberberg. Except where otherwise noted, all text and images licensed CC-BY-NC 4.0.