Algorithms for Scientific Computing - Summer 17

From Sccswiki
Revision as of 16:54, 16 December 2016 by Bader (talk | contribs) (Created page with "{{Lecture | term = Summer 2017 | lecturer = Univ.-Prof. Dr. Michael Bader | timeplace = t.b.a. <!--Lecture: Mon 8:30-10:00, Fri 10:15-11:45, MI Hörsaal 2 (1st lecture: Mo...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
Term
Summer 2017
Lecturer
Univ.-Prof. Dr. Michael Bader
Time and Place
t.b.a.
Tutorial: t.b.a.
Audience
see module description (IN2001) in TUMonline
Tutorials
t.b.a.
Exam
written exam at the end of the semester
Semesterwochenstunden / ECTS Credits
6 SWS (4V + 2Ü) / 8 Credits
TUMonline
https://campus.tum.de/tumonline/wblv.wbShowLvDetail?pStpSpNr=950238554 (course from summer 2016)



What's ASC about?

Many applications in computer science require methods of (prevalently numerical) mathematics - especially in science and engineering, of course, but as well in surprisingly many areas that one might suspect to be directly at the heart of computer science:

Consider, for example, Fourier and wavelet transformations, which are indispensable in image processing and image compression. Space filling curves (which have been considered to be "topological monsters" and a useless theoretical bauble at the end of the 19th century) have become important methods used for parallelization and the implementation of data bases. Numerical methods for minimization and zero-setting are an essential foundation of Neural Networks in machine learning.

Essentially, these methods come down to the question of how to represent and process information or data as (multi-dimensional) continuous functions. Algorithms of Scientific Computing (former Algorithmen des Wissenschaftlichen Rechnens) provides a generally understandable and algorithmically oriented introduction into the foundations of such mathematical methods. Topics are:

  • The fast Fourier transformation (FFT) and some of its variants:
    • FCT (Fast Cosine Transform), real FFT, Application for compression of video and audio data
  • Space filling curves (SFCs):
    • Construction and properies of SFCs
    • Application for parallelization and to linearize multidimensional data spaces in data bases
  • Hierarchical and recursive methods in scientific computing
    • From Archimede's quadrature to the hierarchical basis
    • Cost vs. accuracy
    • Sparse grids, wavelets, multi-grid methods

Lecture Slides and Supplementary Materials

Lecture slides will be published here as soon as they become available. For future lectures, the respective slides from summer 2016 will be linked.


Jupyter Notebook (formerly known as the IPython Notebook)

  • If you want to use a local installation of IPython Notebook on your laptop or home computer, just refer to the Jupyter Notebook website on how to install Jupyter Notebook on Linux, Windows or MAC platforms
    • If you install Jupyter Notebook for Windows, it might happen that starting it from the "Start" menue will open an IPython server website, but that you cannot create or import any new Python notebooks. In that case, try to start Jupyter Notebook from the command line via "ipython notebook --notebook-dir=.\" (from the directory where you want to store the Python notebooks); you can also create a batch file for this (download example, place it in the desired directory).


Literature and Additional Material

Books that are labeled as "available as e-book" can be accessed as e-book via the TUM library - see the ebooks website of the library for details on how to access the books.

Fast Fourier Transform:

The lecture is oriented on:

Hierarchical Methods and Sparse Grids

Wavelets

Space-filling Curves:

Background Material Concerning Scientific and High Performance Computing