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.

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

Warning! The directory is not yet complete and will be amended until the beginning of the term.

052101 VU Numerical Algorithms (2019S)

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 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 28.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 04.04. 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 02.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 09.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
Thursday 16.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 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). 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 in class; test at the end of the semester.

Minimum requirements and assessment criteria

Beyond registration, physical presence is required in the first class on 7.3.2019 in order to be guaranteed a fixed spot in this course.

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

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

Association in the course directory

Module: CNA ESC

Last modified: Mo 07.09.2020 15:30