Search NASA⌕ Search

SEARCH · Search NASA

Results for “Poisson”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

On the Magnetic Shield for a Vlasov–Poisson Plasma

We study the screening of a bounded body Γ against the effect of a wind of charged particles, by means of a shield produced by a magnetic field which becomes infinite on the border of Γ. The charged wind is modeled by a Vlasov–Poisson plasma, the bounded body by a torus, and the external magnetic field is taken close to the border of Γ. We study two models: a plasma composed by different species with positive or negative charges, and finite total mass of each species, and another made of many species of the same sign, each having infinite mass. We investigate the time evolution of both systems, showing in particular that the plasma particles cannot reach the body. Finally we discuss possible extensions to more general initial data. We show also that when the magnetic lines are straight lines, (that imposes an unbounded body), the previous results can be improved.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Semi-Lagrangian Spectral Method for the Vlasov–Poisson System Based on Fourier, Legendre and Hermite Polynomials

In this study, we apply a semi-Lagrangian spectral method for the Vlasov–Poisson system, previously designed for periodic Fourier discretizations, by implementing Legendre polynomials and Hermite functions in the approximation of the distribution function with respect to the velocity variable. We discuss second-order accurate-in-time schemes, obtained by coupling spectral techniques in the space–velocity domain with a BDF time-stepping scheme. The resulting method possesses good conservation properties, which have been assessed by a series of numerical tests conducted on some standard benchmark problems including the two-stream instability and the Landau damping test cases. In the Hermite case, we also investigate the numerical behavior in dependence of a scaling parameter in the Gaussian weight. Confirming previous results from the literature, our experiments for different representative values of this parameter, indicate that a proper choice may significantly impact on accuracy, thus suggesting that suitable strategies should be developed to automatically update the parameter during the time-advancing procedure.

97 MATHEMATICS AND COMPUTING↗

Physics-based stabilized finite element approximations of the Poisson–Nernst–Planck equations

We present and analyze two stabilized finite element methods for solving numerically the Poisson–Nernst–Planck equations. The stabilization we consider is carried out by using a shock detector and a discrete graph Laplacian operator for the ion equations, whereas the discrete equation for the electric potential need not be stabilized. Discrete solutions stemmed from the first algorithm preserve both maximum and minimum discrete principles. For the second algorithm, its discrete solutions are conceived so that they hold discrete principles and obey an entropy law provided that an acuteness condition is imposed for meshes. Remarkably the latter is found to be unconditionally stable. We validate our methodology through transient numerical experiments that show convergence toward steady-state solutions.

97 MATHEMATICS AND COMPUTING↗

A tensor train-based isogeometric solver for large-scale 3D poisson problems

We introduce a three-dimensional (3D), fully tensor train (TT) assembled isogeometric analysis (IGA) framework, TT-IGA, for solving partial differential equations (PDEs). Our method reformulates IGA discrete operators into TT format, enabling efficient compression and computation. Geometry evaluations use the original NURBS description at sampling points and TT approximation is applied to geometry-derived coefficient fields and discrete operators. We demonstrate the effectiveness of the proposed TT-IGA framework on the three-dimensional Poisson equation, achieving substantial reductions in memory and computational cost without compromising solution quality.

97 MATHEMATICS AND COMPUTING↗

Conservative fourth-order finite-volume Vlasov–Poisson solver for axisymmetric plasmas in cylindrical (r,v r ,v θ ) phase space coordinates

In this paper, a fourth-order finite-volume Vlasov–Poisson algorithm is developed for simulating axisymmetric plasma configurations in ( r , v r , v θ ) phase space coordinates. The Vlasov equation for cylindrical phase space coordinates is cast into conservation-law form and is discretized on a structured grid. The conservative finite-volume discretization is based on fifth-order upwind reconstructions of the distribution function and a fourth-order quadrature rule that accounts for transverse variations of fluxes along control volume surfaces. High-order specular reflection boundary conditions enable high-fidelity treatment of plasma distribution functions at the axis and at wall boundaries. The numerical method is applied to simulate a confined uniform neutral gas to assess convergence properties for an equilibrium system in which effects of finite-temperature and acceleration due to centrifugal and Coriolis forces are present. The discretization is also applied to a Z-pinch configuration to study electrostatic ion confinement and the dynamics of the associated breathing mode. Simulations show that the ion distribution function exhibits non-Maxwellian features and that a temperature anisotropy develops and is sustained. Finally, the finite-volume implementation is demonstrated to converge at fourth-order for both applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Arbitrary-order time-accurate semi-Lagrangian spectral approximations of the Vlasov–Poisson system

