Search NASA⌕ Search

SEARCH · Search NASA

Results for “Poisson equation”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Anti-symmetric and positivity preserving formulation of a spectral method for Vlasov-Poisson equations

We analyze the anti-symmetric properties of a spectral discretization for the one-dimensional Vlasov-Poisson equations. The discretization is based on a spectral expansion in velocity with the symmetrically weighted Hermite basis functions, central finite differencing in space, and an implicit Runge Kutta integrator in time. The proposed discretization preserves the anti-symmetric structure of the advection operator in the Vlasov equation, resulting in a stable numerical method. We apply such discretization to two formulations: the canonical Vlasov-Poisson equations and their continuously transformed square-root representation. The latter preserves the positivity of the particle distribution function. We derive analytically the conservation properties of both formulations, including particle number, momentum, and energy, which are verified numerically on the following benchmark problems: manufactured solution, linear and nonlinear Landau damping, two-stream instability, bump-on-tail instability, and ion-acoustic wave.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Poisson Equation for a (General) Homogeneous d-Dimensional Ellipsoid with Applications to Beam Envelope Tracking

This note describes the solution of the free-space Poisson equation in the interior of a $d$-dimensional homogeneous ellipsoid, and the associated space charge fields. An explicit formula (\ref{Sformula}) is provided that relates the $d\times d$ matrix describing the space charge (quadratic) potential to the $d\times d$ covariance matrix of the ellipsoid. For the cases $d=2$ and $d=3$, this result is used to determine the linear map corresponding to a space charge kick, that may be used to push the beam $6\times 6$ covariance matrix during envelope tracking. The treatment of upright ellipsoids for $d=2$ and $d=3$ is well-represented in the literature. However, the approach taken here emphasizes a general ellipsoid with arbitrary correlations in any dimension. The Appendix provides a general solution of the free-space Poisson equation in dimension $d$ for a source distribution with ellipsoidal symmetry.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Block encoding of the three-dimensional heterogeneous Poisson equation with application to fracture flow

Quantum linear system (QLS) algorithms offer the potential to solve large-scale linear systems exponentially faster than classical methods. However, applying QLS algorithms to real-world problems remains challenging due to issues such as state preparation, data loading, and efficient information extraction. In this work, we study the feasibility of applying QLS algorithms to solve discretized three-dimensional (3D) heterogeneous Poisson equations, with specific examples relating to groundwater flow through geologic fracture networks. We explicitly construct a block encoding for the 3D heterogeneous Poisson matrix by leveraging the sparse local structure of the discretized operator. While classical solvers benefit from preconditioning, we show that block encoding the system matrix and preconditioner separately does not improve the effective condition number that dominates the QLS run-time. This differs from classical approaches where the preconditioner and the system matrix can often be implemented independently. Nevertheless, due to the structure of the problem in three dimensions, the quantum algorithm achieves a run-time of 𝑂⁡(𝑁 2/3 polylog 𝑁 ⋅log (1/𝜖)), outperforming the best classical methods (with run times of 𝑂⁡(𝑁⁢log 𝑁 ⋅log (1/𝜖))) and offering exponential memory savings. These results highlight both the promise and limitations of QLS algorithms for practical scientific computing, and point to effective condition-number reduction as a key barrier in achieving quantum advantages.

58 GEOSCIENCES↗
DOE OSTI2025

Poisson's Equations for Electrostatics

This dataset consists of 1000 records in a single HDF5 file generated from the simulation code available at: https://github.com/lezahlie/esp_simulation. This code implements Poisson’s equations for electrostatics and more can be read about it here: https://en.wikipedia.org/wiki/Poisson%27s_equation#Electrostatics

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Validating corrosion models: A comparison of governing equations

