Search NASA⌕ Search

SEARCH · Search NASA

Results for “operator decomposition”

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 235 records · Page 13

The effects of arcjet operating condition and constrictor geometry on the plasma plume

Measurements of plasma number density and electron temperature were obtained in the plumes of lab arcjet thrusters using electrostatic probes of both spherical and cylindrical geometry. The two arcjet thrusters used had different constrictor and/or nozzle geometries and operated on mixtures of nitrogen, hydrogen, and ammonia to simulate the decomposition products of hydrazine and ammonia. An increase in the measured electron density was observed for both geometries with increasing arc power at a constant mass flow rate and with increasing mass flow rate at a constant arc current. For a given operating condition, the electron number density decreased exponentially off centerline and followed an inverse distance squared relationship along the thrust axis. Typical measured electron temperatures ranged from 0.1 to 0.2 eV.

Carney, Lynnette M.↗

The effects of arcjet thruster operating condition constrictor geometry on the plasma plume

Measurements of plasma number density and electron temperature were obtained in the plumes of lab arcjet thrusters using electrostatic probes of both spherical and cylindrical geometry. The two arcjet thrusters used had different constrictor and/or nozzle geometries and operated on mixtures of nitrogen, hydrogen, and ammonia to simulate the decomposition products of hydrazine and ammonia. An increase in the measured electron density was observed for both geometries with increasing arc power at a constant mass flow rate and with increasing mass flow rate at a constant arc current. For a given operating condition, the electron number density decreased exponentially off centerline and followed an inverse distance squared relationship along the thrust axis. Typical measured electron temperatures ranged from 0.1 to 0.2 eV.

Carney, Lynnette M.↗

A natural basis for efficient brain-actuated control

The prospect of noninvasive brain-actuated control of computerized screen displays or locomotive devices is of interest to many and of crucial importance to a few 'locked-in' subjects who experience near total motor paralysis while retaining sensory and mental faculties. Currently several groups are attempting to achieve brain-actuated control of screen displays using operant conditioning of particular features of the spontaneous scalp electroencephalogram (EEG) including central mu-rhythms (9-12 Hz). A new EEG decomposition technique, independent component analysis (ICA), appears to be a foundation for new research in the design of systems for detection and operant control of endogenous EEG rhythms to achieve flexible EEG-based communication. ICA separates multichannel EEG data into spatially static and temporally independent components including separate components accounting for posterior alpha rhythms and central mu activities. We demonstrate using data from a visual selective attention task that ICA-derived mu-components can show much stronger spectral reactivity to motor events than activity measures for single scalp channels. ICA decompositions of spontaneous EEG would thus appear to form a natural basis for operant conditioning to achieve efficient and multidimensional brain-actuated control in motor-limited and locked-in subjects.

NASA Discipline Space Human Factors↗

Universal programmable quantum circuit schemes to emulate an operator

Unlike fixed designs, programmable circuit designs support an infinite number of operators. The functionality of a programmable circuit can be altered by simply changing the angle values of the rotation gates in the circuit. Here, we present a new quantum circuit design technique resulting in two general programmable circuit schemes. The circuit schemes can be used to simulate any given operator by setting the angle values in the circuit. This provides a fixed circuit design whose angles are determined from the elements of the given matrix-which can be non-unitary-in an efficient way. We also give both the classical and quantum complexity analysis for these circuits and show that the circuits require a few classical computations. For the electronic structure simulation on a quantum computer, one has to perform the following steps: prepare the initial wave function of the system; present the evolution operator U=e{sup -iHt} for a given atomic and molecular Hamiltonian H in terms of quantum gates array and apply the phase estimation algorithm to find the energy eigenvalues. Thus, in the circuit model of quantum computing for quantum chemistry, a crucial step is presenting the evolution operator for the atomic and molecular Hamiltonians in terms of quantum gate arrays. Since the presented circuit designs are independent from the matrix decomposition techniques and the global optimization processes used to find quantum circuits for a given operator, high accuracy simulations can be done for the unitary propagators of molecular Hamiltonians on quantum computers. As an example, we show how to build the circuit design for the hydrogen molecule.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

TuckerCompressMPI v. 1.0

