Additionally, touch on a few other really useful methods for approximating solutions and decompositions, namely: partial pivoting, Householder reflections, Givens rotations, and of course, the Power Method.
Additionally, SVD.
We covered these pretty thoroughly in the Calculus 3 for Computer Science class here at Georgia Tech, and they're relatively easy to learn and are fairly useful.
Never having taken a Linear Algebra course, this is the math I've been working the hardest at learning, and absolutely agree it is indispensable for understanding many things (in my case, machine learning). Anything that makes this easier to learn or remember I welcome with open arms.
Without these basics, it becomes increasing difficult to grasp more advanced subjects such as (non)linear optimization, calculating computation complexity, numerical methods, root finding, game theory, and so on. The importance of calculus and combinatorics, as mentioned, should not be undermined either.
EDIT: How could I have forgotten about Eigen Decompositions! I never fully understood its significance until the last two years of college when all fragmented subjects I had learned (in terms of CS, Engineering, and Control Theory) finally fell into place.