Experimental validation of Finite Element Method (FEM) models varying electrochemical governing equations, inclusion of chemical reactions, and time on the resultant damage profile for two galvanic couples is explored. Two anode materials (Magnesium AZ31 and Carbon Steel) in contact with a cathode (Stainless Steel 304 L) were modeled in/exposed to NaCl (1 and 0.1 M respectively for the anode materials) for up to one week. The physics approach, inclusion of chemical reactions, and the boundary conditions required to accurately represent the damage profile in FEM models depended on the galvanic couple materials and, ultimately, the corrosion rate. For high rates of corrosion (i.e., magnesium anode), the Nernst-Planck equation with Electroneutrality was sufficient to describe the damage, while, for low rates of corrosion (i.e., carbon steel anode), the Laplace equation was sufficient. In all cases, the most complete governing equation (Nernst-Planck-Poisson Equation) was not necessary to accurately describe the damage. Precipitation reactions in solution also played a critical role in the predicted damage profile, especially for high corrosion rate systems. Finally, for short time periods (< 6 h), the choice of governing equations does not significantly influence damage profile results. Overall, the choice of physics to reduce error in simulations relies on the boundary conditions, geometry, conductivity of the solution, electrochemical potential differences, and time of exposure. The above results are discussed with regard to accuracy and computational savings.

Carbon steel↗
DOE OSTI2025

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗
DOE OSTI2026

Local reduced-order modeling for electrostatic plasmas by physics-informed solution manifold decomposition

Despite advancements in high-performance computing and modern numerical algorithms, computational cost remains prohibitive for multi-query kinetic plasma simulations. Here, in this work, we develop data-driven reduced-order models (ROMs) for collisionless electrostatic plasma dynamics, based on the kinetic Vlasov-Poisson equation. Our ROM approach projects the equation onto a linear subspace defined by the proper orthogonal decomposition (POD) modes. We introduce an efficient tensorial method to update the nonlinear term using a precomputed third-order tensor. We capture multiscale behavior with a minimal number of POD modes by decomposing the solution manifold into multiple time windows and creating temporally local ROMs. We consider two strategies for decomposition: one based on the physical time and the other based on the electric field energy. Applied to the 1D1V Vlasov–Poisson simulations, that is, prescribed E-field, Landau damping, and two-stream instability, we demonstrate that our ROMs accurately capture the total energy of the system both for parametric and time extrapolation cases. The temporally local ROMs are more efficient and accurate than the single ROM. In addition, in the two-stream instability case, we show that the energy-windowing reduced-order model (EW-ROM) is more efficient and accurate than the time-windowing reduced-order model (TW-ROM). With the tensorial approach, EW-ROM solves the equation approximately 90 times faster than Eulerian simulations while maintaining a maximum relative error of 7.5% for the training data and 11% for the testing data.

Electrostatic plasmas↗
DOE OSTI2025

On finite-dimensional smoothed-particle Hamiltonian reductions of the Vlasov equation

The inclusion of spatial smoothing in finite-dimensional particle-based Hamiltonian reductions of the Vlasov equation and related models is considered. Here, this work investigates the underlying Hamiltonian structure of such smoothed particle-based methods for Hamiltonian systems and the small-scale regularization such methods implicitly make in approximating the continuum theory. In the context of the Vlasov–Poisson equation and other mean-field Lie–Poisson systems, of which Vlasov–Poisson is a special case, smoothing amounts to a convolutive regularization of the Hamiltonian. This regularization may be interpreted as a change of the inner product structure used to identify the dual space in the Lie–Poisson Hamiltonian formulation. In particular, the shape function used for spatial smoothing may be identified as the kernel function of a reproducing kernel Hilbert space whose inner product is used to define the Lie–Poisson Hamiltonian structure. It is likewise possible to introduce smoothing in the Vlasov–Maxwell system, but in this case the Poisson bracket must be modified rather than the Hamiltonian. The smoothing applied to the Vlasov–Maxwell system is incorporated by inserting smoothing in the map from canonical to kinematic coordinates. In the filtered system, the Lorentz force law and the current, the two terms coupling the Vlasov equation with Maxwell’s equations, are spatially smoothed.

