Search NASA⌕ Search

SEARCH · Search NASA

Results for “cluster computer”

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

Nanocluster Active Sites Formed on Heterogeneous Thermal Catalysts and Electrocatalysts by Operando Reactive Environments

Here, in this Viewpoint, we summarize our recent studies in this endeavor, ending with a forward-looking perspective into the remaining challenges and open questions for consideration by the catalysis community. Through a computationally efficient framework of systematically investigating metal atom ejection from and migration onto metal surfaces, leading to the formation of metal atom clusters, we show that the surface of a metal catalyst is dynamic and much less rigid than previously thought. We suggest that the operando formed metal atom clusters are novel active sites, which can dominate the activity of steps or kinks (let aside terraces) from where their constituent atoms were ejected. Through more readily responding to reaction conditions by forming catalytically active clusters, solid metal catalysts approach not only homogeneous catalyst motifs, thus establishing a bridge between homogeneous and heterogeneous catalysis, but also liquid metals which have been suggested to be better than traditional heterogeneous catalysts.

adsorption↗

Multi-GPU porting of a phase-change cascaded lattice Boltzmann method for three-dimensional pool boiling simulations

The Lattice Boltzmann method (LBM) has proven effective in simulating phase-change phenomena, such as melting, solidification, evaporation, and boiling. In this work, we develop a highly parallelized multi-GPU implementation of LBM for three-dimensional pool boiling simulations. The code is based on the OpenACC programming model, which enables the code to be deployed efficiently on multi-core CPUs, GPUs, and potentially other accelerators, without the need for architecture-specific rewrites. To support large-scale simulations, the domain is decomposed and distributed across multiple compute nodes using MPI. We demonstrate that the code exhibits excellent scaling properties, with ideal strong-scaling running with up to 256 GPUs on the MareNostrum5 cluster.

97 MATHEMATICS AND COMPUTING↗

Suppressing the sample variance of DESI-like galaxy clustering with fast simulations

Ongoing and upcoming galaxy redshift surveys, such as the Dark Energy Spectroscopic Instrument (DESI) survey, will observe vast regions of sky and a wide range of redshifts. In order to model the observations and address various systematic uncertainties, N-body simulations are routinely adopted, however, the number of large simulations with sufficiently high mass resolution is usually limited by available computing time. Therefore, achieving a simulation volume with the effective statistical errors significantly smaller than those of the observations becomes prohibitively expensive. In this study, we apply the Convergence Acceleration by Regression and Pooling (CARPool) method to mitigate the sample variance of the DESI-like galaxy clustering in the AbacusSummit simulations, with the assistance of the quasi-N-body simulations FastPM. Based on the halo occupation distribution (HOD) models, we construct different FastPM galaxy catalogs, including the luminous red galaxies (LRGs), emission line galaxies (ELGs), and quasars, with their number densities and two-point clustering statistics well matched to those of AbacusSummit. We also employ the same initial conditions between AbacusSummit and FastPM to achieve high cross-correlation, as it is useful in effectively suppressing the variance. Our method of reducing noise in clustering is equivalent to performing a simulation with volume larger by a factor of 5 and 4 for LRGs and ELGs, respectively. We also mitigate the standard deviation of the LRG bispectrum with the triangular configurations k 2 = 2k 1 = 0.2 h Mpc -1 by a factor of 1.6. With smaller sample variance on galaxy clustering, we are able to constrain the baryon acoustic oscillations (BAO) scale parameters to higher precision. The CARPool method will be beneficial to better constrain the theoretical systematics of BAO, redshift space distortions (RSD) and primordial non-Gaussianity (NG).

79 ASTRONOMY AND ASTROPHYSICS↗

Catalytic Activity of an Ensemble of Sites for CO 2 Hydrogenation to Methanol on a ZrO 2 -on-Cu Inverse Catalyst

