Universität Wien
Achtung! Das Lehrangebot ist noch nicht vollständig und wird bis Semesterbeginn laufend ergänzt.

052101 VU Numerical Algorithms (2024W)

3.00 ECTS (2.00 SWS), SPL 5 - Informatik und Wirtschaftsinformatik
Prüfungsimmanente Lehrveranstaltung
Moodle
Do 30.01. 09:45-11:15 Hörsaal 2, Währinger Straße 29 2.OG

An/Abmeldung

Hinweis: Ihr Anmeldezeitpunkt innerhalb der Frist hat keine Auswirkungen auf die Platzvergabe (kein "first come, first served").

Details

max. 50 Teilnehmer*innen
Sprache: Englisch

Lehrende

Termine (iCal) - nächster Termin ist mit N markiert

  • Donnerstag 03.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 10.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 17.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 24.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 31.10. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 07.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 14.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 21.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
    Seminarraum 3, Währinger Straße 29 1.UG
  • Donnerstag 28.11. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 05.12. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 12.12. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 09.01. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 16.01. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
  • Donnerstag 23.01. 09:45 - 11:15 Hörsaal 2, Währinger Straße 29 2.OG
    Seminarraum 2, Währinger Straße 29 1.UG

Information

Ziele, Inhalte und Methode der Lehrveranstaltung

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.

Art der Leistungskontrolle und erlaubte Hilfsmittel

Three sets of homework problems applying concepts from class (with programming components - implementation, experimentation, analysis); selected presentations of your own solution to homework problems in class, four (unannounced) quizzes in class (little questions about the contents of earlier classes, closed book, bonus points); two written tests (closed book, in the middle and at the end of the semester).

This class will be given on-site. Attendance is at least required for the first class, for the discussion of homeworks and for the two written tests. Since quizzes are unannounced, missing a class may lead to missing a quiz without opportunity to re-do it.

You are welcome to orally discuss the homework problems among each other. However, the homeworks are not group work, but are designed such that every student needs to individually produce and submit their own implementation.

Mindestanforderungen und Beurteilungsmaßstab

PLEASE NOTE: You have to be present and sign in the first class in order to guarantee your fixed spot in the course! If you are not present in the first class you will be signed out to make space for other students currently on the waiting list. If you are present and sign in the first class, you can still decide to drop the course until 14.10.2024.

Grading:
Maximum number of points for the entire course: 100 points + 10 bonus points
Maximum number of points for the three homework problems: 24 points (8 points per homework)
Maximum number of points for the written tests: 76 points (midterm: 30 points, final: 46 points)
Maximum number of points for the (unannounced) quizzes: 10 points (bonus points)

Your final grade is based on the points you achieve for each homework problem, the quizzes and the tests. At least 50 points in total are required for passing the course. Additionally, you need to achieve at least 38 points on the two tests combined to pass the course.

Attendance is strongly recommended, but not formally required for passing the course (except for specific classes, see section above).

Prüfungsstoff

You need to study the material presented in class and the content of the homework problems. The two written tests will cover all the material from the classes and the homeworks. The specific material relevant to each test will be specified in the first lecture.

Literatur

Lecture slides

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

Zuordnung im Vorlesungsverzeichnis

Letzte Änderung: Do 19.09.2024 15:25