Hamiltonian mechanics↗
DOE OSTI2024

One-shot omnidirectional pressure integration through matrix inversion

In this work, we present a method to perform 2D and 3D omnidirectional pressure integration from velocity measurements with a single-iteration matrix inversion approach. This work builds upon our previous work, where the rotating parallel ray approach was extended to the limit of infinite rays by taking continuous projection integrals of the ray paths and recasting the problem as an iterative matrix inversion problem. This iterative matrix equation is now 'fast-forwarded' to the 'infinity' iteration, leading to a different matrix equation that can be solved in a single step, thereby presenting the same computational complexity as the Poisson equation. We observe computational speedups of ~10 6 when compared to brute-force omnidirectional integration methods, enabling the treatment of grids of ~10 9 points and potentially even larger in a desktop setup at the time of publication. Further examination of the boundary conditions of our one-shot method shows that omnidirectional pressure integration implements a boundary condition where the boundary points are treated as interior points to the extent that information is available. Finally, we show how the method can be extended from the regular grids typical of particle image velocimetry to the unstructured meshes characteristic of particle tracking velocimetry data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Spectrally Stabilized Interface Capturing Formulation and Implementation in Nek5000/NekRS

This report documents the formulation of a novel level-set method for incompressible two-phase flows in the continuous Galerkin (CG) high order spectral element framework. The overall method hinges on a novel implementation of the spectral vanishing viscosity (SVV) operator for the stabilization of linear/non-linear hyperbolic problems. The multidimensional SVV convolution kernels, which in essence, have a similar effect as a high pass filter applied to the derivatives, are formulated by exploiting the tensor product form, analogous to the construction of the usual stiffness matrix system. The resulting kernels are directionally decoupled and ensure a linear, symmetric positive definite, elliptic matrix operator. The SVV formulation is demonstrated to provide a robust stabilizing mechanism through challenging linear and non-linear hyperbolic problems, including problems pertinent to the level-set formulation. The two-phase framework conceptualized herein is based on the conservative level-set (CLS) method which represents the interface between the fluids by the 0.5 iso-contour of the smoothed Heaviside function. The CLS method is augmented with a preconditioning procedure for interface normals using the signed distance function which precludes the manifestation of spurious oscillations in the vicinty of the interface. Further, the existing mixed explicit-implicit approach for the solution of Navier-Stokes equations in Nek5000, as described in Tomboulides et al, is augmented with a pressure coefficient splitting approach for the Poisson equation, which greatly accelerated the convergence of pressure solver for two-phase systems with large density ratio. The robustness and accuracy of the overall two-phase method is demonstrated through canonical challenging problems involving high density and viscosity ratios, with and without surface tension. The two-phase formulation is wholly implemented in Nek5000 and the SVV stabilization method is implemented in NekRS, which is the essential precursor to the two-phase framework, undergoing active development.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

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↗
DOE OSTI2024

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Learning the boundary-to-domain mapping using Lifting Product Fourier Neural Operators for partial differential equations

Neural operators such as the Fourier Neural Operator (FNO) have been shown to provide resolution-independent deep learning models that can learn mappings between function spaces. For example, an initial condition can be mapped to the solution of a partial differential equation (PDE) at a future time-step using a neural operator. Despite the popularity of neural operators, their use to predict solution functions over a domain given only data over the boundary (such as a spatially varying Dirichlet boundary condition) remains unexplored. In this paper, we refer to such problems as boundary-to-domain problems; they have a wide range of applications in areas such as fluid mechanics, solid mechanics, heat transfer etc. We present a novel FNO-based architecture, named Lifting Product FNO (or LP-FNO) which can map arbitrary boundary functions defined on the lower-dimensional boundary to a solution in the entire domain. Specifically, two FNOs defined on the lower-dimensional boundary are lifted into the higher dimensional domain using our proposed lifting product layer. We demonstrate the efficacy and resolution independence of the proposed LP-FNO for the 2D Poisson equation.

