Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Von Neumann”

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 73 records · Page 4

Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.

Feng, Xiaochun↗

Improved Particle Swarm Algorithm Using Rubik’s Cube Topology for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g., renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as reducing power loss and stabilizing the main power grid. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. Additionally, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush–Kuhn–Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence-based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubik’s Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubik’s Cube topology-based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology-based PSO and its scalability on larger scale applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Thermally-assisted-occupation density functional theory with generalized-gradient approximations

We extend the recently proposed thermally-assisted-occupation density functional theory (TAO-DFT) [J.-D. Chai, J. Chem. Phys. 136, 154104 (2012)] to generalized-gradient approximation (GGA) exchange-correlation density functionals. Relative to our previous TAO-LDA (i.e., the local density approximation to TAO-DFT), the resulting TAO-GGAs are significantly superior for a wide range of applications, such as thermochemistry, kinetics, and reaction energies. For noncovalent interactions, TAO-GGAs with empirical dispersion corrections are shown to yield excellent performance. Due to their computational efficiency for systems with strong static correlation effects, TAO-LDA and TAO-GGAs are applied to study the electronic properties (e.g., the singlet-triplet energy gaps, vertical ionization potentials, vertical electron affinities, fundamental gaps, and symmetrized von Neumann entropy) of acenes with different number of linearly fused benzene rings (up to 100), which is very challenging for conventional electronic structure methods. The ground states of acenes are shown to be singlets for all the chain lengths studied here. With the increase of acene length, the singlet-triplet energy gaps, vertical ionization potentials, and fundamental gaps decrease monotonically, while the vertical electron affinities and symmetrized von Neumann entropy (i.e., a measure of polyradical character) increase monotonically.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Large time-step stability of explicit one-dimensional advection schemes

There is a wide-spread belief that most explicit one-dimensional advection schemes need to satisfy the so-called 'CFL condition' - that the Courant number, c = udelta(t)/delta(x), must be less than or equal to one, for stability in the von Neumann sense. This puts severe limitations on the time-step in high-speed, fine-grid calculations and is an impetus for the development of implicit schemes, which often require less restrictive time-step conditions for stability, but are more expensive per time-step. However, it turns out that, at least in one dimension, if explicit schemes are formulated in a consistent flux-based conservative finite-volume form, von Neumann stability analysis does not place any restriction on the allowable Courant number. Any explicit scheme that is stable for c is less than 1, with a complex amplitude ratio, G(c), can be easily extended to arbitrarily large c. The complex amplitude ratio is then given by exp(- (Iota)(Nu)(Theta)) G(delta(c)), where N is the integer part of c, and delta(c) = c - N (less than 1); this is clearly stable. The CFL condition is, in fact, not a stability condition at all, but, rather, a 'range restriction' on the 'pieces' in a piece-wise polynomial interpolation. When a global view is taken of the interpolation, the need for a CFL condition evaporates. A number of well-known explicit advection schemes are considered and thus extended to large delta(t). The analysis also includes a simple interpretation of (large delta(t)) total-variation-diminishing (TVD) constraints.

Leonard, B. P.↗

Artificial viscosity: back to the basics

Summary In this paper, we take a different perspective on the derivation of artificial viscosity. Heretofore, the development of artificial viscosity has been based on the paper published in Journal of Applied Physics in 1950 authored by John von Neumann and Robert Richtmyer [1]. Earlier, in 1948, Richtmyer published a report at Los Alamos Scientific Laboratory documenting the original concept [2]. This report was the true origin of shock capturing methods and contains several key ideas that are conceptually different than the 1950 journal article. Unfortunately, this report (LA‐671) was classified until 1993. This has resulted in two issues: the misattribution of the invention of artificial viscosity as primarily being the work of von Neumann and the loss of the structurally different ideas in the original report. We seek to right the record of history here and use the ideas contained in Richtmyer's report to good effect in deriving a new shock viscosity. The focus of previous development has been the Hugoniot curve describing the locus of states connected by a single shock wave. Here we follow a path more focused upon the Rayleigh line, which is strongly guided by Richtmyer's line of development of the original artificial viscosity formulation. We provide an implementation of the method resulting from this perspective and computational results for simple shock problems. Copyright © 2014 John Wiley & Sons, Ltd.

