Search arXivSearch

arXiv · 2109.13076

Using neural networks to solve the 2D Poisson equation for electric field computation in plasma fluid simulations

Abstract

The Poisson equation is critical to get a self-consistent solution in plasma fluid simulations used for Hall effect thrusters and streamer discharges, since the Poisson solution appears as a source term of the unsteady nonlinear flow equations. As a first step, solving the 2D Poisson equation with zero Dirichlet boundary conditions using a deep neural network is investigated using multiple-scale architectures, defined in terms of number of branches, depth and receptive field. One key objective is to better understand how neural networks learn the Poisson solutions and provide guidelines to achieve optimal network configurations, especially when coupled to the time-varying Euler equations with plasma source terms. Here, the Receptive Field is found critical to correctly capture large topological structures of the field. The investigation of multiple architectures, losses, and hyperparameters provides an optimal network to solve accurately the steady Poisson problem. The performance of the optimal neural network solver, called PlasmaNet, is then monitored on meshes with increasing number of nodes, and compared with classical parallel linear solvers. Next, PlasmaNet is coupled with an unsteady Euler plasma fluid equations solver in the context of the electron plasma oscillation test case. In this time-evolving problem, a physical loss is necessary to produce a stable simulation. PlasmaNet is finally tested on a more complex case of discharge propagation involving chemistry and advection. The guidelines established in previous sections are applied to build the CNN to solve the same Poisson equation in cylindrical coordinates with different boundary conditions. Results reveal good CNN predictions and pave the way to new computational strategies using modern GPU-based hardware to predict unsteady problems involving a Poisson equation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lionel Cheng, Ekhi Ajuria Illarramendi, Guillaume Bogopolsky, Michael Bauerheim, Benedicte Cuenot. 2021-11-17. Using neural networks to solve the 2D Poisson equation for electric field computation in plasma fluid simulations. https://arxiv.org/abs/2109.13076

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

KEEP EXPLORING

Related papers

Online Regularized Statistical Learning in Reproducing Kernel Hilbert Space With Non-Stationary Data

We study recursive regularized learning algorithms in the reproducing kernel Hilbert space (RKHS) with non-stationary online data streams. We introduce the concept of a random Tikhonov regularization path and decompose the tracking error of the algorithm's output for the regularization path into random difference equations in RKHS. We show that the tracking error vanishes in mean square and almost surely if the regularization path is slowly time-varying. Then, leveraging the monotonicity of inverse operators and the spectral decomposition of compact operators, and introducing the RKHS persistence of excitation condition, we develop a dominated convergence method to prove the mean square and almost sure consistency between the regularization path and the unknown function to be learned. Especially, for independent and non-identically distributed data streams, the mean square and almost sure consistency between the algorithm's output and the unknown function is achieved if the input data's marginal probability measures are slowly time-varying and the average measure over each fixed-length time period is uniformly above a strictly positive finite Borel measure.

cs.LG

Reflective Policy Optimization

On-policy reinforcement learning methods, like Trust Region Policy Optimization (TRPO) and Proximal Policy Optimization (PPO), often demand extensive data per update, leading to sample inefficiency. This paper introduces Reflective Policy Optimization (RPO), a novel on-policy extension that amalgamates past and future state-action information for policy optimization. This approach empowers the agent for introspection, allowing modifications to its actions within the current state. Theoretical analysis confirms that policy performance is monotonically improved and contracts the solution space, consequently expediting the convergence procedure. Empirical results demonstrate RPO's feasibility and efficacy in two reinforcement learning benchmarks, culminating in superior sample efficiency. The source code of this work is available at https://github.com/Edgargan/RPO.

cs.LG

Transductive Off-policy Proximal Policy Optimization

Proximal Policy Optimization (PPO) is a popular model-free reinforcement learning algorithm, esteemed for its simplicity and efficacy. However, due to its inherent on-policy nature, its proficiency in harnessing data from disparate policies is constrained. This paper introduces a novel off-policy extension to the original PPO method, christened Transductive Off-policy PPO (ToPPO). Herein, we provide theoretical justification for incorporating off-policy data in PPO training and prudent guidelines for its safe application. Our contribution includes a novel formulation of the policy improvement lower bound for prospective policies derived from off-policy data, accompanied by a computationally efficient mechanism to optimize this bound, underpinned by assurances of monotonic improvement. Comprehensive experimental results across six representative tasks underscore ToPPO's promising performance.

cs.LG