We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.NA

Change to browse by:

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Numerical Analysis

Title: Efficient preconditioners for coupled Stokes-Darcy problems

Abstract: Coupled systems of free flow and porous media arise in a variety of technical and environmental applications. For laminar flow regimes, such systems are described by the Stokes equations in the free-flow region and Darcy's law in the porous medium. An appropriate set of coupling conditions is needed on the fluid-porous interface. Discretisations of the Stokes-Darcy problems yield large, sparse, ill-conditioned, and, depending on the interface conditions, non-symmetric linear systems. Therefore, robust and efficient preconditioners are needed to accelerate convergence of the applied Krylov method. In this work, we develop and investigate block diagonal, block triangular and constraint preconditioners for the coupled Stokes-Darcy problems. We apply two classical sets of coupling conditions considering the Beavers-Joseph and the Beavers-Joseph-Saffman condition for the tangential velocity. For the Beavers-Joseph interface condition, the resulting system is non-symmetric, therefore GMRES method is used. Spectral and field-of-values bounds independent of the grid width are derived for the exact versions of the preconditioners. Furthermore, we develop efficient inexact versions of the preconditioners. We demonstrate the effectiveness and robustness of the proposed preconditioners in numerical experiments.
Subjects: Numerical Analysis (math.NA)
MSC classes: 65F08, 65N08, 76D07, 76S05
Cite as: arXiv:2404.18639 [math.NA]
  (or arXiv:2404.18639v1 [math.NA] for this version)

Submission history

From: Paula Strohbeck [view email]
[v1] Mon, 29 Apr 2024 12:18:02 GMT (4432kb,D)

Link back to: arXiv, form interface, contact.