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 289 records · Page 16

Rendezvous algorithms for large-scale modeling and simulation

Rendezvous algorithms encode a communication pattern that is useful when processors sending data do not know who the receiving processors should be, or vice versa. The idea is to define an intermediate decomposition where datums from different sending processors can ”rendezvous” to perform a computation, in a manner that both the senders and eventual receivers of the results can identify the appropriate rendezvous processor. Though they were originally designed for interpolating between overlaid grids with independent parallel decompositions (Plimpton et al., 2004), we have recently found rendezvous algorithms useful for a variety of operations in particle- or grid-based simulation codes when running large problems on large numbers of processors. In particular, we show they can perform well when a load-balanced intermediate decomposition is randomized and not spatial, requiring all-to-all communication to move data between processors. In this case rendezvous algorithms leverage the large bisection communication bandwidths which parallel machines provide. We describe how rendezvous algorithms work in a scientific computing context and give specific examples for molecular dynamics and Direct Simulation Monte Carlo codes which result in dramatic performance improvements versus simpler algorithms which do not scale as well. We explain how a generic rendezvous algorithm can be implemented, and also point out similarities with the MapReduce paradigm popularized by Google and Hadoop.

97 MATHEMATICS AND COMPUTING↗

Using Apex To Construct CPM-GOMS Models

process for automatically generating computational models of human/computer interactions as well as graphical and textual representations of the models has been built on the conceptual foundation of a method known in the art as CPM-GOMS. This method is so named because it combines (1) the task decomposition of analysis according to an underlying method known in the art as the goals, operators, methods, and selection (GOMS) method with (2) a model of human resource usage at the level of cognitive, perceptual, and motor (CPM) operations. CPM-GOMS models have made accurate predictions about behaviors of skilled computer users in routine tasks, but heretofore, such models have been generated in a tedious, error-prone manual process. In the present process, CPM-GOMS models are generated automatically from a hierarchical task decomposition expressed by use of a computer program, known as Apex, designed previously to be used to model human behavior in complex, dynamic tasks. An inherent capability of Apex for scheduling of resources automates the difficult task of interleaving the cognitive, perceptual, and motor resources that underlie common task operators (e.g., move and click mouse). The user interface of Apex automatically generates Program Evaluation Review Technique (PERT) charts, which enable modelers to visualize the complex parallel behavior represented by a model. Because interleaving and the generation of displays to aid visualization are automated, it is now feasible to construct arbitrarily long sequences of behaviors. The process was tested by using Apex to create a CPM-GOMS model of a relatively simple human/computer-interaction task and comparing the time predictions of the model and measurements of the times taken by human users in performing the various steps of the task. The task was to withdraw $80 in cash from an automated teller machine (ATM). For the test, a Visual Basic mockup of an ATM was created, with a provision for input from (and measurement of the performance of) the user via a mouse. The times predicted by the automatically generated model turned out to approximate the measured times fairly well (see figure). While these results are promising, there is need for further development of the process. Moreover, it will also be necessary to test other, more complex models: The actions required of the user in the ATM task are too sequential to involve substantial parallelism and interleaving and, hence, do not serve as an adequate test of the unique strength of CPM-GOMS models to accommodate parallelism and interleaving.

John, Bonnie↗

Automating CPM-GOMS

CPM-GOMS is a modeling method that combines the task decomposition of a GOMS analysis with a model of human resource usage at the level of cognitive, perceptual, and motor operations. CPM-GOMS models have made accurate predictions about skilled user behavior in routine tasks, but developing such models is tedious and error-prone. We describe a process for automatically generating CPM-GOMS models from a hierarchical task decomposition expressed in a cognitive modeling tool called Apex. Resource scheduling in Apex automates the difficult task of interleaving the cognitive, perceptual, and motor resources underlying common task operators (e.g. mouse move-and-click). Apex's UI automatically generates PERT charts, which allow modelers to visualize a model's complex parallel behavior. Because interleaving and visualization is now automated, it is feasible to construct arbitrarily long sequences of behavior. To demonstrate the process, we present a model of automated teller interactions in Apex and discuss implications for user modeling. available to model human users, the Goals, Operators, Methods, and Selection (GOMS) method [6, 21] has been the most widely used, providing accurate, often zero-parameter, predictions of the routine performance of skilled users in a wide range of procedural tasks [6, 13, 15, 27, 28]. GOMS is meant to model routine behavior. The user is assumed to have methods that apply sequences of operators and to achieve a goal. Selection rules are applied when there is more than one method to achieve a goal. Many routine tasks lend themselves well to such decomposition. Decomposition produces a representation of the task as a set of nested goal states that include an initial state and a final state. The iterative decomposition into goals and nested subgoals can terminate in primitives of any desired granularity, the choice of level of detail dependent on the predictions required. Although GOMS has proven useful in HCI, tools to support the construction of GOMS models have not yet come into general use.

