Search arXivSearch

arXiv · 1910.03226

Splitting Methods For Solving Multi-Component Transport Model: A Multicomponent Mixture for Hydrogen Plasma

Abstract

In this paper, we present a splitting algorithm to solve multicomponent transport models. These models are related to plasma simulations, in which we consider the local thermodynamic equilibrium and weakly ionised plasma-mixture models that are used for medical and technical applications in etching processes. These multi-component transport-mixture models can be derived by approximately solving a linearised multi-component Boltzmann equation with an approximation of the collision terms in the mass, momentum and energy equations. The model-equations are nonlinear partial differential equations and they are known as Stefan-Maxwell equations. However, these partial differential equations are delicate to solve and we propose to use noniterative and iterative splitting methods. In the numerical experiments, we see the benefit of the iterative splitting methods, while these methods can relax the nonlinear terms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juergen Geiser. 2019-10-08. Splitting Methods For Solving Multi-Component Transport Model: A Multicomponent Mixture for Hydrogen Plasma. https://arxiv.org/abs/1910.03226

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Two-layers neural networks for Schr{ö}dinger eigenvalue problems

The aim of this article is to analyze numerical schemes using two-layer neural networks with infinite width for the resolution of high-dimensional Schr{ö}dinger eigenvalue problems with smooth interaction potentials and Neumann boundary condition on the unit cube in any dimension. More precisely, any eigenfunction associated to the lowest eigenvalue of the Schr{ö}dinger operator is a unit L 2 norm minimizer of the associated energy. Using Barron's representation of the solution with a probability measure defined on the set of parameter values and following the approach initially suggested by Bach and Chizat [1], the energy is minimized thanks to a constrained gradient curve dynamic on the 2-Wasserstein space of the set of parameter values defining the neural network. We prove the existence of solutions to this constrained gradient curve. Furthermore, we prove that, if it converges, the represented function is then an eigenfunction of the considered Schr{ö}dinger operator. At least up to our knowledge, this is the first work where this type of analysis is carried out to deal with the minimization of non-convex functionals.

math.AP

Validity of Prandtl Expansion for Steady Compressible Navier-Stokes-Fourier Flows

Assume no-slip boundary conditions for the velocity field and either insulated or Dirichlet boundary conditions for the temperature field in a steady compressible fluid. In the inviscid limit $\v \rightarrow 0$, we develop a mathematical framework for the uniform-in-$\v$ remainder estimate for the linear steady compressible Navier-Stokes-Fourier equations around a Prandtl layer profile with both velocity and thermal layers, which leads to the validity of the Prandtl layer expansion.

math.AP

Long time behaviour of Mean Field Games with fractional diffusion

In this paper we study the long time behaviour of mean field games systems with fractional diffusion, modeling the case that the individual dynamics of the players is driven by independent jump processes and controlled through the drift term, while being confined by an external field in order to guarantee ergodicity. In the case of globally Lipschitz, locally uniformly convex Hamiltonian, and weakly coupled costs satisfying the Lasry-Lions monotonicity condition, we prove that there is a unique solution $(u_T,m_T)$ to the mean field game problem in $(0,T)$ and we show that, if $T$ is sufficiently large, $(u_T,m_T)$ satisfies the so-called turnpike property, namely it is exponentially close to the (unique) stationary ergodic state for any proportionally long intermediate time.

math.AP