Scientific Computing I / Wissenschaftliches Rechnen I

The lecture will show the pratical implementation of standard numerical algorithmns. We focus on the special properties of the floating-point arithmetics and difficulties when formulating the algorithms in a high-level programming language, such as C. Utilities for searching fo errors and post proccessing of results will be explained, too. Additionally, existing software packages that are highly recommended for use in own implementations will be introduced.

Schedule - Certifications - Recommended Literature - Teaching Material - Homework and Exercises - Links

Schedule (preliminary)

Lecture: on Wednesday, 11 - 13 hrs. on Fridays, 9 - 11 hrs.
Tutorial: on Tuesdays, 13 - 15 hrs.

 Certifications

Criteria for getting a course assessment:

  • at least 50% of all possible points from the homework
  • at least 50% of the points in one homework ( on n-1 of n homework sheets)
  • demonstrate and explain at least one exercise in the tutorial

Other possibilities to get an assessment will be announced in the lecture.

Recommended Literature

See per chapter recommendations in the lecture notes.

Teaching Material

Homework and Exercises

Links

Go to Editor View