GOMS↗

Long-life LiNi 0.5 Mn 1.5 O 4 /graphite lithium-ion cells with an artificial graphite-electrolyte interface

The high operating voltage of a spinel LiNi 0.5 Mn 1.5 O 4 (LNMO) cathode leads to electrolyte decomposition and accelerated deterioration of the electrode/electrolyte interface in lithium-ion cells. Aggressive side reactions prevent long-term cycling and hinder its practical application. Advanced characterization shows that the high-voltage operation makes the graphite anode react with the electrolyte, particularly with the lithium salt in the electrolyte, resulting in massive active lithium inventory loss and capacity fade. The side reactions at the graphite are identified as the main culprit for the LNMO/graphite full cell decay. Here, we demonstrate that an artificial solid-electrolyte interface layer consisting of an ultra-thin Al 2 O 3 film, generated via atomic layer deposition (ALD) at the graphite surface, can successfully isolate the graphite from the electrolyte and inhibit the undesired reactions. Consequently, the capacity and cycling stability of the LNMO/graphite cell are drastically improved. After 300 cycles, the capacity retention of LNMO/graphite cell increases from 57.7% to 98.6% with the ALD-coated graphite. Furthermore, our findings provide valuable insights into the LNMO/graphite cell degradation and suggest a simple and robust, yet highly effective, approach for the practical viability of high-voltage lithium-ion batteries.

25 ENERGY STORAGE↗

Applying Model Based Systems Engineering to NASA's Space Communications Networks

System engineering practices for complex systems and networks now require that requirement, architecture, and concept of operations product development teams, simultaneously harmonize their activities to provide timely, useful and cost-effective products. When dealing with complex systems of systems, traditional systems engineering methodology quickly falls short of achieving project objectives. This approach is encumbered by the use of a number of disparate hardware and software tools, spreadsheets and documents to grasp the concept of the network design and operation. In case of NASA's space communication networks, since the networks are geographically distributed, and so are its subject matter experts, the team is challenged to create a common language and tools to produce its products. Using Model Based Systems Engineering methods and tools allows for a unified representation of the system in a model that enables a highly related level of detail. To date, Program System Engineering (PSE) team has been able to model each network from their top-level operational activities and system functions down to the atomic level through relational modeling decomposition. These models allow for a better understanding of the relationships between NASA's stakeholders, internal organizations, and impacts to all related entities due to integration and sustainment of existing systems. Understanding the existing systems is essential to accurate and detailed study of integration options being considered. In this paper, we identify the challenges the PSE team faced in its quest to unify complex legacy space communications networks and their operational processes. We describe the initial approaches undertaken and the evolution toward model based system engineering applied to produce Space Communication and Navigation (SCaN) PSE products. We will demonstrate the practice of Model Based System Engineering applied to integrating space communication networks and the summary of its results and impact. We will highlight the insights gained by applying the Model Based System Engineering and provide recommendations for its applications and improvements.

Bhasin, Kul↗

Interface Coating Design for Dynamic Voltage Stability of Solid‐State Batteries

Abstract Intrinsic or interface thermodynamic voltage windows of solid electrolytes are often narrower than the operational voltage range needed by a full battery, thus various interface decomposition reactions can happen in a practical solid‐state battery. Experimentally, it is found that a proper battery design utilizing the reactions can lead to a dynamic evolution from interface instability to stability, giving the so‐called dynamic voltage stability for advanced battery performance. Here, first the state‐of‐the‐art understanding is articulated about how the dynamic voltage stability should be interpreted in physical picture and treated in computation, emphasizing the potential importance of nonequilibrium reaction pathways. The constrained ensemble computational approach is further applied across most types of solid‐state electrolytes to systematically evaluate and compare their dynamic stability voltage windows in response to the mechanical constriction effect. High‐throughput calculations are used to search for coating materials for different interfaces between sulfide, halide, and oxide electrolytes and typical cathode materials with enhanced dynamic voltage stability. A comparison with experiment is given to highlight the value of these computational predictions.

Wang, Yichao↗

Is the Trotterized UCCSD Ansatz Chemically Well-Defined?