The significant increase in CO 2 emissions from heavy fossil fuel utilization has raised serious concerns, highlighting the need for effective methods to convert CO 2 into value-added chemicals. Here, in this work, we report a computational investigation on the catalytic activity of ZrO 2 -on-Cu inverse catalysts for CO 2 hydrogenation to methanol, considering highly dispersed ZrO 2 trimers on Cu (111). Such clusters present a large ensemble of formate-containing configurations, Zr 3 O n (OH) m (OCHO) l , making the evaluation of the catalytic activity very challenging. We found that the sites on the various catalyst configurations exhibit markedly different activities for formate hydrogenation, despite their similar free energy and composition. To understand these differences in reactivity, we examined the structural and electronic nature of the low free-energy catalyst configurations and identified that the energy of the lowest unoccupied orbital of the reacting formate, modified by its binding with the catalytic site, is a descriptor for the reaction energy of the formate hydrogenation step. From there, we screened an ensemble of catalyst structures using this descriptor to predict highly active metastable catalyst configurations and computed the reaction pathways and transition states for formate hydrogenation. From this investigation, we distinguished reactive from nonreactive sites and formate species on the ZrO 2 /Cu inverse catalyst based on structural and electronic features. We showed that rare metastable configurations control the activity. Additionally, an efficient method for examining the reactivity of a large number of coexisting catalyst structures was developed.

catalysts↗

Accuracy, transferability, and computational efficiency of interatomic potentials for simulations of carbon under extreme conditions

Large-scale atomistic molecular dynamics (MD) simulations provide an exceptional opportunity to advance the fundamental understanding of carbon under extreme conditions of high pressures and temperatures. However, the fidelity of these simulations depends heavily on the accuracy of classical interatomic potentials governing the dynamics of many-atom systems. Here, this study critically assesses several popular empirical potentials for carbon, as well as machine learning interatomic potentials (MLIPs), in their ability to simulate a range of physical properties at high pressures and temperatures, including the diamond equation of state, its melting line, shock Hugoniot, uniaxial compressions, and the structure of liquid carbon. Empirical potentials fail to accurately predict the behavior of carbon under high pressure–temperature conditions. In contrast, MLIPs demonstrate quantum accuracy, with Spectral Neighbor Analysis Potential (SNAP) and atomic cluster expansion (ACE) being the most accurate in reproducing the density functional theory results. ACE displays remarkable transferability despite not being specifically trained for extreme conditions. Furthermore, ACE and SNAP exhibit superior computational performance on graphics processing unit-based systems in billion atom MD simulations, with SNAP emerging as the fastest. In addition to offering practical guidance in selecting an interatomic potential with a fine balance of accuracy, transferability, and computational efficiency, this work also highlights transformative opportunities for groundbreaking scientific discoveries facilitated by quantum-accurate MD simulations with MLIPs on emerging exascale supercomputers.

36 MATERIALS SCIENCE↗

Iodine recombination in xenon solvent: Clusters in the gas to liquid-like state transition

Supercritical fluids (SCFs) have attracted significant attention as solvents for chemical reactions due to their unique properties, such as high diffusivity, low viscosity, and tunable solvation properties. These properties profoundly influence reaction kinetics and are often attributed to the formation of molecular clusters within SCFs. To study the effect of supercritical solvent on chemical reactivity and dynamics of reactions, one needs to understand the dynamics of clusters in supercritical fluid. Extensive experiments on the photodissociation and recombination of iodine in supercritical fluids served as a model system for understanding these effects. Experimental studies have been complemented by theoretical and computational investigations, which mostly employ Monte Carlo or empirical molecular dynamics simulations. However, computational studies using non-reactive force fields and ab initio approaches present challenges in capturing reactive processes at larger scales within supercritical fluids. Here, in this work, we developed the ReaxFF parameters by training against quantum mechanics data. ReaxFF reactive force field based molecular dynamics simulations were performed, studying the dynamics of a xenon solvent and cage effect at different thermodynamic conditions for the iodine recombination reaction. We show that the conditions near the critical point are the optimal conditions to study the cage effect. We show that the average lifetime of xenon clusters ranging between 5 and 11 ps is comparable to iodine geminate recombination. Our simulation results of iodine recombination in xenon solvent demonstrate the higher probability of iodine molecule formation in the presence of xenon clusters. Finally, we show that the supercritical condition exhibits the highest recombination rate for iodine atoms.

