052101 VU Numerical Algorithms (2018S)

3.00 ECTS (2.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik

Continuous assessment of course work

Moodle

Registration/Deregistration

Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).

Registration is open from Mo 12.02.2018 09:00 to Tu 20.02.2018 23:59
Deregistration possible until Su 18.03.2018 23:59

Details

max. 25 participants

Language: English

Lecturers

Wilfried Gansterer

Classes (iCal) - next class is marked with N

    
    Thursday
    01.03.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    08.03.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    15.03.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    22.03.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    12.04.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    19.04.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    26.04.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    03.05.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    17.05.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    24.05.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    07.06.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    14.06.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    21.06.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG
    
    Thursday
    28.06.
    13:15 - 14:45
    Seminarraum 7, Währinger Straße 29 1.OG

Information

Aims, contents and method of the course

Get acquainted with fundamental concepts of numerical algorithms (approximations in numerical computation, conditioning, numerical stability) and with techniques for the analysis of numerical algorithms (perturbation theory). Study selected numerical algorithms in detail. Understand the interdependencies between problem data, numerical algorithm, implementation of the algorithm, hardware, performance and accuracy.

Assessment and permitted materials

Three sets of homework problems (with theoretical and programming components - implementation, experimentation, analysis); occasional quizzes in class; test at the end of the semester.

Minimum requirements and assessment criteria

Grading is based on how many points are achieved per each set of homework problems, for the quizzes and for the test. At least half of the maximum possible total number of points is required for passing the course.

Examination topics

Material presented in class and contents of homework problems.

Reading list

Slides; M. T. Heath: “Scientific Computing – an Introductory Survey”

Association in the course directory

Module: CNA ESC

Last modified: Mo 07.09.2020 15:30