SEARCH · Search NASA

Results for “topology analysis”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Pulsed Infrared Thermography Nondestructive Imaging of SiC-SiC f Composite Cladding Architectures; Understanding the Performance of SiC-SiC f Composite Cladding Architectures with Cr Coating in Normal Operating and Accident Conditions in LWRs and Advanced Reactors

SiC-SiC f composites, consisting of silicon carbide fibers embedded in a silicon carbide matrix, are advanced materials with high thermal conductivity, temperature stability, and resistance to radiation damage. Traditional methods for quality control of fabricated SiC-SiC f composites involve nondestructive evaluation (NDE) with X-ray computed tomography (XCT). However, XCT imaging of typical SiC-SiC f structures for cladding applications can involve several hours. In this project, we investigate an alternative approach to NDE of SiC-SiC f composites that involves rapid (on the order of seconds) imaging with Pulsed infrared thermography (PIT). PIT images of a planar SiC-SiC f specimen show the structure of the surface monolith layer and internal SiC f structures. The capability of PIT imaging in visualizing SiC f structures is qualitatively confirmed by observing similarity in the PIT and X-ray transmission images of the same specimen. Computer vision analysis of defects in the PIT image of the monolith was performed with thresholding followed by topological structural analysis that computed geometric descriptors, including major/minor axes of fitted ellipses, area, perimeter, Feret diameter, circularity, roundness, and solidity.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2026

Microstructure‐Informed Analysis Framework for Lattice Structures: Guiding Topology‐Material Synergy in Titanium Alloys

In this work we discuss a microstructure‐informed analysis framework for lattice structures that maps the material's microstructural response to guide topology selection and mechanical performance optimization. By coupling geometrical topology with intrinsic material behavior, we demonstrate how anisotropic microstructural response can inform the design of optimized lattice structures. To illustrate this concept, we focus on two distinct classes of titanium alloys: Ti5553 (Ti‐5Al‐5Mo‐5V‐3Cr wt%), which exhibits a predominantly ‐phase microstructure, and Ti64 (Ti‐6Al‐4V wt%), which features a dual‐phase structure. These alloys exhibit markedly different mechanical responses under multiaxial loading in “fully dense” solid form. The strut‐level stress analysis of these alloys reveals how specific microstructural characteristics can guide the selection of appropriate lattice topologies. Two representative lattice configurations, one stretching‐dominated and one bending‐dominated, are evaluated under identical loading conditions to explore how microstructure‐driven design can lead to topology choices that are better suited to accommodate shear or other critical local stress states, thereby enhancing mechanical performance. A strut‐level mechanics‐based analysis is performed to evaluate shear stress distribution and highlight the role of topology‐microstructure synergy and compatibility in determining overall lattice behavior. The findings emphasize the importance of designing structures that are both load‐aware and microstructure‐responsive, enabling more effective material utilization in advanced engineering applications.

36 MATERIALS SCIENCE↗

DOE OSTI2021

Topological Machine Learning Methods for Power System Responses to Contingencies

While deep learning tools, coupled with the emerging machinery of topological data analysis, are proven to deliver various performance gains in a broad range of applications, from image classification to biosurveillance to blockchain fraud detection, their utility in areas of high societal importance such as power system modeling and, particularly, resilience quantification in the energy sector yet remains untapped. To provide fast acting synthetic regulation and contingency reserve services to the grid while having minimal disruptions on customer quality of service, we propose a new topology-based system that depends on a neural network architecture for impact metric classification and prediction in power systems. This novel topology-based system allows one to evaluate the impact of three power system contingency types, in conjunction with transmission lines, transformers, and transmission lines combined with transformers. We show that the proposed new neural network architecture equipped with local topological measures facilitates more accurate classification of unserved load as well as the amount of unserved load. In addition, we are able to learn more about the complex relationships between electrical properties and local topological measurements on their simulated response to contingencies for the NREL-SIIP power system.

contingency analysis↗

DOE OSTI2021

Efficient Topology Design Algorithms for Power Grid Stability