The variational quantum eigensolver (VQE) has emerged as one of the most enticing near-term quantum algorithms that can be used to simulate many-body systems such as molecular electronic structures. Serving as an attractive ansatz in the VQE algorithm, unitary coupled cluster (UCC) theory has seen a renewed interest in recent literature. Yet, unlike the original classical UCC theory, implementation on a quantum computer requires a finite-order Suzuki-Trotter decomposition to separate the exponentials of the large sum of Pauli operators. While previous literature has recognized the non-uniqueness of different orderings of the operators in the Trotterized form of UCC methods, the question of whether or not different orderings matter at the chemical scale has not been addressed. In this letter, we explore the effect of operator ordering on the Trotterized UCCSD ansatz, as well as the much more compact k-UpCCGSD ansatz recently proposed by Lee et al. We observe a significant, system-dependent variation in the energies of Trotterizations with different operator orderings. The energy variations occur on a chemical scale, sometimes on the order of hundreds of kcal/mol. This letter establishes the need to define not only the operators present in the ansatz, but also the order in which they appear. This is necessary for adhering to the quantum chemical notion of a ``model chemistry'', in addition to the general importance of scientific reproducibility. As a final note, we suggest a useful strategy to select out of the combinatorial number of possibilities, a single well-defined and effective ordering of the operators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Understanding Direct-Ammonia Protonic Ceramic Fuel Cells: High-Performance in the Absence of Precious Metal Catalysts

Ammonia has received considerable attention as a promising carbon-free hydrogen carrier. At temperatures above 400 °C, NH 3 is thermodynamically unstable with respect to decomposition into nitrogen and hydrogen and is, thus, suitable for direct use in solid oxide fuel cells (SOFCs) without external reforming. However, poor catalytic activity for ammonia decomposition at the moderate temperatures of protonic ceramic fuel cell (PCFC) operation has resulted in low fuel cell power output relative to operation on hydrogen and likely contributes to reported cell degradation. Here we prepared cells based on a thermodynamically robust electrolyte, a high activity cathode, and an anode with a distinctive structure to overcome challenges of poor activity and stability. Furthermore, the cells delivered peak power densities of 0.59 and 0.44 W cm –2 under H 2 and NH 3 , respectively, at 500 °C, excellent stability over a period of 200 h, and no detectable NO x in the anode exhaust gas.

25 ENERGY STORAGE↗

Improving the efficiency of hierarchical equations of motion approach and application to coherent dynamics in Aharonov–Bohm interferometers

Several recent advancements for the hierarchical equations of motion (HEOM) approach are reported. First, we propose an a priori estimate for the optimal number of basis functions for the reservoir memory decomposition. Second, we make use of the sparsity of auxiliary density operators (ADOs) and propose two ansatzs to screen out all the intrinsic zero ADO elements. Third, we propose a new truncation scheme by utilizing the time derivatives of higher-tier ADOs. These novel techniques greatly reduce the memory cost of the HEOM approach, and thus enhance its efficiency and applicability. The improved HEOM approach is applied to simulate the coherent dynamics of Aharonov–Bohm double quantum dot interferometers. Quantitatively accurate dynamics is obtained for both noninteracting and interacting quantum dots. The crucial role of the quantum phase for the magnitude of quantum coherence and quantum entanglement is revealed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Linearly supporting feature extraction for automated estimation of stellar atmospheric parameters

We describe a scheme to extract linearly supporting (LSU) features from stellar spectra to automatically estimate the atmospheric parameters T{sub eff}, log g, and [Fe/H]. “Linearly supporting” means that the atmospheric parameters can be accurately estimated from the extracted features through a linear model. The successive steps of the process are as follow: first, decompose the spectrum using a wavelet packet (WP) and represent it by the derived decomposition coefficients; second, detect representative spectral features from the decomposition coefficients using the proposed method Least Absolute Shrinkage and Selection Operator (LARS){sub bs}; third, estimate the atmospheric parameters T{sub eff}, log g, and [Fe/H] from the detected features using a linear regression method. One prominent characteristic of this scheme is its ability to evaluate quantitatively the contribution of each detected feature to the atmospheric parameter estimate and also to trace back the physical significance of that feature. This work also shows that the usefulness of a component depends on both the wavelength and frequency. The proposed scheme has been evaluated on both real spectra from the Sloan Digital Sky Survey (SDSS)/SEGUE and synthetic spectra calculated from Kurucz's NEWODF models. On real spectra, we extracted 23 features to estimate T{sub eff}, 62 features for log g, and 68 features for [Fe/H]. Test consistencies between our estimates and those provided by the Spectroscopic Parameter Pipeline of SDSS show that the mean absolute errors (MAEs) are 0.0062 dex for log T{sub eff} (83 K for T{sub eff}), 0.2345 dex for log g, and 0.1564 dex for [Fe/H]. For the synthetic spectra, the MAE test accuracies are 0.0022 dex for log T{sub eff} (32 K for T{sub eff}), 0.0337 dex for log g, and 0.0268 dex for [Fe/H].