The Vlasov–Poisson system, modeling the evolution of non-collisional plasmas in the electrostatic limit, is approximated by a semi-Lagrangian technique. Spectral methods of periodic type are implemented through a collocation approach. Groups of particles are represented by the Fourier Lagrangian basis and evolve, for a single timestep, along a high-order accurate representation of the local characteristic lines. The time-advancing technique is based on truncated Taylor series that can be, in principle, of any order of accuracy. A variant is obtained by coupling the phase space discretization with high-order accurate Backward Differentiation Formulas (BDF). At each timestep, particle displacements are reinterpolated and expressed in the original basis to guarantee the order of accuracy in all the variables at relatively low costs. Thus, these techniques combine the excellent features of spectral approximations with high-order time integration. The resulting method has excellent conservation properties. Indeed, it can be proven that the total number of particles, proportional to the total mass and charge, is conserved up to the machine precision. Series of numerical experiments are performed in order to assess the real performance. In particular, comparisons with standard benchmarks are examined.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Conservative DG method for the micro-macro decomposition of the Vlasov–Poisson–Lenard–Bernstein model

The micro-macro (mM) decomposition approach is considered for the numerical solution of the Vlasov– Poisson–Lenard–Bernstein (VPLB) system, which is relevant for plasma physics applications. In the mM approach, the kinetic distribution function is decomposed as $f$ = $\mathscr{E}$[$ρ_f$] + g , where $\mathscr{E}$ is a local equilibrium distribution, depending on the macroscopic moments $ρ_f$ = $∫_{\mathbb{R}}$ $efdv$ = $\langle$$ef$$\rangle$$_{\mathbb{R}}$, where e = (1, $v$, $\frac{1}{2}$ $v^2$) T , and $g$, the microscopic distribution, is defined such that $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0. We aim to design numerical methods for the mM decomposition of the VPLB system, which consists of coupled equations for $ρ_f$ and $g$. To this end, we use the discontinuous Galerkin (DG) method for phase-space discretization, and implicit-explicit (IMEX) time integration, where the phase-space advection terms are integrated explicitly and the collision operator is integrated implicitly. We give special consideration to ensure that the resulting mM method maintains the $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0 constraint, which may be necessary for obtaining (i) satisfactory results in the collision dominated regime with coarse velocity resolution, and (ii) unambiguous conservation properties. The constraint-preserving property is achieved through a consistent discretization of the equations governing the micro and macro components. Here, we present numerical results that demonstrate the performance of the mM method. The mM method is also compared against a corresponding DG-IMEX method solving directly for $f$.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sparse-grid discontinuous Galerkin methods for the Vlasov–Poisson–Lenard–Bernstein model

Sparse-grid methods have recently gained interest in reducing the computational cost of solving high-dimensional kinetic equations. In this paper, we construct adaptive and hybrid sparse-grid methods for the Vlasov–Poisson–Lenard–Bernstein (VPLB) model. This model has applications to plasma physics and is simulated in two reduced geometries: a 0x3v space homogeneous geometry and a 1x3v slab geometry. Here we use the discontinuous Galerkin (DG) method as a base discretization due to its high-order accuracy and ability to preserve important structural properties of partial differential equations. We utilize a multiwavelet basis expansion to determine the sparse-grid basis and the adaptive mesh criteria. We analyze the proposed sparse-grid methods on a suite of three test problems by computing the savings afforded by sparse-grids in comparison to standard solutions of the DG method. The results are obtained using the adaptive sparse-grid discretization library ASGarD.

97 MATHEMATICS AND COMPUTING↗

Rate-dependent deformation and Poisson’s effect in porous titanium

Dynamic and quasi-static compression experiments are conducted on a high-density porous titanium with in situ X-ray imaging to characterize its deformation dynamics. The porous titanium exhibits higher strain-rate sensitivity than full-density titanium. Strain field mapping indicates that compaction bands are narrower and denser under dynamic loading, leading to a more homogeneous strain distribution and thus a higher flow stress. Here, the mean Poisson's ratio for dynamic loading is 15% lower than that for quasi-static loading at the same bulk strain, as a result of local inertial confinement which also contributes to the rate hardening of porous titanium.

36 MATERIALS SCIENCE↗

Nonlinear Poisson–Boltzmann solutions for charged parallel plates: When opposite charges repel

I present an exact solution of the Poisson–Boltzmann equation for two parallel plates and discuss the solution properties. I discuss in more detail plates with opposite charges: In this case, there are two critical separations, L c,1 < L c,2 . For separations less than L c,1 , the force between plates is repulsive. It switches to attractive at L c,1 , but with the electric potential having the same sign on both plates. For L > L c,2 , the force remains attractive, and the potential at the plates has the same sign as the charge on each plate. I also describe charge regulation, determined by pK a , and provide formulas for both the critical distance where oppositely charged plates repel and their charging process. Finally, the implications of these results for the nanoparticle assembly, as driven by electrostatic interactions, are also discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Convolutional Non-Homogeneous Poisson Process and its Application to Wildfire Ignition Risk Quantification for Power Delivery Networks

