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

052101 VU Numerical Algorithms (2017S)

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

Lecturers

Classes (iCal) - next class is marked with N

  • Thursday 09.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 16.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 23.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 30.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 06.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 27.04. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 04.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 11.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 18.05. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 01.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 08.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 22.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 29.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 (mostly matrix 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

The maximum possible score is 78 points (12 per set of homework problems, 6 for the quizzes, 36 for the test). At least 39 points are 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