2021
DOI: 10.1002/nme.6853
|View full text |Cite
|
Sign up to set email alerts
|

On a marching level‐set method for extended discontinuous Galerkin methods for incompressible two‐phase flows: Application to two‐dimensional settings

Abstract: In this work a solver for two-dimensional, instationary two-phase flows on the basis of the extended discontinuous Galerkin (extended DG/XDG) method is presented. The XDG method adapts the approximation space conformal to the position of the interface. This allows a subcell accurate representation of the incompressible Navier-Stokes equations in their sharp interface formulation. The interface is described as the zero set of a signed-distance level-set function and discretized by a standard DG method. For the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 9 publications
(10 citation statements)
references
References 45 publications
(103 reference statements)
0
8
0
Order By: Relevance
“…Following the XDG discretization in Smuda and Kummer, 19 we propose the following discretization for the moving contact line problem (2), (4) and boundary conditions (6) with the GNBC (7) and (8): Find (un+1,pn+1)𝕍kX(tn+1), such that (vn+1,qn+1)𝕍kX(tn+1) 1d0normalΔtmfalse(boldun+1,boldun,boldunprefix−1,boldunprefix−2,boldvn+1,boldvn,boldvnprefix−1,boldvnprefix−2false)+cfalse(boldun+1,boldun+1,boldvn+1false)+bfalse(pn+1,boldvn+1false)prefix−bfalse(qn+1,boldun+1false)2emprefix−afalse(boldun+1,boldvn+1false)prefix−anormalS…”
Section: The Xdg Methods For Moving Contact Line Problemsmentioning
confidence: 99%
See 4 more Smart Citations
“…Following the XDG discretization in Smuda and Kummer, 19 we propose the following discretization for the moving contact line problem (2), (4) and boundary conditions (6) with the GNBC (7) and (8): Find (un+1,pn+1)𝕍kX(tn+1), such that (vn+1,qn+1)𝕍kX(tn+1) 1d0normalΔtmfalse(boldun+1,boldun,boldunprefix−1,boldunprefix−2,boldvn+1,boldvn,boldvnprefix−1,boldvnprefix−2false)+cfalse(boldun+1,boldun+1,boldvn+1false)+bfalse(pn+1,boldvn+1false)prefix−bfalse(qn+1,boldun+1false)2emprefix−afalse(boldun+1,boldvn+1false)prefix−anormalS…”
Section: The Xdg Methods For Moving Contact Line Problemsmentioning
confidence: 99%
“…The evolution algorithm presented in Smuda and Kummer 19 is divided into two stages. In the first stage, the extension velocity is computed monolithic with high‐order accuracy on the cut‐cells Kcc using the reformulation of the EVP (28) into an elliptic PDE 30 .…”
Section: Interface Evolution and Coupling With Nsementioning
confidence: 99%
See 3 more Smart Citations