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 (2020S)

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. 25 participants
Language: English

Lecturers

Classes (iCal) - next class is marked with N

Thursday 19.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 26.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 02.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 23.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 30.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 07.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 14.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 28.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 04.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 18.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 25.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). 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); occasional quizzes (online) in class; written test (online) at the end of the semester; after that in some cases possibly additional oral interviews (random selection).

Bonus points are available for excellent presentations of your own solution to homework problems in class.

Minimum requirements and assessment criteria

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.

Selected oral interviews may influence the number of points achieved.

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

Module: CNA ESC

Last modified: Mo 07.09.2020 15:20