Search NASA⌕ Search

SEARCH · Search NASA

Results for “domain of applicability”

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 271 records · Page 15

The achievement of spacecraft autonomy through the thematic application of multiple cooperating intelligent agents

A description is given of UNICORN, a prototype system developed for the purpose of investigating artificial intelligence (AI) concepts supporting spacecraft autonomy. UNICORN employs thematic reasoning, of the type first described by Rodger Schank of Northwestern University, to allow the context-sensitive control of multiple intelligent agents within a blackboard based environment. In its domain of application, UNICORN demonstrates the ability to reason teleologically with focused knowledge. Also presented are some of the lessons learned as a result of this effort. These lessons apply to any effort wherein system level autonomy is the objective.

Rossomando, Philip J.↗

Note on the eigensolution of a homogeneous equation with semi-infinite domain

The 'variation-iteration' method using Green's functions to find the eigenvalues and the corresponding eigenfunctions of a homogeneous Fredholm integral equation is employed for the stability analysis of fluid hydromechanics problems with a semiinfinite (infinite) domain of application. The objective of the study is to develop a suitable numerical approach to the solution of such equations in order to better understand the full set of equations for 'real-world' flow models. The study involves a search for a suitable value of the length of the domain which is a fair finite approximation to infinity, which makes the eigensolution an approximation dependent on the length of the interval chosen. In the examples investigated y = 1 = a seems to be the best approximation of infinity; for y greater than unity this method fails due to the polynomial nature of Green's functions.

Wadia, A. R.↗

An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

Lemke, Max↗

Time-domain finite elements in optimal control with application to launch-vehicle guidance

A time-domain finite element method is developed for optimal control problems. The theory derived is general enough to handle a large class of problems including optimal control problems that are continuous in the states and controls, problems with discontinuities in the states and/or system equations, problems with control inequality constraints, problems with state inequality constraints, or problems involving any combination of the above. The theory is developed in such a way that no numerical quadrature is necessary regardless of the degree of nonlinearity in the equations. Also, the same shape functions may be employed for every problem because all strong boundary conditions are transformed into natural or weak boundary conditions. In addition, the resulting nonlinear algebraic equations are very sparse. Use of sparse matrix solvers allows for the rapid and accurate solution of very difficult optimization problems. The formulation is applied to launch-vehicle trajectory optimization problems, and results show that real-time optimal guidance is realizable with this method. Finally, a general problem solving environment is created for solving a large class of optimal control problems. The algorithm uses both FORTRAN and a symbolic computation program to solve problems with a minimum of user interaction. The use of symbolic computation eliminates the need for user-written subroutines which greatly reduces the setup time for solving problems.

Bless, Robert R.↗

User Manual for Physical Scalars and Plotting Tools in Scala

An open-source scalar package and associated software tools have been developed in the Scala programming language, including plotting tools based on the free GRACE plotting package. The scalar package represents physical scalars and can help to prevent errors involving physical units in engineering and scientific computation. The scalar package includes a complete implementation of the standard SI metric system of units and many common non-metric units. The design also allows users to easily de ne a specialized or reduced set of physical units for any particular application or domain. The scalar package can be used in two different modes: one mode provides unit compatibility checking but is slower, and the other mode bypasses the compatibility checks but is much faster and still prevents the most common type of unit error. Switching between the two modes requires no changes in the user's code, making it convenient and usable with no significant performance penalty for even the most computationally intensive applications.

Paielli, Russell A.↗

Link Winds: A visual data analysis system and its application to the atmospheric ozone depletion problem

The Linked Windows Interactive Data System (LinkWinds) is a prototype visual data exploration system resulting from a NASA Jet Propulsion Laboratory (JPL) program of research into the application of graphical methods for rapidly accessing, displaying, and analyzing large multi variate multidisciplinary data sets. Running under UNIX it is an integrated multi-application executing environment using a data-linking paradigm to dynamically interconnect and control multiple windows containing a variety of displays and manipulators. This paradigm, resulting in a system similar to a graphical spreadsheet, is not only a powerful method for organizing large amounts of data for analysis, but leads to a highly intuitive, easy-to-learn user interface. It provides great flexibility in rapidly interacting with large masses of complex data to detect trends, correlations, and anomalies. The system, containing an expanding suite of non-domain-specific applications, provides for the ingestion of a variety of data base formats and hard -copy output of all displays. Remote networked workstations running LinkWinds may be interconnected, providing a multiuser science environment (MUSE) for collaborative data exploration by a distributed science team. The system is being developed in close collaboration with investigators in a variety of science disciplines using both archived and real-time data. It is currently being used to support the Microwave Limb Sounder (MLS) in orbit aboard the Upper Atmosphere Research Satellite (UARS). This paper describes the application of LinkWinds to this data to rapidly detect features, such as the ozone hole configuration, and to analyze correlations between chemical constituents of the atmosphere.

