Publication

Iterative methods for Stokes/Darcy coupling

Marco Discacciati
2005
Conference Papers

Abstract

We present iterative subdomain methods based on a domain decomposition approach to solve the coupled Stokes/Darcy problem using finite elements. The dependence of the convergence rate on the grid parameter h and on the physical data is discussed; some difficulties encountered when applying the algorithms are indicated together with possible improvement strategies.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Iterative methods for Stokes/Darcy coupling

Chat with Graph Search

Randomized flexible GMRES with deflated restarting

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Residual-based attention in physics-informed neural networks