Check your grades on CMS
Handouts so far
Some relevant websites
Course goalTo learn principles of numerical analysis, that is, algorithms for problems arising in science and engineering involving real number computation. Algorithms will be designed and then analyzed for efficiency and accuracy.
Course locationMondays, Wednesdays, Fridays, 1:25-2:15, Bard 140
493 Rhodes Hall
Office hours: Tues 2:30-4:00 and Thurs 1:30-3:00.
Teaching AssistantMuthuramakrishnan Venkitasubramaniam (Muthu)
Office hours: Wed 4:00-5:00 and Fri 4:00-5:00
TextM. Heath, Scientific Computing: An Introductory Survey, 2nd Edition , McGraw Hill, 2002.
PrerequisitesLinear algebra and multivariable calculus
Knowledge of programming
NoteThis course is considered an honors version of CS 322. CS majors may use only one of CS 321, CS 322, CS 421 toward their degree.
Stephen A. Vavasis, Computer Science Department, Cornell University, Ithaca, NY 14853, firstname.lastname@example.org
handed out 8/27/04