Search NASA⌕ Search

SEARCH · Search NASA

Results for “nodes”

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 451 records · Page 25

Learning subgrid-scale models with neural ordinary differential equations

We propose a new approach to learning the subgrid-scale model when simulating partial differential equations (PDEs) solved by the method of lines and their representation in chaotic ordinary differential equations, based on neural ordinary differential equations (NODEs). Solving systems with fine temporal and spatial grid scales is an ongoing computational challenge, and closure models are generally difficult to tune. Machine learning approaches have increased the accuracy and efficiency of computational fluid dynamics solvers. In this approach neural networks are used to learn the coarse- to fine-grid map, which can be viewed as subgrid-scale parameterization. We propose a strategy that uses the NODE and partial knowledge to learn the source dynamics at a continuous level. Our method inherits the advantages of NODEs and can be used to parameterize subgrid scales, approximate coupling operators, and improve the efficiency of low-order solvers. Numerical results with the two-scale Lorenz 96 ODE, the convection-diffusion PDE, and the viscous Burgers' PDE are used to illustrate this approach.

97 MATHEMATICS AND COMPUTING↗

Resilient information and inference networks under mixed-trust sensing

With ubiquitous digitization, sensing, and computational intelligence deployed in increasingly more and broader domains, including critical infrastructure, potentially misleading and destabilizing effects of multimodal anomalies and adversarial behavior are growing in importance. Here, we develop randomized and reinforcement learning-based strategies for strategically recruiting and utilizing deployed (and, thus, vulnerable and potentially faulty and/or compromised) nodes from information and inference networks, while defending against adversaries that attempt to misguide assessments of inferred variables. Recognizing that, besides communication and other costs, sampling from any observable node can either provide true data or dangerously expose our inference to misinformation (without being easily distinguishable what actually happens), the proposed strategies proceed by progressively recruiting nodes and cautiously scaling their information contribution based on assumed, or, in our reinforcement learning approach, intelligently weighed trustworthiness, with the learning approach also considering network-wide, threat-inclusive risk/value tradeoffs. While avoiding the hardware, communication, analytical and computational burden of explicit redundancy, the proposed defensive schemes enable on-the-fly assessments of underlying processes, and system-wide situational awareness with demonstrable resilience against adversarial activities.

97 - MATHEMATICS AND COMPUTING↗

Multiscale graph neural network autoencoders for interpretable scientific machine learning

The goal of this work is to address two limitations in autoencoder-based models: latent space interpretability and compatibility with unstructured meshes. This is accomplished here with the development of a novel graph neural network (GNN) autoencoding architecture with demonstrations on complex fluid flow applications. To address the first goal of interpretability, the GNN autoencoder achieves reduction in the number nodes in the encoding stage through an adaptive graph reduction procedure. Further, this reduction procedure essentially amounts to flowfieldconditioned node sampling and sensor identification, and produces interpretable latent graph representations tailored to the flowfield reconstruction task in the form of so-called masked fields. These masked fields allow the user to (a) visualize where in physical space a given latent graph is active, and (b) interpret the time-evolution of the latent graph connectivity in accordance with the time-evolution of unsteady flow features (e.g. recirculation zones, shear layers) in the domain. To address the goal of unstructured mesh compatibility, the autoencoding architecture utilizes a series of multi-scale message passing (MMP) layers, each of which models information exchange among node neighborhoods at various lengthscales. The MMP layer, which augments standard single-scale message passing with learnable coarsening operations, allows the decoder to more efficiently reconstruct the flowfield from the identified regions in the masked fields. Analysis of latent graphs produced by the autoencoder for various model settings are conducted using unstructured snapshot data sourced from large-eddy simulations in a backward-facing step (BFS) flow configuration with an OpenFOAM-based flow solver at high Reynolds numbers.

97 MATHEMATICS AND COMPUTING↗

A face-upwinded spectral element method

