One-dimensional magnetohydrodynamic flow and the Monge-Ampere equation.
Euler-Poisson equation extension to one dimensional MHD flow using Monge-Ampere equation
SEARCH · Search NASA
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.
Euler-Poisson equation extension to one dimensional MHD flow using Monge-Ampere equation
Vlasov-Poisson equations reformulation by arbitrary transformation to velocity variable, considering time or space secularity of perturbation theory
Not Available
We discuss the derivation of a new, sixth-order finite volume scheme for Poisson’s equation on 3D Cartesian equispaced grids. The scheme is based on a discretization of the Laplace operator with a compact (Mehrstellen) 27-point stencil. To achieve sixth order convergence the right hand side of the equation is replaced with a discrete operator that involves the discrete Laplace and Biharmonic operators and the sum of discrete fourth-order cross derivatives applied to the charge function. Numerical tests demonstrate the superiority of the proposed method compared to the well known schemes associated with the 7-point and 19-point discretizations of the Laplacian.
A method for generating two dimensional finite difference grids about airfoils and other shapes by the use of the Poisson differential equation is developed. The inhomogeneous terms are automatically chosen such that two important effects are imposed on the grid at both the inner and outer boundaries. The first effect is control of the spacing between mesh points along mesh lines intersecting the boundaries. The second effect is control of the angles with which mesh lines intersect the boundaries. A FORTRAN computer program has been written to use this method. A description of the program, a discussion of the control parameters, and a set of sample cases are included.
The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far, either suffer from lack of accuracy and/or are limited to very small sizes of the problem, and thus have no practical usage. Here we present an advanced quantum algorithm for solving the Poisson equation with high accuracy and dynamically tunable problem size. After converting the Poisson equation to the linear systems through the finite difference method, we adopt the Harrow-Hassidim-Lloyd (HHL) algorithm as the basic framework. Particularly, in this work we present an advanced circuit that ensures the accuracy of the solution by implementing non-truncated eigenvalues through eigenvalue amplification as well as by increasing the accuracy of the controlled rotation angular coefficients, which are the critical factors in the HHL algorithm. We show that our algorithm not only increases the accuracy of the solutions, but also composes more practical and scalable circuits by dynamically controlling problem size in the NISQ devices. We present both simulated and experimental results, and discuss the sources of errors. Finally, we conclude that overall results on the quantum hardware are dominated by the error in the CNOT gates.
Not Available
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
The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far either suffer from lack of accuracy and/or are limited to very small sizes of the problem and thus have no practical usage. In this regard, our previous work showed a proof-of-concept demonstration in advancing quantum Poisson solver algorithm and validated preliminary results for a simple case of 3 x 3 problem. In this work, we delve into comprehensive research details, presenting the results on up to 15 x 15 problems that include step-by-step improvements in Poisson equation solutions, scaling performance, and experimental exploration. In particular, we demonstrate the implementation of eigenvalue amplification by a factor of up to 2 8 , achieving a significant improvement in the accuracy of our quantum Poisson solver and comparing that to the exact solution. Additionally, we present success probability results, highlighting the reliability of our quantum Poisson solver. Moreover, we explore the scaling performance of our algorithm against the circuit depth and width, demonstrating how our approach scales with larger problem sizes and thus further solidifies the practicality of easy adaptation of this algorithm in real-world applications. We also discuss a multilevel strategy for how this algorithm might be further improved to explore much larger problems with greater performance. Finally, through our experiments on the IBM quantum hardware, we conclude that though overall results on the existing NISQ hardware are dominated by the error in the CNOT gates, this work opens a path to realizing a multidimensional Poisson solver on near-term quantum hardware.
In this work, we have considered the formation of warm plasma sheath in the vicinity of a wall in a plasma with considerable presence of dust particles. As an example, we have used the parameters relevant in case of plasma sheath formed around surfaces of various solid bodies in space, though the results obtained in this work can be applied to any other physical situation such as laboratory plasma. In the ion-acoustic time scale, we neglect the dust dynamics. The dust particles affect the sheath dynamics by affecting the Poisson equation which determines the plasma potential in the sheath region. It is important to note that our calculations are valid only when the amount of dust particles is not sufficient so as to affect the plasma dynamics in the dust-acoustic time scale, but enough to affect the plasma sheath. We have assumed the current to a dust particle to be balanced throughout the analysis. This makes the grain potential dependent on plasma potential, which is then incorporated into the Poisson equation. The resultant numerical model becomes an initial value problem, which is described by a 1-D integro-differential equation, which is then solved self-consistently by incorporating the change in plasma potential caused by inclusion of the dust potential in the Poisson equation.
We develop a splitting Chebyshev collocation (SCC) method for the time-dependent Schrödinger–Poisson (SP) system arising from theoretical analysis of quantum plasmas. By means of splitting technique in time, the time-dependant SP system is first reduced to uncoupled Schrödinger and Poisson equations at every time step. The space variables in Schrödinger and Poisson equations are next represented by high-order Chebyshev polynomials, and the resulting system are discretized by the spectral collocation method. Finally, matrix diagonalization technique is applied to solve the fully discretized system in one dimension, two dimensions and three dimensions, respectively. The newly proposed method not only achieves spectral accuracy in space but also reduces the computer-memory requirements and the computational time in comparison with conventional solver. Numerical results confirm the spectral accuracy and efficiency of this method, and indicate that the SCC method could be an efficient alternative method for simulating the dynamics of quantum plasmas.
Electronic structure calculations of atomistic systems based on density functional theory involve solving the Poisson equation. In this paper, we present a plane-wave based algorithm for solving the generalized Poisson equation subject to periodic or homogeneous Neumann conditions on the boundaries of the simulation cell and Dirichlet type conditions imposed at arbitrary subdomains. In this way, source, drain, and gate voltages can be imposed across atomistic models of electronic devices. Dirichlet conditions are enforced as constraints in a variational framework giving rise to a saddle point problem. The resulting system of equations is then solved using a stationary iterative method in which the generalized Poisson operator is preconditioned with the standard Laplace operator. The solver can make use of any sufficiently smooth function modelling the dielectric constant, including density dependent dielectric continuum models. For all the boundary conditions, consistent derivatives are available and molecular dynamics simulations can be performed. The convergence behaviour of the scheme is investigated and its capabilities are demonstrated.
We are reporting on our first observation of a micrometer-order electron spin transport in a (110) GaAs/AlGaAs multiple quantum well (QW) at room temperature using a space- and time-resolved Kerr rotation technique. A 37-μm transport was observed within an electron spin lifetime of 1.2 ns at room temperature when using an in-plane electric field of 1.75 kV/cm. The spatio-temporal profiles of electron spins were well reproduced by the spin drift-diffusion equations coupled with the Poisson equation, supporting the validity of the measurement. The results suggest that (110) QWs are useful as a spin transport layer for semiconductor spintronic devices operating at room temperature.
The influence of electron energy quantization in a space-charge region on the accumulation capacitance of the InAs-based metal-oxide-semiconductor capacitors (MOSCAPs) has been investigated by modeling and comparison with the experimental data from Au/anodic layer(4-20 nm)/n-InAs(111)A MOSCAPs. The accumulation capacitance for MOSCAPs has been calculated by the solution of Poisson equation with different assumptions and the self-consistent solution of Schrödinger and Poisson equations with quantization taken into account. It was shown that the quantization during the MOSCAPs accumulation capacitance calculations should be taken into consideration for the correct interface states density determination by Terman method and the evaluation of gate dielectric thickness from capacitance-voltage measurements.
Here, we present and analyze a new iterative solver for implicit discretizations of a simplified Boltzmann--Poisson system. The algorithm builds on recent work that incorporated a sweeping algorithm for the Vlasov--Poisson equations as part of nested inner-outer iterative solvers for the Boltzmann--Poisson equations. The new method eliminates the need for nesting and requires only one transport sweep per iteration. It arises as a new fixed-point formulation of the discretized system which we prove to be contractive for a given electric potential. We also derive an accelerator to improve the convergence rate for systems in the drift-diffusion regime. We numerically compare the efficiency of the new solver, with and without acceleration, against a recently developed nested iterative solver.
The initial condition problem for a binary neutron star system requires a Poisson equation solver for the velocity potential with a Neumann-like boundary condition on the surface of the star. Difficulties that arise in this boundary value problem are: (a) the boundary is not known a priori, but constitutes part of the solution of the problem; (b) various terms become singular at the boundary. In this work, we present a new method to solve the fluid Poisson equation for irrotational/spinning binary neutron stars. The advantage of the new method is that it does not require complex fluid surface fitted coordinates and it can be implemented in a Cartesian grid, which is a standard choice in numerical relativity calculations. This is accomplished by employing the source term method proposed by Towers, where the boundary condition is treated as a jump condition and is incorporated as additional source terms in the Poisson equation, which is then solved iteratively. The issue of singular terms caused by vanishing density on the surface is resolved with an additional separation that shifts the computation boundary to the interior of the star. We present two-dimensional tests to show the convergence of the source term method, and we further apply this solver to a realistic three-dimensional binary neutron star problem. By comparing our solution with the one coming from the initial data solver cocal, we demonstrate agreement to approximately 1%. We report our method can be used in other problems with non-smooth solutions like in magnetized neutron stars.
The biharmonic equation can be rewritten as a system of two Poisson equations. Multigrid solution of this system is expected to converge with the same amount of work as solving two Poisson equations, requiring less than 70 floating point operations (scalar multiply or addition) per fine grid point to reach a solution using an FMG algorithm. For periodic boundary conditions, this goal is attained by simple, straightforward application of multigrid. For Dirichlet boundary conditions, however, convergence is impeded by poor interaction with the boundaries. Attempts to overcome the slowness without specifically addressing the boundaries have resulted in multigrid algorithms not attaining the Poisson convergence rate. We present three methods of boundary treatment with which full multigrid efficiency can be obtained. All implement an approach described by Brandt, concentrating some additional effort near the boundary. The first approach simply adds a number of relaxation sweeps over points close to the boundary. The second uses joint relaxation on near-boundary points. The third method takes something from each of the first two methods, resulting in a solver more suitable for highly parallel applications.
The numerical analysis of the incompressible Navier-Stokes equations are becoming important tools in the understanding of some fluid flow problems which are encountered in research as well as in industry. With the advent of the supercomputers, more realistic problems can be studied with a wider choice of numerical algorithms. An alternative formulation is presented for viscous incompressible flows. The incompressible Navier-Stokes equations are cast in a velocity/vorticity formulation. This formulation consists of solving the Poisson equations for the velocity components and the vorticity transport equation. Two numerical algorithms for the steady two-dimensional laminar flows are presented. The first method is based on the actual partial differential equations. This uses a finite-difference approximation of the governing equations on a staggered grid. The second method uses a finite element discretization with the vorticity transport equation approximated using a Galerkin approximation and the Poisson equations are obtained using a least squares method. The equations are solved efficiently using Newton's method and a banded direct matrix solver (LINPACK). The method is extended to steady three-dimensional laminar flows and applied to a cubic driven cavity using finite difference schemes and a staggered grid arrangement on a Cartesian mesh. The equations are solved iteratively using a plane zebra relaxation scheme. Currently, a two-dimensional, unsteady algorithm is being developed using a generalized coordinate system. The equations are discretized using a finite-volume approach. This work will then be extended to three-dimensional flows.