Search NASA⌕ Search

SEARCH · Search NASA

Results for “operator exponential”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

A Low-Rank QTT-based Finite Element Method for Elasticity Problems

We present an efficient and robust numerical algorithm for solving the linear elasticity problem that combines the Quantized Tensor Train format and a domain partitioning strategy. This approach makes it possible to solve the linear elasticity problem on a computational domain that is more general than a square. By integrating Z-ordering and subdomain concatenation, our method substantially decreases memory usage and achieves a notable reduction in rank compared to established Finite Element implementations like the FEniCS platform. This efficiency is maintained while still guaranteeing exponential convergence with respect to the number of degrees of freedom. This performance gain, however, requires a fundamental rethinking of how core finite element operations are implemented. This includes changes to mesh discretization, node and degree of freedom ordering, stiffness matrix and internal nodal force assembly, and the execution of algebraic matrix-vector operations. In this work, we discuss all these aspects in detail and assess the method’s performance in the numerical approximation of three representative test cases.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

The effect of water injection on nitric oxide emissions of a gas turbine combustor burning ASTM Jet-A fuel

Tests were conducted to determine the effect of water injection on oxides of nitrogen (NOx) emissions of a full annular, ram induction gas turbine combustor burning ASTM Jet-A fuel. The combustor was operated at conditions simulating sea-level takeoff and cruise conditions. Water at ambient temperature was injected into the combustor primary zone at water-fuel ratios up to 2. At an inlet-air temperature of 589 K (600 F) water injection decreased the NOx emission index at a constant exponential rate: NOx = NOx (o) e to the -15 W/F power (where W/F is the water-fuel ratio and NOx(o) indicates the value with no injection). The effect of increasing combustor inlet-air temperature was to decrease the effect of the water injection. Other operating variables such as pressure and reference Mach number did not appear to significantly affect the percent reduction in NOx. Smoke emissions were found to decrease with increasing water injection.

Marchionna, N. R.↗
DOE OSTI2023

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Memristive linear algebra

The advent of memristive devices offers a promising avenue for efficient and scalable analog computing, particularly for linear algebra operations essential in various scientific and engineering applications. This paper investigates the potential of memristive crossbars in implementing matrix inversion algorithms. We explore both static and dynamic approaches, emphasizing the advantages of analog and in-memory computing for matrix operations beyond multiplication. In particular, we demonstrate that the electrical properties of memristive crossbars uniquely suit them for the evolution of a family of matrix exponentials, which can be exploited for the efficient computation of matrix inverses and online solutions for linear problems. Our results demonstrate that memristive arrays can reduce computational complexity. We also study power consumption and show a tradeoff between precision and energy. Furthermore, we address the challenges of device variability, precision, and scalability, providing insights into the practical implementation of these algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1972

Absolute stability analysis of attitude control systems for large boosters.

A method for performing absolute stability analyses of attitude control systems for large launch vehicles is presented. Absolute stability of these systems is shown in a finite region of the state space. The regions are computed by using the Lur'e-Postnikov Liapunov function. This function is chosen to provide additional information about the exponential property of absolute stability. Significant advantages of the method proposed in this paper are: it is independent of the order of the system; algebraic operations involved in the computations are relatively simple and convenient for machine implementation; and the obtained results are valid not only for a particular nonlinearity but also for an entire class of nonlinear characteristics that satisfy certain general conditions. A system model representing the Saturn V launch vehicle is used to illustrate the method.

Seltzer, S. M.↗
DOE OSTI2022

Learning infinite-horizon average-reward restless multi-action bandits via index awareness

We consider the online restless bandits with average-reward and multiple actions, where the state of each arm evolves according to a Markov decision process (MDP), and the reward of pulling an arm depends on both the current state of the corresponding MDP and the action taken. Since finding the optimal control is typically intractable for restless bandits, existing learning algorithms are often computationally expensive or with a regret bound that is exponential in the number of arms and states. In this paper, we advocate \textit{index-aware reinforcement learning} (RL) solutions to design RL algorithms operating on a much smaller dimensional subspace by exploiting the inherent structure in restless bandits. Specifically, we first propose novel index policies to address dimensionality concerns, which are provably optimal. We then leverage the indices to develop two low-complexity index-aware RL algorithms, namely, (i) GM-R2MAB, which has access to a generative model; and (ii) UC-R2MAB, which learns the model using an upper confidence style online exploitation method. We prove that both algorithms achieve a sub-linear regret that is only polynomial in the number of arms and states. A key differentiator between our algorithms and existing ones stems from the fact that our RL algorithms contain a novel exploitation that leverages our proposed provably optimal index policies for decision-makings.

