Syllabus for
MAPL/CMSC 466, Intro to Numer. Anal., Section 0101, Spring 2000  Bo Li
MAPL/CMSC 466, Section 0101
Introduction to Numerical Analysis (I)
Spring, 2000
A Tentative Syllabus
 Textbook: Numerical Analysis, Sixth edition,
by Richard L. Burden and J. Douglas Faires, Brooks/Cole Publishing Company.
 Mathematical software and programming tool: MATLAB.
 Some references:
 Analysis of Numerical Methods, by Eugene Isaacson and Herbert B. Keller,
John Wiley & Sons, 1966. Dover Publications, Inc., 1994.
 An Introduction to Numerical Analysis, Second edition, by Kendall E. Atkinson,
John Wiley & Sons, 1989.
 Numerical Mathematics and Computing, Forth edition, by E. Ward Cheney and
David R. Kincaid, Brooks/Cole Publishing Company, 1999.
 Matrix Computation, Third edition, by Gene H. Golub and Charles F. Van Loan,
The Johns Hopkins University Press, 1996.
Chapters 
Sections 
Homework 
Projects 
Exams 
1 
1.2, 1.3 
Assignment 1 


2 
2.1, 2.2, 2.4, 2.5 
Assignment 3 


3 
3.1, 3.2, 3.4, 3.4 
Assignment 3 
Project 1 
Midterm exam 1 
4 
4.1, 4.2, 4.3 
Assignment 4 



4.4, 4.5, 4.7 
Assignment 5 
Project 2 

5 
5.1, 5.2, 5.3, 5.4 
Assignment 6 

Midterm exam 2 

5.6, 5.9, 5.10, 5.11 
Assignment 7 
Project 3 

6 
6.1, 6.2, 6.5, 6.6 
Assignment 8 

Final Exam 
Some Remarks
 In addition to the text,
material from instructor's notes will be occasionally added.
 There will be eight homework assignments with each of 100 points.
One of the homework assignments with the lowest grade will be dropped.
Note: no late homework will be accepted except a proved reasonable
excuse (such as hospitalization, a family emergency,
and a major religious activity) is provided.
 There will be three computer projects, each of 100 points,
on the following topics:
 interpolation and approximation;
 convergence rates of numerical integration rules;
 stability of numerical methods for initial value problems
of ordinary differential equations.
Each project should consist of MATLAB script, computational results
including tables and graphs,
and the detailed explanation of computational results.
 There will be two fiftyminute midterm exams and one twohour final exam.
All exams will be closebook and closenote. Simple calculators will be allowed in
these exams. The final exam will be cumulative.
Note: neither rescheduled nor makeup exams will be allowed
unless a proved reasonable excuse (such as hospitalization, a family emergency, and
a major religious activity) is provided.
 Suggested grading policy for future reference: homework
and computer projects  20%, midterm exam 1  20%,
midterm exam 2  20%, and final exam  40%.
The final grade will be curved.
Last updated by B. Li on May 6, 2000.