Jacobson, Allan S.↗

Model-Free Dynamic Voltage Control of Distributed Energy Resource (DER)-Based Microgrids

In this paper, we present a new control technique for sustaining dynamic voltage stability by effective reactive power control and coordination of distributed energy resources (DERs) in microgrids. The proposed control technique is based on model-free control (MFC), which has shown successful operation and improved performance in different domains and applications. This paper presents its first use in the voltage stability of a microgrid setting employing multiple synchronous generator (SG)-based and power electronic (PE)-based DERs. MFC is a computationally efficient, data-driven control technique that does not require modelling of the different components and disturbances in the power system. It is utilized as an online controller to achieve the dynamic voltage stability of a microgrid system under different disturbances and fault conditions. A 21-bus microgrid system fed by multiple DERs is considered as a case study and the overall dynamic voltage stability is investigated using time-domain dynamic simulations. Numerical results show that the proposed MFC provides improvements on the dynamic load bus voltage profiles and requires less computational time as compared to the traditional enhanced microgrid voltage stabilizer (EMGVS) scheme. Due to its simplicity and low computational requirement, MFC can be easily implemented in resource-constrained computing devices such as smart inverters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Application of GOTHIC to Groundwater Transport Analysis - 20152

Migration of pollutants and hazardous wastes, potentially containing radioactive isotopes, via groundwater transport is a concern at most waste cleanup sites. Predictive analysis can be used to evaluate mitigating actions intended to minimize impact on the environment and public exposure. GOTHIC is a multipurpose thermal hydraulics code that is used extensively in the nuclear industry for design, licensing and operation evaluations. It combines the capabilities of typical one-dimensional system codes and the essential features of Computational Fluid Dynamics (CFD) codes for three-dimensional analysis. There are other codes that are specifically developed for groundwater transport analysis and the results presented here are consistent with prior analyses. However, GOTHIC has some unique features that offer advantages for applications related to nuclear waste. Most importantly, it has been developed and maintained under a Quality Assurance program in compliance with the requirements of 10CFR50 Appendix B [2] and applicable portions of ASME NQA-1 [3] since 1995. Available GOTHIC capabilities that make the code especially useful for groundwater transport of nuclear materials include: - Tracking of any number of tracer elements for contaminants and other species of interest; - Radioactive decay and progeny of tracer elements; - Adsorption/desorption of tracer elements; - Tracking of any number of dissolved gases; - Release and absorption for dissolved gases; - Vapor phase tracking; - Non-Newtonian fluid modeling. The general porous body modeling approach makes GOTHIC well suited to groundwater transport analysis. The multi-region modeling approach used by GOTHIC simplifies model construction for regions of varying hydrologic characteristics and focuses the computational effort on regions of particular interest while simultaneously capturing the macroscopic response and any feedback effects across the larger domain. The applicability of GOTHIC to groundwater transport applications is demonstrated by comparing code results with available analytic or semi-analytic solutions for groundwater behavior. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗

Non-intrusive nonlinear model reduction via machine learning approximations to low-dimensional operators

Abstract Although projection-based reduced-order models (ROMs) for parameterized nonlinear dynamical systems have demonstrated exciting results across a range of applications, their broad adoption has been limited by their intrusivity: implementing such a reduced-order model typically requires significant modifications to the underlying simulation code. To address this, we propose a method that enables traditionally intrusive reduced-order models to be accurately approximated in a non-intrusive manner. Specifically, the approach approximates the low-dimensional operators associated with projection-based reduced-order models (ROMs) using modern machine-learning regression techniques. The only requirement of the simulation code is the ability to export the velocity given the state and parameters; this functionality is used to train the approximated low-dimensional operators. In addition to enabling nonintrusivity, we demonstrate that the approach also leads to very low computational complexity, achieving up to $$10^3{\times }$$ 10 3 × in run time. We demonstrate the effectiveness of the proposed technique on two types of PDEs. The domain of applications include both parabolic and hyperbolic PDEs, regardless of the dimension of full-order models (FOMs).

