Javascript must be enabled for the correct page display

Elimination based hybrid methods for solving time-dependent PDEs

Koerts.F.J (2011) Elimination based hybrid methods for solving time-dependent PDEs. Bachelor's Thesis, Mathematics.

[img] Text
AkkoordWubs.pdf - Other
Restricted to Registered users only

Download (49kB)
bachelorthesis_Koerts.pdf - Published Version

Download (802kB) | Preview


In solving a PDE, a grid can be decomposed into subgrids in order to adapt it for parallel computing. On the subgrids, different solving techniques can be applied which result in some hybrid method. Since the amount of communication between processors is often the bottleneck for the computational effort we try to reduce it by an appropriate hybrid method. Here we might think of implicit-explicit integration methods, but also of integration-(quasi) stationary hybrid methods. The latter methods appear to be particularly promising if the state is sufficiently smooth in time.

Item Type: Thesis (Bachelor's Thesis)
Degree programme: Mathematics
Thesis type: Bachelor's Thesis
Language: English
Date Deposited: 15 Feb 2018 07:47
Last Modified: 15 Feb 2018 07:47

Actions (login required)

View Item View Item