Still lurking here?
To my students: the class is over, but you can peruse the course evaluations. You can also try to locate yourself in this video from the last day of our class (Wednesday April 30th, 2014): what we do in this life echoes on YouTube.
To other students: you must be cramming for an upcoming exam. First cut your teeth on the homework and practice problems, and use the solutions only if necessary. Once you’re confident, go straight to the exams. My students had 50 minutes for each midterm, but you should really try to get each one done within 40 minutes (all at once, no snack breaks!). Textbooks and calculators were neither necessary nor allowed. All the best!
To instructors: perhaps you’re organising your own course, or a single lecture. The lecture notes are the hand-written, scanned notes I used for each class. If I were teaching the course again, I would almost certainly move Lecture 11 (graphs and adjacency matrices) later in the semester and Lecture 29 (Jordan forms) earlier. Good luck!
Lecture notes
Hand-written and scanned; use them as an outline for reviewing the material.
| No. | Topic | Notes |
|---|---|---|
| Matrices, vectors and their geometry | ||
| 01 | The algebra and geometry of linear equations | |
| 02 | Counting solutions of linear systems | |
| 03 | Enter the matrix | |
| 04 | Understanding inverses | |
| 05 | What does my matrix do? | |
| 06 | Linear combinations and vector spaces | |
| 07 | Null space, column space and dimension-counting | |
| 08 | Linear independence, spans and basis | |
| 09 | The fundamental theorem of linear algebra | |
| 10 | Understanding the four fundamental spaces | |
| 11 | Graphs and their adjacency matrices | |
| Orthogonality and eigen-decomposition | ||
| 12 | Orthogonality | |
| 13 | Projections | |
| 14 | Least squares | |
| 15 | Orthogonal matrices and Gram–Schmidt | |
| 16 | Determinants | |
| 17 | More determinants | |
| 18 | Eigenstuff | |
| 19 | Diagonalization | |
| 20 | Linear differential systems | |
| 21 | The spectral theorem | |
| 22 | The singular value decomposition | |
| Applications and advanced topics | ||
| 23 | Markov chains | |
| 24 | The Perron–Frobenius theorem | |
| 25 | Linear programming | |
| 26 | The simplex method | |
| 27 | The Fourier transform | |
| 28 | The fast Fourier transform | |
| 29 | The Jordan form | |
Homework
Solutions to Homeworks 1–5 were written by the TA, Hua Qiang. Homework 8 was never collected: it is meant for final exam practice.
- 1Collected Fri 1/31
- 2Collected Mon 2/10
- 3Collected Mon 2/24
- 4Collected Wed 3/19
- 5Collected Wed 3/26
- 6Collected Wed 4/09
- 7Collected Fri 4/25
- 8Final exam practice
- PPractice problems for the first midterm
Most problems in Dr. Kazdan’s first midterm from Spring 2013 should also be accessible; his exam says kernel for null space and image for column space.
Exams
- E1First exam, Wed Feb 19th
- E2Second exam, Wed Apr 2nd
See also Dr. Jerry Kazdan’s exam material from Spring 2013, at the bottom of this page.
About the course
We met on Mondays, Wednesdays and Fridays from 11 AM to 12 PM in Room A4 of the DRL building. The semester had three units: the algebra, geometry and mechanics of matrix–vector operations; eigen-decomposition of square matrices; and several important advanced topics, including modern applications of linear algebra to ranking, image compression and so forth.
The prerequisite was an introductory linear algebra course (Math 240 at Penn). The best way to check whether you are ready for this material is to try as many old Math 240 final exam problems as possible.
The main textbook was Gilbert Strang’s Introduction to Linear Algebra (4th edition), though every homework problem was written out in full, so you never need a copy. As a reference I recommend David Poole’s example-filled Linear Algebra: A Modern Introduction. A free online textbook, taking a slightly more abstract approach, is Sergei Treil’s Linear Algebra Done Wrong; I strongly urge you not to judge it by its title!
Grading
| Regular homework assignments | 20% |
| Two in-class midterms | 40% |
| Giant Final of Doom | 40% |
Here’s a graph (no, not the kind with nodes and edges) of how the class did:
Regardless of how you feel about your grade, or what you will retain in the years (months? days??) to come, keep in mind that the material we covered, especially near the end, is quite hard-core and current. Perron–Frobenius theory underlies almost all modern search engine algorithms. SVDs are used regularly for image compression. Billions of dollars are being funnelled into research which hopes to produce even faster Fourier transforms. Entire books are dedicated to the manifold applications of linear optimisation in economics. You’ve seen some things this semester. And hopefully, they’ve seen you too.
I taught the course as a postdoc at Penn, with Hua Qiang as TA. The Penn Math Department gave me a good teaching award for it.