42 ENGINEERING↗

Control system design using frequency domain models and parameter optimization, with application to supersonic inlet controls

A technique is described for designing feedback control systems using frequency domain models, a quadratic cost function, and a parameter optimization computer program. FORTRAN listings for the computer program are included. The approach is applied to the design of shock position controllers for a supersonic inlet. Deterministic or random system disturbances, and the presence of random measurement noise are considered. The cost function minimization is formulated in the time domain, but the problem solution is obtained using a frequency domain system description. A scaled and constrained conjugate gradient algorithm is used for the minimization. The approach to a supersonic inlet included the calculations of the optimal proportional-plus integral (PI) and proportional-plus-integral-plus-derivative controllers. A single-loop PI controller was the most desirable of the designs considered.

Seidel, R. C.↗

Yang-Mills observables: from $\mathrm{KMOC}$ to eikonal through $\mathrm{EFT}$

We obtain a conservative Hamiltonian describing the interactions of two charged bodies in Yang-Mills through $\mathcal{O}$ (α 2 ) and to all orders in velocity. Our calculation extends a recently-introduced framework based on scattering amplitudes and effective field theory (EFT) to consider color-charged objects. These results are checked against the direct integration of the observables in the Kosower-Maybee-O’Connell (KMOC) formalism. At the order we consider we find that the linear and color impulses in a scattering event can be concisely described in terms of the eikonal phase, thus extending the domain of applicability of a formula originally proposed in the context of spinning particles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing with many challenging associated problems. Hex meshes vary from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges be adjacent to four hexes each. Edges failing this criteria are singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. Hex meshes with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. In conclusion, with this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.

97 MATHEMATICS AND COMPUTING↗

Solid face sheets enable lattice metamaterials to withstand high-amplitude impulsive loading without yielding

Owing to their ability to provide tunable mechanical responses, lattice materials are frequently studied to elucidate their response to static and dynamic loads. However, these roles are typically in opposition: static loads must be supported sufficiently far away from the onset of buckling or yielding, whereas dynamic loads are typically ameliorated by crushing of the lattice, which provides excellent energy-absorption due to the large plastic deformation accompanying densification. In contrast, this work considers the octet truss as an exemplar topology, in a structural role where it must simultaneously support static loads while enduring high-amplitude impulsive loads. This study focuses on the ability to withstand impulsive loads without yielding, an essential prerequisite to enduring dual loading. Computational studies using the ALE3D hydrocode were performed to examine the response of the octet truss under a short temporal width impulse shape associated with laser-driven shocks. A key finding was that covering the lattice with a solid face sheet and treating this face sheet thickness as a design variable allows the Taylor-like pulse to be attenuated prior to entering the weaker lattice, at the cost of added mass up front. Experimental validation was accomplished by laser-driven shock testing, using octet trusses printed out of Ti-5Al-5V-5Mo-3Cr. The results show that for a given quantity of mass, the attenuation is maximized when as much mass as possible is moved into the face sheet, leaving a more slender lattice structure. The effect of placing mass in the face sheet rather than lattice beams dominates the effect of relative density, to the point where a low-mass structure with most of the mass concentrated in the face sheet can outperform a high-mass structure with most of the mass in the lattice. Finally, by further understanding the propagation of short pulse width waves within under-dense structures, this study expand the domain of applicability of such structures, including lattice materials, to challenging dual-loading regimes spanning decades of strain rates.

36 MATERIALS SCIENCE↗

Navigating Transition-Metal Chemical Space: Artificial Intelligence for First-Principles Design

