Universität Wien

052101 VU Numerical Algorithms (2023S)

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 02.03. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • 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 20.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 25.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 15.06. 13:15 - 14:45 Seminarraum 7, Währinger Straße 29 1.OG
  • Thursday 22.06. 13:15 - 14:45 PC-Unterrichtsraum 5, Währinger Straße 29 2.OG
    PC-Unterrichtsraum 6, Währinger Straße 29 2.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, etc.). 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

Several homework problems (with theoretical and programming components - covering analysis, implementation and numerical experiments); occasional quizzes in class; written test (closed book) at the end of the semester.

Potential bonus points for outstanding homework solutions or exzellent presentation of your own solution of a homework problem in class.

Minimum requirements and assessment criteria

Grading is based on how many points are achieved for the homework problems (in total there are at most 48 points for all homework problems), for the quizzes (in total there are at most 8 points for the quizzes) and for the written test (in total there are at most 36 points for the test). At least 46 points are required for passing the course.

Attendance is strongly recommended, but not formally required for passing the course.

Examination topics

You need to study the material presented in class and the contents of the homework problems. The written test at the end of the semester covers all the material covered in the class and in the homeworks until then.

Reading list

Lecture slides (which will be made available in Moodle)

Selected chapters from M. T. Heath: “Scientific Computing – an Introductory Survey”

Association in the course directory

Module: CNA ESC

Last modified: Mo 15.01.2024 09:25