Xiong, Guojun↗
DOE OSTI2021

Cryogenic operation of planar ultrananocrystalline diamond field emission source in SRF injector

Here, we report a demonstration of electron beam generation in a superconducting radio frequency (SRF) Teraelectronvolt Energy Superconducting Linear Accelerator 1.3 GHz gun equipped with a field emission cathode and operated at 2 K. The cathode is a submicrometer film of nitrogen-incorporated ultrananocrystalline diamond [(N)UNCD] deposited atop a Nb RRR300 cathode plug that is 4 mm in diameter. Measurements of the output current showed that it increased exponentially as a function of the gun gradient. Our results demonstrate a feasible path toward simplified fully cryogenic SRF injector technology. At a maximal gradient of 0.9 MV/m, a current density of 22 μA/cm2 was obtained [calculated as a 2.75 μA current over the total cathode surface area of π(2 mm)2]. One important finding is that the electron emitter made of (N)UNCD, a material long been known as a highly efficient field emission material, demonstrated a record low turn-on gradient of 0.6 MV/m. A hypothesis explaining this behavior is proposed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2022

Quantifying the reduction in cavitation-induced erosion damage in the Spallation Neutron Source mercury target by means of small-bubble gas injection

Here, a model developed to represent the progress of erosion damage in liquid-metal spallation target vessels was modified to incorporate the effect of gas injection on the erosion rate. The liquid mercury target system for the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory now operates with helium gas injection to reduce target vessel fatigue stress and cavitation-induced erosion damage. Erosion damage is a primary degradation phenomenon affecting the service life of SNS target vessels, and cavitation mitigation techniques, such as small-bubble gas injection, have been implemented to reduce damage and extend target lifetimes. Erosion depths in samples removed from SNS targets after operation were measured using laser line scanning. These measurements confirmed that gas injection reduced erosion damage. However, quantifying the damage reduction due to gas injection was complicated by variations in lifetime, power, and gas injection rates between different targets. In this study, the operating power and gas injection rate of targets were incorporated into an erosion damage prediction model to quantify their effects on erosion damage reduction. Values of a power scaling factor, β, were calculated by comparing modeled with measured erosion damage. These values indicate that the use of gas injection at the SNS reduced damage to a level equivalent to operating targets without gas injection at 35–47% of the actual beam power. To account for the gas injection effect on the cavitation damage, a simple exponential form based on analysis of the scaling factor β was developed to incorporate the gas rate history with a scaling factor γ in the erosion damage modeling.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Operator Relaxation and the Optimal Depth of Classical Shadows

Classical shadows are a powerful method for learning many properties of quantum states in a sample-efficient manner, by making use of randomized measurements. Here we study the sample complexity of learning the expectation value of Pauli operators via “shallow shadows,” a recently proposed version of classical shadows in which the randomization step is effected by a local unitary circuit of variable depth t. Here we show that the shadow norm (the quantity controlling the sample complexity) is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing (“twirling”) circuit—namely the evolution of the weight distribution characterizing the number of sites on which an operator acts nontrivially. For spatially contiguous Pauli operators of weight k, this entails a competition between two processes: operator spreading (whereby the support of an operator grows over time, increasing its weight) and operator relaxation (whereby the bulk of the operator develops an equilibrium density of identity operators, decreasing its weight). From this simple picture we derive (i) an upper bound on the shadow norm which, for depth t~log⁡(k), guarantees an exponential gain in sample complexity over the t=0 protocol in any spatial dimension, and (ii) quantitative results in one dimension within a mean-field approximation, including a universal subleading correction to the optimal depth, found to be in excellent agreement with infinite matrix product state numerical simulations. Our Letter connects fundamental ideas in quantum many-body dynamics to applications in quantum information science, and paves the way to highly optimized protocols for learning different properties of quantum states.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1989

Long period pseudo random number sequence generator

