Lecture
This lecture covers the complexity of matrix computations, including the model of computation, stability of algorithms, and variants for structured matrices. It discusses algebraic complexity, known algorithms like Gaussian elimination, and iterative methods such as conjugate gradient. The instructor also explores accurate solutions to ill-conditioned problems and the impact of structured solvers on theoretical computer science.