Here we present a new high-order accurate discretisation on unstructured meshes of quadrilateral elements. Our Face Upwinded Spectral Element (FUSE) method uses the same node distribution as a high-order continuous Galerkin (CG) method, but with a particular choice of node locations within each element and an upwinded stencil on the face nodes. This results in a number of benefits, including fewer degrees of freedom and straight-forward integration with CG. We present the derivation of the scheme and the analysis of its properties, in particular showing stability using von Neumann analysis. We show numerical evidence for its accuracy and efficiency on multiple classes of problems including convection-dominated flows, Poisson's equation, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

Multi-GPU immersed boundary method hemodynamics simulations

Large-scale simulations of blood flow that resolve the 3D deformation of each comprising cell are increasingly popular owing to algorithmic developments in conjunction with advances in compute capability. Among different approaches for modeling cell-resolved hemodynamics, fluid structure interaction (FSI) algorithms based on the immersed boundary method are frequently employed for coupling separate solvers for the background fluid and the cells within one framework. GPUs can accelerate these simulations; however, both current pre-exascale and future exascale CPU-GPU heterogeneous systems face communication challenges critical to performance and scalability. In this paper, we describe, to our knowledge, the largest distributed GPU-accelerated FSI simulations of high hematocrit cell-resolved flows with over 17 million red blood cells. We compare scaling on a fat node system with six GPUs per node and on a system with a single GPU per node. Through comparison between the CPU- and GPU-based implementations, we identify the costs of data movement in multiscale multi-grid FSI simulations on heterogeneous systems and show it to be the greatest performance bottleneck on the GPU.

97 MATHEMATICS AND COMPUTING↗

Optically connected memory for disaggregated data centers

Recent advances in integrated photonics enable the implementation of reconfigurable, high-bandwidth, and low energy-per-bit interconnects in next-generation data centers. We propose and evaluate an Optically Connected Memory (OCM) architecture that disaggregates the main memory from the computation nodes in data centers. OCM is based on micro-ring resonators (MRRs), and it does not require any modification to the DRAM memory modules. We calculate energy consumption from real photonic devices and integrate them into a system simulator to evaluate performance. Here, our results show that (1) OCM is capable of interconnecting four DDR4 memory channels to a computing node using two fibers with 1.02 pJ energy-per-bit consumption and (2) OCM performs up to 5.5× faster than a disaggregated memory with 40G PCIe NIC connectors to computing nodes.

97 MATHEMATICS AND COMPUTING↗

Distributed Tomographic Reconstruction with Quantization

Conventional tomographic reconstruction typically depends on centralized servers for both data storage and computation, leading to concerns about memory limitations and data privacy. Distributed reconstruction algorithms mitigate these issues by partitioning data across multiple nodes, reducing server load and enhancing privacy. However, these algorithms often encounter challenges related to memory constraints and communication overhead between nodes. In this paper, we introduce a decentralized Alternating Directions Method of Multipliers (ADMM) with configurable quantization. By distributing local objectives across nodes, our approach is highly scalable and can efficiently reconstruct images while adapting to available resources. To overcome communication bottlenecks, we propose two quantization techniques based on K-means clustering and JPEG compression. Numerical experiments with benchmark images illustrate the tradeoffs between communication efficiency, memory use, and reconstruction accuracy.

Miao, Runxuan↗

Evaluating adaptive and predictive power management strategies for optimizing visualization performance on supercomputers

Power is becoming an increasingly scarce resource on the next generation of supercomputers, and should be used wisely to improve overall performance. One strategy for improving power usage is hardware overprovisioning, i.e., systems with more nodes than can be run at full power simultaneously without exceeding the system-wide power limit. With this study, we compare two strategies for allocating power throughout an overprovisioned system – adaptation and prediction – in the context of visualization workloads. While adaptation has been suitable for workloads with more regular execution behaviors, it may not be as suitable on visualization workloads, since they can have variable execution behaviors. This study considers a total of 104 experiments, which vary the rendering workload, power budget, allocation strategy, and node concurrency, including tests processing data sets up to 1 billion cells and using up to 18,432 cores across 512 nodes. Overall, we find that prediction is a superior strategy for this use case, improving performance up to 27% compared to an adaptive strategy.