Conspectus The variability of chemical bonding in open-shell transition-metal complexes not only motivates their study as functional materials and catalysts but also challenges conventional computational modeling tools. Here, tailoring ligand chemistry can alter preferred spin or oxidation states as well as electronic structure properties and reactivity, creating vast regions of chemical space to explore when designing new materials atom by atom. Although first-principles density functional theory (DFT) remains the workhorse of computational chemistry in mechanism deduction and property prediction, it is of limited use here. DFT is both far too computationally costly for widespread exploration of transition-metal chemical space and also prone to inaccuracies that limit its predictive performance for localized d electrons in transition-metal complexes. These challenges starkly contrast with the well-trodden regions of small-organic-molecule chemical space, where the analytical forms of molecular mechanics force fields and semiempirical theories have for decades accelerated the discovery of new molecules, accurate DFT functional performance has been demonstrated, and gold-standard methods from correlated wavefunction theory can predict experimental results to chemical accuracy. The combined promise of transition-metal chemical space exploration and lack of established tools has mandated a distinct approach. In this Account, we outline the path we charted in exploration of transition-metal chemical space starting from the first machine learning (ML) models (i.e., artificial neural network and kernel ridge regression) and representations for the prediction of open-shell transition-metal complex properties. The distinct importance of the immediate coordination environment of the metal center as well as the lack of low-level methods to accurately predict structural properties in this coordination environment first motivated and then benefited from these ML models and representations. Once developed, the recipe for prediction of geometric, spin state, and redox potential properties was straightforwardly extended to a diverse range of other properties, including in catalysis, computational “feasibility”, and the gas separation properties of periodic metal–organic frameworks. Interpretation of selected features most important for model prediction revealed new ways to encapsulate design rules and confirmed that models were robustly mapping essential structure–property relationships. Encountering the special challenge of ensuring that good model performance could generalize to new discovery targets motivated investigation of how to best carry out model uncertainty quantification. Distance-based approaches, whether in model latent space or in carefully engineered feature space, provided intuitive measures of the domain of applicability. With all of these pieces together, ML can be harnessed as an engine to tackle the large-scale exploration of transition-metal chemical space needed to satisfy multiple objectives using efficient global optimization methods. In practical terms, bringing these artificial intelligence tools to bear on the problems of transition-metal chemical space exploration has resulted in ML-model assessments of large, multimillion compound spaces in minutes and validated new design leads in weeks instead of decades.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Predicting Small Molecule Transfer Free Energies by Combining Molecular Dynamics Simulations and Deep Learning

Accurately predicting small molecule partitioning and hydrophobicity is critical in the drug discovery process. There are many heterogeneous chemical environments within a cell and entire human body. For example, drugs must be able to cross the hydrophobic cellular membrane to reach their intracellular targets, and hydrophobicity is an important driving force for drug–protein binding. Atomistic molecular dynamics (MD) simulations are routinely used to calculate free energies of small molecules binding to proteins, crossing lipid membranes, and solvation but are computationally expensive. Machine learning (ML) and empirical methods are also used throughout drug discovery but rely on experimental data, limiting the domain of applicability. We present atomistic MD simulations calculating 15,000 small molecule free energies of transfer from water to cyclohexane. This large data set is used to train ML models that predict the free energies of transfer. We show that a spatial graph neural network model achieves the highest accuracy, followed closely by a 3D-convolutional neural network, and shallow learning based on the chemical fingerprint is significantly less accurate. A mean absolute error of ~4 kJ/mol compared to the MD calculations was achieved for our best ML model. We also show that including data from the MD simulation improves the predictions, tests the transferability of each model to a diverse set of molecules, and show multitask learning improves the predictions. This work provides insight into the hydrophobicity of small molecules and ML cheminformatics modeling, and our data set will be useful for designing and testing future ML cheminformatics methods.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Graph-Based Approaches for Predicting Solvation Energy in Multiple Solvents: Open Datasets and Machine Learning Models

The solvation properties of molecules, often estimated using quantum chemical simulations, are important in the synthesis of energy storage materials, drugs, and industrial chemicals. Here, we develop machine learning models of solvation energies to replace expensive quantum chemistry calculations with inexpensive-to-compute message-passing neural network models that require only the molecular graph as inputs. Our models are trained on a new database of solvation energies for 130,258 molecules taken from the QM9 dataset computed in five solvents (acetone, ethanol, acetonitrile, dimethyl sulfoxide, and water) via an implicit solvent model. Our best model achieves a mean absolute error of 0.5 kcal/mol for molecules with nine or fewer non-hydrogen atoms and 1 kcal/mol for molecules with between 10 and 14 non-hydrogen atoms. We make the entire dataset of 651,290 computed entries openly available and provide simple web and programmatic interfaces to enable others to run our solvation energy model on new molecules. This model calculates the solvation energies for molecules using only the SMILES string and also provides an estimate of whether each molecule is within the domain of applicability of our model. We envision that the dataset and models will provide the functionality needed for the rapid screening of large chemical spaces to discover improved molecules for many applications.

25 ENERGY STORAGE↗