Mutilevel Methods for Solving Linear Systems of EquationsModule description #20499 / Version 1
- 5 CP
- Oral exam
- Graded
- Summer semester
- German
| Module / Version | #20499 / #1 |
|---|---|
| Validity | Since SS 2017 |
| Available language(s) | English, German |
| Credit points | 5 |
| Person responsible for the module | Nabben, Reinhard |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät II |
|---|---|
| Institute | Institut für Mathematik |
| Academic chair | Not specified |
Contact
| Office | MA 3-3 |
|---|---|
| Contact person | Nabben, Reinhard |
| E-mail address | reinhard.nabben@tu-berlin.de |
| Website | Not specified |
Learning outcomes
Students will be able to distinguish between, understand, and apply various concepts of multilevel methods.
Content
Solving linear systems of equations is often the subproblem within very complex algorithms that requires the most computation time. It is not uncommon to have to solve systems of equations with several million unknowns. Therefore, there is a great need for fast solvers for systems of equations. Multilevel methods in combination with Krylov subspace methods are among the fastest solvers. Classical multilevel methods include the geometric and algebraic multigrid methods. Deflation techniques can also be regarded as multilevel methods. Both types of methods are used as preconditioners for Krylov subspace methods, such as the CG or GMRES methods.
In this lecture, the basic concepts of various multilevel methods will be explained and compared.
Keywords include: numerical linear algebra, projection methods, Krylov subspace methods, preconditioning, deflation, multigrid methods
English:
Finding the solution to linear systems of equations is often the most time-consuming part of more complex algorithms. Therefore, fast solvers need to be developed and analyzed.
Multilevel methods, in combination with Krylov subspace methods, are among the fastest methods for solving linear systems of equations. Classical multilevel methods include geometric and algebraic multigrid methods. However, deflation techniques can also be regarded as multilevel methods. Both types of methods are now used as preconditioners for Krylov subspace methods, such as the CG or GMRES methods.
This course covers the basic concepts of multilevel methods.
Keywords: Numerical linear algebra, projection methods, Krylov subspace methods, preconditioning, deflation techniques, multigrid methods
In this lecture, the basic concepts of various multilevel methods will be explained and compared.
Keywords include: numerical linear algebra, projection methods, Krylov subspace methods, preconditioning, deflation, multigrid methods
English:
Finding the solution to linear systems of equations is often the most time-consuming part of more complex algorithms. Therefore, fast solvers need to be developed and analyzed.
Multilevel methods, in combination with Krylov subspace methods, are among the fastest methods for solving linear systems of equations. Classical multilevel methods include geometric and algebraic multigrid methods. However, deflation techniques can also be regarded as multilevel methods. Both types of methods are now used as preconditioners for Krylov subspace methods, such as the CG or GMRES methods.
This course covers the basic concepts of multilevel methods.
Keywords: Numerical linear algebra, projection methods, Krylov subspace methods, preconditioning, deflation techniques, multigrid methods
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Multilevel methods for solving linear systems of equations | Lecture | Summer semester | [en, de] | ISIS |
Workload and credit points
Multilevel methods for solving linear systems of equations (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 2 h | 30 h |
| Preparation and follow-up review | 15 | 6 h | 90 h |
| 120 h | |||
Course-independent workload
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Exam preparation | 1 | 30 h | 30 h |
| 30 h | |||
The workload of the module adds up to 150 hours. The module therefore comprises 5 credit points.
Description of teaching and learning methods
Lectures
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Numerical Linear Algebra
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | German |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Summer semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Standard.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
No recommended literature given
Assigned programs
This module version is used in the following programs:
| Program / program version | Semester(s) | Curriculum component |
|---|---|---|
| Business Mathematics StuPO 2014 | SS 2025 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra |
| WS 2025/26 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| SS 2026 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| WS 2026/27 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| Business Mathematics Business Mathematics (M. Sc.) - StuPO 2014 | SS 2025 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra |
| WS 2025/26 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| SS 2026 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| WS 2026/27 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| Mathematics Mathematics (B. Sc.) - Bachelor Mathematik 2014 | SS 2025 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra |
| WS 2025/26 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| SS 2026 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| WS 2026/27 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| Mathematics StuPO 2014 | SS 2025 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra |
| WS 2025/26 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| SS 2026 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| WS 2026/27 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| Technomathematics Technomathematics (M. Sc.) - StuPO 2014 | SS 2025 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra |
| WS 2025/26 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| SS 2026 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| WS 2026/27 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| Technomathematics Technomathematics (B. Sc.) - StuPO 2014 | SS 2025 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra |
| WS 2025/26 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| SS 2026 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra | |
| WS 2026/27 | Vertiefung Mathematik › Fortgeschrittene Module - Diskrete Mathematik und Algebra |
Miscellaneous
[Contains machine generated translations 2026-07-07 11:17, only the German version is legally binding]