Home › Appuntamenti › Efficient discretisation and domain decomposition precondit [...] | IT|EN |
Sala conferenze IMATI-CNR, Pavia - Martedì 11 Luglio 2017 h.15:00
Abstract. Solving the linear elasticity and Stokes equations by an optimal domain decomposition method involves the use of non standard interface conditions whose discretisation is not trivial. For this reason the use of approximation methods such as hybrid discontinuous Galerkin appears as an appropriate strategy: on the one hand they provide the best compromise in terms of the number of degrees of freedom in between standard continuous and discontinuous Galerkin methods, and on the other hand the degrees of freedom used in the non standard interface conditions are naturally defined at the boundary between elements. In this presentation I show the coupling between a well chosen discretisation method (hybrid discontinuous Galerkin) and a novel and efficient domain decomposition method to solve the Stokes system. The original definition of the domain decomposition preconditioners is one-level, this is, the preconditioner is built only using the solution of local problems. This has the undesired consequence that the results are not scalable, it means that the number of iterations needed to reach convergence increases with the number of subdomains. This is the reason why we have also introduced, and tested numerically, two-level preconditioners. Such preconditioners use a coarse space in their construction. We consider two finite element discretisations, namely, the hybrid discontinuous Galerkin and Taylor-Hood discretisations for the nearly incompressible elasticity problems and Stokes equations.
Università degli Studi di Pavia -
Via Ferrata, 5 - 27100 Pavia
Tel +39.0382.985600 - Fax +39.0382.985602