Each of the participants gives a 90 minute lecture which will be prepared together with an advisor on the basis of selected material from the literature. Training in presenting and communication of mathematical research.

In 2000, the editors of the journal "Computing in Science and Engineering" selected ten algorithms which appear of utmost importance in science and technology of the 20th century. In chronological order, the presented algorithms were the following: (1) Monte Carlo method (1946) (2) Simplex algorithm (1947) (3) Krylov subspace methods for the solution of systems of linear equations (1950) (4) Matrix factorizations for systems of linear equations (1951) (5) The first Fortran compiler (1957) (6) QR algorithm for the computation of eigenvalues (1959/61) (7) Quicksort algorithm (1962) (8) Fast Fourier Transform FFT (1965) (9) Integer relation detection algorithm (1977) (10)Fast Multiploe Method FMM (1987) The objective of this seminar is to consider some of these algorithms as well as their applications. Besides the mathematical analysis, a second focus is on the implementation. A very short overview on these algorithms can be found on the web under http://amath.colorado.edu/resources/archive/topten.pdf .

Continuation of seminar on the same topic from SS 2008Please consider the plagiarism guidelines of TU Wien when writing your seminar paper: Directive concerning the handling of plagiarism (PDF)

evaluation of seminar talk

Collected material from the relevant literature will be used as the basis for the seminar talks.