Search NASA⌕ Search

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.

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

At least 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
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↗
DOE OSTI2023

TopoSZ: Preserving Topology in Error-Bounded Lossy Compression

Existing error-bounded lossy compression techniques control the pointwise error during compression to guarantee the integrity of the decompressed data. However, they typically do not explicitly preserve the topological features in data. When performing post hoc analysis with decompressed data using topological methods, preserving topology in the compression process to obtain topologically consistent and correct scientific insights is desirable. In this paper, we introduce TopoSZ, an error-bounded lossy compression method that preserves the topological features in 2D and 3D scalar fields. Specifically, we aim to preserve the types and locations of local extrema as well as the level set relations among critical points captured by contour trees in the decompressed data. The main idea is to derive topological constraints from contour-tree-induced segmentation from the data domain, and incorporate such constraints with a customized error-controlled quantization strategy from the SZ compressor (version 1.4). In conclusion, our method allows users to control the pointwise error and the loss of topological features during the compression process with a global error bound and a persistence threshold.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Curvature Energetics Determined by Alchemical Simulation on Four Topologically Distinct Lipid Phases

The relative curvature energetics of two lipids are tested using thermodynamic integration (TI) on four topologically distinct lipid phases. Simulations use TI to switch between choline headgroup lipids (POPC; that prefers to be flat) and ethanolamine headgroup lipids (POPE; that prefer, for example, the inner monolayer of vesicles). Here, the thermodynamical moving of the lipids between planar, inverse hexagonal (H II ), cubic (Q II ; Pn3m space group), and vesicle topologies reveals differences in material parameters that were previously challenging to access. The methodology allows for predictions of two important lipid material properties: the difference in POPC/POPE monolayer intrinsic curvature (ΔJ 0 ) and the difference in POPC/POPE monolayer Gaussian curvature modulus (Δ$\bar{κ_m}$), both of which are connected to the energetics of topological variation. Analysis of the TI data indicates that, consistent with previous experiment and simulation, the J 0 of POPE is more negative than POPC (ΔJ 0 = –0.018 ± 0.001 Å –1 ). The theoretical framework extracts significant differences in $\bar{κ_m}$ of which POPE is less negative than POPC by 2.0 to 4.0 kcal/mol. The range of these values is determined by considering subsets of the simulations, and disagreement between these subsets suggests separate mechanical parameters at very high curvature. Finally, the fit of the TI data to the model indicates that the position of the pivotal plane of curvature is not constant across topologies at high curvature. Overall, the results offer insights into lipid material properties, the limits of a single HC model, and how to test them using simulation.

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

Efficient Topology Assessment for Integrated Transmission and Distribution Network with 10,000+ Inverter-based Resources

The renewable energy proliferation calls upon the grid operators and planners to systematically evaluate the potential impacts of distributed energy resources (DERs). Considering the significant differences between various inverter-based resources (IBRs), especially the different capabilities between grid-forming inverters and grid-following inverters, it is crucial to develop an efficient and effective assessment procedure besides available co-simulation framework with high computation burdens. This paper presents a streamlined graph-based topology assessment for the integrated power system transmission and distribution networks. Graph analyses were performed based on the integrated graph of modified miniWECC grid model and IEEE 8500-node test feeder model, high performance computing platform with 40 nodes and total 2400 CPUs has been utilized to process this integrated graph, which has 100,000+ nodes and 10,000+ IBRs. The node ranking results not only verified the applicability of the proposed method, but also revealed the potential of distributed grid forming (GFM) and grid following (GFL) inverters interacting with the centralized power plants.

Graph Analysis, Topology evaluation, Infrastructur↗
DOE OSTI2024

Topological Optimization with Big Steps

Using persistent homology to guide optimization has emerged as a novel application of topological data analysis. Existing methods treat persistence calculation as a black box and backpropagate gradients only onto the simplices involved in particular pairs. We show how the cycles and chains used in the persistence calculation can be used to prescribe gradients to larger subsets of the domain. In particular, we show that in a special case, which serves as a building block for general losses, the problem can be solved exactly in linear time. This relies on another contribution of this paper, which eliminates the need to examine a factorial number of permutations of simplices with the same value. Here, we present empirical experiments that show the practical benefits of our algorithm: the number of steps required for the optimization is reduced by an order of magnitude.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2023

Influence of topology optimization parameters on the mechanical response of an additively manufactured test structure

