Fall 2012

                    CS 383C / CSE 383C / M 383E / SSC 393C
                       "Numerical Analysis: Linear Algebra"
                               TTh 9:30-11am
                                WRW 113

                            Prof. Inderjit Dhillon


        Matrix Computations arise in a varied number of applications, such as,
        quantum chemistry computations, statistics, economics, data mining,
        etc. This first year graduate course focuses on some of the
        fundamental computations that occur in these applications.
        The standard problems whose numerical solutions we will study
        are (i) systems of linear equations, (ii) least squares problems,
        (iii) eigenvalue problems as well as SVD computations. We will also
        learn basic principles applicable to a variety of numerical
        problems and apply them to the standard problems. These principles
        include (i) matrix factorizations, (ii) perturbation theory and
        condition numbers, (iii) effects of roundoff error on algorithms
        and (iv) analysis of the speed of algorithms.

        Pre-requisites: Graduate standing; CS 367 or M 368K; and M 340L, M 341; or
        consent of instructor. The pre-requisites are meant to ensure that students
        taking this course have a good knowledge of undergraduate linear algebra,
        computer programming, and some mathematical sophistication (students should
        have some experience in writing mathematical proofs).

        For detailed course information see:
           http://www.cs.utexas.edu/users/inderjit/courses/cs383c