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 145 records · Page 8

The Role of Tribology in the Development of an Oil-Free Turbocharger

Gas-turbine-based aeropropulsion engines are technologically mature. Thus, as with any mature technology, revolutionary approaches will be needed to achieve the significant performance gains that will keep the U.S. propulsion manufacturers well ahead of foreign competition. One such approach is the development of oil-free turbomachinery utilizing advanced foil air bearings, seals, and solid lubricants. By eliminating oil-lubricated bearings and seals and supporting an engine rotor on an air film, significant improvements can be realized. For example, the entire oil system including pipes, lines, filters, cooler, and tanks could be removed, thereby saving considerable weight. Since air has no thermal decomposition temperature, engine systems could operate without excessive cooling. Also, since air bearings have no diameter-rpm fatigue limits (D-N limits), engines could be designed to operate at much higher speeds and higher density, which would result in a smaller aeropropulsion package. Because of recent advances in compliant foil air bearings and high temperature solid lubricants, these technologies can be applied to oil-free turbomachinery. In an effort to develop these technologies and to demonstrate a project along the path to an oil-free gas turbine engine, NASA has undertaken the development of an oil-free turbocharger for a heavy duty diesel engine. This turbomachine can reach 120000 rpm at a bearing temperature of 540 C (1000 F) and, in comparison to oil-lubricated bearings, can increase efficiency by 10 to 15 percent because of reduced friction. In addition, because there are no oil lubricants, there are no seal-leakage-induced emissions.

Dellacorte, Christopher↗

Volumetric Acoustic Vector Intensity Probe

A new measurement tool capable of imaging the acoustic intensity vector throughout a large volume is discussed. This tool consists of an array of fifty microphones that form a spherical surface of radius 0.2m. A simultaneous measurement of the pressure field across all the microphones provides time-domain near-field holograms. Near-field acoustical holography is used to convert the measured pressure into a volumetric vector intensity field as a function of frequency on a grid of points ranging from the center of the spherical surface to a radius of 0.4m. The volumetric intensity is displayed on three-dimensional plots that are used to locate noise sources outside the volume. There is no restriction on the type of noise source that can be studied. The sphere is mobile and can be moved from location to location to hunt for unidentified noise sources. An experiment inside a Boeing 757 aircraft in flight successfully tested the ability of the array to locate low-noise-excited sources on the fuselage. Reference transducers located on suspected noise source locations can also be used to increase the ability of this device to separate and identify multiple noise sources at a given frequency by using the theory of partial field decomposition. The frequency range of operation is 0 to 1400Hz. This device is ideal for the study of noise sources in commercial and military transportation vehicles in air, on land and underwater.

Klos, Jacob↗

Parallel Adaptive Mesh Refinement Library

Parallel Adaptive Mesh Refinement Library (PARAMESH) is a package of Fortran 90 subroutines designed to provide a computer programmer with an easy route to extension of (1) a previously written serial code that uses a logically Cartesian structured mesh into (2) a parallel code with adaptive mesh refinement (AMR). Alternatively, in its simplest use, and with minimal effort, PARAMESH can operate as a domain-decomposition tool for users who want to parallelize their serial codes but who do not wish to utilize adaptivity. The package builds a hierarchy of sub-grids to cover the computational domain of a given application program, with spatial resolution varying to satisfy the demands of the application. The sub-grid blocks form the nodes of a tree data structure (a quad-tree in two or an oct-tree in three dimensions). Each grid block has a logically Cartesian mesh. The package supports one-, two- and three-dimensional models.

Mac-Neice, Peter↗

The Planning Execution Monitoring Architecture

The Planning Execution Monitoring (PEM) architecture is a design concept for developing autonomous cockpit command and control software. The PEM architecture is designed to reduce the operations costs in the space transportation system through the use of automation while improving safety and operability of the system. Specifically, the PEM autonomous framework enables automatic performance of many vehicle operations that would typically be performed by a human. Also, this framework supports varying levels of autonomous control, ranging from fully automatic to fully manual control. The PEM autonomous framework interfaces with the core flight software to perform flight procedures. It can either assist human operators in performing procedures or autonomously execute routine cockpit procedures based on the operational context. Most importantly, the PEM autonomous framework promotes and simplifies the capture, verification, and validation of the flight operations knowledge. Through a hierarchical decomposition of the domain knowledge, the vehicle command and control capabilities are divided into manageable functional "chunks" that can be captured and verified separately. These functional units, each of which has the responsibility to manage part of the vehicle command and control, are modular, re-usable, and extensible. Also, the functional units are self-contained and have the ability to plan and execute the necessary steps for accomplishing a task based upon the current mission state and available resources. The PEM architecture has potential for application outside the realm of spaceflight, including management of complex industrial processes, nuclear control, and control of complex vehicles such as submarines or unmanned air vehicles.

