Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “primitive equations”

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.

24 records · Page 2

A Computational Review of Privacy-Preserving Mechanisms for the Smart Grid

Smart grid technologies have rapidly become one of the largest and most comprehensive sources of data for the modern utility. For the most part, data streams are seen as an essential tool that enable utilities to carry their day-to-day business operations, but they also create the need for efficient and secure data management strategies. In the context of the smart grid, ensuring data privacy is becoming an increasing concern due to a combination of factors that range from shifts in operational paradigms and rapid technology evolution to changes in legislation. Furthermore, researchers have highlighted the risks associated with improperly protected energy records. For example, energy consumption data from homes could be used to infer the behaviors and habits of home occupants through activity recognition or user profiling (Fan, 2017), which may lead to unfair service pricing, targeted advertising, or other personal security violations. Similarly, Electric Vehicles’ (EVs) charging metadata could be used to reveal private information about the owner such as their payment methods, preferred charging stations, and other locational and timing information that could be used to reconstruct the vehicle owner’s behaviors. The privacy of user data, even when used for statistical analysis or machine learning training processes, also needs to be carefully considered, as an individual’s private traits may still be vulnerable if their inclusion/exclusion greatly impacts the result or could be linked to a public dataset through cross-reference. The breach of user privacy also has severe impacts for organizations that store, transmit, or work on the data in the form of diminishing the public’s trust in them while potentially incurring legal consequences (e.g., fines and suspensions under the European Union General Data Protection Regulation, Health Insurance Portability and Accountability Act, etc.). Because of these risks, several privacy-preserving mechanisms are available to help organizations comply with privacy legislations and prevent the unauthorized and malicious use of user data. In light of these concerns, this report focuses on performing a computational review of privacy-preserving mechanisms that have received a significant amount of interest in literature. It specifically focuses on 1) homomorphic encryption, 2) zero-knowledge proofs, 3) differential privacy, and 4) federated learning. It is worth noting that although many of the methods presented in this document rely on cryptographic primitives, their intent is not to provide perfect secrecy, but rather to enable users to maintain privacy, and thus they shall not be compared or equated to other constructs that are aimed to address cybersecurity constructs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

High electron mobility of Al x Ga1− x N evaluated by unfolding the DFT band structure

We calculate the alloy-disorder-limited electron mobility of AlxGa1−xN from first principles. AlxGa1−xN is a technologically important ultra-wide-bandgap alloy with promise in light emitting diodes and high-power transistors. Alloying introduces statistical disorder, which causes electrons to scatter between different crystal-momentum states, leading to a reduction in mobility for intermediate alloy compositions. The corresponding lifetime, which appears as an energy broadening in the band structure, can be evaluated by unfolding the band structure from the supercell basis to the primitive-cell basis. We fit the first-principles band broadening with a model scattering potential and evaluate the low-field electron mobility using the semiclassical Boltzmann transport equation in the relaxation-time approximation. Our calculated mobility is in agreement with experimental values. We also find the lowest alloy-scattering electron mobility (total electron mobility) across the entire composition range to be 186 cm2/V s (136 cm2/V s), which is comparable to the highest electron mobility predicted in the competitor system, β-(AlxGa1−x)2O3. Our results elucidate the intrinsic limits imposed by alloy disorder on electron transport in AlxGa1−xN.

Pant, Nick (ORCID:0000000254506045)↗

Conservative discontinuous Galerkin schemes for nonlinear Dougherty–Fokker–Planck collision operators

Here, we present a novel discontinuous Galerkin algorithm for the solution of a class of Fokker–Planck collision operators. These operators arise in many fields of physics, and our particular application is for kinetic plasma simulations. In particular, we focus on an operator often known as the ‘Lenard–Bernstein’ or ‘Dougherty’ operator. Several novel algorithmic innovations, based on the concept of weak equality, are reported. These weak equalities are used to define weak operators that compute primitive moments, and are also used to determine a reconstruction procedure that allows an efficient and accurate discretization of the diffusion term. We show that when two integrations by parts are used to construct the discrete weak form, and finite velocity-space extents are accounted for, a scheme that conserves density, momentum and energy exactly is obtained. One novel feature is that the requirements of momentum and energy conservation lead to unique formulas to compute primitive moments. Careful definition of discretized moments also ensure that energy is conserved in the piecewise linear case, even though the kinetic-energy term, $v^2$ is not included in the basis set used in the discretization. A series of benchmark problems is presented and shows that the scheme conserves momentum and energy to machine precision. Empirical evidence also indicates that entropy is a non-decreasing function. The collision terms are combined with the Vlasov equation to study collisional Landau damping and plasma heating via magnetic pumping.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗

Electronic structure and exchange interactions in altermagnetic MnGeP 2 in the quasiparticle self-consistent G W approach

The quasiparticle self-consistent 𝐺⁡𝑊 method is used to study the electronic band structure, optical dielectric function, and exchange interactions in chalcopyrite, 𝐼⁢ ‾ 4 ⁢2⁢𝑑, structure MnGeP 2 . The material is found to be an antiferromagnetic semiconductor with a lowest direct gap of 2.44 eV at the Γ point and a lower indirect gap of 1.87 eV from Γ to 𝑀. The material is an altermagnet because the two magnetic atoms of opposite spin are related by a twofold rotation operation perpendicular to the main fourfold rotation inversion axis. The spin splittings along a low symmetry line like 𝑃⁢𝑁 is sizable while at k points on the diagonal mirror planes or on the twofold symmetry axes the spin splitting is zero. The exchange interactions are calculated using a linear response approach. The antiferromagnetic exchange interaction between nearest neighbors in the primitive unit cell is dominating and found to be slightly decreasing upon carrier doping but not sufficiently to change the interaction to become ferromagnetic. The bare (noninteracting) and interacting transverse spin susceptibilities, which provide interatomic site exchange interactions after averaging over the muffin-tin spheres, are calculated from the 𝐺⁡𝑊 band structure and wave functions. From these exchange interactions, the spin wave spectra are obtained along the high symmetry lines and the Néel temperature is calculated using the mean-field and Tyablikov estimations. The dielectric function and the optical absorption spectra are calculated including excitonic effects using the Bethe Salpeter equation. The exchange interactions around Mn Ge defect sites is also studied. While we find it can generate ferromagnetic interactions with neighboring spins, we did not find direct evidence of producing an overall ferromagnetic phase. First, if Mn antisites are introduced by exchanging Mn with a nearby Ge, the interactions stay largely antiferromagnetic. Second, when we add additional Mn, in other words in Mn-rich stoichiometry, the Mn Ge antisites produce a strong ferromagnetic interaction primarily with the Mn in the same basal plane but weaker ferromagnetic interaction with adjacent plane Mn. The interactions between regular lattice Mn stay antiferromagnetic as before and thus favor keeping the antiferromagnetic order along the [001] direction. Adding Mn antisites, however, does lead to a metallic band structure.

36 MATERIALS SCIENCE↗

Neuromorphic Computing is Turing-Complete

Neuromorphic computing is a non-von Neumann computing paradigm that performs computation by emulating the human brain. Neuromorphic systems are extremely energy-efficient and known to consume thousands of times less power than CPUs and GPUs. They have the potential to drive critical use cases such as autonomous vehicles, edge computing and internet of things in the future. For this reason, they are sought to be an indispensable part of the future computing landscape. Neuromorphic systems are mainly used for spike-based machine learning applications, although there are some non-machine learning applications in graph theory, differential equations, and spike-based simulations. These applications suggest that neuromorphic computing might be capable of general-purpose computing. However, general-purpose computability of neuromorphic computing has not been established yet. In this work, we prove that neuromorphic computing is Turing-complete and therefore capable of general-purpose computing. Specifically, we present a model of neuromorphic computing, with just two neuron parameters (threshold and leak), and two synaptic parameters (weight and delay). We devise neuromorphic circuits for computing all the μ-recursive functions (i.e., constant, successor and projection functions) and all the μ-recursive operators (i.e., composition, primitive recursion and minimization operators). Given that the μ-recursive functions and operators are precisely the ones that can be computed using a Turing machine, this work establishes the Turing-completeness of neuromorphic computing.

Date, Prasanna↗