Universität Wien

052101 VU Numerical Algorithms (2022W)

3.00 ECTS (2.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Continuous assessment of course work
Moodle

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 06.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 13.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 20.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 27.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 27.10. 11:30 - 13:00 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 03.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 10.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 17.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 24.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 01.12. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 15.12. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 12.01. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Thursday 19.01. 09:45 - 11:15 PC-Unterrichtsraum 4, Währinger Straße 29 1.OG
    PC-Unterrichtsraum 5, Währinger Straße 29 2.OG
  • Thursday 26.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). 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, occasional (unannounced) quizzes in class; written test at the end of the semester.

The current plan (as of 21.9.2022) is as follows: This class will be given on-site and attendance is required.

Minimum requirements and assessment criteria

PLEASE NOTE: You have to be present 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.

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 and discussed 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: Tu 23.01.2024 00:11