97 MATHEMATICS AND COMPUTING↗

Immortal rays: Rethinking random ray neutron transport on GPU architectures

The Random Ray Method (TRRM) is a recently developed adaptation of the Method of Characteristics for neutral particle transport simulations. TRRM has demonstrated excellent performance on 3D nuclear reactor benchmark problems using CPU-based compute systems. When porting to GPU-based systems, however, new performance challenges arise that are unique to processors targeting massive fine-grained parallelism. For smaller problems, or for large problems that are domain decomposed across many computational nodes, the problem size per node has insufficient parallelism to saturate GPU node resources, thus greatly limiting speedup. In this study, we report on a newly developed “immortal ray” variant of TRRM. Here, the immortal ray technique exposes significantly more fine-grained parallelism by fundamentally reformulating the numerical details of ray discretization, resulting in performance tradeoffs with significant overall benefit on GPUs. For very small 2D simulation problems we found the new immortal ray variant allowed for up to a 4.4x speedup when run on a single GPU. For larger 3D simulation problems we found the new variant improved strong scaling by 3x when run on the Summit supercomputer.

97 MATHEMATICS AND COMPUTING↗

Porting hypre to heterogeneous computer architectures: Strategies and experiences

We report that linear systems are occurring in many applications, and solving them can take a large amount of the total simulation time. The high performance library hypre provides a variety of interfaces and linear solvers, including various multigrid methods, that have achieved good scalability on a variety of homogeneous parallel computer architectures. Heterogeneous architectures with nodes that have both CPUs and accelerators provide new challenges, since they require more fine-grained parallelism and reduced data movement between different memories on a single node as well as across nodes. We will discuss our experiences and strategies to port hypre to heterogeneous computers with accelerators, including the design of a new memory model, the use of abstractions, the BoxLoop macros in the structured and semi-structured interfaces, and the restructuring of algebraic multigrid (AMG) into modular components. We present numerical experiments comparing CPU and GPU performance for several test problems.

97 MATHEMATICS AND COMPUTING↗

Time-series learning of latent-space dynamics for reduced-order model closure

In this work, we study the performance of long short-term memory networks (LSTMs) and neural ordinary differential equations (NODEs) in learning latent-space representations of dynamical equations for an advection-dominated problem given by the viscous Burgers equation. Our formulation is devised in a nonintrusive manner with an equation-free evolution of dynamics in a reduced space with the latter being obtained through a proper orthogonal decomposition. In addition, we leverage the sequential nature of learning for both LSTMs and NODEs to demonstrate their capability for closure in systems that are not completely resolved in the reduced space. We assess our hypothesis for two advection-dominated problems given by the viscous Burgers equation. We observe that both LSTMs and NODEs are able to reproduce the effects of the absent scales for our test cases more effectively than does intrusive dynamics evolution through a Galerkin projection. This result empirically suggests that time-series learning techniques implicitly leverage a memory kernel for coarse-grained system closure as is suggested through the Mori–Zwanzig formalism.

97 MATHEMATICS AND COMPUTING↗

Charge Transport in Zirconium-Based Metal–Organic Frameworks