As parallel computing trends towards the exascale, scientific data produced by high-fidelity simulations are growing increasingly massive. For instance, a simulation on a three-dimensional spatial grid with 512 points per dimension that tracks 64 variables per grid point for 128 time steps yields 8 TB of data. By viewing the data as a dense five-way tensor, we can compute a Tucker decomposition to find inherent low-dimensional multilinear structure, achieving compression ratios of up to 10000 on real-world data sets with negligible loss in accuracy. So that we can operate on such massive data, we present the first-ever distributed-memory parallel implementation for the Tucker decomposition, whose key computations correspond to parallel linear algebra operations, albeit with nonstandard data layouts. Our approach specifies a data distribution for tensors that avoids any tensor data redistribution, either locally or in parallel. This software provides a method for compressing large-scale multiway data.

Austin, Woody↗

Advanced Automotive Fuels Research, Development, and Commercialization Cluster (OH) (Final Report)

Technical aspects of producing alternative fuels that may eventually supplement or replace conventional the petroleum-derived fuels that are presently used in vehicular transportation have been investigated. The work was centered around three projects: 1) deriving butanol as a fuel additive from bacterial action on sugars produced from decomposition of aqueous suspensions of wood cellulose under elevated temperature and pressure; 2) using highly ordered, openly structured molecules known as metal-organic framework (MOF) compounds as adsorbents for gas separations in fuel processing operations; and 3) developing a photocatalytic membrane for solar-driven water decomposition to generate pure hydrogen fuel. Several departments within the STEM College at YSU contributed to the effort: Chemistry, Biology, and Chemical Engineering. In the butanol project, sawdust was blended with water at variable pH and temperature (150 – 250 °C), and heated inside a pressure vessel for specified periods of time. Analysis of the extracts showed a wide variety of compounds, including simple sugars that bacteria are known to thrive upon. Samples of the cellulose hydrolysate were fed to colonies of Clostridium beijerinckii, which are known to convert sugars to a mixture of compounds, principally butanol. While the bacteria were active toward additions of pure sugar solutions, the cellulose extract appeared to inhibit butanol production, and furthermore encouraged the Clostridium to become dormant. Proteomic analysis showed that the bacteria had changed their genetic code to where it was becoming sporulated, i.e., the bacteria were trying to go dormant. This finding may be an opportunity, as it may be possible to genetically engineer bacteria that resist the butanol-driven triggering mechanism to stop further fuel production. Another way of handling the cellulosic hydrolysates was to simply add the enzymes responsible for butanol synthesis to the hydrolytic extract ex-vivo. These enzymes are generally not available commercially, however, and those that are can be quite expensive. Accordingly, the genes responsible for enzyme synthesis were inserted into other microorganisms in order to accelerate enzyme production. This was demonstrated for two of the required enzymes in the overall series. In the MOF project, a number of new MOF compounds were synthesized and characterized, as well as some common MOFs well-known for their adsorption properties. Selectivity for specific gases such as CO 2 and H 2 was demonstrated, although it was seen that water vapor would frequently act as an interferent. This work underscored the need to test MOF compounds under real world conditions, i.e., room temperature and above instead of liquid N 2 temperature, and testing adsorption using blends of gases instead of pure components. In the solar membrane project, thin films of CdTe and WO 3 were applied to steel substrates and used as p-type and n-type semiconductors, respectively, in the production of H 2 and O 2 . Testing with 2 H and 18 O isotopically labeled water enabled substantiation of net water-splitting.

08 HYDROGEN↗

Gyrokinetic particle-in-cell optimization on emerging multi- and manycore platforms

The next decade of high-performance computing (HPC) systems will see a rapid evolution and divergence of multi- and manycore architectures as power and cooling constraints limit increases in microprocessor clock speeds. Understanding efficient optimization methodologies on diverse multicore designs in the context of demanding numerical methods is one of the greatest challenges faced today by the HPC community. In this paper, we examine the efficient multicore optimization of GTC, a petascale gyrokinetic toroidal fusion code for studying plasma microturbulence in tokamak devices. For GTC’s key computational components (charge deposition and particle push), we explore efficient parallelization strategies across a broad range of emerging multicore designs, including the recently-released Intel Nehalem-EX, the AMD Opteron Istanbul, and the highly multithreaded Sun UltraSparc T2+. We also present the first study on tuning gyrokinetic particle-in-cell (PIC) algorithms for graphics processors, using the NVIDIA C2050 (Fermi). Our work discusses several novel optimization approaches for gyrokinetic PIC, including mixed-precision computation, particle binning and decomposition strategies, grid replication, SIMDized atomic floating-point operations, and effective GPU texture memory utilization. Overall, we achieve significant performance improvements of 1.3–4.7× on these complex PIC kernels, despite the inherent challenges of data dependency and locality. Finally, our work also points to several architectural and programming features that could significantly enhance PIC performance and productivity on next-generation architectures.

