SearcharxivSearch

arXiv subjects

Sergej Rjasanow

Publications and source records attributed to Sergej Rjasanow.

5 recordsLinked to original sources

Analysis of Moment Closures Using $φ$-Divergences for Rarefied Dynamics with Binary Collisions and Their Galerkin Discretizations

This work introduces a robust deterministic framework for approximating solutions of the Boltzmann equation with binary collisions by discretizing their dependence on time, position, and velocity using Galerkin methods. By employing a family of parametric Galerkin closures based on $φ$-divergences in velocity space, we derive rigorous hierarchies of moment equations that govern fluid dynamic variables. Addressing the limitation that these closures alone do not guarantee dissipation of a $φ$-divergence entropy for the true binary collision operator, we restore this property by formulating a compatible approximate collision operator tailored to each closure. This constructed operator intrinsically retains fundamental physical properties essential for high-fidelity flow simulations, including Galilean invariance, exact conservation of mass, momentum, and energy, and strict dissipation of a $φ$-divergence entropy. Furthermore, we show that the resulting closed moment systems are symmetric-dissipative, yielding Cauchy problems that are well-posed locally in time. To translate this mathematical foundation into an efficient computational tool, we discretize the position and time variables with an entropy-stable discontinuous Galerkin (DG) finite element method. The fully implicit, entropy-stable space-time approach enables time steps far beyond typical CFL-limited step sizes and the direct computation of steady states. The robustness and accuracy of the methodology are verified and validated through numerical simulations on the supersonic nozzle flow of argon, mass flow through a channel, and heat transfer between parallel walls, demonstrating agreement with analytical benchmarks, experimental measurements, and stochastic particle simulations.

math.NA

Numerical Solution of the Bardeen-Cooper-Schrieffer Equation for Unconventional Superconductors

In this work, we consider the analytical properties and the efficient numerical solution of the Bardeen-Cooper-Schrieffer equation for unconventional superconductivity incorporating long-range power-law electron-electron interactions within a tight-binding model on a $d$-dimensional lattice. It is a nonlinear convolution equation for the complex matrix-valued superconducting gap under symmetry constraints imposed by the fermionic anticommutation rules. The long-range interaction enters in momentum space in the form of the now efficiently computable Epstein zeta function, which exhibits a power-law singularity at zero momentum. This needs to be accounted when evaluating the convolution. After a brief overview of some of the equation's analytical properties, we discuss its efficient numerical solution using a Galerkin method with B-splines. We present numerical results for a nodal superconductor on a two-dimensional square lattice.

math-ph

Multidisciplinary benchmarks of a conservative spectral solver for the nonlinear Boltzmann equation

The Boltzmann equation describes the evolution of the phase-space probability distribution of classical particles under binary collisions. Approximations to it underlie the basis for several scholarly fields, including aerodynamics and plasma physics. While these approximations are appropriate in their respective domains, they can be violated in niche but diverse applications which require direct numerical solution of the original nonlinear Boltzmann equation. An expanded implementation of the Galerkin-Petrov conservative spectral algorithm is employed to study a wide variety of physical problems. Enabled by distributed precomputation, solutions of the spatially homogeneous Boltzmann equation can be achieved in seconds on modern personal hardware, while spatially-inhomogeneous problems are solvable in minutes. Several benchmarks against both analytic theoretical predictions and comparisons to other Boltzmann solvers are presented in the context of several domains including weakly ionized plasma, gaseous fluids, and atomic-plasma interaction.

physics.plasm-ph

Vlasov-Poisson system tackled by particle simulation utilising boundary element methods

This paper presents a grid-free simulation algorithm for the fully three-dimensional Vlasov--Poisson system for collisionless electron plasmas. We employ a standard particle method for the numerical approximation of the distribution function. Whereas the advection of the particles is grid-free by its very nature, the computation of the acceleration involves the solution of the non-local Poisson equation. To circumvent a volume mesh, we utilise the Fast Boundary Element Method, which reduces the three-dimensional Poisson equation to a system of linear equations on its two-dimensional boundary. This gives rise to fully populated matrices which are approximated by the $\mathcal H^2$-technique, reducing the computational time from quadratic to linear complexity. The approximation scheme based on interpolation has shown to be robust and flexible, allowing a straightforward generalisation to vector-valued functions. In particular, the Coulomb forces acting on the particles are computed in linear complexity. In first numerical tests, we validate our approach with the help of classical non-linear plasma phenomena. Furthermore, we show that our method is able to simulate electron plasmas in complex three-dimensional domains with mixed boundary conditions in linear complexity.

math.NA

Galerkin-Petrov approach for the Boltzmann equation

In this work, we propose a new Galerkin-Petrov method for the numerical solution of the classical spatially homogeneous Boltzmann equation. This method is based on an approximation of the distribution function by associated Laguerre polynomials and spherical harmonics and test an a variational manner with globally defined three-dimensional polynomials. A numerical realization of the algorithm is presented. The algorithmic developments are illustrated with the help of several numerical tests.

math.NA