CS 621 Home Page (Fall 2001)

CS 621: Matrix Computations (Fall 2001)

Handouts so far

Syllabus
Course requirements and grading policy
Problem set 1, due 9/17/01
Problem set 1 solutions
Problem set 2, due 10/1/01
Practice prelim 1
Prelim 1
Problem Set 2 solutions
Prelim 1 solutions
Problem set 3 (with correction to problem 1)
Problem set 3 solutions
Problem set 4 Note: you may find rnd24.m useful for question 4.
Problem set 5
Problem set 4 solutions
Prelim 2
Problem set 5 solutions
Problem set 6
Problem set 6 solutions
Final exam. Note: the reference for Q1 on PS6 and Q1 of the final is: B. Parlett and I. Dhillon, Fernando's solution to Wilkinson's problem: an application of double factorization, Linear Algebra and its Applications, 267 (1998) 247-279.

Some relevant websites

Course goal

To learn principles of matrix computations, that is, algorithms for linear algebra. Algorithms will be designed and then analyzed for efficiency and accuracy. General principles of numerical analysis will also be covered.

Course location

Mondays, Wednesdays, Fridays, 11:15-12:05, Upson 111.

Instructor

S. Vavasis
493 Rhodes Hall (Mailing address: 4130 Upson Hall)
255-9213
Email: vavasis@cs.cornell.edu
Office hours: Wed and Thursday, 2:30-4. (Note change to office hours effective 9/7/01).

No teaching assistant

Text

Golub and Van Loan, Matrix Computations, 3d edition, or
Trefethen and Bau, Numerical Linear Algebra

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/31/2001