Please use this identifier to cite or link to this item: https://oar.tib.eu/jspui/handle/123456789/3201
Files in This Item:
File SizeFormat 
774690380.pdf1.76 MBAdobe PDFView/Open
Title: On iterative subdomain methods for the Stokes-Darcy problem
Authors: Caiazzo, AlfonsoJohn, VolkerWilbrandt, Ulrich
Issue Date: 2013
Published in: Preprint / Weierstraß-Institut für Angewandte Analysis und Stochastik , Volume 1812, ISSN 0946 – 8633
Publisher: Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik
Abstract: Iterative subdomain methods for the StokesDarcy problem that use Robin boundary conditions on the interface are reviewed. Their common underlying structure and their main differences are identified. In particular, it is clarified that there are different updating strategies for the interface conditions. For small values of fluid viscosity and hydraulic permeability, which are relevant in applications from geosciences, it is shown in numerical studies that only one of these updating strategies leads to an efficient numerical method, if this strategy is used in combination with appropriate parameters in the Robin boundary conditions. In particular, it is observed that the values of appropriate parameters are larger than those proposed so far. Not only the size but also the ratio of appropriate Robin parameters depends on the coefficients of the problem.
Keywords: Stokes–Darcy problem; iterative subdomain methods; Robin boundary conditions; finite element methods; continuous and discontinuous updating strategy; applications from geosciences
DDC: 510
License: This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.
Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.
Appears in Collections:Mathematik



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.