In this lecture algorithms are investigated for solving eigenvalue problemswith large sparse matrices. Some of these eigensolvers have been developedonly in the last few years. They will be analyzed in theory and practice (by meansof MATLAB exercises).

Class participants study and make a 40 minute presentation (in English) on fundamental papers of Computational Science. A preliminary discussion of the talk (structure, content, methodology) with the responsible professor is required. The talk has to be given in a way that the other seminar participants can understand it and learn from it. Participation throughout the semester is mandatory.

Class participants study and make a 40 minute presentation (in English) on fundamental papers of Computational Science. A preliminary discussion of the talk (structure, content, methodology) with the responsible professor is required. The talk has to be given in a way that the other seminar participants can understand it and learn from it. Participation throughout the semester is mandatory.

Class participants study and make a 40 minute presentation (in English) on fundamental papers of Computational Science. A preliminary discussion of the talk (structure, content, methodology) with the responsible professor is required. The talk has to be given in a way that the other seminar participants can understand it and learn from it. Participation throughout the semester is mandatory.

Introduction to programming in Java. Procedural foundations of programming and outlook to object oriented programming. Variables, types, assignments, control structures (branch, loop), data structures, algorithms, line graphics, Java applets, graphical user interface. Writing small programs. Working with a professional programming environment (Eclipse).

Students will be presented an overview of computer organization anddesign. Using the assembly language MIPS the organization levels fromlogic gates to the data path are described. Additional topics fromtheoretical and practical computer science are Turing machines,information theory, computer networks and data bases.

In this lecture, basic terms of computer science are introduced.Emphasis is given on:The Internet as a data source for literature search and as a platform for publication.Introduction to MATLAB, a powerful tool for scientific computation and data processing.Introduction to relational database systems with exersices in Access.

The fundamental elements of imperative programming languages (variables, assignments,conditional statements, loops, procedures, pointers, recursion) are explained on the basis of C++.Simple data structures (lists, trees) and fundamental algorithms (searching, sorting)are discussed and implemented. Finally, the concept of object oriented programming is briefly explained.

This course is on programming for parallel computers. At a low levels, memory, vectors/pipelining, branch prediction, and independent functional units are studied. The next level is on shared memory machines using OpenMP. At the highest level on multiple independent processors, networks and MPI programming are studied. Numerical examples: FFT, linear algebra, and Monte-Carlo are studied.

The aim of this course is to show how numerical algorithms are implemented correctly and efficiently.We follow this agenda by discussing various important algorithms of numerical linear algebra.