University of Birmingham > Talks@bham > Optimisation and Numerical Analysis Seminars > Domain decomposition methods for the Stokes-Darcy problem

Domain decomposition methods for the Stokes-Darcy problem

Add to your list(s) Download to your calendar using vCal

  • UserMarco Discacciati (Loughborough University)
  • ClockThursday 25 October 2018, 12:00-13:00
  • HouseNuffield G13.

If you have a question about this talk, please contact Sergey Sergeev.

The Stokes-Darcy problem has received a growing attention by the mathematical community over the last decade not only due to its many possible applications but also to its mathematical nature. Indeed, it is a good example of a multi-physics problem where two different boundary value problems are coupled into a global heterogeneous one. The approximate solution of this problem could be obtained proceeding in a monolithic way using either a direct method or a suitably preconditioned iterative method. However, its multi-physics nature makes it suitable to domain decomposition techniques which allow to recover the solution of the global problem by iteratively solving each subproblem separately. The difficulty of this approach is to guarantee effective convergence and robustness of the iterations. In this talk, I will give an overview of few domain decomposition methods for the Stokes-Darcy problem considering their convergence, robustness and performance. I will present some numerical examples to show their effectiveness for practical applications.

This talk is part of the Optimisation and Numerical Analysis Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.