97 MATHEMATICS AND COMPUTING↗

VpROM: a novel variational autoencoder-boosted reduced order model for the treatment of parametric dependencies in nonlinear systems

Reduced Order Models (ROMs) are of considerable importance in many areas of engineering in which computational time presents difficulties. Established approaches employ projection-based reduction, such as Proper Orthogonal Decomposition. The limitation of the linear nature of such operators is typically tackled via a library of local reduction subspaces, which requires the assembly of numerous local ROMs to address parametric dependencies. Our work attempts to define a more generalisable mapping between parametric inputs and reduced bases for the purpose of generative modeling. We propose the use of Variational Autoencoders (VAEs) in place of the typically utilised clustering or interpolation operations, for inferring the fundamental vectors, termed as modes, which approximate the manifold of the model response for any and each parametric input state. The derived ROM still relies on projection bases, built on the basis of full-order model simulations, thus retaining the imprinted physical connotation. However, it additionally exploits a matrix of coefficients that relates each local sample response and dynamics to the global phenomena across the parametric input domain. The VAE scheme is utilised for approximating these coefficients for any input state. This coupling leads to a high-precision low-order representation, which is particularly suited for problems where model dependencies or excitation traits cause the dynamic behavior to span multiple response regimes. Moreover, the probabilistic treatment of the VAE representation allows for uncertainty quantification on the reduction bases, which may then be propagated to the ROM response. The performance of the proposed approach is validated on an open-source simulation benchmark featuring hysteresis and multi-parametric dependencies, and on a large-scale wind turbine tower characterised by nonlinear material behavior and model uncertainty.

Conditional VAEs↗

Preparing angular momentum eigenstates using engineered quantum walks

Coupled angular-momentum eigenstates are widely used in atomic and nuclear physics calculations and are building blocks for spin networks and the Schur transform. To combine two angular momenta J 1 and J 2 , forming eigenstates of their total angular momentum J=J 1 +J 2 , we develop a quantum-walk scheme that does not require inputting O(j 3 ) nonzero Clebsch–Gordan (CG) coefficients classically. In fact, our scheme may be regarded as a unitary method for computing CG coefficients on quantum computers with a typical complexity of O⁡(j) and a worst-case complexity of O⁡(j 3 ). Equivalently, our scheme provides decompositions of the dense CG unitary into sparser unitary operations. Our scheme prepares angular-momentum eigenstates using a sequence of Hamiltonians to move an initial state deterministically to desired final states, which are usually highly entangled states in the computational basis. In contrast with usual quantum walks, whose Hamiltonians are prescribed, we engineer the Hamiltonians in su⁡(2)×su⁡(2), which are inspired by, but different from, Hamiltonians that govern magnetic resonances and dipole interactions. To achieve a deterministic preparation of both ket and bra states, we use projection and destructive interference to double pinch the quantum walks, such that each step is a unit-probability population transfer within a two-level system. We test our state preparation scheme on classical computers, reproducing tables of CG coefficients. Finally, we also implement small test problems on current quantum hardware.

97 MATHEMATICS AND COMPUTING↗

Operations Program Executive

Ground Resource Operations Program executive (GROPE) is control program for binding system of programs into single, easily operated entity. It relieves user from complexity arising from decomposition of large application into number of interacting program units. System simplifies job control, data management, and recordkeeping for interacting programs.

Fague, M. A.↗

Real-number codes for fault-tolerant matrix operations on processor arrays

A generalization of existing real number codes is proposed. It is proven that linearity is a necessary and sufficient condition for codes used for fault-tolerant matrix operations such as matrix addition, multiplication, transposition, and LU decomposition. It is also proven that for every linear code defined over a finite field, there exists a corresponding linear real-number code with similar error detecting capabilities. Encoding schemes are given for some of the example codes which fall under the general set of real-number codes. With the help of experiments, a rule is derived for the selection of a particular code for a given application. The performance overhead of fault tolerance schemes using the generalized encoding schemes is shown to be very low, and this is substantiated through simulation experiments.

Nair, V. S. S.↗

Detection of signature consistent with cosmological time dilation in gamma-ray bursts