Mattsson, Ann E.↗

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power.In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation.The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

97 MATHEMATICS AND COMPUTING↗

A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers

Current Deep Learning models use highly optimized convolutional neural networks (CNN) trained on large graphical processing units (GPU)-based computers with a fairly simple layered network topology, i.e., highly connected layers, without intra-layer connections. Complex topologies have been proposed, but are intractable to train on current systems. Building the topologies of the deep learning network requires hand tuning, and implementing the network in hardware is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing (HPC) to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. Due to input size limitations of current quantum computers we use the MNIST dataset for our evaluation. The results show the possibility of using the three architectures in tandem to explore complex deep learning networks that are untrainable using a von Neumann architecture. We show that a quantum computer can find high quality values of intra-layer connections and weights, while yielding a tractable time result as the complexity of the network increases; a high performance computer can find optimal layer-based topologies; and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware. This represents a new capability that is not feasible with current von Neumann architecture. It potentially enables the ability to solve very complicated problems unsolvable with current computing technologies.

Potok, Thomas E↗

The algebraic structure of gravitational scrambling

We introduce a new algebraic framework to describe gravitational scrambling, including the semiclassical limit of any out-of-time-order correlation function that is built out of operator insertions separated by approximately the scrambling time. In two dimensions, the scrambling algebra, which we call a modular-twisted product, is defined in terms of two copies of the Leutheusser-Liu half-sided modular inclusion of von Neumann algebras; these describe early- and late-time operators respectively. In limits where the separation between insertions is taken to be either significantly greater or smaller than the scrambling time, the modular-twisted product reduces, respectively, to free- and tensor-product algebras that were previously studied in [arXiv:2209.10454]. In a sense, the modular-twisted product interpolates between these two products. Including the Hamiltonian in the scrambling algebra leads to a Type II$_\infty$ von Neumann algebra with finite renormalized entropies that interpolate between single-QES and multi-QES phases. We also describe how to generalize the modular-twisted product algebra to higher dimensions, including spatially localized boundary excitations.

FOS: Physical sciences↗

Theory of Mach reflection of detonation at glancing incidence

In this paper, we present a theory for Mach reflection of a detonation undergoing glancing incidence reflection off of a rigid wall. Our focus is on condensed-phase explosives, which we describe with a constant adiabatic gamma equation of state and an irreversible and either state-independent or weakly state-dependent reaction rate. We consider two detonation models: (1) the instantaneous reaction heat-release Chapman–Jouguet (CJ) limit and (2) the spatially resolved reaction heat-release Zeldovich–von Neumann–D$\ddot{Ø}$ring (ZND) limit, where here we only consider that a small fraction of the detonation energy release is spatially resolved (the SRHR limit). We observe a three-shock reflection in the CJ limit case, with a Mach shock that is curved. In addition, we develop an analytical expression for the triple-point track angle as a function of the angle of incidence. For the SRHR model, we observe a smooth lead shock, akin to von Neumann reflection, with no reflected shock in the reaction zone. Only at larger angles of incidence is a three-shock Mach reflection observed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local Poincaré algebra from quantum chaos