Metal–organic frameworks (MOFs) are a class of crystalline porous materials characterized by inorganic nodes and multitopic organic linkers. Because of their molecular-scale porosity and periodic intraframework chemical functionality, MOFs are attractive scaffolds for supporting and/or organizing catalysts, photocatalysts, chemical-sensing elements, small enzymes, and numerous other functional-property-imparting, nanometer-scale objects. Notably, these objects can be installed after the synthesis of the MOF, eliminating the need for chemical and thermal compatibility of the objects with the synthesis milieu. Thus, postsynthetically functionalized MOFs can present three-dimensional arrays of high-density, yet well-separated, active sites. Depending on the application and corresponding morphological requirements, MOF materials can be prepared in thin-film form, pelletized form, isolated single-crystal form, polycrystalline powder form, mixed-matrix membrane form, or other forms. For certain applications, most obviously catalytic hydrolysis and electro- or photocatalytic water splitting, but also many others, an additional requirement is water stability. MOFs featuring hexa-zirconium(IV)-oxy nodes satisfy this requirement. For applications involving electrocatalysis, charge storage, photoelectrochemical energy conversion, and chemiresistive sensing, a further requirement is electrical conductivity, as embodied in electron or hole transport. As most MOFs, under most conditions, are electrically insulating, imparting controllable charge-transport behavior is both a chemically intriguing and chemically compelling challenge. Herein, we describe three strategies to render zirconium-based metal–organic frameworks (MOFs) tunably electrically conductive and, therefore, capable of transporting charge on the few nanometers (i.e., several molecular units) to few micrometers (i.e., typical dimensions for MOF microcrystallites) scale. The first strategy centers on redox-hopping between periodically arranged, chemically equivalent sites, essentially repetitive electron (or hole) self-exchange. Zirconium nodes are electrically insulating, but they can function as grafting sites for (a) redox-active inorganic clusters or (b) molecular redox couples. Alternatively, charge hopping based on linker redox properties can be exploited. Marcus’s theory of electron transfer has proven useful for understanding/predicting trends in redox-hopping based conductivity, most notably, in accounting for variations as great as 3000-fold depending on the direction of charge propagation through structurally anisotropic MOFs. In MOF environments, propagation of electronic charge via redox hopping is necessarily accompanied by movement of charge-compensating ions. Consequently, rates of redox hopping can depend on both the identity and concentration of ions permeating the MOF. In the context of electrocatalysis, an important goal is to transport electronic charge fast enough to match or exceed the inherent activity of MOF-based or MOF-immobilized catalysts. Bandlike electronic conductivity is the focus of an alternative strategy: one based on the introduction of molecular guests capable of forming donor–acceptor charge transfer complexes with the host framework. Theory again can be applied predictively to alter conductivity. A third strategy similarly emphasizes electronic conductivity, but it makes use of added bridges in the form of molecular oligomers or inorganic clusters that can then be linked to span the length of a MOF crystallite. For all strategies, retention of molecular-scale porosity is emphasized, as this property is key to many applications. Lastly, while our focus is on Zr-MOFs, the described approaches clearly are extendable to other MOF compositions, as has already been demonstrated, in part, in studies by others.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Postsynthetic Oxidation of the Coordination Site in a Heterometallic Metal-Organic Framework: Tuning Catalytic Behaviors

Postsynthetic modification (PSM) in metal-organic frameworks (MOFs) can introduce multiple functionalities and alter the structural function for the desired application. However, the PSM of the coordination site faces the challenges of structural collapse or incompatibility between the original metal site and the newly formed coordination group. Herein, we developed a novel concept of introducing “primary” and “secondary” nodes, coexisting in a water-stable, Zr-based heterometallic MOF, [Zr6(µ3-OH)8(OH)8][CuI4(L1)4]2 (1-SH-a, H2L1 = 6-mercaptopyridine-3-carboxylic acid). The post-synthetic oxidation at the coordination site was successfully achieved in the “secondary” nodes [CuI4(L1)4]4-, while the robust “primary” nodes [Zr6(µ3-OH)8(OH)8]8+ stabilized the whole framework to form [Zr6(µ3-OH)8(OH)8][(CuI0.44CuII0.56(OH)0.56)4(L2)4]2 (1-SO3H, H2L2 = 6-sulfonicotinic acid). PSM of 1-SH-a to form 1-SO3H dramatically tuned the catalytic properties toward the styrene oxide ring-opening reaction to give a regioselectivity of primary alcohol (A) of ~99% compared with 1-SH-a (~71%).

Han, Yi↗

