052101 VU Numerical Algorithms (2021W)

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

Prüfungsimmanente Lehrveranstaltung

GEMISCHT

Moodle

An/Abmeldung

Hinweis: Ihr Anmeldezeitpunkt innerhalb der Frist hat keine Auswirkungen auf die Platzvergabe (kein "first come, first served").

Anmeldung von Mo 13.09.2021 09:00 bis Mo 20.09.2021 09:00
Abmeldung bis Do 14.10.2021 23:59

Details

max. 50 Teilnehmer*innen

Sprache: Englisch

Lehrende

Wilfried Gansterer

Termine (iCal) - nächster Termin ist mit N markiert

    
    Donnerstag
    07.10.
    09:45 - 11:15
    Digital
    
    Donnerstag
    14.10.
    09:45 - 11:15
    Digital
    
    Donnerstag
    21.10.
    09:45 - 11:15
    Digital
    
    Donnerstag
    28.10.
    09:45 - 11:15
    Digital
    
    Donnerstag
    04.11.
    09:45 - 11:15
    Digital
    
    Donnerstag
    11.11.
    09:45 - 11:15
    Digital
    
    Donnerstag
    18.11.
    09:45 - 11:15
    Digital
    
    Donnerstag
    25.11.
    09:45 - 11:15
    Digital
    
    Donnerstag
    02.12.
    09:45 - 11:15
    Digital
    
    Donnerstag
    09.12.
    09:45 - 11:15
    Digital
    
    Donnerstag
    16.12.
    09:45 - 11:15
    Digital
    
    Donnerstag
    13.01.
    09:45 - 11:15
    Digital
    
    Donnerstag
    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
    
    Donnerstag
    27.01.
    09:45 - 11:15
    Digital

Information

Ziele, Inhalte und Methode der Lehrveranstaltung

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.

Art der Leistungskontrolle und erlaubte Hilfsmittel

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.

Mindestanforderungen und Beurteilungsmaßstab

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.

Prüfungsstoff

Material presented in class and contents of homework problems.

Literatur

Lecture slides

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

Zuordnung im Vorlesungsverzeichnis

Letzte Änderung: Fr 12.05.2023 00:13