Preconditioning for Parallelizable Domain Decomposition Approach

Proseminar, Seminar paper, Bachelor thesis

For accurate and efficient simulations of electrical machines in 3D several prospective approaches are examined in more detail within the CRC TRR 361. One of which is the application of parallelization through domain decomposition. In order to obtain scalable solvers, preconditioning is a necessity because the number of iterations for reaching a certain tolerance in an iterative solver can be decreased.

In this work you are provided with code for generating discrete domain decomposition problems which is based on IsoGeometric Analysis and a mortaring approach. After familiarizing yourself with the theory and the implementation, different preconditioning approaches need to be explored and compared to each other.