Complex Dirac-like Electronic Structure in Atomic Site-Ordered Rh 3 In 3.4 Ge 3.6

We report the synthesis via an indium flux method of a novel single-crystalline compound Rh 3 In 3.4 Ge 3.6 that belongs to the cubic Ir 3 Ge 7 structure type. In Rh 3 In 3.4 Ge 3.6 , the In and Ge atoms preferentially occupy, respectively, the 12d and 16f sites of the Im3¯m space group, thus creating a colored variant of the Ir 3 Ge 7 structure. Like the other compounds of the Ir 3 Ge 7 family, Rh 3 In 3.4 Ge 3.6 shows potential as a thermoelectric, displaying a relatively large power factor, PF ~ 2 mW/cm K 2 , at a temperature T ~ 225 K, albeit showing a modest figure of merit, ZT = 8 x 10 -4 , because of the lack of a finite band gap. These figures might improve through a use of chemical substitution strategies to achieve band gap opening. Remarkably, electronic band structure calculations reveal that this compound displays a complex Dirac-like electronic structure relatively close to the Fermi level. The electronic structure is composed of several Dirac type-I and type-II nodes, and even Dirac type-III nodes that result from the touching between a flat band and a linearly dispersing band. Here, this rich Dirac-like electronic dispersion suggests the possibility to observe experimentally Dirac type-III nodes and study their role in the physical properties of Rh 3 In 3.4 Ge 3.6 and related Ir 3 Ge 7 -type materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Role of Metal Selection in the Radiation Stability of Isostructural M-UiO-66 Metal–Organic Frameworks

Robust and versatile metal–organic frameworks (MOFs) have emerged as sophisticated scaffolds to meet the critical needs of the nuclear community, but their performance depends on their underexplored structural integrities in high- radiation fields. The contributions of selected metal nodes in the radiation stability of MOFs within the isostructural M-UiO-66 series (where M = Zr, Ce, Hf, Th, and Pu; Zr-UiO-66 experiments were executed in a previous work) have been determined. Ce-, Hf-, and Th-UiO-66 MOF samples were irradiated via gamma and He-ion methodologies to obtain doses up to 3 MGy and 85 MGy, respectively, the latter strikingly higher than that obtained in most other studies. Appreciable self-irradiation constituted the total absorbed doses, up to 31 MGy of the gamma-irradiated Pu-UiO-66 samples. Structural degradation was ascertained by powder X-ray diffraction, X-ray total scattering, vibrational spectroscopy, and, where possible, N 2 physisorption isotherms. Diffuse reflectance infrared Fourier transform spectroscopy provided atomic-level mechanistic insights to reveal that the node-linker connection was most susceptible to radiation damage. Density functional theory calculations were performed on cluster models to evaluate the binding energy of the linkers to each metal node. Here, while the isostructures disclosed the same breakdown signatures, distinct radiation sensitivity as a function of metal selection was evident and followed the trend Hf-UiO-66 ~ Zr-UiO-66 > Th-UiO-66 > Pu-UiO-66 > Ce-UiO-66. We anticipate that these endeavors will contribute to the rational design of radiation-resistant materials for targeted applications.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Zirconium-Based Metal–Organic Frameworks as Reusable Antibacterial Peroxide Carriers for Protective Textiles

Countries around the world have sought efficient protective coverings, including masks, gowns, and fabrics, for air purification to protect people against infectious diseases. However, the demand for significant quantities of disposable protective textiles poses a global challenge, especially when the production of protective gear is suspended due to COVID-19 outbreaks in factories and along supply lines. Therefore, the development of reusable, self-decontaminating protective masks and coverings loaded with disinfectants, such as antibacterial peroxide species, presents an attractive strategy to fight against bacteria risks. In this work, we incorporated persulfate ions, which serve as stable active peroxide precursors, into two porous zirconium-based metal–organic frameworks (Zr-MOFs), enabling these materials to act as regenerable reservoirs for the slow release of biocidal hydrogen peroxide upon hydrolysis by contact with humid air. Single-crystal X-ray diffraction studies reveal the two different coordination motifs for the persulfate ions, which can either bridge between two adjacent nodes or coordinate to a single node depending on both the node connectivity and the distances between open metal sites. The active peroxide precursors within the porous Zr-MOF carriers are stable during storage and easily regenerated once consumed. Importantly, these persulfate-loaded Zr-MOFs can be integrated onto textiles using a facile aqueous in-situ growth procedure, and these composites demonstrate potent and reusable biocidal activity against both Gram-negative bacteria and Gram-positive bacteria. Altogether, this approach presents a viable strategy to develop robust protective textiles capable of rapidly deactivating pathogens.

