For practically relevant problem sizes, classical one-level methods had already reached their limits and new hierarchical algorithms had to be developed in order to allow an efficient solution of even larger problems. Although the development of AMG goes back to the early eighties, it still provides one of the most efficient algebraic methods to solve corresponding problems. Compared to the original approach, however, several modifications and extensions have been introduced. In addition to the theoretical basics of AMG, we present a concrete algorithm in some detail and demonstrate its robustness and efficiency by means of a variety of typical applications. This program is preliminary and subject to modifications.
Times given here are only estimates, and are likely to change.
We will try to limit most schedule changes to within the given day. Participants and speakers should monitor this page and the bulletin board at the conference. Speakers should plan their talks to be at most 20 minutes. Program Chairs will adhere strictly to this schedule. We will have a slide projector and an overhead projector for speaker use.