Universität Wien

052101 VU Numerical Algorithms (2024S)

3.00 ECTS (2.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Continuous assessment of course work
Moodle
Th 16.05. 13:15-14:45 Seminarraum 7, Währinger Straße 29 1.OG

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 07.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 14.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 21.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 11.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 18.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 25.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 02.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 23.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 06.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 13.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 20.06. 13:15 - 14:45 Seminarraum 10, Währinger Straße 29 2.OG
Seminarraum 7, Währinger Straße 29 1.OG
Thursday 27.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, 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

Three sets of homework problems applying concepts from class (with programming components - implementation, experimentation, analysis); selected presentations of your own solution to homework problems in class, four (unannounced) quizzes in class (little questions about the contents of earlier classes, only a small part of the available points); written test (closed book) at the end of the semester.

This class will be given on-site. Attendance is at least required for the first class, for the discussion of homeworks and for the written test. Since quizzes are unannounced, missing a class may lead to missing a quiz without opportunity to re-do it.

Large language model assistance (e.g., using ChatGPT) is partly integrated in the homework problems. In any case, you always need to declare explicitly in your submissions whether and how you used such tools in your homeworks.

You are welcome to orally discuss the homework problems among each other, but the homeworks are not group work, but are designed such that every student needs to individually produce and submit their own implementation and report.

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 but decide later to drop the course, you can do so until 14.3.2024.

Grading:
Maximum number of points for the three homework problems: 30 points (10 points per homework)
Maximum number of points for the (unannounced) quizzes: 12 points
Maximum number of points for the written test: 38 points

Your final grade is based on how many points you achieve for each homework problem, for the quizzes and for the test. At least half of the maximum possible total number of points (40 points) is required for passing the course. This semester, there will not be any bonus points.

Attendance is strongly recommended, but not formally required for passing the course.

Examination topics

You need to study the material presented in class and the contents of the homework problems. The written test at the end of the semester covers all the material covered in the class and in the homeworks until then.

Reading list

Lecture slides (which will be made available in Moodle)

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

Association in the course directory

Module: CNA ESC

Last modified: We 13.03.2024 08:05