If gamma ray bursts are at cosmological distances-as suggested by their isotropic distribution on the sky and by their number-intensity relation-then the burst profiles will be stretched in time, by an amount proportional to the redshift, 1 + Z. We have tested data from the Compton Gamma Ray Observatory's (CGRO's) Burst and Transient Source Experiment (BATSE) for such time dilation. Out of 590 bursts observed by BATSE, 131 bursts were analyzed; bursts with durations shorter than 1.5 s were excluded. We used three tests to compare the timescales of bright and dim bursts, the latter, on average, being more distant than the former. Our measures of timescale are constructed to avoid selection effects arising from intensity differences by rescaling all bursts to fiducial levels of peak intensity and noise bias. (1) We found that the total rescaled count above background for the dim burst ensemble is approximately twice that for the brightest bursts-translating into longer durations for the dim bursts. (2) Wavelet-transform decompositions of the burst profiles confirmed that this dilation operates over a broad range of timescales. (3) Structure on the shortest timescales was examined using a procedure which aligns the highest peaks of profiles from which the noise has been optimally removed using a wavelet threshold technique. In all three tests, the dim bursts are stretched by a factor of approximately 2 relative to the bright ones, over seven octaves of timescale. We calibrated the measurements by dilating synthetic bursts that approximate the temporal characteristics of bright BATSE bursts. Results are consistent with bursts at BATSE's peak-flux completeness limit being at cosmological distances corresponding to Z approximately equal to 1, and thus with independent cosmological interpretations of the BATSE number-intensity relation. Alternative explanations of our results, arising from the nature of physical processes in bursts, are still possible.

Norris, J. P.↗

Three-Dimensional High-Lift Analysis Using a Parallel Unstructured Multigrid Solver

A directional implicit unstructured agglomeration multigrid solver is ported to shared and distributed memory massively parallel machines using the explicit domain-decomposition and message-passing approach. Because the algorithm operates on local implicit lines in the unstructured mesh, special care is required in partitioning the problem for parallel computing. A weighted partitioning strategy is described which avoids breaking the implicit lines across processor boundaries, while incurring minimal additional communication overhead. Good scalability is demonstrated on a 128 processor SGI Origin 2000 machine and on a 512 processor CRAY T3E machine for reasonably fine grids. The feasibility of performing large-scale unstructured grid calculations with the parallel multigrid algorithm is demonstrated by computing the flow over a partial-span flap wing high-lift geometry on a highly resolved grid of 13.5 million points in approximately 4 hours of wall clock time on the CRAY T3E.

Mavriplis, Dimitri J.↗

3D Navier-Stokes Time Accurate Solutions Using Multipartitioning Parallel Computation Methodology

A parallel CFD code solving 3D time accurate Navier-Stokes equations with multipartitioning parallel Methodology is being developed in collaboration with Ohio State University within the Air Vehicle Directorate, at Wright Patterson Air Force Base. The advantage of the multipartitioning parallel method is that the domain decomposition will not introduce domain boundaries for the implicit operators. A ring structure data communication is employed so that the implicit time accurate method can be implemented for multi-processors with the same accuracy as for the single processor. No sub-iteration is needed at the domain boundaries. The code has been validated for some typical unsteady flows, which include Coutte Flow, flow passing a cylinder. The code now is being employed for a large scale time accurate wall jet transient flow computation. 'ne preliminary results are promising. The mesh has been refined to capture more details of the flow field. The mesh refinement computation is in progress and would be difficult to successfully implement without the parallel computation techniques used. A modified version of the code with more efficient inversion of the diagonalized block matrix is currently being tested.

Zha, Ge-Cheng↗

Satellite Monitoring of Global Surface Soil Organic Carbon Dynamics Using the SMAP Level 4 Carbon Product

