Check your grades on CMS
## Handouts so far- Syllabus
- Course requirements and grading policy
- Problem Set 1
- Practice Prelim 1 (web only)
- Problem Set 2
- Problem Set 1 Solutions (in-class only)
- Prelim 1
- Prelim 1 Solutions (in-class only)
- Problem Set 3. Problem Set 3 image page
- Problem Set 2 solutions (in-class only)
- Problem Set 4. Problem Set 4 dat file
- Problem Set 3 solutions (in-class only)
- Prelim 2
- Problem Set 5. M-files for question 4: newton.m, unitsquare_meshgen.m, minsurf_wrapper.m. Example run of minsurf.m: randomfgh.txt.
- Problem Set 4 solutions (in-class only)
- Problem Set 6
- Practice Final (web only)
- Final Exam Syllabus (web only)
## 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, Upson 111.## InstructorS. Vavasis493 Rhodes Hall 255-9213 Email: vavasis@cs.cornell.edu Office hours: Tues 2:00-3:30 and Thurs 1:30-3:00. ## Teaching AssistantJaime Barrera657 Rhodes Email: jhb9149@cam.cornell.edu Office hours: Wed., 2:30-3:30 and Thurs., 3:00-4:00. ## TextM. 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 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, vavasis@cs.cornell.edu

handed out 8/26/05