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, Hollister 401.InstructorS. Vavasis493 Rhodes Hall 255-9213 Email: vavasis@cs.cornell.edu Office hours: Tues 2:30-4:00 and Thurs 1:30-3:00. Note change in Thursday office hours, effective in the week of 10/28/02. Teaching AssistantNo teaching assistantTextM. Heath, Scientific Computing: An Introductory Survey, 2nd Edition , McGraw Hill, 2002.
PrerequisitesLinear algebra and multivariable calculusKnowledge of programming NoteThis course is considered an honors version of CS 322. CS major 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, vavasis@cs.cornell.edu
handed out 8/30/02