Numerical Linear Algebra
Numerical linear algebra is the study of algorithms for solving problems such as finding solutions of linear systems and eigenvalues of matrices. Many real-life applications simplify to these scenarios and often involve millions of variables. We will analyze shortcomings of direct methods such as Gaussian Elimination, which theoretically produces the true solution but fails in practical applications. In contrast, iterative methods are often more practical and precise, and continually evolve with changing technology and our understanding of mathematics. Our study will include the First Order Richardson, Steepest Descent, and Conjugate Gradient algorithms for linear systems, and the power method for eigenvalue problems. (MATH 0200) 3 hrs. lect.