The local two-dimensional Poincaré algebra near the horizon of an eternal AdS black hole, or in proximity to any bifurcate Killing horizon, is generated by the Killing flow and outward null translations on the horizon. In holography, this local Poincaré algebra is reflected as a pair of unitary flows in the boundary Hilbert space whose generators under modular flow grow and decay exponentially with a maximal Lyapunov exponent. This is a universal feature of many geometric vacua of quantum gravity. To explain this universality, we show that a two-dimensional Poincaré algebra emerges in any quantum system that has von Neumann subalgebras associated with half-infinite modular time intervals (modular future and past subalgebras) in a limit analogous to the near-horizon limit. In ergodic theory, quantum dynamical systems with future or past algebras are called quantum K-systems. The surprising statement is that modular K-systems are always maximally chaotic. Interacting quantum systems in the thermodynamic limit and large N theories above the Hawking-Page phase transition are examples of physical theories with future/past subalgebras. We prove that the existence of (modular) future/past von Neumann subalgebras also implies a second law of (modular) thermodynamics and the exponential decay of (modular) correlators. We generalize our results from the modular flow to any dynamical flow with a positive generator and interpret the positivity condition as quantum detailed balance.

79 ASTRONOMY AND ASTROPHYSICS↗

Neuromorphic Computing, Architectures, Models, and Applications. A Beyond-CMOS Approach to Future Computing, June 29-July 1, 2016, Oak Ridge, TN

The White House and Department of Energy have been instrumental in driving the development of a neuromorphic computing program to help the United States continue its lead in basic research into (1) Beyond Exascale—high performance computing beyond Moore’s Law and von Neumann architectures, (2) Scientific Discovery—new paradigms for understanding increasingly large and complex scientific data, and (3) Emerging Architectures—assessing the potential of neuromorphic and quantum architectures. Neuromorphic computing spans a broad range of scientific disciplines from materials science to devices, to computer science, to neuroscience, all of which are required to solve the neuromorphic computing grand challenge. In our workshop we focus on the computer science aspects, specifically from a neuromorphic device through an application. Neuromorphic devices present a very different paradigm to the computer science community from traditional von Neumann architectures, which raises six major questions about building a neuromorphic application from the device level. We used these fundamental questions to organize the workshop program and to direct the workshop panels and discussions. From the white papers, presentations, panels, and discussions, there emerged several recommendations on how to proceed.

97 MATHEMATICS AND COMPUTING↗

Variational approach to relative entropies with an application to QFT

Abstract We define a new divergence of von Neumann algebras using a variational expression similar in nature to Kosaki’s formula for Umegaki’s relative entropy. Our divergence satisfies several of the usual desirable properties, upper bounds the sandwiched Renyi entropy and reduces to the fidelity in a limit. As an illustration, we use the formula in quantum field theory to compute our divergence between the vacuum in a bipartite system and an “orbifolded”—in the sense of a conditional expectation—system in terms of the Jones index. We take the opportunity to point out an entropic certainty relation associated with an inclusion of von Neumann factors related to the relative entropy. This certainty relation has an equivalent formulation in terms of error correcting codes.

Hollands, Stefan↗

Study on the well-posedness, convergence and the stability of the semi-implicit upwind numerical solver for the multi-fluid model

The well-posedness, convergence and the stability of the two-fluid code has been studied for a long time. Most of the investigations concern the semi-implicit upwind solution scheme for the six equation two-fluid model such as used in RELAP5 3 or TRACE 21. Since the system code, SPACE 2, adopts one more field, a droplet field, it consists of nine equations (3 mass, 3 momentum and 3 energy balance equations) and thus more involved investigations are necessary to confirm the stability and convergence. For this objective, the old issue of the well-posedness, convergence and the stability is revisited and some general guidelines to develop a well-posed numerical multi-fluid model are derived as follows; (1) Hyperbolicity of the corresponding system of partial differential equations is not a necessary condition for the development of a numerical model for multi-phase flow, but whether or not it is hyperbolic can provide guidance relative to initial conditions, boundary conditions, and expected high frequency behavior of the model. (2) A necessary condition for a well-posed numerical model is stability in the von Neumann sense, i.e. growth factor less than 1.0 for the shortest wave-length, 2{Delta}x. (3) The smallest node size used for convergence studies should be of the order of the characteristic dimension of the average description, i.e. smaller nodes can be used so long as they do not result in unphysical growth of wave-lengths less than the characteristic dimension. The usual mathematical definition of convergence i.e. the behavior of the solution as the node size approaches zero, is not appropriate for the discrete averaged numerical model, since there is diminished physical meaning to behavior at wavelengths less than the characteristic dimension of the average description. Under these guidelines, dispersion analysis and von Neumann stability analysis are performed for the three field multi-fluid, semi-implicit, upwind numerical model to show that the necessary conditions for well-posedness are met. To study the non-linear stability and the convergence, various runs with the torus problem using the SPACE code are utilized to confirm the frequency cascading effects that augment non-linear stability. A robust mechanism for the flow regime change is also a very important factor for developing non-linearly stable and convergent code. A open pipe flow problem is also simulated to investigate the non-linear stability effects in a flow geometry more typical of real safety code applications. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

