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 127 records · Page 7

A petabyte size electronic library using the N-Gram memory engine

A model library containing petabytes of data is proposed by Triada, Ltd., Ann Arbor, Michigan. The library uses the newly patented N-Gram Memory Engine (Neurex), for storage, compression, and retrieval. Neurex splits data into two parts: a hierarchical network of associative memories that store 'information' from data and a permutation operator that preserves sequence. Neurex is expected to offer four advantages in mass storage systems. Neurex representations are dense, fully reversible, hence less expensive to store. Neurex becomes exponentially more stable with increasing data flow; thus its contents and the inverting algorithm may be mass produced for low cost distribution. Only a small permutation operator would be recalled from the library to recover data. Neurex may be enhanced to recall patterns using a partial pattern. Neurex nodes are measures of their pattern. Researchers might use nodes in statistical models to avoid costly sorting and counting procedures. Neurex subsumes a theory of learning and memory that the author believes extends information theory. Its first axiom is a symmetry principle: learning creates memory and memory evidences learning. The theory treats an information store that evolves from a null state to stationarity. A Neurex extracts information data without a priori knowledge; i.e., unlike neural networks, neither feedback nor training is required. The model consists of an energetically conservative field of uniformly distributed events with variable spatial and temporal scale, and an observer walking randomly through this field. A bank of band limited transducers (an 'eye'), each transducer in a bank being tuned to a sub-band, outputs signals upon registering events. Output signals are 'observed' by another transducer bank (a mid-brain), except the band limit of the second bank is narrower than the band limit of the first bank. The banks are arrayed as n 'levels' or 'time domains, td.' The banks are the hierarchical network (a cortex) and transducers are (associative) memories. A model Neurex was built and studied. Data were 50 MB to 10 GB samples of text, data base, and images: black/white, grey scale, and high resolution in several spectral bands. Memories at td, S(m(sub td)), were plotted against outputs of memories at td-1. S(m(sub td)) was Boltzman distributed, and memory frequencies exhibited self-organized criticality (SOC); i.e., 'l/f(sup beta)' after long exposures to data. Whereas output signals from level n may be encoded with B(sub output) = O(-log(2)f(sup beta)) bits, and input data encoded with B(sub input) = O((S(td)/S(td-1))(sup n)), B(sup output)/B(sub input) is much less than 1 always, the Neurex determines a canonical code for data and it is a lossless data compressor. Further tests are underway to confirm these results with more data types and larger samples.

Bugajski, Joseph M.↗

Fixed-point quantum circuits for quantum field theories

Renormalization group ideas and effective operators are introduced to efficiently prepare ground states of massive lattice field theories on digital quantum devices. This is accomplished with a systematic approximation through localized unitaries that removes an exponentially costly barrier in the spatial volume of the quantum simulation. With these methods, classically computed ground states in a spatial volume L, containing a few Compton wavelengths, can be used to determine operators for preparing the ground state toward the thermodynamic limit with a precision improving as e –mL on beyond-classical quantum registers. Here, due to the exponential spatial decay of correlations in massive theories and the double exponential suppression of digitization artifacts in the number of qubits representing the scalar field, the derived fixed-point quantum circuits are expected to be relevant for simulations of quantum field theories throughout the evolution from small-scale near-term quantum devices to large-scale fault-tolerant quantum computers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Complexity growth in integrable and chaotic models

We use the SYK family of models with N Majorana fermions to study the complexity of time evolution, formulated as the shortest geodesic length on the unitary group manifold between the identity and the time evolution operator, in free, integrable, and chaotic systems. Initially, the shortest geodesic follows the time evolution trajectory, and hence complexity grows linearly in time. We study how this linear growth is eventually truncated by the appearance and accumulation of conjugate points, which signal the presence of shorter geodesics intersecting the time evolution trajectory. By explicitly locating such “shortcuts” through analytical and numerical methods, we demonstrate that: (a) in the free theory, time evolution encounters conjugate points at a polynomial time; consequently complexity growth truncates at O($\sqrt{N}$), and we find an explicit operator which “fast-forwards” the free N-fermion time evolution with this complexity, (b) in a class of interacting integrable theories, the complexity is upper bounded by O(poly(N)), and (c) in chaotic theories, we argue that conjugate points do not occur until exponential times O(e N ), after which it becomes possible to find infinitesimally nearby geodesics which approximate the time evolution operator. Finally, we explore the notion of eigenstate complexity in free, integrable, and chaotic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of data‐driven exponential integrators with application to modeling of delay photocurrents

