Warning! The directory is not yet complete and will be amended until the beginning of the term.

052101 VU Numerical Algorithms (2021W)

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

Continuous assessment of course work

MIXED

Moodle

Th 27.01. 09:45-11:15 Digital

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 13.09.2021 09:00 to Mo 20.09.2021 09:00
Deregistration possible until Th 14.10.2021 23:59

Details

max. 50 participants

Language: English

Lecturers

Wilfried Gansterer

Classes (iCal) - next class is marked with N

    
    Thursday
    07.10.
    09:45 - 11:15
    Digital
    
    Thursday
    14.10.
    09:45 - 11:15
    Digital
    
    Thursday
    21.10.
    09:45 - 11:15
    Digital
    
    Thursday
    28.10.
    09:45 - 11:15
    Digital
    
    Thursday
    04.11.
    09:45 - 11:15
    Digital
    
    Thursday
    11.11.
    09:45 - 11:15
    Digital
    
    Thursday
    18.11.
    09:45 - 11:15
    Digital
    
    Thursday
    25.11.
    09:45 - 11:15
    Digital
    
    Thursday
    02.12.
    09:45 - 11:15
    Digital
    
    Thursday
    09.12.
    09:45 - 11:15
    Digital
    
    Thursday
    16.12.
    09:45 - 11:15
    Digital
    
    Thursday
    13.01.
    09:45 - 11:15
    Digital
    
    Thursday
    20.01.
    09:45 - 11:15
    Hörsaal 2, Währinger Straße 29 2.OG
PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    
    N
    Thursday
    27.01.
    09:45 - 11:15
    Digital

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); selected presentations of your own solution to homework problems in class (online), occasional quizzes (online) in class; written test at the end of the semester.

PLEASE NOTE: Due to the Covid-19 situation, the current plan (as of 14.9.2021) is as follows: This class will be given online except for the written test on 20.1.2022, which will be in presence.

Minimum requirements and assessment criteria

PLEASE NOTE: You have to participate (online) in the first class in order to guarantee your fixed spot in the course! If you do not participate in the first class you will be signed out to make space for other students currently on the waiting list.

Grading is based on how many points are achieved for 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

Lecture slides

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

Association in the course directory

Last modified: Fr 14.01.2022 12:48