On quantum Rényi entropies: A new generalization and some properties

The Rényi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies, or mutual information, and have found many applications in information theory and beyond. Various generalizations of Rényi entropies to the quantum setting have been proposed, most prominently Petz's quasi-entropies and Renner's conditional min-, max-, and collision entropy. However, these quantum extensions are incompatible and thus unsatisfactory. We propose a new quantum generalization of the family of Rényi entropies that contains the von Neumann entropy, min-entropy, collision entropy, and the max-entropy as special cases, thus encompassing most quantum entropies in use today. We show several natural properties for this definition, including data-processing inequalities, a duality relation, and an entropic uncertainty relation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement entropy between two coupled Tomonaga-Luttinger liquids

We consider a system of two coupled Tomonaga-Luttinger liquids (TLL's) on parallel chains and study the Renyi entanglement entropy S{sub n} between the two chains. Here the entanglement cut is introduced between the chains, not along the perpendicular direction, as has been done in previous studies of one-dimensional systems. The limit n{yields}1 corresponds to the von Neumann entanglement entropy. The system is effectively described by two-component bosonic field theory with different TLL parameters in the symmetric and antisymmetric channels as far as the coupled system remains in a gapless phase. We argue that in this system, S{sub n} is a linear function of the length of the chains (boundary law) followed by a universal subleading constant {gamma}{sub n} determined by the ratio of the two TLL parameters. The formulas of {gamma}{sub n} for integer n{>=}2 are derived using (a) ground-state wave functionals of TLL's and (b) boundary conformal field theory, which lead to the same result. These predictions are checked in a numerical diagonalization analysis of a hard-core bosonic model on a ladder. Although the analytic continuation of {gamma}{sub n} to n{yields}1 turns out to be a difficult problem, our numerical result suggests that the subleading constant in the von Neumann entropy is also universal. Our results may provide useful characterization of inherently anisotropic quantum phases such as the sliding Luttinger liquid phase via qualitatively different behaviors of the entanglement entropy with the entanglement partitions along different directions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Large N algebras and generalized entropy

We construct a Type II ∞ von Neumann algebra that describes the large N physics of single-trace operators in AdS/CFT in the microcanonical ensemble, where there is no need to include perturbative 1/N corrections. Using only the extrapolate dictionary, we show that the entropy of semiclassical states on this algebra is holographically dual to the generalized entropy of the black hole bifurcation surface. From a boundary perspective, this constitutes a derivation of a special case of the QES prescription without any use of Euclidean gravity or replicas; from a purely bulk perspective, it is a derivation of the quantum-corrected Bekenstein-Hawking formula as the entropy of an explicit algebra in the G → 0 limit of Lorentzian effective field theory quantum gravity. In a limit where a black hole is first allowed to equilibrate and then is later potentially re-excited, we show that the generalized second law is a direct consequence of the monotonicity of the entropy of algebras under trace-preserving inclusions. Finally, by considering excitations that are separated by more than a scrambling time we construct a “free product” von Neumann algebra that describes the semiclassical physics of long wormholes supported by shocks. We compute Rényi entropies for this algebra and show that they are equal to a sum over saddles associated to quantum extremal surfaces in the wormhole. Surprisingly, however, the saddles associated to “bulge” quantum extremal surfaces contribute with a negative sign.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PIMS: Memristor-Based Processing-in-Memory-and-Storage.

Continued progress in computing has augmented the quest for higher performance with a new quest for higher energy efficiency. This has led to the re-emergence of Processing-In-Memory (PIM) ar- chitectures that offer higher density and performance with some boost in energy efficiency. Past PIM work either integrated a standard CPU with a conventional DRAM to improve the CPU- memory link, or used a bit-level processor with Single Instruction Multiple Data (SIMD) control, but neither matched the energy consumption of the memory to the computation. We originally proposed to develop a new architecture derived from PIM that more effectively addressed energy efficiency for high performance scientific, data analytics, and neuromorphic applications. We also originally planned to implement a von Neumann architecture with arithmetic/logic units (ALUs) that matched the power consumption of an advanced storage array to maximize energy efficiency. Implementing this architecture in storage was our original idea, since by augmenting storage (in- stead of memory), the system could address both in-memory computation and applications that accessed larger data sets directly from storage, hence Processing-in-Memory-and-Storage (PIMS). However, as our research matured, we discovered several things that changed our original direc- tion, the most important being that a PIM that implements a standard von Neumann-type archi- tecture results in significant energy efficiency improvement, but only about a O(10) performance improvement. In addition to this, the emergence of new memory technologies moved us to propos- ing a non-von Neumann architecture, called Superstrider, implemented not in storage, but in a new DRAM technology called High Bandwidth Memory (HBM). HBM is a stacked DRAM tech- nology that includes a logic layer where an architecture such as Superstrider could potentially be implemented.

97 MATHEMATICS AND COMPUTING↗

Resistive Switching of Spinel Li 4 Ti 5 O 12 Lithium-Ion Battery Material for Neuromorphic Computing

The rapid rise of AI has exposed significant limitations in conventional Von Neumann computing architecture, particularly in regard to speed and energy efficiency. To address these challenges, researchers are exploring a brain-inspired neuromorphic architecture that mimics biological neural networks, enabling massive parallel processing with reduced power consumption for complex AI computational demands. Recent interest has focused on utilizing battery electrodes and solid electrolyte materials for their resistive switching properties in developing a neuromorphic architecture. These properties are precisely tuned through local- and bulk-level chemical composition modifications via voltage bias stimuli. In this study, we demonstrate fabricating a three-terminal lithium-ion electrochemical transistor based on lithium titanium oxide (Li 4 Ti 5 O 12 ), a popular lithium-ion battery anode material. We deposited and characterized LTO thin films using RF sputtering, demonstrating a 6 orders of magnitude increase in electronic conductivity upon lithiation, with conductivity plateauing after 20% lithiation. Density functional theory calculations revealed transformation from the insulating to conducting state, supported by experimental characterization through X-Ray Photoelectron Spectroscopy (XPS) and Direct Current (DC) polarization analyses. The fabricated transistor consisted of LTO as the channel layer, gold as source/drain terminals, lithium phosphorus oxynitride (LiPON) as the lithium-ion conductor, and copper as the gate terminal. The device exhibited clear hysteresis in transfer characteristics due to lithium insertion/extraction processes. Long-term potentiation (LTP) and long-term depression (LTD) measurements showed an asymmetric ratio of 1.425 and maximum/minimum conductance ratio of 7.83. When implemented in a deep neural network (DNN) for MNIST handwritten digit recognition, the device achieved 92.03% accuracy over 20 training epochs. Detailed transport mechanism analysis revealed the crucial role of oxygen vacancies and interface effects in device operation. Our preliminary findings establish LTO-based lithium-ion electrochemical transistors as promising candidates for energy-efficient neuromorphic computing applications, offering potential solutions to traditional Von Neumann architecture limitations.

25 ENERGY STORAGE↗