M393D / CAM393D Iterative Methods and Fast Algorithms

Course information:
Course description:

This course contains two parts. The first part is about iterative methods for solving linear and nonlinear equations. We will cover the following topics: classical iterative methods, Krylov subspace iterative methods, preconditioners, multigrid, domain decomposition, basic convex optimization, and adjoint method.

In the second part, we will focus on the study of fast algorithms for applying structured linear operators. Topics in this part include fast Fourier transform, nonuniform fast Fourier transform, fast multipole method, directional multilevel algorithm, butterfly algorithm, and random projection method.


Textbook:

Required:Other references:
Prerequisite and degree relevance:

Grading:

Homeworks:

Notes:

Disabilities:

The University of Texas at Austin provides upon request appropriate academic accommodations for qualified students with disabilities. For more information, contact the Office of the Dean of Students at 471-6259, 471-4641 TTY.
Policy on scholastic dishonesty:

Students who violate university rules on scholastic dishonesty are subject to disciplinary penalties, including the possibility of failing in the course and/or dismissal from the University. Since such dishonesty harms the individual, all students, and the integrity of the University, policies on scholastic dishonesty will be strictly enforced. For further infomation, please visit the Student Judicial Services web site at http://deanofstudents.utexas.edu/.