CS 621: Matrix Computations (Fall 1997)

Handouts so far

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, 1:25-2:15, Upson 205.

Instructor

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

Teaching Assistant

Divakar Viswanath
4161 Upson Hall
255-6835
Email: divakar@cs.cornell.edu
Office hours: Fri 11:30-1:00

Administrative Support

Helene Croft
726 Rhodes
255-9215
Email: croft@cs.cornell.edu

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/29/97