Algorithms for Scientific Computing (IN2001)
Course 0000002480 in SS 2023
General Data
| Course Type | lecture with integrated exercises |
|---|---|
| Semester Weekly Hours | 6 SWS |
| Organisational Unit | Informatics 5 - Chair of Scientific Computing (Prof. Bungartz) |
| Lecturers |
Michael Georg Bader Mario Wille |
| Dates |
Mon, 14:00–16:00, MI HS2 Wed, 08:00–10:00, MI HS2 Fri, 10:00–12:00, MI HS2 |
Assignment to Modules
-
IN2001: Algorithms for Scientific Computing / Algorithms for Scientific Computing
This module is included in the following catalogs:- Catalogue of non-physics elective courses
Further Information
Courses are together with exams the building blocks for modules. Please keep in mind that information on the contents, learning outcomes and, especially examination conditions are given on the module level only – see section "Assignment to Modules" above.
| additional remarks | This course deals with the general question of how to store and work with continuous data - i.e., data we would mathematically describe via a multidimensional real-valued function. It thus gives an introduction to several transforms, approaches for high-dimensional data and adaptivity. Topics include: Discrete Fourier Transform (DFT) and related transforms: - Fast Fourier Transform (FFT): derivation and efficient implementation - Fast discrete cosine/sine transforms: derivation and implementation via FFT - Applications: multi-dimensional data (images, video, audio), using specific transform for data with specific properties, FFT-based solvers for linear systems of equations Hierarchical numerical methods: - Hierarchical bases for one-and multi-dimensional problems - Computational cost versus accuracy: Sparse Grids - Applications: numerical quadrature, approximation and classification of data - Wavelets Space-filling curves: - Tree-structured adaptive grids (quadtrees, octrees) and relation to space-filling curves - Peano-and Hilbert curves: representation by algebraic and grammatical means - Applications: organisation of multi-dimensional data; parallel algorithms and cache oblivious algorithms |
|---|---|
| Links |
E-Learning course (e. g. Moodle) Additional information TUMonline entry |
Equivalent Courses (e. g. in other semesters)
| Semester | Title | Lecturers | Dates |
|---|---|---|---|
| SS 2024 | Algorithms for Scientific Computing (IN2001) | Bader, M. Gaddameedi, K. Wille, M. |
Mon, 14:00–16:00, MI HS2 Wed, 08:00–10:00, MI HS2 Fri, 10:00–12:00, MI HS2 |
| SS 2022 | Algorithms for Scientific Computing (IN2001) | Bader, M. Lopez Gutierrez, I. Wille, M. |
Mon, 14:00–16:00, MI HS2 Wed, 12:00–13:45, GALILEO 300 Fri, 10:00–12:00, MI HS2 and singular or moved dates |
| SS 2021 | Algorithms for Scientific Computing (IN2001) | Bader, M. Gallard, J. Wille, M. |
Mon, 14:00–16:00, virtuell Wed, 12:00–14:00, virtuell Fri, 10:00–12:00, virtuell and singular or moved dates |
| SS 2020 | Algorithms for Scientific Computing (IN2001) | Ashraf, H. Dietrich, F. Gallard, J. Mendl, C. Narvaez Rivas, S. … (total 6) |
Mon, 14:00–16:00, virtuell Wed, 12:00–14:00, virtuell Fri, 10:00–12:00, virtuell |
| SS 2019 | Algorithms for Scientific Computing (IN2001) |
Gallard, J.
Obersteiner, M.
Responsible/Coordination: Bader, M. |
Fri, 10:00–12:00, MI HS2 Mon, 14:00–16:00, MI HS2 Wed, 12:00–14:00, MI 00.13.009A and singular or moved dates |
| SS 2018 | Algorithms for Scientific Computing (IN2001) | Bader, M. Gallard, J. Obersteiner, M. |
Mon, 14:00–16:00, MI HS2 Wed, 10:00–12:00, MI 00.13.009A Fri, 10:00–12:00, MI HS2 and singular or moved dates |
| SS 2017 | Algorithms for Scientific Computing (IN2001) |
Gallard, J.
Responsible/Coordination: Bader, M. |
Mon, 08:00–10:00, MI HS2 Wed, 10:00–12:00, MI 00.13.009A Fri, 10:00–12:00, MI HS2 |
| SS 2016 | Algorithms for Scientific Computing (IN2001) |
Mon, 08:00–10:00, MI HS2 Wed, 10:00–12:00, MI 00.13.009A Fri, 10:00–12:00, MI HS2 |
|
| SS 2015 | Algorithms for Scientific Computing (IN2001) |
Mon, 08:00–10:00, MI HS3 Wed, 10:00–12:00, MI 00.13.009A Fri, 10:00–12:00, MI HS2 |
|
| SS 2014 | Algorithms for Scientific Computing (IN2001) |
Mon, 08:00–10:00, MI HS3 Wed, 10:00–12:00, MI 02.07.023 Fri, 10:00–12:00, MI HS2 and singular or moved dates |
|
| SS 2013 | Algorithms for Scientific Computing (IN2001) |