A circuit for generating a sequence of pseudo random numbers, (A sub K). There is an exponentiator in GF(2 sup m) for the normal basis representation of elements in a finite field GF(2 sup m) each represented by m binary digits and having two inputs and an output from which the sequence (A sub K). Of pseudo random numbers is taken. One of the two inputs is connected to receive the outputs (E sub K) of maximal length shift register of n stages. There is a switch having a pair of inputs and an output. The switch outputs is connected to the other of the two inputs of the exponentiator. One of the switch inputs is connected for initially receiving a primitive element (A sub O) in GF(2 sup m). Finally, there is a delay circuit having an input and an output. The delay circuit output is connected to the other of the switch inputs and the delay circuit input is connected to the output of the exponentiator. Whereby after the exponentiator initially receives the primitive element (A sub O) in GF(2 sup m) through the switch, the switch can be switched to cause the exponentiator to receive as its input a delayed output A(K-1) from the exponentiator thereby generating (A sub K) continuously at the output of the exponentiator. The exponentiator in GF(2 sup m) is novel and comprises a cyclic-shift circuit; a Massey-Omura multiplier; and, a control logic circuit all operably connected together to perform the function U(sub i) = 92(sup i) (for n(sub i) = 1 or 1 (for n(subi) = 0).

Wang, Charles C.↗
NASA NTRSDate not supplied

Lessons Learned on Mega-Constellation Deployments and Impact to Space Domain Awareness

The breakneck expansion of multi-payload launches in low Earth orbit (LEO) has seen significant escalation over the last three years in the Space Domain Awareness (SDA) enterprise. The uptick in satellite deployment frequency, gradation of mega-constellation deployments utilizing electric propulsion, and surge in metric observation density from the Space Surveillance Network (SSN) have driven major system enhancements to ensure spaceflight safety. Beginning with the launch phase, new tactics, software, and procedures have been developed over the last few years to optimize the tasking of the SSN and ensure custody of all recently launched satellites that are added to the space catalog. Ensuring appropriate tasking levels were pivotal during the satellite separation phase, which necessitated updates to the mission systems for improved delineation between clustered satellites in a short window of time. The improved incorporation of utilizing satellite owner/operator-provided ephemeris coupled with critical code improvements have revolutionized how we maintain custody of Earth orbiting objects. The exponential population growth of Low-Earth orbiting satellites have also increased the quantity of Conjunction Data Messages sent out to partners such as the Trajectory Operations Group (TOPO) in Johnson Space Center. We will discuss the need for continued collaboration between the National Aeronautics and Space Administration (NASA) and other mega-constellation satellite operators to safeguard human spaceflight operations. Lastly, we will discuss how mega-constellations are driving best practices for safe operations across the space community.

Christian Ramos↗
DOE OSTI2023

Quantum algorithms for geologic fracture networks

Abstract Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approach known as coarse-graining. For many practical applications, such as flow in porous, homogenous materials, coarse-graining offers a sufficiently-accurate approximation of the solution. Unfortunately, fractured systems cannot be accurately coarse-grained, as critical network topology exists at the smallest scales, including topology that can push the network across a percolation threshold. Therefore, new techniques are necessary to accurately model important fracture systems. Quantum algorithms for solving linear systems offer a theoretically-exponential improvement over their classical counterparts, and in this work we introduce two quantum algorithms for fractured flow. The first algorithm, designed for future quantum computers which operate without error, has enormous potential, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size (order 10–1000 nodes), which we demonstrate experimentally and explain theoretically. We expect further improvements by leveraging quantum error mitigation and preconditioning.

58 GEOSCIENCES↗
DOE OSTI2026

Polynomial-time preparation of low-temperature Gibbs states for two-dimensional toric code

In this work, we propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Measurement of atomic oxygen densities using TALIF on a dielectric barrier discharge: insights into the volume above a micro cavity plasma array

Dielectric barrier discharges, particularly micro cavity plasma arrays, offer significant potential for plasma-catalytic research due to their ability to ignite plasma in direct contact with a catalytic surface, enabling the observation of plasma-surface interactions. A key factor in their application is the generation of reactive species, such as atomic oxygen, within the cavities. These species can interact with both the surface (e.g. for activation or cleaning) and the gas being treated (e.g. for oxidation). Given the central role of oxygen atoms in plasma catalysis and their use as a model for more complex species, this work investigates the transport of these atoms out of the cavities. Two-photon absorption laser-induced fluorescence spectroscopy with picosecond laser excitation is performed in the volume above the cavities. The results are compared with a basic diffusion model. The reactor operates with a He/O 2 mixture at a flow rate of 1 slm and atmospheric pressure. Densities of up to 10 16 cm -3 are measured near the surface. Time-dependent measurements show that, at a distance of 350 µm from the surface, a density equilibrium is reached within less than 3 ms of reactor operation. Decay times due to ozone formation after the reactor is turned off are on a similar scale. Spatially resolved measurements show that the oxygen density decreases exponentially from the surface but remains detectable up to approximately 1 mm above the surface, indicating significant application potential. Variations in the O 2 admixture show a density maximum at 0.4%, confirming previous helium state enhanced actinometry measurements within the cavities.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2016

A Numerical Approach to Estimate the Ballistic Coefficient of Space Debris from TLE Orbital Data

Low Earth Orbit (LEO) is full of space debris, which consist of spent rocket stages, old satellites and fragments from explosions and collisions. As of 2009, more than 21,000 orbital debris larger than 10 cm are known to exist], and while it is hard to track anything smaller than that, the estimated population of particles between 1 and 10 cm in diameter is approximately 500,000, whereas small as 1 cm exceeds 100 million. These objects orbit Earth with huge kinetic energies speeds usually exceed 7 kms. The shape of their orbit varies from almost circular to highly elliptical and covers all LEO, a region in space between 160 and 2,000 km above sea level. Unfortunately, LEO is also the place where most of our active satellites are situated, as well as, International Space Station (ISS) and Hubble Space Telescope, whose orbits are around 400 and 550 km above sea level, respectively.This poses a real threat as debris can collide with satellites and deal substantial damage or even destroy them.Collisions between two or more debris create clouds of smaller debris, which are harder to track and increase overall object density and collision probability. At some point, the debris density couldthen reach a critical value, which would start a chain reaction and the number of space debris would grow exponentially. This phenomenon was first described by Kessler in 1978 and he concluded that it would lead to creation of debris belt, which would vastly complicate satellite operations in LEO. The debris density is already relatively high, as seen from several necessary debris avoidance maneuvers done by Shuttle, before it was discontinued, and ISS. But not all satellites have a propulsion system to avoid collision, hence different methods need to be applied. One of the proposed collision avoidance concepts is called LightForce and it suggests using photon pressure to induce small orbital corrections to deflect debris from colliding. This method is very efficient as seen from theoretical simulations, even few continuous mode 10 kW ground-based lasers, focused by 1.5 m telescopes with adaptive optics, were enough to prevent significant amount of the debris collisions. Simulations were done by propagating all space objects in LEO by 1 year into the future and checking whether the probability of collision was high. For those space objects different ground-based lasers were used to divert them, afterwards collision probabilities were reevaluated. However, the actual accuracy of the LightForce software, which has been developed at NASA AmesResearch Center, depends on the veracity of the input parameters, one of which is the objects ballistic coefficient. It is a measure of bodys ability to overcome air resistance, which has a significant impact on the debris in LEO, and thus it is responsible for the shape of the trajectory of the debris. Having the exact values of the ballistic coefficient would make significantly better collision predictions, unfortunately, we do not know what are the values for most of the objects.In this research, we were working with part of LightForce code, which estimates the ballistic coefficient from ephemerides. Previously used method gave highly inaccurate values, when compared to known objects, and it needed to be changed. The goal of this work was to try out a different method of estimating the ballistic coefficient and to check whether or not it gives noticeable improvements.