Topology Optimization (TO) determines a material distribution within a domain under given conditions and design constraints, and generally generates complex geometries as a result. Complementary to TO, Additive Manufacturing (AM) offers the ability to fabricate complex geometries which may be difficult to manufacture using traditional techniques such as milling. AM has been used in multiple industries including the medical devices area. Hence, TO may be used to create patient-matched devices where the mechanical response is catered to a particular patient. Furthermore, during a medical device regulatory 510(k) pathway, demonstrating that worst-cases are known and tested is critical to the review process. Using TO and AM to predict worst-case designs for subsequent performance testing may be challenging and does not appear to have been thoroughly explored. Investigating the effects of TO input parameters when AM is employed may be the first step in determining the feasibility of predicting these worst-cases.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Evaluation of low-exergy heating and cooling systems and topology optimization for deep energy savings at the urban district level

District energy systems have the potential to achieve deep energy savings by leveraging the density and diversity of loads in urban districts. However, planning and adoption of district thermal energy systems is hindered by the analytical burden and high infrastructure costs. It is hypothesized that network topology optimization would enable wider adoption of advanced (ambient temperature) district thermal energy systems, resulting in energy savings. In this study, energy modeling is used to compare the energy performance of “conventional” and “advanced” district thermal energy systems at the urban district level, and a partial exhaustive search is used to evaluate a heuristic for the topology optimization problem. For the prototypical district considered, advanced district thermal energy systems mated with low-exergy building heating and cooling systems achieved a source energy use intensity that was 49% lower than that of conventional systems. The minimal spanning tree heuristic was demonstrated to be effective for the network topology optimization problem in the context of a prototypical district, and contributes to mitigating the problem’s computational complexity. The work presented in this paper demonstrates the potential of advanced district thermal energy systems to achieve deep energy savings, and advances to addressing barriers to their adoption through topology optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Quantum chemical topology and natural bond orbital analysis of M–O covalency in M(OC 6 H 5 ) 4 (M = Ti, Zr, Hf, Ce, Th, Pa, U, Np)

Covalency is complex yet central to our understanding of chemical bonding, particularly in the actinide series. In this work, we assess covalency in a series of isostructural d and f transition element compounds M(OC 6 H 5 ) 4 (M = Ti, Zr, Hf, Ce, Th, Pa, U, Np) using scalar relativistic hybrid density functional theory in conjunction with the Natural Bond Orbital (NBO), quantum theory of atoms in molecules (QTAIM) and interacting quantum atoms (IQA) approaches. The IQA exchange–correlation covalency metric is evaluated for the first time for actinides other than uranium, in order to assess its applicability in the 5f series. It is found to have excellent correlation with NBO and QTAIM covalency metrics, making it a promising addition to the computational toolkit for analysing metal–ligand bonding. Our range of metrics agree that the actinide-oxygen bonds are the most covalent of the elements studied, with those of the heavier group 4 elements the least. Within the early actinide series, Th stands apart from the other three elements considered, being consistently the least covalent.

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

A Unified Scaling Framework for Comparative Analysis of Major Electrical Machine Topologies

This paper presents a unified framework for comparing major electrical machine topologies under identical output and thermal constraints, with emphasis on supply-chain-aware selection among rare-earth-intensive, reduced-rare-earth, and rare-earth-free solutions. Using power factor and air-gap flux density as the principal descriptors, the framework links topology choice to relative size, copper demand, magnet dependence, cost sensitivity, and inertia. To support robust early-stage screening, the deterministic scaling model is combined with uncertainty representation, Monte Carlo scenario propagation, and hesitationaware ranking. The results show that rare-earth-rich machines remain compact and dense, whereas reduced-rare-earth and rare-earth-free alternatives become more attractive under specific material-risk and cost scenarios.

Kumar, Praveen [ORNL] (ORCID:0000000291877857)↗
DOE OSTI2021

Oineus v1.0

A library for multi-threaded computation of persistence diagrams. The algorithm for computing persistence diagrams in a lock-free manner was published in the 'Towards Lock-free Persistent Homology' (D. Morozov, A. Nigmetov, Brief Announcement: SPAA 2020); it scales better than the only other shared-memory parallel implementation of persistent homology computation PHAT. Library includes python bindings to compute persistence diagrams and their vectorizations for lower-star filtrations on grid data. It is intended to be used by scientists working on Topological Data Analysis and its applications in different areas.

Nigmetov, Arnur↗
DOE OSTI2021

molecule-tda v0.1.0

A general framework to extract topological information (via topological data analysis) from some type of point cloud data, to be used in downstream machine learning tasks.

Krishnapriyan, Aditi↗