Universität Wien FIND

Due to the COVID-19 pandemic, changes to courses and exams may be necessary at short notice. Inform yourself about the current status on u:find and check your e-mails regularly. Registration is mandatory for courses and exams. Wearing a FFP2 face mask and a valid evidence of being tested, vaccinated or have recovered from an infection are mandatory on site.

Please read the information on studieren.univie.ac.at/en/info.

052101 VU Numerical Algorithms (2020W)

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 09:45 - 11:15 online (except for exam)

Participation in the first class (online) is required for guaranteeing the assigned spot in the class.

Thursday 01.10. 09:45 - 11:15 Digital
Thursday 08.10. 09:45 - 11:15 Digital
Thursday 15.10. 09:45 - 11:15 Digital
Thursday 22.10. 09:45 - 11:15 Digital
Thursday 29.10. 09:45 - 11:15 Digital
Thursday 05.11. 09:45 - 11:15 Digital
Thursday 12.11. 09:45 - 11:15 Digital
Thursday 19.11. 09:45 - 11:15 Digital
Thursday 26.11. 09:45 - 11:15 Digital
Thursday 03.12. 09:45 - 11:15 Digital
Thursday 10.12. 09:45 - 11:15 Digital
Thursday 17.12. 09:45 - 11:15 Digital
Thursday 07.01. 09:45 - 11:15 Digital
Thursday 14.01. 09:45 - 11:15 Digital
Thursday 21.01. 09:45 - 11:15 Digital
Hörsaal 41 Hauptgebäude, 1.Stock, Stiege 8
Thursday 28.01. 09:45 - 11:15 Digital

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 (online), occasional quizzes (online) in class; written test (online) at the end of the semester.

PLEASE NOTE: Due to the Covid-19 situation, we decided to switch to an online written test (instead of presence) at the end of the semester.

Minimum requirements and assessment criteria

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 may 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 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: Th 17.12.2020 09:47