1:00pm - 2:15pm TR, Thompson Hall 215 & 303
Instructor: Mei Q. Chen, Office: Thompson Hall 230
Phone: 953-7882 (office)
Course Outline, Lecture Notes Homework/Solutions, Projects, Exams/Solutions, MatLab Programs
(1) An introduction to numerical methods for approximation of differentiation and integration.
(2) An introduction to numerical methods for solving initial-value and boundary-value problems for ordinary differential equations.
(3) An introduction to numerical methods for solving systems of linear equations and finding eigenvalues and eigenvectors of real square matrices.
The mathematical software MatLab (GNU Octave) is used to implement all numerical methods.
Textbook: Online Lecture Notes.
Grading: It is based on homework assignments, projects, two hour exams, and a comprehensive final exam.
(1) Homework and Project: 35% of the final course grade.
Homework will be assigned weekly, usually on Wednesday and will be collected a week later for grading. Homework problems are designed to help you understand each numerical algorithm including its derivation, convergence and error analysis and uses in numerical differentiation or integration, solving differential equations, solving system of equations and finding eigenvalues and their associated eigenvectors. Some assignments are in project form. The mathematical software MatLab will be used to implement numerical algorithms. Many MatLab commands and programs can be run in GNU Octave which is free. If you do not have a student version of MatLab, you may want to down load a copy of GNU Octave on your personal computer or laptop so you can work on your assignments when you cannot get to the computer lab (Thompson 215).
I truly believe that completing each homework assignment is very important in learning process. You are encouraged to work on homework assignments in pairs or to discuss problems or work in progress with me or your classmates.
(2) Hour exams: 40% of the final course grade.
Two one-hour exams are tentatively scheduled for February 17, and March 29, respectively. It will be re-announced a week before each hour exam. Each hour exam covers the materials that have been discussed in class since last hour exam. Hour exams are designed to test your understanding of definitions, derivations of algorithms and skills of problem solving using these algorithms. You are allowed to bring 3x5 note cards with definitions, algorithms and theorems for exams (no examples please).
(3) Final exam: 25% of the final course grade.
The final exam will be comprehensive and similar to hour exams. The date and time will be determined later.
(4) Problem of Week: Two extra points will be added to the final exam score for each correct answer.
Grades (overall average):
A = 90% - 100%, B = 80% - 89%, C = 70% - 79%, D = 60% - 69%, F = 59% or lower
Office Hours: 2:30pm-3:30pm TR
ESP: 8:00-9:00pm MW
or by appointments, Thompson Hall 230