Cage effect↗

Fusion and Fission Energy and Science Directorate and Information Technology Services Directorate HPC Cluster Reduction, Consolidation, and Savings in Data Center Space, Power, and Cooling

This report evaluates the benefits of decommissioning six legacy FFESD purchased HPC clusters and consolidating services and workloads into a new HPC cluster named HELIOS. The findings demonstrate significant reductions in the data center power and cooling requirements, data center footprint, and operational overhead, while simultaneously increasing computational capacity.

97 MATHEMATICS AND COMPUTING↗

Active-noise-induced dynamic clustering of passive colloidal particles

Active fluids generate spontaneous, often chaotic mesoscale flows. Harnessing these flows to drive soft materials embedded within an active fluid into structures with controlled length scales and lifetimes is a key challenge at the interface between the fields of active matter and nonequilibrium self-assembly. Here, we present a simple and efficient computational approach to model soft materials advected by active fluids, by simulating particles moving in a spatiotemporally correlated noise field. To illustrate our approach, we simulate the dynamical self-organization of repulsive colloids within such an active noise field. The colloids form structures whose sizes and dynamics can be tuned by the correlation time and length of the active fluid, and range from small rotating droplets to clusters with internal flows and system-spanning sizes that vastly exceed the active correlation length. Our results explain how the interplay between active fluid time and length scales and emergent driven assembly can be used to rationally design functional assemblies. More broadly, our approach can be used to efficiently simulate diverse active fluids and other systems with spatiotemporally correlated noise.

Brownian dynamics↗

High-Purity Quantum Emission from an Au 24 (S-CH 2 Ph- t Bu) 20 Nanocluster at Room Temperature

Atomically precise gold nanoclusters have garnered significant attention for their diverse applications, ranging from biological labeling to optoelectronics. Their potential in optical quantum computing, which calls for ideal single-photon sources, has recently become a key area of interest. In the current work, we use photon antibunching experiments to explore the single-photon emission efficiency of atomically precise Au 24 nanoclusters protected by 4-tert-butylbenzyl mercaptan ligands (Au 24 (TBBM) 20 ). This cluster exhibits quantum emission with good photostability and without any observable blinking or spectral drift at room temperature under an inert gas atmosphere, with antibunching dips (g 2 (0)) as low as 0.07 in the solid state or, equivalently, a single-photon purity of 93% under time-gated conditions. Transient absorption and time-gated antibunching studies reveal that the short emission lifetime of this cluster and its high photoluminescence quantum yield in the solid state play critical roles in enhancing the emitted single-photon purity. This research advances the understanding of single-emitter behavior in atomically precise gold nanoclusters, contributing to the development of stable quantum emitters that are essential for quantum computing and cryptography.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Non-smooth Bayesian optimization in tuning scientific applications

Tuning algorithmic parameters to optimize the performance of large, complicated computational codes is an important problem involving finding the optima and identifying regimes defined by non-smooth boundaries in black-box functions. Within the Bayesian optimization framework, the Gaussian process surrogate model produces smooth mean functions, but functions in the tuning problem are often non-smooth, which is exacerbated by the fact that we usually have limited sequential samples from the black-box function. Here, motivated by these issues encountered in tuning, we propose a novel Gaussian process model called a clustered Gaussian process (cGP), where the components are dynamically updated by clustering. In our studies, the performance of cGP can be better than stationary GPs in nearly 90% of the experiments and better than non-stationary GPs in nearly 70% of the repeated experiments while requiring less computational cost. cGP provides a novel approach for dynamic GP, computes more efficiently than recursive partitioning, and discovers non-smoothness regimes. We provide extensive experiments including high-performance computing (HPC) and industrial simulation functions to show the effectiveness of our methods.

97 MATHEMATICS AND COMPUTING↗

Hijacking a rapid and scalable metagenomic method reveals subgenome dynamics and evolution in polyploid plants

