Universität Wien

052101 VU Numerical Algorithms (2025W)

Continuous assessment of course work

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

Details

max. 50 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

  • Thursday 02.10. 09:45 - 11:15 Hörsaal 34 Hauptgebäude, Hochparterre, Stiege 6
  • Thursday 09.10. 09:45 - 11:15 Hörsaal 34 Hauptgebäude, Hochparterre, Stiege 6
  • Thursday 16.10. 09:45 - 11:15 Hörsaal 34 Hauptgebäude, Hochparterre, Stiege 6
  • Thursday 23.10. 09:45 - 11:15 Hörsaal 34 Hauptgebäude, Hochparterre, Stiege 6
  • Thursday 30.10. 08:00 - 09:30 PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 4, Währinger Straße 29 1.OG
  • Thursday 30.10. 09:45 - 11:15 PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 4, Währinger Straße 29 1.OG
  • Thursday 06.11. 09:45 - 11:15 Hörsaal 34 Hauptgebäude, Hochparterre, Stiege 6
  • Thursday 20.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 27.11. 09:45 - 11:15 Hörsaal 34 Hauptgebäude, Hochparterre, Stiege 6
  • Thursday 04.12. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 11.12. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 18.12. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 08.01. 08:00 - 09:30 PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 4, Währinger Straße 29 1.OG
  • Thursday 08.01. 09:45 - 11:15 PC-Unterrichtsraum 3, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 4, Währinger Straße 29 1.OG
  • Thursday 15.01. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 22.01. 08:00 - 09:30 Audimax Zentrum für Translationswissenschaft, Gymnasiumstraße 50
  • Thursday 29.01. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.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, etc.). 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

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 tests 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: 30.10.2025 (8:00-11:15)
Written test 1: 13.11.2025 (9:45-11:15)
Programming test 2: 08.01.2026 (8:00-11:15)
Written test 2: 22.01.2026 (8:00-9:30)

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

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.

Minimum requirements and assessment criteria

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.10.2025.
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).

Examination topics

You need to study the material presented in class, the lecture slides and the content of the Practice Sheets. 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, the lecture slides and the Practice Sheets. The specific material relevant to each written test will be specified in the first lecture.

Reading list

Lecture slides

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

Association in the course directory

Last modified: Mo 03.11.2025 14:25