36 MATERIALS SCIENCE↗

Benders Decomposition Using Graph Modeling and Multi-Parametric Programming

Benders decomposition is a widely used method for solving large and structured optimization problems, but its performance is affected by the repeated solution of subproblems. We propose a flexible and modular algorithmic framework for accelerating Benders decomposition. Specifically, we express the problem structure by using a graph-theoretic modeling abstraction in which nodes represent optimization subproblems and edges represent connectivity between subproblems. A key innovation of our approach is that we embed multiparametric programming (mp) surrogates for node subproblems, which maps the exact analytical map of the subproblem solution space. The use of mp surrogates allows us to replace subproblem solves with fast look-ups and function evaluations for primal and dual variables during the iterative Benders process. We formally show the equivalence between classical Benders cuts and those derived from the mp solution. We implement our framework in the open-source PlasmoBenders.jl software package. To demonstrate the capabilities of the proposed framework, we apply it to a two-stage stochastic programming problem, which aims to make optimal capacity expansion decisions under market uncertainty. We evaluate both single-cut and multicut variants of Benders decomposition and show that the use of mp surrogates achieves substantial speedups in subproblem solve time, while preserving the convergence guarantees of Benders decomposition. We highlight advantages in solution analysis and interpretability that is enabled by mp critical region tracking; specifically, we show that these reveal how decisions evolve geometrically across the Benders search. Our results aim to demonstrate that combining surrogate modeling with graph modeling offers a promising and extensible foundation for structure-exploiting decomposition. In addition, by decomposing the problem into more tractable subproblems, the proposed approach also aims to overcome scalability issues of mp. Finally, the use of mp surrogates provides a unifying and modular optimization framework that enables the representation of heterogeneous node subproblems as modeling objects with a homogeneous structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Photochemical CO 2 Reduction by a Postsynthetically Modified Zr-MOF

Metal–organic frameworks are an excellent platform for photochemical CO 2 reduction into valuable chemicals. Herein, we report the synthesis and photocatalytic behavior of Ru@MOF-808, a Zr-based MOF, modified with a Ru-polypyridyl complex. The postsynthetic modification was achieved using solvent-assisted incorporation of bipyridine–carboxylate ligands onto the nodes of the MOF-808, followed by the coordination of Ru­(II)-terpyridine moiety. A thorough characterization including 1 H NMR, diffuse reflectance UV/vis, X-ray absorption spectroscopy and gas adsorption studies, combined with DFT calculations, provides strong support for efficient incorporation of the molecular Ru-complex at the loading of one Ru center per node. In the presence of a strong sacrificial reductant BIH, Ru@MOF-808 was found to catalyze the photochemical reduction of CO 2 into a mixture of CO and formate ion. When compared to the homogeneous model catalyst Ru­(tpy)­(bpy) 2+ , Ru@MOF-808 was found to exhibit higher formate yields. Additionally, to explain these formate enhancements, we propose a mechanism that involves CO 2 capture at the MOF nodes to form Zr-bicarbonate species, which further react in a hydride transfer reaction with photogenerated Ru–H donor, thereby outperforming molecular catalysts in HCOO – production. Overall, the results presented in this work indicate the potential of Zr-based MOFs in integrating CO 2 capture with its photochemical conversion to desired products.

CO2 reduction↗