The dynamic response of power grids to small disturbances influences their overall stability. This letter examines the effect of network topology on the linearized time-invariant dynamics of electric power systems. The proposed framework utilizes H 2 -norm based stability metrics to study the optimal placement of lines on existing networks as well as the topology design of new networks. The design task is first posed as an NP-hard mixed-integer nonlinear program (MINLP) that is exactly reformulated as a mixed-integer linear program (MILP) using McCormick linearization. To improve computation time, graph-theoretic properties are exploited to derive valid inequalities (cuts) and tighten bounds on the continuous optimization variables. Moreover, a cutting plane generation procedure is put forth that is able to interject the MILP solver and augment additional constraints to the problem on-the-fly. Finally, the efficacy of our approach in designing optimal grid topologies is demonstrated through numerical tests on the IEEE 39-bus network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRSDate not supplied

Combined Analysis of NASA's High Efficiency Megawatt Motor and Its Converter

NASA’s High Efficiency Megawatt Motor (HEMM) is being developed to achieve the performance needed by single aisle class electrified aircraft. It is a 1.4 MW electric machine designed as a generator for NASA’s STARC-ABL concept vehicle. It has performance objectives of greater than 16 kW/kg electromagnetic specific power and efficiency of greater than 98%. The key enabling technology for HEMM’s high performance metrics is a superconducting rotor cooled by an integrated cryocooler. HEMM’s integrated cryocooler is being designed to only lift 50 W of heat at its target 50 K cold tip operating temperature. HEMM’s superconducting rotor therefore needs to have essentially zero electromagnetic losses in order to stay below the 50 W heat rejection limit of the cryocooler. This paper presents the combined analysis of HEMM and a preliminarily designed HEMM converter to analyze the rotor loss impact of several potential converter filter topologies. The analysis results point to interleaving and series inductance filters not being sufficient to suppress switching harmonic caused rotor loss. Paths forward to develop a converter to eliminate rotor loss are discussed.

Matthew Granger↗

NASA NTRSDate not supplied

Combined Analysis of NASA's High Efficiency Megawatt Motor and Its Converter

Matthew Granger↗

DOE OSTI2026

Scalable Computation of Topological Abstractions for Scalar Data

Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial and on single machines. This paper presents the state of the art in the scalable computation of topological abstractions on scalar data, in shared memory parallel on single machines, and in distributed memory parallel on multiple machines. We highlight results for set‐based, graph‐based and complex‐based abstractions and organize the state of the art based on this taxonomy. The paper identifies parallelization and distribution techniques common in topological algorithms and highlights further areas of interest with underdeveloped efforts.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Analysis and Comparison of Different Metrics of DC-DC Converters to Determine Fuel Cell Stack Architectures in Heavy Duty Fuel Cell Vehicle Applications

This paper presents a comparative study of the DC-DC converters used in heavy-duty fuel cell electric vehicles for different input fuel cell stack configurations and voltages in terms of various important metrics including efficiency, cost, weight and power density. Contrary to conventional use of an interleaved boost topology, the analysis presented in this paper demonstrates that improved converter metrics can be achieved for an interleaved buck topology that uses a different input fuel cell stack. An insight to the optimal choice of number of interleaved phases for each metric is also presented. Results presented in the tables and plots convey the findings.

Mukherjee, Subho↗

DOE OSTI2025

Dark Energy Survey Year 3 results: $w$CDM cosmology from simulation-based inference with persistent homology on the sphere

We present cosmological constraints from Dark Energy Survey Year 3 (DES Y3) weak lensing data using persistent homology, a topological data analysis technique that tracks how features like clusters and voids evolve across density thresholds. For the first time, we apply spherical persistent homology to galaxy survey data through the algorithm TopoS2, which is optimized for curved-sky analyses and HEALPix compatibility. Employing a simulation-based inference framework with the Gower Street simulation suite, specifically designed to mimic DES Y3 data properties, we extract topological summary statistics from convergence maps across multiple smoothing scales and redshift bins. After neural network compression of these statistics, we estimate the likelihood function and validate our analysis against baryonic feedback effects, finding minimal biases (under $0.3σ$) in the $Ω_\mathrm{m}-S_8$ plane. Assuming the $w$CDM model, our combined Betti numbers and second moments analysis yields $S_8 = 0.821 \pm 0.018$ and $Ω_\mathrm{m} = 0.304\pm0.037$-constraints 70% tighter than those from cosmic shear two-point statistics in the same parameter plane. Our results demonstrate that topological methods provide a powerful and robust framework for extracting cosmological information, with our spherical methodology readily applicable to upcoming Stage IV wide-field galaxy surveys.

