CSCI 4100
NUMERICAL METHODS
SPRING 2001
TIME: Tuesdays and Thursdays, 1:00 - 2:30 PM
LOCATION: Smith 303
INSTRUCTOR: Dr. Fay A. Riddle
OFFICE: Smith 305
OFFICE PHONE: 880-8279
OFFICE HOURS: Mon./Wed./Fri. 9-9:35 AM, Tues./Thurs. 11:15-11:55 AM. Available by appointment at other times.
CATALOG COURSE DESCRIPTION: Introduction to numerical methods with computer solution. Taylor series, finite difference calculus, interpolation, roots of equations, solutions of linear systems of equation, matrix inversion, least squares, numerical integration. Prerequisite: MATH 2222 or consent of instructor.
COURSE OBJECTIVES: The student will exhibit an understanding of the concepts in numerical methods and be able to apply them in solving problems primarily with the use of the computer.
TECHNOLOGY REQUIREMENTS: All correspondence (assignments, test information, etc.) will be via e-mail. Each student will be expected to provide an e-mail address to the instructor by the end of the first week of class. Students will be expected to check their e-mail on a daily basis. Cell phones and audible pagers must be turned off in class unless there is a prior arrangement with the instructor.
ATTENDANCE REQUIREMENTS: The Bulletin says, "A student is expected to attend all classes, including labs, for all courses for which he/she is registered. The student is solely responsible for accounting to his/her instructor for any absence. An instructor may recommend that the Academic Dean drop from class with grade of W or U any student whose absences are interfering with satisfactory performance in the course."
Each student is allowed two unexcused absences; any other absence must be excused by the instructor. The instructor reserves to right to assign an F to any student with too many absences. Your daily grade is influenced by your attendance.
The student is responsible for all material covered, assignments and test dates announced, and any other announcements made on the day the student is absent. Makeup tests are not automatic; they may only be expected under unusual, documentable circumstances (and at the discretion of the instructor) and, in such a situation, normally only if arranged with the instructor in advance of the test or exam. Absence from class is not an excuse for late or no homework.
COURSE REQUIREMENTS:
READING ASSIGNMENTS: The instructor will assume that the student reads those sections of the text corresponding to what is covered in class, as well as any assigned readings.
HOMEWORK ASSIGNMENTS: Homework assignments will be assigned regularly and should be turned in by class time on the date specified. Five points will be deducted if submitted on the due date after class. Ten points per day for the first two days of lateness will be deducted; after two days, the assignment may not be accepted.
TESTS: There will be 3 tests (tentatively scheduled March 1, March 20, and April 19) and a final exam on May 15 at 8.
GRADING POLICIES AND PROCEDURES: The homework assignments will count a total of 15% of the course grade. When two or more students submit similar homework or a student does well on a problem submitted as homework but poorly on related material on a test, the instructor reserves the right to assign a grade of zero to that homework and to do whatever is necessary to ensure that the students are having the experience of doing their own homework, including reporting the incident to the Honor Council.
The daily grade will be computed as follows: 0-2 unexcused absences: 5 points; 3 unexcused absences: 3 points; 4 unexcused absences: 1 point; 5 unexcused absences: 0 points; 6-7 unexcused absences: 1 point deducted from your grade; 8-9 unexcused absences: 2 points deducted from your grade; etc.
Each test will count 20% of the course grade, the exam 20%, and the daily grade 5%. The grading scale will be no higher than the following: 90-100 A, 80-89 B, 70-79 C, 60-69 D, 0-59 F.
TEXTBOOK: Numerical Mathematics and Computing (Fourth Edition) by Cheney and Kincaid.
COURSE OUTLINE:
Chapter 1: Introduction.
Chapter 2: Numerical Representation and Errors.
Chapter 3: Locating Roots of Equations.
Chapter 4: Interpolation and Numerical Differentiation.
Chapter 5: Numerical Integration.
Chapter 6: Systems of Linear Equations.
Chapter 7: Approximation by Spline Functions.
Chapter 10: Smoothing of Data and the Method of Least Squares.
Chapter 11: Monte Carlo Methods and Simulation.
Chapter 15: Linear Programming.