Abstract Radiation‐induced photocurrent effects represent a threat to microelectronic components operating in space, manmade and terrestrial radiation environments. Analysis of these threats by circuit simulations requires accurate and computationally efficient compact models. Most existing compact models are based on closed form analytic solutions of the governing equations and require empirical assumptions and idealizations that can limit their validity. In this paper we formulate an alternative numerical, data‐driven approach that learns a compact model from data representative of the type of measurements one can obtain in an experimental facility. To develop the model we start from a generic discrete‐time dynamical system and then use physics knowledge to refine its structure. Numerical studies demonstrate the potential of the model and establish some empirical guidelines for its training.

Bochev, Pavel↗

Control Design Strategies to Enhance Long-Term Aircraft Structural Integrity

Over the operational lifetime of both military and civil aircraft, structural components are exposed to hundreds of thousands of low-stress repetitive load cycles and less frequent but higher-stress transient loads originating from maneuvering flight and atmospheric gusts. Micro-material imperfections in the structure, such as cracks and debonded laminates, expand and grow in this environment, reducing the structural integrity and shortening the life of the airframe. Extreme costs associated with refurbishment of critical load-bearing structural components in a large fleet, or altogether reinventoring the fleet with newer models, indicate alternative solutions for life extension of the airframe structure are highly desirable. Increased levels of operational safety and reliability are also important factors influencing the desirability of such solutions. One area having significant potential for impacting crack growth/fatigue damage reduction and structural life extension is flight control. To modify the airframe response dynamics arising from command inputs and gust disturbances, feedback loops are routinely applied to vehicles. A dexterous flight control system architecture senses key vehicle motions and generates critical forces/moments at multiple points distributed throughout the airframe to elicit the desired motion characteristics. In principle, these same control loops can be utilized to influence the level of exposure to harmful loads during flight on structural components. Project objectives are to investigate and/or assess the leverage control has on reducing fatigue damage and enhancing long-term structural integrity, without degrading attitude control and trajectory guidance performance levels. In particular, efforts have focused on the effects inner loop control parameters and architectures have on fatigue damage rate. To complete this research, an actively controlled flexible aircraft model and a new state space modeling procedure for crack growth have been utilized. Analysis of the analytical state space model for crack growth revealed the critical mathematical factors, and hence the physical mechanism they represent, that influenced high rates of airframe crack growth. The crack model was then exercised with simple load inputs to uncover and expose key crack growth behavior. To characterize crack growth behavior, both "short-term" laboratory specimen test type inputs and "long-term" operational flight type inputs were considered. Harmonic loading with a single overload revealed typical exponential crack growth behavior until the overload application, after which time the crack growth was retarded for a period of time depending on the overload strength. An optimum overload strength was identified which leads to maximum retardation of crack growth. Harmonic loading with a repeated overload of varying strength and frequency again revealed an optimum overload trait for maximizing growth retardation. The optimum overload strength ratio lies near the range of 2 to 3 with dependency on frequency. Experimental data was found to correlate well with the analytical predictions.

Newman, Brett A.↗

Exploring Our Solar System with CubeSats and NanoSats

The Jet Propulsion Laboratory (JPL) is NASA's lead center for robotic exploration of our solar system. We are known for our large, flagship missions, such as Voyager, which gave humanity its first close look at Jupiter and Saturn; and the Mars Rovers, which have excited millions worldwide with their daring landing exploits. Less familiar to those outside NASA may be our role in developing the Kepler mission, which has discovered more than 2000 planets around other stars; or the recently launched Soil Moisture Active Passive (SMAP) mission, one of many JPL Earth Science missions. A recent JPL initiative has emphasized low cost missions that use rapidly evolving technology developed for CubeSats and NanoSat s to explore our solar system. Costs are significantly lower (by one or two orders of magnitude) than for conventional JPL missions, and development time is also significantly shorter. At present 21 such CubeSat flight projects are under way at the laboratory with various partners : some in flight, some in development, some in advanced formulation. Four are planned as deep space missions. To succeed in exploring deep space CubeSat/NanoSat missions have to address several challenges: the more severe radiation environment, communications and navigation at a distance, propulsion, and packaging of instruments that can return valuable science into a compact volume/mass envelope. Instrument technologies, including cameras, magnetometers, spectrometers, radiometers, and even radars are undergoing miniaturization to fit on these smaller platforms. Other key technologies are being matured for smallsats and NanoSats in deep space, including micro -electric propulsion, compact radio (and optical) communications, and onboard data reduction. This paper will describe missions that utilize these developments including the first two deep space CubeSats (INSPIRE), planned for launch in 2017; the first pair of CubeSats to be sent to another planet (MARCO), manifested with the InSight Mars lander launch in March of 2016; a helicopter "drone" on Mars to extend the reach of future rovers; plans for a Lunar Flashlight mission to shine a light on the permanently shadowed craters of the Moon's poles; a Near Earth Asteroid CubeSat missio n; and a CubeSat constellation to demonstrate time series measurements of storm systems on Earth. From these beginnings, the potential for CubeSats and NanoSats to add to our knowledge of the solar system could easily grow exponentially. Imagine if every deep space mission carried one or more CubeSats that could operate independently (even for a brief period) on arrival at their target body. At only incremental additional cost, such spacecraft could go closer, probe deeper, and provide science measurements that we would not risk with the host spacecraft. This paper will describe examples including a NanoSat to probe the composition of Venus' atmosphere, impactors and close flybys of Europa, lunar probes, and soft landers for the moons of Mars. Low cost access to deep space also offers the potential for independent CubeSat/NanoSat missions - allowing us to characterize the population of near Earth asteroids for example, deploy a constellation around Venus, or take closer looks at the asteroid belt.

