Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graph properties”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Synthesis of motif and symmetry for accelerated learning, discovery, and design of electronic structures for energy conversion applications (Final Technical Report)

The overall goal of the projects is to develop a framework to incorporate structure motifs and crystal/orbital symmetries into the data-driven materials discovery infrastructure. The PI proposed to develop structure-motif- and symmetry-based graph convolutional networks for effective learning and efficient predictions of electronic structures and related properties. Fundamental understanding of the roles of structure motif and symmetry will establish new hypothesis and design rules, which will be combined with high-throughput computations based on density functional theory to discover novel light absorbers, transparent conductors, as well as 2D light emitting materials and heterojunctions for optoelectronics.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Uncovering Structure–Conductivity Relationships in Anion Exchange Membranes (AEMs) Using Interpretable Machine Learning

Anion exchange membranes (AEMs) play a vital role in the performance of water electrolyzers and fuel cells, yet their discovery and optimization remain challenging due to the complexity of structure–property relationships. In this study, we introduce a machine learning framework that leverages conditional graph neural networks (cGNNs) and descriptor-based models and a hybrid graph neural network (HGARE) to predict and interpret ionic conductivity. The descriptor-based pipeline employs principal component analysis (PCA), ablation, and SHAP analysis to identify factors governing anion conductivity, revealing electronic, topological, and compositional descriptors as key contributors. Beyond prediction, dimensionality reduction and clustering are performed by employing t-SNE and KMeans as well as SOM, which reveal distinct membranes clusters, some of which were enriched with high anion conductivity. Among graph-based approaches, the graph convolutional (GCN) achieved strong predictive performance, while the Hybrid Graph Autoencoder-Regressor Ensemble (HGARE) achieved the highest accuracy. Additionally, atom-level saliency maps from GCN provide spatial explanations for conductive behavior, revealing the importance of polarizable and flexible regions. This work contributes to the accelerated and data-driven design of high-performance AEMs.

