2007
DOI: 10.1016/j.jcp.2007.08.027
|View full text |Cite
|
Sign up to set email alerts
|

A moving interface method for dynamic kinetic–fluid coupling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
89
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 36 publications
(90 citation statements)
references
References 22 publications
(41 reference statements)
1
89
0
Order By: Relevance
“…We have shown a concise analysis for a simple, but relevant, model problem which showed that this type of coupling leads to a very efficient heterogeneous domain decomposition method. This method can be viewed as a formalisation of a coupling technique for very complex problems, see for example [5,6] for the coupling between kinetic and hydrodynamic equations. In such a coupling, the partition between the different fuzzy domains can evolve with time and can even adapt automatically to the local conditions using some local criterion, see [6].…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…We have shown a concise analysis for a simple, but relevant, model problem which showed that this type of coupling leads to a very efficient heterogeneous domain decomposition method. This method can be viewed as a formalisation of a coupling technique for very complex problems, see for example [5,6] for the coupling between kinetic and hydrodynamic equations. In such a coupling, the partition between the different fuzzy domains can evolve with time and can even adapt automatically to the local conditions using some local criterion, see [6].…”
Section: Resultsmentioning
confidence: 99%
“…This assumption has been used at least in two different series of papers: the first one is in physics for the approximation of neutrino radiative transfer in core-collapse supernovae [11,2,3], and the second one is in mathematics for the coupling between the kinetic equation and approximations of it (diffusion, Euler, Navier-Stokes...) [8,5,6,7].…”
Section: Motivationmentioning
confidence: 99%
See 1 more Smart Citation
“…Note also that the initial data is automatically switched thanks to the indicator function, as described in §4.2.1. See also [12]. We also recall that f n E,i,…”
Section: Relaxation Step In Es-bgk Cellsmentioning
confidence: 93%
“…Beside the difficulty in the design of effective breakdown criteria, see also the discussion in [20] and [12], another difficulty in domain decomposition algorithms is due to the need of exchanging information between the stochastic solution obtained with DSMC and the deterministic solution of the continuum solver. This can be circumvented reducing noise through averaging, as in [17], where the stochastic solution is computed with a smaller grid in space and time with respect to the macroscopic solution, and thus it is averaged over the larger macroscopic cells.…”
Section: Introductionmentioning
confidence: 99%