Premise: The genomes of polyploid plants archive the evolutionary events leading to their present forms. However, plant polyploid genomes present numerous hurdles to the genome comparison algorithms for classification of polyploid types and exploring genome dynamics. Methods: Here, the problem of intra- and inter-genome comparison for examining polyploid genomes is reframed as a metagenomic problem, enabling the use of the rapid and scalable MinHashing approach. To determine how types of polyploidy are described by this metagenomic approach, plant genomes were examined from across the polyploid spectrum for both k-mer composition and frequency with a range of k-mer sizes. In this approach, no subgenome-specific k-mers are identified; rather, whole-chromosome k-mer subspaces were utilized. Results: Given chromosome-scale genome assemblies with sufficient subgenome-specific repetitive element content, literature-verified subgenomic and genomic evolutionary relationships were revealed, including distinguishing auto- from allopolyploidy and putative progenitor genome assignment. The sequences responsible were the rapidly evolving landscape of transposable elements. An investigation into the MinHashing parameters revealed that the downsampled k-mer space (genomic signatures) produced excellent approximations of sequence similarity. Furthermore, the clustering approach used for comparison of the genomic signatures is scrutinized to ensure applicability of the metagenomics-based method. Discussion: The easily implementable and highly computationally efficient MinHashing-based sequence comparison strategy enables comparative subgenomics and genomics for large and complex polyploid plant genomes. Such comparisons provide evidence for polyploidy-type subgenomic assignments. In cases where subgenome-specific repeat signal may not be adequate given a chromosomes' global k-mer profile, alternative methods that are more specific but more computationally complex outperform this approach.

59 BASIC BIOLOGICAL SCIENCES↗

Physics-based reward driven image analysis in microscopy

The rise of electron microscopy has expanded our ability to acquire nanometer and atomically resolved images of complex materials. The resulting vast datasets are typically analyzed by human operators, an intrinsically challenging process due to the multiple possible analysis steps and the corresponding need to build and optimize complex analysis workflows. We present a methodology based on the concept of a Reward Function coupled with Bayesian Optimization, to optimize image analysis workflows dynamically. The Reward Function is engineered to closely align with the experimental objectives and broader context and is quantifiable upon completion of the analysis. Here, cross-section, high-angle annular dark field (HAADF) images of ion-irradiated (Y, Dy)Ba 2 Cu 3 O 7–δ thin-films were used as a model system. The reward functions were formed based on the expected materials density and atomic spacings and used to drive multi-objective optimization of the classical Laplacian-of-Gaussian (LoG) method. These results can be benchmarked against the DCNN segmentation. This optimized LoG* compares favorably against DCNN in the presence of the additional noise. We further extend the reward function approach towards the identification of partially-disordered regions, creating a physics-driven reward function and action space of high-dimensional clustering. We pose that with correct definition, the reward function approach allows real-time optimization of complex analysis workflows at much higher speeds and lower computational costs than classical DCNN-based inference, ensuring the attainment of results that are both precise and aligned with the human-defined objectives.

47 OTHER INSTRUMENTATION↗

Lieb-Robinson Bounds with Exponential-in-Volume Tails

Lieb-Robinson bounds demonstrate the emergence of locality in many-body quantum systems. Intuitively, Lieb-Robinson bounds state that, with local or exponentially decaying interactions, the correlation that can be built up between two sites separated by distance 𝑟 after a time 𝑡 decays as exp (𝑣⁢𝑡 −𝑟), where 𝑣 is the emergent Lieb-Robinson velocity. In many problems, it is important to also capture how much of an operator grows to act on 𝑟 𝑑 sites in 𝑑 spatial dimensions. Perturbation theory and cluster expansion methods suggest that, at short times, these volume-filling operators are suppressed as exp (−𝑟 𝑑 ). We confirm this intuition, showing that, for 𝑟 >𝑣⁢𝑡, the volume-filling operator is suppressed by exp (−(𝑟−𝑣⁢𝑡) 𝑑 /(𝑣⁢𝑡) 𝑑−1 ). This closes a conceptual and practical gap between the cluster expansion and the Lieb-Robinson bound. We then present two very different applications of this new bound. Firstly, we obtain improved bounds on the classical computational resources necessary to simulate many-body dynamics with error tolerance 𝜀 for any finite time 𝑡: as 𝜀 becomes sufficiently small, only 𝜀 −O⁡(𝑡 𝑑−1 ) resources are needed. A protocol that likely saturates this bound is given. Secondly, we prove that disorder operators have volume-law suppression near the “solvable (Ising) point” in quantum phases with spontaneous symmetry breaking, which implies a new diagnostic for distinguishing many-body phases of quantum matter.