79 ASTRONOMY AND ASTROPHYSICS↗

Exact representations of many-body interactions with restricted-Boltzmann-machine neural networks

Restricted Boltzmann machines (RBMs) are simple statistical models defined on a bipartite graph which have been successfully used in studying more complicated many-body systems, both classical and quantum. In this work, we exploit the representation power of RBMs to provide an exact decomposition of many-body contact interactions into one-body operators coupled to discrete auxiliary fields. This construction generalizes the well known Hirsch's transform used for the Hubbard model to more complicated theories such as pionless effective field theory in nuclear physics, which we analyze in detail. Finally, we also discuss possible applications of our mapping for quantum annealing applications and conclude with some implications for RBM parameter optimization through machine learning.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Improvements in sparse matrix operations of NASTRAN

A "nontransmit" packing routine was added to NASTRAN to allow matrix data to be refered to directly from the input/output buffer. Use of the packing routine permits various routines for matrix handling to perform a direct reference to the input/output buffer if data addresses have once been received. The packing routine offers a buffer by buffer backspace feature for efficient backspacing in sequential access. Unlike a conventional backspacing that needs twice back record for a single read of one record (one column), this feature omits overlapping of READ operation and back record. It eliminates the necessity of writing, in decomposition of a symmetric matrix, of a portion of the matrix to its upper triangular matrix from the last to the first columns of the symmetric matrix, thus saving time for generating the upper triangular matrix. Only a lower triangular matrix must be written onto the secondary storage device, bringing 10 to 30% reduction in use of the disk space of the storage device.

Harano, S.↗

Effect of motor dynamics on nonlinear feedback robot arm control

A nonlinear feedback robot controller that incorporates the robot manipulator dynamics and the robot joint motor dynamics is proposed. The manipulator dynamics and the motor dynamics are coupled to obtain a third-order-dynamic model, and differential geometric control theory is applied to produce a linearized and decoupled robot controller. The derived robot controller operates in the robot task space, thus eliminating the need for decomposition of motion commands into robot joint space commands. Computer simulations are performed to verify the feasibility of the proposed robot controller. The controller is further experimentally evaluated on the PUMA 560 robot arm. The experiments show that the proposed controller produces good trajectory tracking performances and is robust in the presence of model inaccuracies. Compared with a nonlinear feedback robot controller based on the manipulator dynamics only, the proposed robot controller yields conspicuously improved performance.

Tarn, Tzyh-Jong↗

Iterative procedure for in-situ EUV optical testing with an incoherent source

We propose an iterative method for in-situ optical testing under partially coherent illumination that relies on the rapid computation of aerial images. In this method a known pattern is imaged with the test optic at several planes through focus. A model is created that iterates through possible aberration maps until the through-focus series of aerial images matches the experimental result. The computation time of calculating the through-focus series is significantly reduced by a-SOCS, an adapted form of the Sum Of Coherent Systems (SOCS) decomposition. In this method, the Hopkins formulation is described by an operator S which maps the space of pupil aberrations to the space of aerial images. This operator is well approximated by a truncated sum of its spectral components.

36 MATERIALS SCIENCE↗

Relativistic theory of nuclear magnetic resonance parameters in a Gaussian basis representation

The calculation of NMR parameters from relativistic quantum theory in a Gaussian basis expansion requires some care. While in the absence of a magnetic field the expansion in a kinetically balanced basis converges for the wave function in the mean and for the energy with any desired accuracy, this is not necessarily the case for magnetic properties. The results for the magnetizability or the nuclear magnetic shielding are not even correct in the nonrelativistic limit (nrl) if one expands the original Dirac equation in a kinetically balanced Gaussian basis. This defect disappears if one starts from the unitary transformed Dirac equation as suggested by Kutzelnigg [Phys. Rev. A 67, 032109 (2003)]. However, a new difficulty can arise instead if one applies the transformation in the presence of the magnetic field of a point nucleus. If one decomposes certain contributions, the individual terms may diverge, although their sum is regular. A controlled cancellation may become difficult and numerical instabilities can arise. Various ways exist to avoid these singularities and at the same time get the correct nrl. There are essentially three approaches intermediate between the transformed and the untransformed formulation, namely, the bispinor decomposition, the decomposition of the lower component, and the hybrid unitary transformation partially at operator and partially at matrix level. All three possibilities were first considered by Xiao et al. [J. Chem. Phys. 126, 214101 (2007)] in a different context and in a different nomenclature. Their analysis and classification in a more general context are given here for the first time. Use of an extended balanced basis has no advantages and has other drawbacks and is not competitive, while the use of a restricted magnetic balance basis can be justified.

