Math 574: General Course Outline
Catalog Description

    574. Numerical Analysis II. This is the second part, independent of the first, of a general survey of the basic topics in numerical analysis. We shall study and analyze a number of numerical algorithms for approximating the solution of a variety of generic problems which occur in applications. The course will begin with the description of the solution methods for the linear system of equations. Starting from the direct methods based on the Gaussian elimination, various classical iterative methods such as Gauss-Seidel, Jacobi and SOR will be discussed. If time permits, we shall also study more advanced iterative methods, multigrid methods in this course, which is known to be most efficient iterative methods until now. Large portion of the course will be devoted to numerical techniques for optimization, matrix eigenvalues and eigenvectors and numerical solutions to nonlinear equations. As a separate but important technique, finite difference and finite element discretization methods for simple partial differential equations such as Poisson's equations and Heat equations will be studied at the end of the course. Particular emphasis in this course is to interconnect the theorectical results and computer implementation. Students will study not only the solid theoretical backgrounds in developing and understanding the algorithms but also a hands-on experience to implement the methods.
Recommended Textbooks
    (1) A. Quarteroni, R. Sacco, and F. Saleri Numerical Mathematics, 2nd Ed., Springer, 2004
    (2) K. Atkinson An Introduction to Numerical Analysis, 2nd Ed., Wiley, 1989

    Note* : Most of lectures will be based on hand outs prepared by the instructor. Students are suggested to have one of the aforementioned textbooks depending on their preference.
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. Numerical Analysis 01:642:573 is desirable but not required.
Schedule of Lectures

Lecture

Reading
Topics
1 :
General course outline and Background for Programming projects.
Numerical Solution of Systems of Linear Equations.
2 :
Ch 3.3 in Ref. (1)
Gaussian Elimination
3 :
Ch. 3.4 in Ref. (1)
Choleski Decomposition and Pivoting
4 :
Ch. 3.1 and Ch. 4.1 in Ref. (1)
Perturbation theory for linear systems of equations
5 :
Ch. 4.2 in Ref. (1)
Stationary iterative method, Gauss-Seidel, Jacobi and SOR
6 :
Ch. 4.2 and 4.3.3 in Ref. (1)
Convergence of Stationary Iterative method
7 :
Ch. 4.3.4 in Ref. (1)
Steepest Descent and Conjugate Gradient Methods
8 :
Ch. 4.3.5 in Ref. (1)
Convergence of Conjugate Gradient Methods and Preconditioning
9:
Note on Iterative method at Sakai
Nonsymmetric systems and Least Square methods
Matrix Eigenvalues and Eigenvectors
10:
Lecture Note 6 by Prof. Falk
Motivation of Eigenvalue and Eigenvector computations and Preliminaries
11:
Lecture Note 7 by Prof. Falk
Numerical Methods for Eigenvalues and Eigenvectors
12:
Lecture Note 8/9 by Prof. Falk
QR algorithms
13:
Reivew for Midterm
14:
Midterm
Solution of Nonliear (Systems of) Equations and Optimizations
15:
Lecture notes by Professors Falk and Arnold
Bisection, False Position, Secant, Newton's method and Fixed point iterations
16:
Lecture notes by Professors Falk and Arnold
Newton and Quasi-Newton methods.
17:
Lecture notes by Professors Falk and Arnold
Quasi-Newton methods (Broyden's methods) and its convergence
18:
Lecture notes by Professors Falk and Arnold
Minimization methods : Steepest descent and Levenberg-Marguardt methods
Finite Difference Methods
19:
Lecture notes by Professor Arnold
Two-Point Boundary Problems, FDM for one, two and three dimensions
20:
Lecture notes by Professors Arnold and Falk
Analysis of Finite Difference Methods
21:
Lecture notes by Professors Arnold and Falk
Finite Difference Method for Curved boundary
22:
Lecture notes by Professors Arnold and Falk
Finite Difference Methods for Parabolic Equations
23:
Lecture notes by Professors Arnold and Falk
Stability Analysis and Convergence of FDM for Parabolic Equations
24:
FDM for General 2nd Order Evolutionary PDEs
Finite Element Methods
25:
Lecture notes by Professors Arnold and Falk
Introduction to Finite Element Methods
26:
Lecture note by Professor Arnold
Finite Element Method I
27:
Lecture note by Professor Arnold
Finite Element Method II
28:
Review for Final
Comments

Topics listed above is temporary and may be modified.

Outline update: Y.J. Lee, 9/07

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