BILKENT UNIVERSITY
CS 511 Iterative Methods for Sparse Linear Systems, Spring '99
(10:40-13:30 Th, EA521)


Dr. Tugrul Dayar
Department of Computer Engineering and Information Science (521 Engineering Building)
e-mail: tugrul@cs.bilkent.edu.tr
Office Hours: (14:40-15:30 T, 14:40-15:30 Th (or if this is not possible, by appointment from 1981)

Course Description:
Background in linear algebra, sparse matrices, basic iterative methods, projection methods, Krylov subspace methods, methods related to the normal equations, preconditioned iterations, preconditioning techniques.
Prerequisites:
See me.

Course Objectives:
The purpose of this course is to acquaint you with the state-of-the-art solution techniques for large linear systems and develop the necessary background so that you can carry out research in related fields.
References:
  1. O. Axelsson, Iterative Solution Methods,
    Cambridge University Press, Cambridge, England, 1994. [QA297.8.A94 1994]
  2. R. Barrett et al., Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods,
    SIAM Press, Philadelphia, PA, 1994. [QA297.8.T45 1994]
  3. J. W. Demmel, Applied Numerical Linear Algebra,
    SIAM Press, Philadelphia, PA, 1998.
  4. G. H. Golub and C. F. van Loan, Matrix Computations,
    Johns Hopkins University Press, Baltimore, MD, 1996. [QA188.G65 1996]
  5. A. Greenbaum, Iterative Methods for Solving Linear Systems,
    SIAM Press, Philadelphia, PA, 1997. [QA297.8.G74 1997]
  6. Y. Saad, Iterative Methods for Sparse Linear Systems,
    PWS Publishing Company, Boston, MA, 1996. [QA188.S17 1996]
  7. G. W. Stewart, Matrix Algorithms, Volume I: Basic Decompositions,
    SIAM Press, Philadelphia, PA, 1998.
  8. L. N. Trefethen and D. Bau, III, Numerical Linear Algebra,
    SIAM Press, Philadelphia, PA, 1997. [QA184.T74 1997]

Course Outline: Note: In order to use matlab, which is available in the bcc domain, please check the CS 471 course home page. Also there is a wealth of software at netlib.

Grading:

Scores