36 MATERIALS SCIENCE↗

Next Generation Aircraft Design Considering Airline Operations and Economics

Traditional approaches to design and optimization of a new system often use a system-centric objective and do not take into consideration how the operator will use this new system alongside other existing systems. When the new system design is incorporated into the broader group of systems, the performance of the operator-level objective can be sub-optimal due to the unmodeled interaction between the new system and the other systems. Among the few available references that describe attempts to address this disconnect, most follow an MDO (Multidisciplinary Design Optimization)-motivated sequential decomposition approach of first designing a very good system and then providing this system to the operator who, decides the best way to use this new system along with the existing systems. This paper addresses this issue by including aircraft design, airline operations, and revenue management "subspaces"; and presents an approach that could simultaneously solve these subspaces posed as a monolithic optimization problem rather than the traditional approach described above. The monolithic approach makes the problem an expensive Mixed Integer Non-Linear Programming problem, which are extremely difficult to solve. To address the problem, we use a recently developed optimization framework that simultaneously solves the subspaces to capture the "synergy" in the problem that the previous decomposition approaches did not exploit, addresses mixed-integer/discrete type design variables in an efficient manner, and accounts for computationally expensive analysis tools. This approach solves an 11-route airline network problem consisting of 94 decision variables including 33 integer and 61 continuous type variables. Simultaneously solving the subspaces leads to significant improvement in the fleet-level objective of the airline when compared to the previously developed sequential subspace decomposition approach.

Roy, Satadru↗

Data-driven linear time advance operators for the acceleration of plasma physics simulation

In this study, we demonstrate the application of data-driven linear operator construction for time advance with a goal of accelerating plasma physics simulation. We apply dynamic mode decomposition (DMD) to data produced by the nonlinear SOLPS-ITER (Scrape-off Layer Plasma Simulator - International Thermonuclear Experimental Reactor) plasma boundary code suite in order to estimate a series of linear operators and monitor their predictive accuracy via online error analysis. We find that this approach defines when these dynamics can be represented by a sequence of approximate linear operators and is essential for providing consistent projections when compared to an unconstrained application. For linear diffusion and advection–diffusion fluid test problems, we construct and apply operators within explicit and implicit time advance schemes, demonstrating that stability can be robustly guaranteed in each case. We further investigate the use of the linear time advance operators within several integration methods including forward Euler, backward Euler, and the matrix exponential. The application of this method to simulation data from SOLPS-ITER, with varying levels of Markov chain Monte Carlo numerical noise, shows that constrained DMD operators yield a capability to identify, extract, and integrate a (slow) subset of the present timescales. Example applications show that for projected speedup factors of [Formula: see text], and [Formula: see text], a mean relative error of 3%, 5%, and 8% and maximum relative error less than 20% are achievable, which appears acceptable for typical SOLPS-ITER steady-state simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Automatic computer procedure for generating exact and analytical kinetic energy operators based on the polyspherical approach: General formulation and removal of singularities

We present new techniques for an automatic computation of the kinetic energy operator in analytical form. These techniques are based on the use of the polyspherical approach and are extended to take into account Cartesian coordinates as well. An automatic procedure is developed where analytical expressions are obtained by symbolic calculations. This procedure is a full generalization of the one presented in Ndong et al., [J. Chem. Phys. 136, 034107 (2012)]. The correctness of the new implementation is analyzed by comparison with results obtained from the TNUM program. We give several illustrations that could be useful for users of the code. In particular, we discuss some cyclic compounds which are important in photochemistry. Among others, we show that choosing a well-adapted parameterization and decomposition into subsystems can allow one to avoid singularities in the kinetic energy operator. We also discuss a relation between polyspherical and Z-matrix coordinates: this comparison could be helpful for building an interface between the new code and a quantum chemistry package.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