Instructor: Dr. Cal Ribbens, 632 McBryde, email@example.com, Office Hours: MWF 11:00-12:00.
Graduate Teaching Assistant: Satish Tadepalli, firstname.lastname@example.org, Office Hours: MW 2:00-3:30, 133 McBryde.
Prerequisite: Math 2214, 2224, and CS 1044 or equivalent.
Text: Numerical Mathematics and Computing, Cheney and Kincaid, Brooks/Cole, 1999.
Grading: homework (55%), midterm test 1 (12%), midterm test 2 (13%), final exam (15%), quizzes (5%). The due date and time will be clearly indicated on each assignment. See the quiz schedule for a list of quiz due dates and associated text book readings. Unexcused late assignments will be penalized 25% if turned in within one weekday of the due date/time. No assignment will be accepted beyond this one day limit.
Course goals and content. We will look at several famous problems and algorithms from the world of numerical computation. Major goals for the course include: an understanding of the significant issues characterizing numerical computation, an appreciation for the importance of algorithms in this area, a sense of how `real-world' problems are modeled and studied computationally, and an introduction to mathematical software and high performance computing. See the course schedule for a more detailed summary of topics and dates.
VPI & SU Honor Code applies: The work you turn in must be your own. The CS Department's ``Policy on koofers, old programs, cheating, and computer use'' applies to this course.
Note: if any student needs special accommodations because of a disability, please contact the instructor during the first week of classes.