CS 421 Home Page (Fall 2000)

CS 421: Numerical Analysis (Fall 2000)

Handouts so far

Syllabus
Course requirements and grading policy
Gaussian elimination with partial pivoting in Matlab
Problem Set 1
Practice Prelim 1
Problem Set 1 Solutions
Prelim 1
Problem Set 2. Note correction: In question 4, use tril rather than triu.
Prelim 1 solutions
Problem Set 2 Solutions
Problem Set 3.
Problem Set 3 Solutions
Problem Set 4.
Problem Set 4 solutions.
Problem Set 5. Necessary m-files: threepath.m and makedistlist.m.
Prelim 2
Prelim 2 solutions
Problem Set 6
Problem Set 5 Solutions
Final Exam Syllabus / NA Q-exam Syllabus
Practice Final Exam

Some relevant websites

Course goal

To 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 location

Mondays, Wednesdays, Fridays, 1:25-2:15, Phillips 407.

Instructor

S. Vavasis
493 Rhodes Hall
255-9213
Email: vavasis@cs.cornell.edu
Office hours: Wed 2:30-4:00 and Thurs 2:30-4:00

Teaching Assistant

No teaching assistant

Administrative Support

Helene Croft
5146 Upson
255-9215
Email: croft@cs.cornell.edu

Text

M. Heath, Scientific Computing: An Introductory Survey , McGraw Hill, 1997.

Prerequisites

Linear algebra and multivariable calculus
Knowledge of programming

Stephen A. Vavasis, Computer Science Department, Cornell University, Ithaca, NY 14853, vavasis@cs.cornell.edu

handed out 8/25/00