Prat, J. [Nordita; Royal Inst. Tech., Sodertalje; ↗

DOE OSTI2023

Comparing Mapper Graphs of Artificial Neuron Activations

The mapper graph is a popular tool from topological data analysis that provides a graphical summary of point cloud data. It has been used to study data from cancer research, sports analytics, neurosciences, and machine learning. In particular, mapper graphs have been used recently to visualize the topology of high-dimensional artificial neural activations from convolutional neural networks and large language models. However, a key question that arises from using mapper graphs across applications is how to compare mapper graphs to study their structural differences. In this paper, we introduce a distance between mapper graphs using tools from optimal transport. We demonstrate the utility of such a distance by studying the topological changes of neural activations across convolutional layers in deep learning, as well as by capturing the loss of structural information for multiscale mapper.

mapper graphs, computational topology, machine lea↗

DOE OSTI2025

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

DOE OSTI2020

Experimental and quantum mechanical characterization of an oxygen-bridged plutonium(IV) dimer

We report the synthesis and characterization of K 4 {[PuCl 2 (NO 3 ) 3 ] 2 (μ 2 -O)}·H 2 O, which contains the first known μ 2 -oxo bridge between two Pu IV metal centers. Adding to its uniqueness is the Pu-(μ 2 -O) bond length of 2.04 Å, which is the shortest of other analogous compounds. The Pu-(μ 2 -O)-Pu bridge is characterized by the mixing of s -, d -, and p -orbitals from Pu with the p -orbitals of O; the 5 f -orbitals do not participate in bonding. Natural bond orbital analysis indicates that Pu and O interact through one 3c-2e σ Pu-O-Pu and two 3c-2e π Pu-O-Pu bonding orbitals and that the electron density is highly polarized on the μ 2 -O. Bond topology properties analysis indicates that the Pu-(μ 2 -O) bond shares both ionic and covalent character. Quantum mechanical calculations also show that the dimer has multiconfigurational ground states, where the nonet, septet, quintet, triplet, and singlet are close in energy. This work demonstrates the interplay between experimental and computational efforts that is required to understand the chemical bonding of Pu compounds.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

PlasmoData.jl — A Julia framework for modeling and analyzing complex data as graphs

Datasets encountered in scientific and engineering applications appear in complex formats (e.g., images, multivariate time series, molecules, video, text strings, networks). Graph theory provides a unifying framework to model such datasets and enables the use of powerful tools that can help analyze, visualize, and extract value from data. In this work, we present PlasmoData.jl, an open-source, Julia framework that uses concepts of graph theory to facilitate the modeling and analysis of complex datasets. The core of our framework is a general data modeling abstraction, which we call a DataGraph. We show how the abstraction and software implementation can be used to represent diverse data objects as graphs and to enable the use of tools from topology, graph theory, and machine learning (e.g., graph neural networks) to conduct a variety of tasks. We illustrate the versatility of the framework by using real datasets: (i) an image classification problem using topological data analysis to extract features from the graph model to train machine learning models; (ii) a disease outbreak problem where we model multivariate time series as graphs to detect abnormal events; and (iii) a technology pathway analysis problem where we highlight how we can use graphs to navigate connectivity. Further, our discussion also highlights how PlasmoData.jl leverages native Julia capabilities to enable compact syntax, scalable computations, and interfaces with diverse packages. Overall, we show that the DataGraph abstraction and PlasmoData.jl Julia package are able to model data within graphs and enable useful analysis.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

DOE OSTI2021

Optimization and Augmentation for Data Parallel Contour Trees

Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. Furthermore, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

TopFusion: Using Topological Feature Space for Fusion and Imputation in Multi-Modal Data

We present a novel multi-modal data fusion technique using topological features. The method, TopFusion, leverages the flexibility of topological data analysis tools (namely persistent homology and persistence images) to map multi-modal datasets into a common feature space by forming a new multi-channel persistence image. Each channel in the image is representative of a view of the data from a modality-dependent filtration. We demonstrate that the topological perspective we take allows for more effective data reconstruction, i.e. imputation. In particular, by performing imputation in topological feature space we are able to outperform the same imputation techniques applied to raw data or alternatively derived features. We show that TopFusion representations can be used as input to downstream deep learning-based computer vision models and doing so achieves comparable performance to other fusion methods for classification on two multi-modal datasets.

Myers, Audun D.↗

DOE OSTI2025

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Contour trees offer an abstract representation of the level set topology in scalar fields and are widely used in topological data analysis and visualization. However, applying contour trees to large-scale scientific datasets remains challenging due to scalability limitations. Recent developments in distributed hierarchical contour trees have addressed these challenges by enabling scalable computation across distributed systems. Building on these structures, advanced analytical tasks—such as volumetric branch decomposition and contour extraction—have been introduced to facilitate large-scale scientific analysis. Despite these advancements, such analytical tasks substantially increase memory usage, which hampers scalability. In this paper, we propose a pre-simplification strategy to significantly reduce the memory overhead associated with analytical tasks on distributed hierarchical contour trees. We demonstrate enhanced scalability through strong scaling experiments, constructing the largest known contour tree—comprising over half a trillion nodes with complex topology—in under 15 minutes on a dataset containing 550 billion elements.

Li, Mingzhe [University of Utah]↗

DOE OSTI2022

On the integration of molecular dynamics, data science, and experiments for studying solvent effects on catalysis

Computational workflows that combine molecular dynamics (MD) simulations and emerging data-centric (DC) methods can accelerate the screening and analysis of solvent systems experimentally and computationally. Here, MD simulations provide atomic positions and velocities of reactant, solvent, and catalyst materials that can be manipulated into data representations that in turn can be used by DC techniques to conduct predictive modeling, feature extraction, and experimental design. For liquid-phase catalytic applications, emerging DC techniques such as Convolutional and Graph Neural Networks (CNN/GNN), Topological Data Analysis (TDA), and Active Learning (AL) can leverage MD and experimental data to quickly predict solvent effects on reaction outcomes. For instance, in recent studies, 3D solvent environments obtained with MD have been exploited by CNNs to predict experimental reaction rates for homogeneous acid-catalyzed lignocellulosic processes. In this perspective, we discuss basic principles of DC methods and how these can be combined with MD to enable high-throughput screening of solvent selection for diverse catalysis applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2025

Analysis of the SiMPL Method for Density-Based Topology Optimization

We present a rigorous convergence analysis of a new method for density-based topology optimization that provides pointwise bound-preserving design updates and faster convergence than other popular first-order topology optimization methods. Due to its strong bound preservation, the method is exceptionally robust, as demonstrated in numerous examples here and in the companion article [D. Kim et al., Struct. Multidiscip. Optim., 68 (2025), 74]. Furthermore, it is easy to implement with clear structure and analytical expressions for the updates. Our analysis covers two versions of the method, characterized by the employed line search strategies. We consider a modified Armijo backtracking line search and a Bregman backtracking line search. For both line search algorithms, our algorithm delivers a strict monotone decrease in the objective function and further intuitive convergence properties, e.g., strong and pointwise convergence of the density variables on the active sets, norm convergence to zero of the increments, convergence of the Lagrange multipliers, and more. In addition, the numerical experiments demonstrate apparent mesh-independent convergence of the algorithm. Here, we refer to the new algorithm as the SiMPL method (pronounced “simple”), which stands for Sigmoidal Mirror descent with a Projected Latent variable.

97 MATHEMATICS AND COMPUTING↗