Naghshnejad, Pegah [Department of Chemical Enginee↗
NASA NTRS1989

Mechanics of unsymmetric laminates

Theoretical models describing the mechanical behavior of fiber-reinforced composite laminates are developed analytically and demonstrated. The curing of composite structures and the out-of-plane shapes of unsymmetric laminates are discussed and illustrated with photographs; the derivation of the governing equations is outlined; numerical results for typical laminates are presented in graphs; and particular attention is given to stability considerations and the effects of material properties, laminate thickness, aspect ratio, and stacking sequence.

Hyer, M. W.↗
NASA NTRS2003

MISR Multi-Angle Imaging SpectroRadiometer

This viewgraph presentation reviews the concept of the Multi-Angle Imaging SpectroRadiometer (MISR), a methodology to use the MISR to retrieve aerosols over water and land. The presentation shows some of the results of the use of the MISR in graphs and charts. Multi-angle remote sensing provides unique ways of retrieving aerosol properties over many surface types, including bright deserts which are major source regions.

global maps↗
DOE OSTI2024

A Performance and Energy Study of GPU-Resident Preconditioners for Conjugate Gradient Solvers: In the Context of Existing and Novel Approaches

Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.

Preconditioned Conjugate Gradient, GPUs, iterative↗
DOE OSTI2024

Graph characterization of higher-order structure in atmospheric chemical reaction mechanisms

Atmospheric chemical reactions play an important role in air quality and climate change. While the structure and dynamics of individual chemical reactions are fairly well understood, the emergent properties of the entire atmospheric chemical system, which can involve many different species that participate in many different reactions, are not well described. In this work, we leverage graph-theoretic techniques to characterize patterns of interaction (“motifs”) in three different representations of gas-phase atmospheric chemistry, termed “chemical mechanisms.” These widely used mechanisms, the master chemical mechanism, the GEOS-Chem mechanism, and the Super-Fast mechanism, vary dramatically in scale and application, but they all generally aim to simulate the abundance and variability of chemical species in the atmosphere. This motif analysis quantifies the fundamental patterns of interaction within the mechanisms, which are directly related to their construction. For example, the gas-phase chemistry in the very small Super-Fast mechanism is entirely composed of bimolecular reactions, and its motif distribution matches that of an individual bimolecular reaction well. The larger and more complex mechanisms show emergent motif distributions that differ strongly from any specific reaction type, consistent with their complexity. The proposed motif analysis demonstrates that while these mechanisms all have a similar design goal, their higher-order structure of interactions differs strongly and thus provides a novel set of tools for exploring differences across chemical mechanisms.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization

In topological data analysis and visualization, topological descriptors such as persistence diagrams, merge trees, contour trees, Reeb graphs, and Morse–Smale complexes play an essential role in capturing the shape of scalar field data. Herein we present a state–of–the–art report on scalar field comparison using topological descriptors. We provide a taxonomy of existing approaches based on visualization tasks associated with three categories of data: single fields, time–varying fields, and ensembles. These tasks include symmetry detection, periodicity detection, key event/feature detection, feature tracking, clustering, and structure statistics. Our main contributions include the formulation of a set of desirable mathematical and computational properties of comparative measures, and the classification of visualization tasks and applications that are enabled by these measures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

LigninGraphs: lignin structure determination with multiscale graph modeling

Lignin is an aromatic biopolymer found in ubiquitous sources of woody biomass. Designing and optimizing lignin valorization processes requires a fundamental understanding of lignin structures. Experimental characterization techniques, such as 2D-heteronuclear single quantum coherence (HSQC) nuclear magnetic resonance (NMR) spectra, could elucidate the global properties of the polymer molecules. Computer models could extend the resolution of experiments by representing structures at the molecular and atomistic scales. We introduce a graph-based multiscale modeling framework for lignin structure generation and visualization. The framework employs accelerated rejection-free polymerization and hierarchical Metropolis Monte Carlo optimization algorithms. We obtain structure libraries for various lignin feedstocks based on literature and new experimental NMR data for poplar wood, pinewood, and herbaceous lignin. The framework could guide researchers towards feasible lignin structures, efficient space exploration, and future kinetics modeling. Its software implementation in Python, LigninGraphs, is open-source and available on GitHub.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Global bases for nonplanar loop integrands, generalized unitarity, and the double copy to all loop orders

We introduce a constructive method for defining a global loop-integrand basis for scattering amplitudes, encompassing both planar and nonplanar contributions. Our approach utilizes a graph-based framework to establish a well-defined, non-redundant basis of integrands. This basis, constructed from a chosen set of non-redundant graphs together with a selection of irreducible scalar products, provides clear insights into various physical properties of scattering amplitudes and proves useful in multiple contexts, such as on-shell Ward identities and manifesting gauge-choice independence. A key advantage of our integrand basis is its ability to streamline the generalized unitarity method. Specifically, we can directly read off the coefficients of basis elements without resorting to ansätze or solving linear equations. This novel approach allows us to lift generalized unitarity cuts — expressed as products of tree amplitudes — to loop-level integrands, facilitating the use of the tree-level double copy to generate complete gravitational integrands at any loop order. This method circumvents the difficulties in identifying complete higher-loop-order gauge-theory integrands that adhere to the color-kinematics duality. Additionally, our cut-based organization is well-suited for expansion in hard or soft limits, aiding in the exploration of ultraviolet or classical limits of scattering amplitudes.

Effective Field Theories↗
DOE OSTI2021

From Anderson localization on random regular graphs to many-body localization

Highlights: • Anderson transition from ergodicity to localization on random regular graphs (RRG). • Analytical, pool method, and exact-diagonalization study of correlations on RRG. • Many-body localization (MBL) to ergodicity transition: quantum dots and spin chains. • Dynamical eigenstate correlation functions in RRG and MBL problems. • Anderson localization on RRG as a toy model for MBL. The article reviews the physics of Anderson localization on random regular graphs (RRG) and its connections to many-body localization (MBL) in disordered interacting systems. Properties of eigenstate and energy level correlations in delocalized and localized phases, as well at criticality, are discussed. In the many-body part, models with short-range and power-law interactions are considered, as well as the quantum-dot model representing the limit of the “most long-range” interaction. Central themes – which are common to the RRG and MBL problems – include ergodicity of the delocalized phase, localized character of the critical point, strong finite-size effects, and fractal scaling of eigenstate correlations in the localized phase.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Graph convolutional networks applied to unstructured flow field data

Abstract Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both a set number and order of features for each sample. They thus cannot be easily constructed for an unstructured dataset. Therefore, a graph based data-driven model to perform inference on fields defined on an unstructured mesh, using a graph convolutional neural network (GCNN) is presented. The ability of the method to predict global properties from spatially irregular measurements with high accuracy is demonstrated by predicting the drag force associated with laminar flow around airfoils from scattered velocity measurements. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented. The GCNN method, using inductive convolutional layers and adaptive pooling, is able to predict this quantity with a validation R 2 above 0.98, and a Normalized Mean Squared Error below 0.01, without relying on spatial structure.

Ogoke, Francis (ORCID:0000000224327783)↗
DOE OSTI2021

Freedom of the mixer rotation axis improves performance in the quantum approximate optimization algorithm

Variational quantum algorithms such as the quantum approximate optimization algorithm (QAOA) are particularly attractive candidates for implementation on near-term quantum processors. As hardware realities such as error and qubit connectivity will constrain achievable circuit depth in the near future, new ways to achieve high performance at low depth are of great interest. In this work, we present a modification to QAOA that adds additional variational parameters in the form of freedom of the rotation axis in the XY plane of the mixer Hamiltonian. Here, via numerical simulation, we show that this leads to a drastic performance improvement over standard QAOA at finding solutions to the MaxCut problem on graphs of up to seven qubits. Furthermore, we explore the Z-phase error mitigation properties of our modified Ansatz, its performance under a realistic error model for a neutral atom quantum processor, and the class of problems it can solve in a single round.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Shortest Path and Neighborhood Subgraph Extraction on a Spiking Memristive Neuromorphic Implementation

Spiking neuromorphic computers (SNCs) are promising as a post Moore's law technology partly because of their potential for very low power computation. SNCs have primarily been demonstrated on machine learning and neural network applications, but they can also be used for applications beyond machine learning that can leverage SNC properties such as massively parallel computation and collocated processing and memory. Here, we demonstrate two graph problems (shortest path and neighborhood subgraph extraction) that can be solved using SNCs. We discuss the approach for mapping these applications to an SNC. We also estimate the performance of a memristive SNC for these applications on three real-world graphs.

Schuman, Catherine↗
NASA NTRS1989

A user-friendly, menu-driven, language-free laser characteristics curves graphing program for desk-top IBM PC compatible computers

A facility was established that uses collected data and feeds it into mathematical models that generate improved data arrays by correcting for various losses, base line drift, and conversion to unity scaling. These developed data arrays have headers and other identifying information affixed and are subsequently stored in a Laser Materials and Characteristics data base which is accessible to various users. The two part data base: absorption - emission spectra and tabulated data, is developed around twelve laser models. The tabulated section of the data base is divided into several parts: crystalline, optical, mechanical, and thermal properties; aborption and emission spectra information; chemical name and formulas; and miscellaneous. A menu-driven, language-free graphing program will reduce and/or remove the requirement that users become competent FORTRAN programmers and the concomitant requirement that they also spend several days to a few weeks becoming conversant with the GEOGRAF library and sequence of calls and the continual refreshers of both. The work included becoming thoroughly conversant with or at least very familiar with GEOGRAF by GEOCOMP Corp. The development of the graphing program involved trial runs of the various callable library routines on dummy data in order to become familiar with actual implementation and sequencing. This was followed by trial runs with actual data base files and some additional data from current research that was not in the data base but currently needed graphs. After successful runs, with dummy and real data, using actual FORTRAN instructions steps were undertaken to develop the menu-driven language-free implementation of a program which would require the user only know how to use microcomputers. The user would simply be responding to items displayed on the video screen. To assist the user in arriving at the optimum values needed for a specific graph, a paper, and pencil check list was made available to use on the trial runs.

Klutz, Glenn↗
DOE OSTI2024

Designing Ti-6Al-4V microstructure for strain delocalization using neural networks

Abstract The deformation behavior of Ti-6Al-4V titanium alloy is significantly influenced by slip localized within crystallographic slip bands. Experimental observations reveal that intense slip bands in Ti-6Al-4V form at strains well below the macroscopic yield strain and may serially propagate across grain boundaries, resulting in long-range localization that percolates through the microstructure. These connected, localized slip bands serve as potential sites for crack initiation. Although slip localization in Ti-6Al-4V is known to be influenced by various factors, an investigation of optimal microstructures that limit localization remains lacking. In this work, we develop a novel strategy that integrates an explicit slip band crystal plasticity technique, graph networks, and neural network models to identify Ti-6Al-4V microstructures that reduce the propensity for strain localization. Simulations are conducted on a dataset of 3D polycrystals, each represented as a graph to account for grain neighborhood and connectivity. The results are then used to train neural network surrogate models that accurately predict localization-based properties of a polycrystal, given its microstructure. These properties include the ratio of slip accumulated in the band to that in the matrix, fraction of total applied strain accommodated by slip bands, and spatial connectivity of slip bands throughout the microstructure. The initial dataset is enriched by synthetic data generated by the surrogate models, and a grid search optimization is subsequently performed to find optimal microstructures. Describing a 3D polycrystal with only a few features and a combination of graph and neural network models offer robustness compared to the alternative approaches without compromising accuracy. We show that while each material property is optimized through a unique microstructure solution, elongated grain shape emerges as a recurring feature among all optimal microstructures. This finding suggests that designing microstructures with elongated grains could potentially mitigate strain localization without compromising strength.

Ahmadikia, Behnam↗
DOE OSTI2020

Machine learning enabled discovery of application dependent design principles for two-dimensional materials

Abstract The unique electronic and mechanical properties of two-dimensional (2D) materials make them promising next-generation candidates for a variety of applications. Large-scale searches for high-performing 2D materials are limited to calculating descriptors with computationally demanding first-principles density functional theory. In this work, we alleviate this issue by extending and generalizing crystal graph convolutional neural networks to systems with planar periodicity and train an ensemble of models to predict thermodynamic, mechanical and electronic properties. We carry out a screening of nearly 45,000 structures for two separate applications: mechanical strength and photovoltaics. By collecting statistics of the screened candidates, we investigate structural and compositional design principles that impact the properties of the structures surveyed. Our approach recovers some well-accepted design rules: hybrid organic-inorganic perovskites with lead and tin tend to be good candidates for solar cell applications and titanium based MXenes usually have high stiffness coefficients. Interestingly, other members of the group 4 elements also contribute to increasing the mechanical strength of MXenes. For all-inorganic perovskites, we discover some compositions that have not been deeply studied in the field of photovoltaics and thus open up paths for further investigation. We open-source the code-base to spur further development in this space.

Venturi, Victor (ORCID:0000000156727549)↗
NASA NTRSDate not supplied

High-Throughput Screening of Li Solid-State Electrolytes With Bond Valence Methods and Graph Neural Networks

Li-based solid-state electrolyte (Li-SSE) materials enable safer, all-solid-state batteries but the computational search for candidates with favorable stability and Li-ion conductivity is challenging due to the size of the search space and the cost of evaluating transport properties with ab initio methods. We present a high-throughput screening approach for Li-SSE materials using a combination of bond-valence methods and graph neural networks. We demonstrate the screening approach with a dataset containing tens of thousands of Li-containing compounds. Furthermore, we combine the machine-learning screening procedure with an isovalent substitution scheme to generate and screen additional Li SSE candidates beyond existing databases. Finally, we discuss relative importances of geometric and bond-valence quantities in the training of graph neural networks, providing insight for future modeling of ionic conductivity in Li-SSE materials.

Materials discovery↗
NASA NTRSDate not supplied

Screening of Li-Based Solid Electrolytes Using Bond-Valence Methods and Graph Neural Networks

Li-based solid-state electrolyte (Li-SSE) materials enable safer, all-solid-state batteries but the computational search for candidates with favorable stability and Li-ion conductivity is challenging due to the size of the search space and the cost of evaluating transport properties with ab initio methods. We present a high-throughput screening approach for Li-SSE materials using a combination of bond-valence methods and graph neural networks. We demonstrate the screening approach with a dataset containing tens of thousands of Li-containing compounds. Furthermore, we combine the machine-learning screening procedure with an isovalent substitution scheme to generate and screen additional Li SSE candidates beyond existing databases. Finally, we discuss relative importances of geometric and bond-valence quantities in the training of graph neural networks, providing insight for future modeling of ionic conductivity in Li-SSE materials.

Materials discovery↗