To quantify wildfire ignition risks on power delivery networks, the current practice predominantly relies on the empirically calculated fire danger indices, which may not well capture the effects of dynamically changing environmental factors. This article proposes a spatio-temporal point process model, known as the Convolutional Non-homogeneous Poisson Process (cNHPP), and applies the model to quantify wildfire ignition risks for power delivery networks. The proposed model captures both the current (i.e., instantaneous) and cumulative (i.e., historical) effects of key environmental processes (i.e., covariates) on wildfire risks, as well as the spatio-temporal dependency among different segments of the power delivery network. The computation and interpretation of the intensity function are thoroughly investigated. We apply the proposed approach to estimate wildfire ignition risks on major transmission lines in California, using historical fire data, meteorological and vegetation data obtained from the National Oceanic and Atmospheric Administration and National Aeronautics and Space Administration. Here, a comprehensive comparison study is performed to show the applicability and predictive capability of the proposed approach.

Non-homogeneous Poisson Process↗

A numerical Poisson solver with improved radial solutions for a self-consistent locally scaled self-interaction correction method

Abstract The universal applicability of density functional approximations is limited by self-interaction error made by these functionals. Recently, a novel one-electron self-interaction-correction (SIC) method that uses an iso-orbital indicator to apply the SIC at each point in space by scaling the exchange-correlation and Coulomb energy densities was proposed. The locally scaled SIC (LSIC) method is exact for the one-electron densities, and unlike the well-known Perdew–Zunger SIC (PZSIC) method recovers the uniform electron gas limit of the uncorrected density functional approximation, and reduces to PZSIC method as a special case when isoorbital indicator is set to the unity. Here, we present a numerical scheme that we have adopted to evaluate the Coulomb potential of the electron density scaled by the iso-orbital indicator required for the self-consistent LSIC calculations. After analyzing the behavior of the finite difference method (FDM) and the green function solution to the radial part of the Poisson equation, we adopt a hybrid approach that uses the FDM for the Coulomb potential due to the monopole and the GF for all higher-order terms. The performance of the resultant hybrid method is assessed using a variety of systems. The results show improved accuracy than earlier numerical schemes. We also find that, even with a generic set of radial grid parameters, accurate energy differences can be obtained using a numerical Coulomb solver in standard density functional studies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A 4 th -Order Particle-in-Cell Method with Phase-Space Remapping for the Vlasov&ndash;Poisson Equation

Numerical solutions to the Vlasov-Poisson system of equations have important applications to both plasma physics and cosmology. In this paper, we present a new particle-in- cell (PIC) method for solving this system that is 4th-order accurate in both space and time. Our method is a high-order extension of one presented previously [B. Wang, G. H. Miller, and P. Colella, SIAM J. Sci. Comput. , 33 (2011), pp. 3509-3537]. It treats all of the stages of the standard PIC update|charge deposition, force interpolation, the field solve, and the particle push|with 4th-order accuracy, and includes a 6th-order accurate phase-space remapping step for controlling particle noise. Here, we demonstrate the convergence of our method on a series of one- and two- dimensional electrostatic plasma test problems, comparing its accuracy to that of a 2 nd -order method. As expected, the 4 th -order method can achieve accuracy comparable to that of the 2nd-order method and with considerably fewer resolution elements.

97 MATHEMATICS AND COMPUTING↗

Graph link prediction in computer networks using Poisson matrix factorisation

Graph link prediction is an important task in cybersecurity: relationships between entities within a computer network, such as users interacting with computers or system libraries and the corresponding processes that use them, can provide key insights into adversary behaviour. Poisson matrix factorisation (PMF) is a popular model for link prediction in large networks, particularly useful for its scalability. In this article PMF is extended to include scenarios that are commonly encountered in cybersecurity applications. Specifically, an extension is proposed to explicitly handle binary adjacency matrices and include known categorical covariates associated with the graph nodes. A seasonal PMF model is also presented to handle seasonal networks. To allow the methods to scale to large graphs, variational methods are discussed for performing fast inference. The results show an improved performance over the standard PMF model and other statistical network models.

97 MATHEMATICS AND COMPUTING↗

A fourth-order Cartesian grid embeddedboundary method for Poisson’s equation

In this paper, we present a fourth-order algorithm to solve Poisson's equation in two and three dimensions. We use a Cartesian grid, embedded boundary method to resolve complex boundaries. We use a weighted least squares algorithm to solve for our stencils. We use convergence tests to demonstrate accuracy and we show the eigenvalues of the operator to demonstrate stability. We compare accuracy and performance with an established second-order algorithm. We also discuss in depth strategies for retaining higher-order accuracy in the presence of nonsmooth geometries.

97 MATHEMATICS AND COMPUTING↗