Deep Space↗

Queueing Network Models for Parallel Processing of Task Systems: an Operational Approach

Computer performance modeling of possibly complex computations running on highly concurrent systems is considered. Earlier works in this area either dealt with a very simple program structure or resulted in methods with exponential complexity. An efficient procedure is developed to compute the performance measures for series-parallel-reducible task systems using queueing network models. The procedure is based on the concept of hierarchical decomposition and a new operational approach. Numerical results for three test cases are presented and compared to those of simulations.

Mak, Victor W. K.↗

Quantum Algorithms

This thesis describes several new quantum algorithms. These include a polynomial time algorithm that uses a quantum fast Fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases for which all know classical algorithms require exponential time.

Quantum Algorithms polynomial time algorithm Hamil↗

Formulations and Valid Inequalities for Optimal Black Start Allocation in Power Systems

The restoration of a power system after a blackout starts around units with enhanced technical capabilities, referred to as black start units (BSUs). We examine the planning problem of optimally allocating these units on the grid subject to a budget constraint. We present a mixed integer programming model based on current literature in power systems. Binary variables are associated with the allocation of BSUs and with the energization state of buses, branches, and generators of the power system over a time horizon. We extract a substructure of the feasible region which imposes the requirement that each island that appears during the restoration process must have at least one operational generator. We discuss three equivalent reformulations for this requirement. We introduce a family of exponentially many, polynomially separable, valid inequalities to strengthen the formulation. Under simplifying assumptions, we show that the convex hull of the feasible region is a full-dimensional polyhedron, and prove that some of the constraints we introduced are facet-defining. We perform experiments to examine the difference in strength between the formulations as well as the computational times to solve the problem to near optimality for synthetic instances of the IEEE-39, IEEE-118, Illinois-200, WECC-225, IEEE-300, South Carolina-500, and Texas-2000 power systems. We illustrate a use case of the model. We conclude by suggesting extensions of the current work for future research.

Black Start Allocation↗

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗

Learning Distributed Geometric Koopman Operator for Sparse Networked Dynamical Systems

Koopman operator theory provides an alternative to study nonlinear networked dynamical systems by mapping the state space to an abstract higher dimensional space where the system evolution is linear. Recent works show the application of graph neural networks (GNNs) to learn state to object-centric embeddings and achieve centralized block-wise computation of Koopman operator (KO) under additional assumptions on the underlying agents properties and constraints on the KO structure. However, the computational complexity of learning the Koopman increases exponentially for networked systems where the number of possible system states grows in a combinatorial fashion with the number of nodes. The learning challenge is further amplified for sparse networks by two factors: 1) sample sparsity for learning the Koopman operator in the non-linear space, and 2) the divergence in the dynamics of individual nodes or from one subgraph to another. Our work aims to address these challenge by formulating the representation learning of networked dynamical systems into a multi-agent paradigm and learning the Koopman operator in a distributive manner. The computational as well as performance advantages of distributed Koopman is predominant for sparse networks whereas for fully connected networks, it is shown to coincide with the centralized one. The empirical study on rope system, network of oscillators and a synthetic power system show comparable and superior performance along with computational benefits with the state-of-the-art methods.

Mukherjee, Sayak↗

Scanning Tunneling Optical Resonance Microscopy