Kashi, Aditya↗
DOE OSTI2025

Optimal Polynomial Smoothers and One‐Sided V‐Cycles for Poisson Problems

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A computational study of the effects of graphene additions on electrical properties of polycrystalline copper

The addition of graphene has recently shown promise as a route for the significant improvement of the bulk electrical properties of metallic materials. Here, we explore the effects these additions have on the net electrical conductivity of fabricated copper-graphene (Cu-Gr) nanocomposites as a function of grain structure and grain boundary properties. Synthetic 3D microstructures were generated to represent polycrystalline copper with different average grain diameters and twinned grain boundary fractions. Then, the Poisson equation of electrical transport was solved using a finite difference method in order to predict the net electrical conductivity of each microstructure. In this context, the potential effect of graphene on the conductivity of the composite was evaluated as a function of the number of affected grain boundaries. The results of these calculations indicate that 1.) as supported by literature, net electrical conductivity decreases with decreasing grain size, 2.) the presence of twinned grain boundaries results in smaller loss of conductivity than would otherwise be expected, and 3.) the presence of graphene on the grain boundaries can be expected to lead to improvements in net electrical conductivity. However, we also find that 4.) when the Cu grain structure becomes sufficiently refined, the addition of graphene could conceivably result in significant improvements in electrical conductivity over and above coarse-grained Cu. It is estimated from our calculations that, assuming microstructures with average grain sizes between 100 nm and 100 μm and graphene conductivity 1000 to 10,000 that of a typical Cu grain boundary, an improvement in electrical conductivity of approximately 17% over that of bulk Cu may be attainable. Therefore, by performing this study we suggest a possible route for the improvement of Cu electrical properties through the addition of graphene.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

A variational method for the sheath potential of hypersonic leading edges with space-charge limitations

Electron transpiration cooling for the leading edges (LE) of hypersonic aircraft utilizes thermionic emission; however, space-charge effects limit the electron emission rate, potentially diminishing the efficiency of this cooling mechanism. We develop a variational weak form of the Poisson equation that describes the sheath potential and then numerically solve it using the finite element method. This formulation has two main benefits: (1) the space-charge limit condition can be incorporated as a constraint and (2) it allows for the analysis of three-dimensional geometries with complex boundary conditions. We demonstrate that the current emitted from the surface of an LE is generally a small fraction of the Child–Langmuir limit due to space charge. We then propose several methods to enhance the emitted current from the surface and to boost the cooling effect of thermionic emission. These include increasing the plasma density, applying a negative surface potential, and using fringe fields under suitable geometric conditions. For a LaB6 emitting LE, the total emitted current is shown to be minimal and independent of the temperature of a surface with floating potential. However, when a negative potential is applied and the surface is heated, the emitted current follows the Richardson–Dushman relationship up to a critical temperature, beyond which it remains constant. At an applied surface potential of −5 V, the critical temperature is around 1700 K.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Drift kinetic electrostatic simulations of the edge localized mode heat pulse

In the present work, electrostatic drift kinetic simulations of parallel plasma transport within the tokamak scrape-off layer (SOL) are conducted using the COGENT code. The SOL configuration is represented in one-dimensional slab geometry, incorporating a heat source localized in the midplane. The heat source parameters correspond to those characterizing edge-localized modes observed in the Joint European Torus (JET) tokamak. The numerical model includes kinetic treatment of both ions and electrons, a simplified model for the gyrokinetic Poisson equation that allows one to step over short time scales associated with fast electrostatic shear Alfvèn waves, and the logical sheath boundary condition (LSBC) that enforces global system quasineutrality. A third-order accurate LSBC is derived to be consistent with the third-order accurate upwind advection scheme utilized in the code, and it was shown to noticeably impact the simulation results, especially parallel heat flux at the target plate. The findings of this study are in agreement with results from preceding fluid and kinetic simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