Algorithms for Scientific Computing

Module IN2001

This Module is offered by TUM Department of Informatics.

This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.

Module version of WS 2011/2

There are historic module descriptions of this module. A module description is valid until replaced by a newer one.

available module versions
SS 2012WS 2011/2

Basic Information

IN2001 is a semester module in English language at Bachelor’s level und Master’s level which is offered in summer semester.

This Module is included in the following catalogues within the study programs in physics.

  • Catalogue of non-physics elective courses
Total workloadContact hoursCredits (ECTS)
240 h 90 h 8 CP

Content, Learning Outcome and Preconditions

Content

Discrete Fourier transform and related transforms - FFT: derivation and implementation - Fast discrete cosine/sine transforms: derivation and implementation via FFT - Applications: multi-dimensional data (images, video, audio) and FFT-based solvers for linear systems of equations Space-filling curves - Peano- and Hilbert curves: representation by algebraic and grammatical means - Applications: organisation of multi-dimensional data; parallel, adaptive, and cache oblivious algorithms Hierarchical numerical methods - Hierarchical bases for one- and multi-dimensional problems - Computational cost versus accuracy; Sparse Grids - Adaptive representation of continuous data - Applications: numerical quadrature, differential equations - Outlook: multigrid methods, wavelets

Learning Outcome

At the end of the module, students are able to identify, explain, and implement selected methods that are of particular interest to the informatical aspects of scientific computing because of their algorithmic structure and their significance for practical applications. Participants can analyse and judge the efficiency of such methods by deriving statements about the required computational cost and - where applicable - the achieved accuracy and by comparing them with corresponding results for other methods. The students are able to transfer the methodology to new methods for related problems.

Preconditions

no info

Courses, Learning and Teaching Methods and Literature

Courses and Schedule

ArtSWSTitelDozent(en)Termine
VU 6 Algorithms for Scientific Computing (IN2001) Montag, 08:00–10:00
Mittwoch, 10:00–12:00
Freitag, 10:00–12:00

Learning and Teaching Methods

This module comprises lectures and accompanying tutorials. The contents of the lectures will be taught by talks and presentations. Students will be encouraged to study literature and to get involved with the topics in depth. In the tutorials, concrete problems will be solved - partially in teamwork - and selected examples will be discussed.

Media

Slides, whiteboard, exercise sheets

Literature

- W.L. Briggs, Van Emden Henson, The DFT - An Owner's Manual for the Discrete Fourier Transform, SIAM, 1995 - Charles van Loan, Computational Frameworks for the Fast Fourier Transform, SIAM, 1992 - M. Bader, Space-Filling Curves - An Introduction with Applications to Scientific Computing, Springer-Verlag, 2013 - H. Sagan, Space-Filling Curves, Springer-Verlag, 1994 - H.-J. Bungartz, Skript Rekursive Verfahren und hierarchische Datenstrukturen in der numerischen Analysis, http://www5.in.tum.de/lehre/vorlesungen/algowiss/Bungartz_HierVerf.ps.gz - H.-J. Bungartz, M. Griebel: Sparse Grids, Acta Numerica, Volume 13, p. 147-269. Cambridge University Press, May 2004

Module Exam

Description of exams and course work

Type of Assessment: exam In the exam students should prove to be able to identify a given problem and find solutions within limited time. The examination will completely cover the content of the lectures. The answers will require own formulations. In addition, questions requiring short calculations may be posed. Exam assignments assess the students' capability to identify, explain, and implement the selected methods and to analyse and judge the efficiency. Questions test whether students are able to transfer the methodology to new methods for related problems.

Exam Repetition

There is a possibility to take the exam at the end of the semester.

Current exam dates

Currently TUMonline lists the following exam dates. In addition to the general information above please refer to the current information given during the course.

Title
TimeLocationInfoRegistration
Algorithms of Scientific Computing
Mi, 12.10.2016, 16:00 bis 17:40 Physik I: 2501
bis 19.9.2016 (Abmeldung bis 5.10.2016)

Condensed Matter

When atoms interact things can get interesting. Fundamental research on the underlying properties of materials and nanostructures and exploration of the potential they provide for applications.

Nuclei, Particles, Astrophysics

A journey of discovery to understanding our world at the subatomic scale, from the nuclei inside atoms down to the most elementary building blocks of matter. Are you ready for the adventure?

Biophysics

Biological systems, from proteins to living cells and organisms, obey physical principles. Our research groups in biophysics shape one of Germany's largest scientific clusters in this area.