Scanning tunneling optical resonance microscopy (STORM) is a method, now undergoing development, for measuring optoelectronic properties of materials and devices on the nanoscale by means of a combination of (1) traditional scanning tunneling microscopy (STM) with (2) tunable laser spectroscopy. In STORM, an STM tip probing a semiconductor is illuminated with modulated light at a wavelength in the visible-to-near-infrared range and the resulting photoenhancement of the tunneling current is measured as a function of the illuminating wavelength. The photoenhancement of tunneling current occurs when the laser photon energy is sufficient to excite charge carriers into the conduction band of the semiconductor. Figure 1 schematically depicts a proposed STORM apparatus. The light for illuminating the semiconductor specimen at the STM would be generated by a ring laser that would be tunable across the wavelength range of interest. The laser beam would be chopped by an achromatic liquid-crystal modulator. A polarization-maintaining optical fiber would couple the light to the tip/sample junction of a commercial STM. An STM can be operated in one of two modes: constant height or constant current. A STORM apparatus would be operated in the constant-current mode, in which the height of the tip relative to the specimen would be varied in order to keep the tunneling current constant. In this mode, a feedback control circuit adjusts the voltage applied to a piezoelectric actuator in the STM that adjusts the height of the STM tip to keep the tunneling current constant. The exponential relationship between the tunneling current and tip-to-sample distance makes it relatively easy to implement this mode of operation. The choice of method by which the photoenhanced portion of the tunneling current would be measured depends on choice of the frequency at which the input illumination would be modulated (chopped). If the frequency of modulation were low enough (typically < 10 Hz) that the feedback circuit could respond, then the voltage applied to the piezoelectric tip-height actuator could be measured by use of a lock-in amplifier locked to the modulation (chopping) signal. However, at a high modulation frequency (typically in the kilohertz range or higher), the feedback circuit would be unable to respond. In this case, the photoenhanced portion of the tunneling current could be measured directly. For this purpose, the tunneling current would be passed through a precise resistor and the voltage drop would be measured by use of the lock-in amplifier.

Bailey, Sheila↗

Calculating the divided differences of the exponential function by addition and removal of inputs

We introduce a method for calculating the divided differences of the exponential function by means of addition and removal of items from the input list to the function. Our technique exploits a new identity related to divided differences recently derived by F. Zivcovich. We show that upon adding an item to or removing an item from the input list of an already evaluated exponential, the re-evaluation of the divided differences can be done with only O(sn) floating point operations and O(sn) bytes of memory, where [z 0 ,...,z n ] are the inputs and s ∝ max i,j |z i – z j |. We demonstrate our algorithm’s ability to deal with input lists that are orders-of-magnitude longer than the maximal capacities of the current state-of-the-art. Here, we discuss in detail one practical application of our method: the efficient calculation of weights in the off-diagonal series expansion quantum Monte Carlo algorithm.

97 MATHEMATICS AND COMPUTING↗

The Area Coverage of Geophysical Fields as a Function of Sensor Field-of View

In many remote sensing studies of geophysical fields such as clouds, land cover, or sea ice characteristics, the fractional area coverage of the field in an image is estimated as the proportion of pixels that have the characteristic of interest (i.e., are part of the field) as determined by some thresholding operation. The effect of sensor field-of-view on this estimate is examined by modeling the unknown distribution of subpixel area fraction with the beta distribution, whose two parameters depend upon the true fractional area coverage, the pixel size, and the spatial structure of the geophysical field. Since it is often not possible to relate digital number, reflectance, or temperature to subpixel area fraction, the statistical models described are used to determine the effect of pixel size and thresholding operations on the estimate of area fraction for hypothetical geophysical fields. Examples are given for simulated cumuliform clouds and linear openings in sea ice, whose spatial structures are described by an exponential autocovariance function. It is shown that the rate and direction of change in total area fraction with changing pixel size depends on the true area fraction, the spatial structure, and the thresholding operation used.

Key, Jeffrey R.↗

Delay Banking for Managing Air Traffic