Wang, Lui↗

Hybrid sulfur cycle operation for high-temperature gas-cooled reactors

A hybrid sulfur (HyS) cycle process for the production of hydrogen is provided. The process uses a proton exchange membrane (PEM) SO.sub.2-depolarized electrolyzer (SDE) for the low-temperature, electrochemical reaction step and a bayonet reactor for the high-temperature decomposition step The process can be operated at lower temperature and pressure ranges while still providing an overall energy efficient cycle process.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Combustion engine system

A flow through catalytic reactor which selectively catalytically decomposes methanol into a soot free hydrogen rich product gas utilizing engine exhaust at temperatures of 200 to 650 C to provide the heat for vaporizing and decomposing the methanol is described. The reactor is combined with either a spark ignited or compression ignited internal combustion engine or a gas turbine to provide a combustion engine system. The system may be fueled entirely by the hydrogen rich gas produced in the methanol decomposition reactor or the system may be operated on mixed fuels for transient power gain and for cold start of the engine system. The reactor includes a decomposition zone formed by a plurality of elongated cylinders which contain a body of vapor permeable, methanol decomposition catalyst preferably a shift catalyst such as copper-zinc.

Houseman, John↗

Optimized Lie–Trotter–Suzuki decompositions for two and three non-commuting terms

Lie–Trotter–Suzuki decompositions are an efficient way to approximate operator exponentials exp ( t H ) when H is a sum of n (non-commuting) terms which, individually, can be exponentiated easily. They are employed in time-evolution algorithms for tensor network states, digital quantum simulation protocols, path integral methods like quantum Monte Carlo, and splitting methods for symplectic integrators in classical Hamiltonian systems. Here, we provide optimized decompositions up to order t 6 . The leading error term is expanded in nested commutators (Hall bases) and we minimize the 1-norm of the coefficients. For n = 2 terms, several of the optima we find are close to those in McLachlan (1995). Generally, our results substantially improve over unoptimized decompositions by Forest, Ruth, Yoshida, and Suzuki. We explain why these decompositions are sufficient to efficiently simulate any one- or two-dimensional lattice model with finite-range interactions. This follows by solving a partitioning problem for the interaction graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Decomposition Technique for Remaining Useful Life Prediction

The prognostic tool disclosed here decomposes the problem of estimating the remaining useful life (RUL) of a component or sub-system into two separate regression problems: the feature-to-damage mapping and the operational conditions-to-damage-rate mapping. These maps are initially generated in off-line mode. One or more regression algorithms are used to generate each of these maps from measurements (and features derived from these), operational conditions, and ground truth information. This decomposition technique allows for the explicit quantification and management of different sources of uncertainty present in the process. Next, the maps are used in an on-line mode where run-time data (sensor measurements and operational conditions) are used in conjunction with the maps generated in off-line mode to estimate both current damage state as well as future damage accumulation. Remaining life is computed by subtracting the instance when the extrapolated damage reaches the failure threshold from the instance when the prediction is made.

Saha, Bhaskar↗

Parametric dynamic mode decomposition for reduced order modeling

Dynamic Mode Decomposition (DMD) is a model-order reduction approach, whereby spatial modes of fixed temporal frequencies are extracted from numerical or experimental data sets. The DMD low-rank or reduced operator is typically obtained by singular value decomposition of the temporal data sets. For parameter-dependent models, as found in many multi-query applications such as uncertainty quantification or design optimization, the only parametric DMD technique developed was a stacked approach, with data sets at multiple parameter values were aggregated together, increasing the computational work needed to devise low-rank dynamical reduced-order models. Here in this paper, we present two novel approach to carry out parametric DMD: one based on the interpolation of the reduced-order DMD eigen-pair and the other based on the interpolation of the reduced DMD (Koopman) operator. Numerical results are presented for diffusion-dominated nonlinear dynamical problems, including a multiphysics radiative transfer example. All three parametric DMD approaches are compared.

97 MATHEMATICS AND COMPUTING↗

A 10,000 hour life multipropellant engine for Space Station applications

A review of the design background and operating objectives of a multipropellant resistojet is presented. An engine has been designed to operate with carbon dioxide, methane, water, hydrazine decomposition products and hydrogen. Design performance has been constrained to ensure a 10,000-hour life. The engine, constructed primarily of grain stabilized platinum, is to operate at temperatures up to 1400 C. General performance guidelines, design and fabrication methods are reported.

Pugmire, T. K.↗

Operations for Learning with Graphical Models

