Difference between revisions of "Algorithms of Scientific Computing II - Winter 11"

From Sccswiki
Jump to navigation Jump to search
Line 16: Line 16:
  
 
* In winter term 2011/12, this lecture will be held by [[Michael Bader]] with a focus on algorithms in high performance computing (and scientific computing).
 
* In winter term 2011/12, this lecture will be held by [[Michael Bader]] with a focus on algorithms in high performance computing (and scientific computing).
* * The '''first lecture''' will be on '''Oct 26'''
+
* The '''first lecture''' will be on '''Oct 26'''
 +
* The '''first tutorial''' will be on '''Nov 7'''
 +
* The lecture on Wednesday, Nov 2, will be skipped due to the student's general assembly
  
 
<!--
 
<!--

Revision as of 17:45, 27 October 2011

Term
Winter 11/12
Lecturer
Prof. Dr. Michael Bader
Time and Place
Lecture: Wednesday, 10:15 - 11:45 Uhr, room MI 02.07.023
Tutorial: Monday, 16:00 -18:00, every second week, room MI 02.07.023
Audience
Elective topic in Informatik Bachelor/Master/Diplom subject area Algorithms and Scientific Computing
Wirtschaftsinformatik Bachelor (Modul IN2002)
Mathematik, Natur- und Ingenieurwissenschaften students are also welcome!
Tutorials
Daniel Butnaru, M.Sc, Christoph Kowitz, M.Sc.
Exam
details t.b.a.
Semesterwochenstunden / ECTS Credits
3 SWS (2V + 1Ü) / 4 Credits
TUMonline
{{{tumonline}}}



News

  • In winter term 2011/12, this lecture will be held by Michael Bader with a focus on algorithms in high performance computing (and scientific computing).
  • The first lecture will be on Oct 26
  • The first tutorial will be on Nov 7
  • The lecture on Wednesday, Nov 2, will be skipped due to the student's general assembly


Content

The lecture will have a focus on parallel algorithms and implementation techniques in the field of numerical simulation and high performance computing, such as:

  • linear algebra problems on dense and sparse matrices
  • simulation on structured and unstructured meshes
  • particle-based simulations (with long-range and short-range interactions)
  • spectral methods (parallel FFT and related algorithms)
  • Monte Carlo and statistical methods

(a.k.a. the seven dwarfs of HPC).


Materials

Lecture slides will be published here after the lessons:


Tutorials

Roughly every second week a two hour tutorial will take place (details at page top; days and time will be announced here and in the lectures). The assignments and their solutions will be gradually posted here.


Prerequisites

Lecture IN0019 Numerical Programming or similar basic knowledge in numerical methods. Basic knowledge in parallel programming (lecture Parallel Programming, Parallele Algorithmen und Höchstleistungsrechnen, or similar) is helpful (as is a certain interest in problems from scientific computing and numerical simulation).