Delay banking has been invented to enhance air-traffic management in a way that would increase the degree of fairness in assigning arrival, departure, and en-route delays and trajectory deviations to aircraft impacted by congestion in the national airspace system. In delay banking, an aircraft operator (airline, military, general aviation, etc.) would be assigned a numerical credit when any of their flights are delayed because of an air-traffic flow restriction. The operator could subsequently bid against other operators competing for access to congested airspace to utilize part or all of its accumulated credit. Operators utilize credits to obtain higher priority for the same flight, or other flights operating at the same time, or later, in the same airspace, or elsewhere. Operators could also trade delay credits, according to market rules that would be determined by stakeholders in the national airspace system. Delay banking would be administered by an independent third party who would use delay banking automation to continually monitor flights, allocate delay credits, maintain accounts of delay credits for participating airlines, mediate bidding and the consumption of credits of winning bidders, analyze potential transfers of credits within and between operators, implement accepted transfers, and ensure fair treatment of all participating operators. A flow restriction can manifest itself in the form of a delay in assigned takeoff time, a reduction in assigned airspeed, a change in the position for the aircraft in a queue of all aircraft in a common stream of traffic (e.g., similar route), a change in the planned altitude profile for an aircraft, or change in the planned route for the aircraft. Flow restrictions are typically imposed to mitigate traffic congestion at an airport or in a region of airspace, particularly congestion due to inclement weather, or the unavailability of a runway or region of airspace. A delay credit would be allocated to an operator of a flight that has accepted, or upon which was imposed, a flow restriction. The amount of the credit would increase with the amount of delay caused by the flow restriction, the exact amount depending on which of several candidate formulas is eventually chosen. For example, according to one formula, there would be no credit for a delay smaller than some threshold value (e.g., 30 seconds) and the amount of the credit for a longer delay would be set at the amount of the delay minus the threshold value. Optionally, the value of a delay credit could be made to decay with time according to a suitable formula (e.g., an exponential decay). Also, optionally, a transaction charge could be assessed against the value of a delay credit that an operator used on a flight different from the one for which the delay originated or that was traded with a different operator. The delay credits accumulated by a given airline could be utilized in various ways. For example, an operator could enter a bid for priority handling in a new flow restriction that impacts one or more of the operator s flights; if the bid were unsuccessful, all or a portion of the credit would be returned to the bidder. If the bid pertained to a single aircraft that was in a queue, delay credits could be consumed in moving the aircraft to an earlier position within the queue. In the case of a flow restriction involving a choice of alternate routes, planned altitude profile, aircraft spacing, or other non-queue flow restrictions, delay credits could be used to bid for an alternative assignment.

Green, Steve↗

Covariance operator estimation: Sparsity, lengthscale, and ensemble Kalman filters

This paper investigates covariance operator estimation via thresholding. For Gaussian random fields with approximately sparse covariance operators, we establish non-asymptotic bounds on the estimation error in terms of the sparsity level of the covariance and the expected supremum of the field. We prove that thresholded estimators enjoy an exponential improvement in sample complexity compared with the standard sample covariance estimator if the field has a small correlation lengthscale. As an application of the theory, we study thresholded estimation of covariance operators within ensemble Kalman filters.

Covariance operator estimation↗

Spectral scheme for atomic structure calculations in density functional theory

In this study, we present a spectral scheme for atomic structure calculations in pseudopotential Kohn-Sham density functional theory. In particular, after applying an exponential transformation of the radial coordinates, we employ global polynomial interpolation on a Chebyshev grid, with derivative operators approximated using the Chebyshev differentiation matrix, and integrations using Clenshaw-Curtis quadrature. We demonstrate the accuracy and efficiency of the scheme through spin-polarized and unpolarized calculations for representative atoms, while considering local, semilocal, and hybrid exchange-correlation functionals. In particular, we find that $\mathcal{O}$(200) grid points are sufficient to achieve an accuracy of 1 microhartree in the eigenvalues for optimized norm conserving Vanderbilt pseudopotentials spanning the periodic table from atomic number Ζ = 1 to 83.

74 ATOMIC AND MOLECULAR PHYSICS↗

Chaotic roots of the modular multiplication dynamical system in Shor's algorithm

Shor's factoring algorithm, believed to provide an exponential speedup over classical computation, relies on finding the period of an exactly periodic quantum modular multiplication operator. This exact periodicity is the hallmark of an integrable system, which is paradoxical from the viewpoint of quantum chaos, given that the classical limit of the modular multiplication operator is a highly chaotic system that occupies the “maximally random” Bernoulli level of the classical ergodic hierarchy. In this work, we approach this apparent paradox from a quantum dynamical systems viewpoint, and consider whether signatures of ergodicity and chaos may indeed be encoded in such an “integrable” quantization of a chaotic system. We show that Shor's modular multiplication operator, in specific cases, can be written as a superposition of quantized 𝐴-baker's maps exhibiting more typical signatures of quantum chaos and ergodicity. This work suggests that the integrability of Shor's modular multiplication operator may stem from the interference of other “chaotic” quantizations of the same family of maps, and paves the way for deeper studies on the interplay of integrability, ergodicity, and chaos in and via quantum algorithms.

Dynamical systems↗