Who: Taught by Amit Chakrabarti; teaching assistant: Hao Luo
When: 2 hour, MWF 13:45-14:50, X-hr Th 13:00-13:50
Where: Sudikoff 214
Office hours: Amit: Mon & Fri 10:30-11:30 in Sudikoff 107; Hao: Tue 14:00-15:00 in Sudikoff 114
This course is about how to solve, computationally, linear algebra problems. It is not a course to introduce linear algebra (you are expected to already have some background in this — see prerequisites). However, we will review this material as needed and you might be asked to demonstrate understanding of this. It is also not a course on the applications of linear algebra: for that, see CS 36/136. Rather, it is on how to solve those linear algebra problems that you get in your applications: we will study the algorithms of linear algebra. Or, to quote one of the authors of our textbook (see the Appendix)
"Numerical analysis is the study of algorithms for the problems of continuous mathematics."
Please read the Appendix of the text book before the second class for a much more insightful and thorough discussion about what this course is about.
This is a rough and tentative syllabus, essentially copied from the textbook.
Workload and Grading:
In general, homework will be due each Wednesday before class. You may submit by either bringing it to me (Amit) in class, or putting it in my mailbox.
References, for further reading:
Last updated Oct 29 2010