This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian net- works, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, and the manipulation of probability models from the exponential family. These operations adapt existing techniques from statistics and automatic differentiation to graphs. Two standard algorithm schemes for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximization algorithm. Some algorithms are developed in this graphical framework including a generalized version of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing some popular algorithms that fall within the framework presented. The main original contributions here are the decomposition techniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.

Buntine, Wray L.↗

A drift-kinetic analytical model for scrape-off layer plasma dynamics at arbitrary collisionality

We report a drift-kinetic model to describe the plasma dynamics in the scrape-off layer region of tokamak devices at arbitrary collisionality is derived. Our formulation is based on a gyroaveraged Lagrangian description of the charged particle motion, and the corresponding drift-kinetic Boltzmann equation that includes a full Coulomb collision operator. Using a Hermite–Laguerre velocity space decomposition of the gyroaveraged distribution function, a set of equations to evolve the coefficients of the expansion is presented. By evaluating explicitly the moments of the Coulomb collision operator, distribution functions arbitrarily far from equilibrium can be studied at arbitrary collisionalities. A fluid closure in the high-collisionality limit is presented, and the corresponding fluid equations are compared with previously derived fluid models.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Observables for scattering on targets with arbitrary spin

Starting from the Weinberg formalism for fields of arbitrary spin, we discuss a method for the decomposition of matrix elements of QCD operators (local currents, quark/gluon bilinears) for targets with arbitrary spin. This procedure is advantageous for the systematic study of the structure of hadrons and nuclei, particularly in the case of spin-dependent observables. As higher spin targets exhibit new features in their hadronic structure, the investigation of these properties can enhance our understanding of the strong force. The construction allows for a unified framework to discuss spin > 1/2 very similar to the spin 1/2 case, without subsidiary conditions for the wave functions. Different types of spinors (canonical, helicity, light-front helicity) can be easily accommodated. Its numerical implementation is simple and can be entirely reduced to objects familiar from the rotation group. A natural sl(2,C) multipole decomposition emerges, enabling a physical interpretation of non-perturbative objects that multiply spinor bilinears as Generalized Form Factors. To demonstrate the efficacy of this method, we apply it to the description of a spin 1 target, such as the deuteron. We discuss extensions of the formalism to hard exclusive processes on the deuteron and beyond.

Vera, Frank↗

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational reproducibility is well known in the parallel computing community. It is a requirement that the parallel code perform calculations in a fashion that will yield identical results on different configurations of processing elements on the same platform. In some cases this problem can be solved by sacrificing performance. Meeting this requirement and still achieving high performance is very difficult. Topics to be discussed include: current PSAS design and parallelization strategy; reproducibility issues; load balance vs. database memory demands, possible solutions to these problems.

Larson, J. W.↗

Feasibility Study on the Use of On-line Multivariate Statistical Process Control for Safeguards Applications in Natural Uranium Conversion Plants

The objective of this work was to determine the feasibility of using on-line multivariate statistical process control (MSPC) for safeguards applications in natural uranium conversion plants. Multivariate statistical process control is commonly used throughout industry for the detection of faults. For safeguards applications in uranium conversion plants, faults could include the diversion of intermediate products such as uranium dioxide, uranium tetrafluoride, and uranium hexafluoride. This study was limited to a 100 metric ton of uranium (MTU) per year natural uranium conversion plant (NUCP) using the wet solvent extraction method for the purification of uranium ore concentrate. A key component in the multivariate statistical methodology is the Principal Component Analysis (PCA) approach for the analysis of data, development of the base case model, and evaluation of future operations. The PCA approach was implemented through the use of singular value decomposition of the data matrix where the data matrix represents normal operation of the plant. Component mole balances were used to model each of the process units in the NUCP. However, this approach could be applied to any data set. The monitoring framework developed in this research could be used to determine whether or not a diversion of material has occurred at an NUCP as part of an International Atomic Energy Agency (IAEA) safeguards system. This approach can be used to identify the key monitoring locations, as well as locations where monitoring is unimportant. Detection limits at the key monitoring locations can also be established using this technique. Several faulty scenarios were developed to test the monitoring framework after the base case or normal operating conditions of the PCA model were established. In all of the scenarios, the monitoring framework was able to detect the fault. Overall this study was successful at meeting the stated objective.

Ladd-Lively, Jennifer L↗

Four-point correlators of light-ray operators in CCFT

We compute the four-point correlator of two gluon light-ray operators and two gluon primaries from the four-gluon celestial amplitude in (2, 2) signature spacetime. The correlator is non-distributional and allows us to verify that light-ray operators appear in the OPE of two gluon primaries. We also carry out a conformal block decomposition of the terms involving the exchange of gluon operators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