Universität Wien
Achtung! Das Lehrangebot ist noch nicht vollständig und wird bis Semesterbeginn laufend ergänzt.

052101 VU Numerical Algorithms (2026S)

Prüfungsimmanente Lehrveranstaltung

An/Abmeldung

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

Details

max. 50 Teilnehmer*innen
Sprache: Englisch

Lehrende

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

  • Donnerstag 05.03. 13:15 - 14:45 Hörsaal 1, Währinger Straße 29 1.UG
  • Donnerstag 19.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Donnerstag 26.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Donnerstag 16.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Donnerstag 23.04. 13:15 - 14:45 PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 4, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 6, Währinger Straße 29 2.OG
  • Donnerstag 23.04. 15:00 - 16:30 PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 6, Währinger Straße 29 2.OG
  • Donnerstag 30.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Donnerstag 07.05. 13:15 - 14:45 Auditorium Maximum Tiefparterre Hauptgebäude Stiege 10
  • Donnerstag 21.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Donnerstag 28.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Donnerstag 11.06. 13:15 - 14:45 PC-Unterrichtsraum 2, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 4, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 6, Währinger Straße 29 2.OG
  • Donnerstag 18.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Donnerstag 25.06. 13:15 - 14:45 Auditorium Maximum Tiefparterre Hauptgebäude Stiege 10

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, etc.). 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

This course will be given on-site. Attendance is required for the first class.

This course includes two programming tests and two written tests.

The programming tests will be in Python. For each programming test, a Practice Sheet will be provided in advance. These sheets allow students to apply concepts from class (including implementation, experimentation, and analysis) and serve as preparation for the respective programming test. Practice Sheets are not submitted or graded.
During the programming tests, selected resources will be made available by the instructors (details will be specified in class); students may not bring any materials of their own. No other resources are permitted.
Students are required to log in to the exam platform for the programming test using their u:account credentials. Please ensure that you have memorized your password before the tests.

The written tests cover the material presented in class, the lecture slides, and the Practice Sheet problems. The written tests are closed-book.

Programming test 1: 23.04.2026 (13:15-16:30 (!))
Written test 1: 07.05.2026 (13:15-14:45)
Programming test 2: 11.06.2026 (13:15-14:45)
Written test 2: 25.06.2026 (13:15-14:45)

You are welcome to discuss the Practice Sheet problems orally among each other. However, all four tests are strictly individual work and must be completed without collaboration.

Mindestanforderungen und Beurteilungsmaßstab

PLEASE NOTE: You have to be present and sign in the first class in order to guarantee your fixed spot in the course! If you are not present in the first class, you will be signed out to make space for other students currently on the waiting list. If you are present and sign in the first class, you can still decide to drop the course until 14.03.2026.
If you are on the waiting list, you have to be present and sign in the first class in order to keep your waiting list spot.

Grading:
Maximum number of points for the entire course: 100 points
Maximum number of points for the two programming tests: 40 points
Maximum number of points for the two written tests: 60 points

Your final grade is based on the points you achieve for each of the tests. At least 50 points in total are required for passing the course.

Attendance is strongly recommended, but not formally required for passing the course (except for the first class).

Prüfungsstoff

You need to study the material presented in class and the content of the Practice Sheet problems. The two programming tests will cover the content of the respective Practice Sheet. The two written tests will cover all the material from the classes and the Practice Sheets. The specific material relevant to each written test will be specified on Moodle.

Literatur

Lecture slides (which will be made available in Moodle)

Selected chapters from Michael T. Heath: “Scientific Computing – an Introductory Survey”, SIAM, 2018.

Zuordnung im Vorlesungsverzeichnis

Module: CNA ESC

Letzte Änderung: Mo 27.07.2026 09:26