Next: About this document
Up: MA/CS 371 Numerical Algorithms
Previous: Course Grades
If you miss class, you are still responsible for the material covered in
the lecture. It would be wise to
borrow lecture notes from another student in the class.
No makeup lab work will be allowed unless an acceptable reason is
presented to the instructor well before the scheduled lab session.
The same policy, of course, holds for the midterm and final examinations.
CS 371 Course Outline
The following is a preliminary outline of the topics intended for
this course. It is subject to change and reordering of topics.
- Chapter 2. Computer Arithmetic and Errors
- Representation of Numbers
- Machine Constants
- Errors
- Chapter 3. Linear Systems of Equations
- Linear Systems
- Subroutine SGEFS
- Column-Oriented Algorithms
- Condition Number
- Error Analysis
- Chapter 4. Interpolation
- Polynomial Interpolation
- Basis Functions
- Evaluation of Polynomials
- Piecewise Linear Interpolation
- Piecewise Cubic Functions
- PCHIP Package
- Cubic Splines
- Chapter 5. Numerical Quadrature
- 1-D and Compound Quadrature Rules
- Change of Interval
- Gauss-Kronrod Quadrature Rules
- Adaptive Quadrature
- Subroutines Q1DA and QK15
- Data Integration
- Chapter 6. Linear Least Squares
- Normal Equations
- Orthogonal Factorizations
- Subroutine SQRLS
- Chapter 7. Nonlinear Equations
- Methods for Computing Real Roots
- Subroutine FZERO
- Solving Systems of Nonlinear Equations
- Chapter 8. Ordinary Differential Equations
- Stability of Equations
- Stiff Differential Equations
- Euler's Method
- Accuracy and Stability of Methods
- Order of Integration Method
- Implicit and Multi-step Methods
- Subroutine SDRIV2
sgreen@cs.utk.edu