Numerical Programming 1 (CSE)
Module MA3305
This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.
Module version of WS 2011/2
There are historic module descriptions of this module. A module description is valid until replaced by a newer one.
Whether the module’s courses are offered during a specific semester is listed in the section Courses, Learning and Teaching Methods and Literature below.
available module versions | ||||
---|---|---|---|---|
WS 2021/2 | WS 2020/1 | SS 2020 | SS 2012 | WS 2011/2 |
Basic Information
MA3305 is a semester module in English language at Master’s level which is offered in winter semester.
This Module is included in the following catalogues within the study programs in physics.
- Catalogue of non-physics elective courses
Total workload | Contact hours | Credits (ECTS) |
---|---|---|
240 h | 90 h | 8 CP |
Content, Learning Outcome and Preconditions
Content
Condition numbers, floating point arithmetic, stability;
Solving linear systems (Gaussian elimination, least squares);
Eigenvalue problems;
Interpolation (algebraic and trigonometric polynomials, splines);
Intgration (sum rules, Gaussian quadrature);
Iterative methods (Jacobi, Gauß-Seidel, conjugate gradient method (CG), Newton);
Runge-Kutta method.
Learning Outcome
Preconditions
Courses, Learning and Teaching Methods and Literature
Courses and Schedule
Type | SWS | Title | Lecturer(s) | Dates | Links |
---|---|---|---|---|---|
VO | 4 | Numerical Programming 1 CSE | Lasser, C. |
Mon, 12:00–14:00, MI HS2 Wed, 12:00–14:00, MI HS3 |
documents |
UE | 2 | Numerical Programming 1 CSE (Exercise Session) | Lasser, C. Schreiber, A. |
Thu, 11:45–13:30, MW 0608m |
Learning and Teaching Methods
Media
Literature
Moler: Numerical Computing with MATLAB, SIAM, 2004.
Press, Flannery, Teukolsky, Vetterling: Numerical Recipes.Cambridge University Press, http://www.nr.com/.
Strang: Introduction to Linear Algebra, Wellesley-Cambridge, 2009.
Strang, Calculus, Wellesley-Cambridge, 1991.
Module Exam
Description of exams and course work
Students demonstrate that they have gained deeper knowledge of the mathematical concepts of the numerical algorithms presented in the course. The students are expected to be able to derive the methods, to explain their properties, to read and write pseudocode of the algorithms, and to apply them to specific examples.
Exam Repetition
The exam may be repeated at the end of the semester.
Current exam dates
Currently TUMonline lists the following exam dates. In addition to the general information above please refer to the current information given during the course.
Title | |||
---|---|---|---|
Time | Location | Info | Registration |
Numerical Programming 1 | |||
Mon, 2021-03-29, 8:00 till 9:30 | Written remote exam without video surveillance | till 2021-03-22 |