IWR - Simulation and Optimization

Home | Research | Teaching | People | Grants | Open Positions | Internships | Conferences | Publications | Local | Links |
printer
SimOpt

Home
Research
Teaching
    [Seminar Iterative methods for sparse linear systems]
People
Grants
Open Positions
Internships
Conferences
Publications
Local
Links

Seminar Iterative methods for sparse linear systems

Semester: Winter 2016/17
Date: Wednesdays, 2:15-3:45 pm, kickoff meeting: 26th October
Location: Seminar room 11, Mathematikon
Organization: A. Potschka
Kontakt:

Contents

Linear systems of the form A x = b arise in almost all disciplines of scientific computing, in particular as subproblems for the solution of nonlinear problems. For large-scale systems, iterative methods are an attractive alternative to direct methods, which use decompostitions of the matrix A. These decompositions might be prohibitively expensive in terms of memory and computational effort due to the generation of fill-in, i.e., former zero entries of A turning non-zero in the decomposition. Iterative methods do not require (exact) decompositions of A.

Participants of this seminar will study fixed-point iterations, nonlinear acceleration through Krylov subspace methods, and aspects of preconditioning. Particular emphasis will be given on linear problems arising after discretization of partial differential equations or in optimization problems.

The seminar is based on the classic textbook by Y. Saad, Iterative Methods for sparse linear systems, PWS Publ., 1996.

An overview of the presentation topics and a time schedule can be found in the slides of the kickoff meeting.

Audience

Students of the MSc/Lehramt programs Mathematics and MSc Scientific Computing.

Prerequisites

Courses on Linear Algebra and Introductory Numerical Analysis.

Credit Points

For earning 6 CPs, the delivery of one presentation and presence at the other presentations are required.

[ Top | Home]

Last Modified By: Andreas Potschka
Last Update:2016-10-07
Webmaster: