CompSciWeek11

= Reading Assignment =
 * Numerical Recipes Pages 37-40
 * Feynman Learning Technique
 * Try and identify the most challenging missing concept and explain it to someone else!
 * Optional Additional reference: Basis and Singular Value lectures from codingthematrix.com

= Class 1 =
 * Tensor Manipulations - distance distributions in random point set exercise
 * pdist
 * histogram
 * Rodrigues' Rotation Formula - the preferred method when you have to work with an angle.
 * Matrix Multiplication
 * Basic linear algebra operations
 * Timing Strassen (see also Winograd)

Distribution Function Code
This illustrates dramatic simplifications that can be obtained by using tensors in numpy.

Rodrigues' formula code. This is for completeness, so you can generate 3D rotations given in axis-angle notation. It is definitely not for memorization.

= Class 2 =
 * Implicit solutions to linear algebraic equations
 * Least-squares fitting
 * Repetition for point sets - project out and re-fit
 * Review projection and orthogonality (see also Gram-Schmidt)
 * Solution by factorization + forward / reverse substitution
 * Minimization the hard way - nonlinear problems Optimize
 * Transcendental problem, 5th order polynomials, etc.
 * Geodesic paths via numerical optimization