computational complexity↗

Leading Axion-Photon Sensitivity with NuSTAR Observations of M82 and M87

Here, we perform one of the most sensitive searches to date for the existence of ultralight axions using data from the NuSTAR telescope. We search for stellar axion production in the M82 starburst galaxy and the M87 central galaxy of the Virgo cluster and then the subsequent conversion into hard x-rays in the surrounding magnetic fields. We sum over the full stellar populations in these galaxies when computing the axion luminosity, and we account for the conversion of axions to photons by using magnetic field profiles in simulated IllustrisTNG analog galaxies. We show that analyzing NuSTAR data toward these targets between roughly 30 and 70 keV shows no evidence for axions and leads to robust constraints on the axion-photon coupling at the level of |𝑔𝑎⁢𝛾⁢𝛾| ≲ 7.8 × 10 −13 GeV −1 for 𝑚 𝑎 ≲ 10 −10 eV at 95% confidence.

Axions↗

Low‐dimensional manifold learning for uncertainty quantification in complex multi‐scale stochastic systems

Broadly speaking, the goals of the project are to develop techniques to use manifold learning to develop reduced‐order and surrogate models for "hyper‐reduction" of very high‐dimensional complex multi‐scale systems. This is being achieved by employing a newly proposed form of manifold projection and learning that leverages recent advancements in computational geometry and data‐driven modeling. In particular, we are applying a manifold projection technique to project the solutions of very high‐dimensional systems onto the so‐called Grassmannmanifold, a Reimannian manifold comprised of orthonormal matrices. We then apply data‐driven machine learning techniques to classify the solutions on the manifold (e.g. clustering techniques) according to their proximity on the manifold and leverage a further nonlinear dimension reduction to organize the structured data on the manifold. Finally, we are developing novel techniques that enable us to directly interpolate the hyper‐reduced data such that we can predict the solution of the complex, high‐ dimensional system without need to call the full expensive computational model. Given their adherence to the underlying structure of the solution of the physical system, it is expected that these approximate solutions will be sufficiently constrained so as to (approximately) adhere to physical principles.

97 MATHEMATICS AND COMPUTING↗

Materials Learning Algorithms (MALA): Scalable machine learning for electronic structure calculations in large-scale atomistic simulations

We present the Materials Learning Algorithms (MALA) package, a scalable machine learning framework designed to accelerate density functional theory (DFT) calculations suitable for large-scale atomistic simulations. Using local descriptors of the atomic environment, MALA models efficiently predict key electronic observables, including local density of states, electronic density, density of states, and total energy. The package integrates data sampling, model training and scalable inference into a unified library, while ensuring compatibility with standard DFT and molecular dynamics codes. We demonstrate MALA's capabilities with examples including boron clusters, aluminum across its solid-liquid phase boundary, and predicting the electronic structure of a stacking fault in a large beryllium slab. Scaling analyses reveal MALA's computational efficiency and identify bottlenecks for future optimization. With its ability to model electronic structures at scales far beyond standard DFT, MALA is well suited for modeling complex material systems, making it a versatile tool for advanced materials research.

Density functional theory↗

Beyond CCSD(T) Accuracy at Lower Scaling with Auxiliary Field Quantum Monte Carlo

We introduce a black-box auxiliary field quantum Monte Carlo (AFQMC) approach to perform highly accurate electronic structure calculations using configuration interaction singles and doubles (CISD) trial states. This method consistently provides more accurate energy estimates than coupled cluster singles and doubles with perturbative triples (CCSD(T)), often regarded as the gold standard in quantum chemistry. This level of precision is achieved at a lower asymptotic computational cost, scaling as O(N 6 ) compared to the O(N 7 ) scaling of CCSD(T). Furthermore, we provide numerical evidence supporting these findings through results for challenging main group and transition metal-containing molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