Soil organic carbon (SOC) is an important metric of soil health and the terrestrial carbon balance. Short‐term climate variations affect SOC through changes in temperature and moisture, which control vegetation growth and soil decomposition. We evaluated a satellite data‐driven carbon model, operating under the NASA Soil Moisture Active‐Passive (SMAP) mission, as a means of monitoring global surface SOC dynamics. The SMAP Level 4 Carbon (L4C) product estimates a daily global carbon budget including surface (0‐ to 5‐cm depth) SOC. We found that the L4C mean latitudinal SOC distribution is generally consistent with alternative assessments from static soil inventory records and dynamic global vegetation models (r ≥ 0.89). Within forest systems, based on inventory data, L4C SOC is most similar in magnitude to litterfall but is correlated with coarse woody debris ( urn:x-wiley:jgrg:media:jgrg21790:jgrg21790-math-0001) and total SOC ( urn:x-wiley:jgrg:media:jgrg21790:jgrg21790-math-0002). L4C SOC is sensitive to seasonal and annual climate variability, with mean residence times that range from 1.5 years in the wet tropics to 17 years in the cold tundra. Incorporating soil moisture retrievals from the SMAP L‐band (1.4 GHz) microwave radiometer within the L4C algorithm provides enhanced soil moisture sensitivity under low‐to‐moderate vegetation cover (<5 kg/sq.m vegetation water content). The L‐band soil moisture had the greatest impact on the L4C carbon budget in semiarid regions, which span almost 60% of the globe and account for substantial variability in the terrestrial carbon sink. The L4C operational product enables prognostic investigations into effects of recent climate trends and anomalies (e.g., droughts and pluvials) on shallow soil carbon dynamics.

K. Arthur Endsley↗

Bilinear dynamic mode decomposition for quantum control

Abstract Data-driven methods for establishing quantum optimal control (QOC) using time-dependent control pulses tailored to specific quantum dynamical systems and desired control objectives are critical for many emerging quantum technologies. We develop a data-driven regression procedure, bilinear dynamic mode decomposition (biDMD), that leverages time-series measurements to establish quantum system identification for QOC. The biDMD optimization framework is a physics-informed regression that makes use of the known underlying Hamiltonian structure. Further, the biDMD can be modified to model both fast and slow sampling of control signals, the latter by way of stroboscopic sampling strategies. The biDMD method provides a flexible, interpretable, and adaptive regression framework for real-time, online implementation in quantum systems. Further, the method has strong theoretical connections to Koopman theory, which approximates nonlinear dynamics with linear operators. In comparison with many machine learning paradigms minimal data is needed to construct a biDMD model, and the model is easily updated as new data is collected. We demonstrate the efficacy and performance of the approach on a number of representative quantum systems, showing that it also matches experimental results.

97 MATHEMATICS AND COMPUTING↗

General CMB and primordial trispectrum estimation

In this paper we present trispectrum estimation methods which can be applied to general nonseparable primordial and CMB trispectra. We review the relationship between the reduced CMB trispectrum and the reduced primordial trispectrum. We present a general optimal estimator for the connected part of the trispectrum, for which we derive a quadratic term to incorporate the effects of inhomogeneous noise and masking. We describe a general algorithm for creating simulated maps with given arbitrary (and independent) power spectra, bispectra, and trispectra. We propose a universal definition of the trispectrum parameter T{sub NL}, so that the integrated trispectrum on the observational domain can be consistently compared between theoretical models. We define a shape function for the primordial trispectrum, together with a shape correlator and a useful parametrization for visualizing the trispectrum; these methods might also be applied to the late-time trispectrum for large-scale structure. We derive separable analytic CMB solutions in the large-angle limit for constant and local models. We present separable mode decompositions which can be used to describe any primordial or CMB trispectra on their respective wave number or multipole domains. By extracting coefficients of these separable basis functions from an observational map, we are able to present an efficient estimator for any given theoretical model with a nonseparable trispectrum. The estimator has two manifestations, comparing the theoretical and observed coefficients at either primordial or late times, thus encompassing a wider range of models, such as secondary anisotropies, lensing, and cosmic strings. We show that these mode decomposition methods are numerically tractable with order l{sup 5} operations for the CMB estimator and approximately order l{sup 6} for the general primordial estimator (reducing to order l{sup 3} in both cases for a special class of models). We also demonstrate how the trispectrum can be reconstructed from observational maps using these methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Revenge of the Semicoarsening Frequency Decomposition Multigrid Method

The frequency decomposition multigrid method was previously considered and modified so as to obtain robustness for problems with discontinuous coefficients while retaining robustness for problems with anisotropic coefficients. The application of this modified method to a problem arising in global ocean modeling was also considered. For this problem it was shown that the discretization employed gives rise to an operator for which point relaxation is not robust. In fact, alternating line relaxation is required for robustness, negating the main advantage of the frequency decomposition method: robustness for anisotropic operators using only point relaxation. In this paper a semicoarsening variant, which requires line relaxation in one direction only is considered, and it is shown that this variant works well for the global ocean modeling problem.

Dendy, J. E., Jr.↗