Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Staggered DG method for coupling of the Stokes and Darcy-Forchheimer problems (1906.06652v1)

Published 16 Jun 2019 in math.NA and cs.NA

Abstract: In this paper we develop a staggered discontinuous Galerkin method for the Stokes and Darcy-Forchheimer problems coupled with the \Red{Beavers-Joseph-Saffman} conditions. The method is defined by imposing staggered continuity for all the variables involved and the interface conditions are enforced by switching the roles of the variables met on the interface, which eliminate the hassle of introducing additional variables. This method can be flexibly applied to rough grids such as the highly distorted grids and the polygonal grids. In addition, the method allows nonmatching grids on the interface thanks to the special inclusion of the interface conditions, which is highly appreciated from a practical point of view. A new discrete trace inequality and a generalized Poincar\'{e}-Friedrichs inequality are proved, which enables us to prove the optimal convergence estimates under reasonable regularity assumptions. Finally, several numerical experiments are given to illustrate the performances of the proposed method, and the numerical results indicate that the proposed method is accurate and efficient, in addition, it is a good candidate for practical applications.

Citations (15)

Summary

We haven't generated a summary for this paper yet.