Collisions↗
DOE OSTI2025

Analyzing the Quantum Approximate Optimization Algorithm: Ansätze, Symmetries, and Lie Algebras

The quantum approximate optimization algorithm (QAOA) has been proposed as a method to obtain approximate solutions for combinatorial optimization tasks. In this work, we study the underlying algebraic properties of three QAOA ansätze for the maximum-cut problem on connected graphs, while focusing on the generated Lie algebras as well as their invariant subspaces. Specifically, we analyze the standard QAOA ansatz as well as the orbit and multiangle ansätze. We are able to fully characterize the Lie algebras of the multiangle ansatz across arbitrary connected graphs, finding that they only fall into one of just six families. Aside from the cycle and path graphs, the Lie dimensions for every graph are exponentially large in the system size, meaning that multiangle ansätze are extremely prone to exhibiting barren plateaus. Then, a similar quasi-graph-independent Lie-algebraic characterization beyond the multiangle ansatz is impeded as the circuit exhibits additional “hidden” symmetries besides those naturally arising from a certain parity-superselection operator and all automorphisms of the considered graph. Disregarding the “hidden” symmetries, we can upper bound the dimensions of the orbit and the standard Lie algebras, and the dimensions of the associated invariant subspaces are determined via explicit character formulas. To finish, we conjecture that (for most graphs) the standard Lie algebras have only components that are either exponential or that grow, at most, polynomially with the system size. This would imply that the QAOA is either prone to barren plateaus or classically simulable. More generally, our work provides a symmetry framework and tools to analyze any desired variational quantum algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