Math 575: General Course Outline
Catalog Description

    575. Numerical Solution of Partial Differential Equations. The course goals consist of design, analysis and implementation of the most commonly used numerical methods for solutions to partial differential equations. We will discuss various discretization schemes such as finite difference, finite element and finite volume methods as well as iterative solvers such as multigrid methods. The course will maintain a balance between in-depth mathematical theories for algorithmic techniques and computer implementations and students will have the opportunity to study not only theoretical backgrounds in developing and understanding the numerical algorithms, but also a hands-on experience to implement the methods. Matlab (or scilab) will be used for the computational component of the course and a number of source codes will be provided to minimize the coding efforts from students.
Recommended Textbooks
    Dietrich Braess. Theory, fast solvers, and applications in solid mechanics, 3rd Ed., Cambridge University, 2007

    Note* : Most of lectures will be based on hand outs prepared by the instructor.
Assignments
    Homework assignments in the course consist of both theoretical and computational work. For the computational component, the students should use a language/environment that possesses high level data types so that the students spend more time working with algorithms and not worrying about the details of writing computer code. Matlab is a good choice. Fortran 77/90/95 and C++ with appropriate class libraries can also be used.
Prerequisite
    Advanced Calculus, Linear Algebra, and familiarity with differential equations.
Schedule of Lectures (From Professor Richard Falk's 575 Schedule Website)

Lecture

Reading
Topics
1 :
General course outline and Background for Programming projects.
Finite Difference methods for Laplace's equation.
2 :
Derivation of 5-point difference scheme and Discrete Maximum principle
3 :
Error analysis based on Stability and Consistency in Max norm.
4 :
Curved Domain and Error Analysis and Classical iterative solvers
5 :
Classical iterative solvers and Convergence criteria
6 :
Multigrid Methods and Preconditioning I
7 :
Multigrid Methods and Preconditioning II
Finite Element Methods for Elliptic equations
8:
Some Variational Problems for Elliptic boundary value problems
9:
Construction of finite element spaces in one-dimension: dimension of the spaces, basis functions, degrees of freedom
10:
Construction of Lagrange-type triangular finite element spaces in two dimensions: barycentric coordinates, mapping from the reference to the general triangle.
11:
Mesh Generation (Data Structues) and Efficient Finite Element Implementation
12:
Error estimates for finite element approximation schemes (L2 function and derivative errors) -- reduction to approximation theory
Mixed Finite Element for Saddle Point Problems
13:
Finite Element Methods for Saddle point problems
14:
A Mixed Finite Element Method for Poisson's Equations
15:
A Mixed Finite Element Method for the Stationary Stokes Equations
16:
Efficient Implementation of Mixed Finite Element Methods
Finite Difference Methods for Parabolic and Hyperbolic Problems
17:
Basic schemes for the heat equation
18:
Basic schemes for the wave and transport equations
19:
Consistency, stability, local trunction error, error estimates
Finite Element Methods for Parabolic and Hyperbolic Problems
20:
Basic schemes for the heat equation
21:
Basic schemes for the wave and transport equations
Finite Volume Methods
Comments

Topics listed above is temporary and may be modified.

Outline update: Y.J. Lee, 12/09

For more information, please contact , leeyoung@math.rutgers.edu.