HPC OpenShift Cluster & Stackrox Demonstration
Explore the source record for details and available documents.
Computer Science↗
SEARCH · Search NASA
Results for “Cluster Computing”
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.
Ground state property calculations of LiH n complexes using IBM Qiskit’s quantum simulator
In this study, the variational quantum eigensolver (VQE) on a quantum simulator is used in calculating ground state electronic structure properties of the LiH n , n = 1–3, complexes including their singly charged ions. Results calculated using classical electronic structure algorithms are also included. We investigate the use of the unitary coupled cluster with singles and doubles (UCCSD) Ansatz using VQE within Qiskit and compare results to full configuration interaction (FCI) calculations. Computed ground state energies, electron affinities, ionization potentials, and dipole moments are considered. We report the first-of-its-kind simulated quantum computing results of selected LiH n species and use the parity orbital to qubit mapping scheme. We find that VQE/UCCSD results are comparable to classical coupled clusters with singles and doubles for all considered systems with respect to FCI. A VQE calculation cost evaluation is included in which we evaluate performance using both Jordan–Wigner and parity orbital to qubit mapping schemes. We also discuss some of the current limitations of utilizing VQE for the study of chemical systems.
97 MATHEMATICS AND COMPUTING↗
Scalable Tensor Methods for Nonuniform Hypergraphs
While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.
97 MATHEMATICS AND COMPUTING↗
Decentralized Formation Flying Control in a Multiple-Team Hierarchy
This paper presents the prototype of a system that addresses these objectives-a decentralized guidance and control system that is distributed across spacecraft using a multiple-team framework. The objective is to divide large clusters into teams of manageable size, so that the communication and computational demands driven by N decentralized units are related to the number of satellites in a team rather than the entire cluster. The system is designed to provide a high-level of autonomy, to support clusters with large numbers of satellites, to enable the number of spacecraft in the cluster to change post-launch, and to provide for on-orbit software modification. The distributed guidance and control system will be implemented in an object-oriented style using MANTA (Messaging Architecture for Networking and Threaded Applications). In this architecture, tasks may be remotely added, removed or replaced post-launch to increase mission flexibility and robustness. This built-in adaptability will allow software modifications to be made on-orbit in a robust manner. The prototype system, which is implemented in MATLAB, emulates the object-oriented and message-passing features of the MANTA software. In this paper, the multiple-team organization of the cluster is described, and the modular software architecture is presented. The relative dynamics in eccentric reference orbits is reviewed, and families of periodic, relative trajectories are identified, expressed as sets of static geometric parameters. The guidance law design is presented, and an example reconfiguration scenario is used to illustrate the distributed process of assigning geometric goals to the cluster. Next, a decentralized maneuver planning approach is presented that utilizes linear-programming methods to enact reconfiguration and coarse formation keeping maneuvers. Finally, a method for performing online collision avoidance is discussed, and an example is provided to gauge its performance.
Mueller, Joseph .↗
Multiscale modelling of evolving foams
We present a set of multi-scale interlinked algorithms to model the dynamics of evolving foams. These algorithms couple the key effects of macroscopic bubble rearrangement, thin film drainage, and membrane rupture. For each of the mechanisms, we construct consistent and accurate algorithms, and couple them together to work across the wide range of space and time scales that occur in foam dynamics. These algorithms include second order finite difference projection methods for computing incompressible fluid flow on the macroscale, second order finite element methods to solve thin film drainage equations in the lamellae and Plateau borders, multiphase Voronoi Implicit Interface Methods to track interconnected membrane boundaries and capture topological changes, and Lagrangian particle methods for conservative liquid redistribution during rearrangement and rupture. We derive a full set of numerical approximations that are coupled via interface jump conditions and flux boundary conditions, and show convergence for the individual mechanisms. We demonstrate our approach by computing a variety of foam dynamics, including coupled evolution of three-dimensional bubble clusters attached to an anchored membrane and collapse of a foam cluster.
97 MATHEMATICS AND COMPUTING↗
Distributed seams for gigapixel panoramas
Gigapixel panoramas are an increasingly popular digital image application. They are often created as a mosaic of many smaller images. The mosaic acquisition can take many hours causing the individual images to differ in exposure and lighting conditions. A blending operation is often necessary to give the appearance of a seamless image. The blending quality depends on the magnitude of discontinuity along the image boundaries. Often, new boundaries, or seams, are first computed that minimize this transition. Current techniques based on multi-labeling Graph Cuts are too slow and memory intensive for gigapixel sized panoramas. In this paper, we present a parallel, out-of-core seam computing technique that is fast, has small memory footprint, and is capable of running efficiently on different types of parallel systems. Its maximum memory usage is configurable, in the form of a cache, which can improve performance by reducing redundant disk I/O and computations. It shows near-perfect scaling on symmetric multiprocessing systems and good scaling on clusters and distributed shared memory systems. Lastly, our technique improves the time required to compute seams for gigapixel imagery from many hours (or even days) to just a few minutes, while still producing boundaries with energy that is on-par with Graph Cuts.
97 MATHEMATICS AND COMPUTING↗
Benchmarking third-order cluster perturbation theory for electronically excited states
In this study, we investigate the reliability of cluster perturbation (CP) theory applied to the calculation of electronically excited states through a comprehensive benchmark. In CP theory, perturbative corrections are added to the properties of a parent excitation space, which converge toward the properties of a target excitation space. For the CPS(D-n) model, perturbative corrections through order n are added to the coupled cluster singles (CCS) excitation energies to target the coupled cluster singles and doubles (CCSD) excitation energies. Through a comparative analysis of excitation energy calculations across a diverse set of molecules and wavefunction methods, we present a comprehensive evaluation of the accuracy of the third-order CPS(D) model, CPS(D-3), in calculating excitation energies. Further, our findings demonstrate that CPS(D-3) is a reliable alternative to established methods, particularly CCSD, while systematically overestimating the excitation energies compared to high-level coupled cluster methods such as CC3. These results highlight the strengths and limitations of CPS(D-3), as well as the promising directions for its future development.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Assessing Ground State Energy of Molecules and Energy Profile of the NH3 Capturing CO2 System Using the Quantum Computing Algorithms
Molecule size correlates with the number of electrons on electronic energies and strength of anharmonicity on vibrational properties, however, it is challenging to address using classical computing. In this study, variational quantum eigensolver (VQE) algorithm was implemented on a quantum simulator to quantify electronic and vibrational energies and reaction pathways of CO2 + NH3 = NH2COOH. The VQE-based Hartree-Fock-Embedding algorithm was adopted to benchmark electronic energies for a series of molecules (doi.org/10.1063/5.0188249) and quantify the reaction energy profile of the CO2 capture reaction (doi.org/10.1116/5.0137750). The generated reaction profile is in good agreement with the classical high-level Coupled-Cluster-Singles-and-Doubles (CCSD) results. The quantum computing algorithm also helps enhance the calculation of vibrational ground-state energies by considering the many-body coupling using the Vibrational Self-Consistent Field method, providing results for CO2 and NH3 molecules with accuracy comparable to the direct diagonalization method. Our approach indicates quantum computing can be applied to solve practical problems.
Lee, Yueh-Lin↗
Non-local corrections to the typical medium theory of Anderson localization
We use the recently developed finite cluster typical medium approach to study the Anderson localization transition in three dimensions. Applying our method to the box and binary alloy disorder distributions, we find a fast convergence with the cluster size. We demonstrate the importance of the typical medium environment and the non-local spatial correlations for the proper characterization of the localization transition. As the cluster size increases, our typical medium cluster method recovers the correct critical disorder strength for the transition. Our findings highlight the importance of the non-local cluster corrections for capturing the localization behavior of the mobility edge trajectories. Our results demonstrate that the typical medium cluster approach developed here provides a consistent and systematic description of the Anderson localization transition in the framework of the effective medium embedding schemes.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Proton transfer in acetaldehyde–water clusters mediated by a single water molecule
Proton transfer in aqueous media is a ubiquitous process, occurring in acid–base chemistry, biology, and in atmospheric photochemistry. Photoionization mass spectrometry coupled with theoretical calculations demonstrate that a relay-type proton transfer mechanism is operational for single-water-molecule-assisted proton transfer between two acetaldehyde molecules in the gas phase. Threshold photoionization of acetaldehyde–water clusters leads to proton transfer between the formyl groups (–CH=O) of one acetaldehyde molecule to another, and the subsequent formation of cationic moieties. Density functional theory computations reveal several plausible pathways of proton transfer in mixed cluster cations. Among these pathways, water-mediated proton transfer is energetically favored. Finally, mass spectra and photoionization efficiency curves confirm these theoretical findings and also demonstrate the increased stability of cluster cations where acetaldehyde molecules are symmetrically bonded to the hydronium ion.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
A DISTANT RADIO MINI-HALO IN THE PHOENIX GALAXY CLUSTER
We report the discovery of extended radio emission in the Phoenix cluster (SPT-CL J2344-4243, z = 0.596) with the Giant Metrewave Radio Telescope (GMRT) at 610 MHz. The diffuse emission extends over a region of at least 400-500 kpc and surrounds the central radio source of the Brightest Cluster Galaxy, but does not appear to be directly associated with it. We classify the diffuse emission as a radio mini-halo, making it the currently most distant mini-halo known. Radio mini-halos have been explained by synchrotron emitting particles re-accelerated via turbulence, possibly induced by gas sloshing generated from a minor merger event. Chandra observations show a non-concentric X-ray surface brightness distribution, which is consistent with this sloshing interpretation. The mini-halo has a flux density of 17 ± 5 mJy, resulting in a 1.4 GHz radio power of (10.4 ± 3.5) × 10{sup 24} W Hz{sup –1}. The combined cluster emission, which includes the central compact radio source, is also detected in a shallow GMRT 156 MHz observation and together with the 610 MHz data we compute a spectral index of –0.84 ± 0.12 for the overall cluster radio emission. Given that mini-halos typically have steeper radio spectra than cluster radio galaxies, this spectral index should be taken as an upper limit for the mini-halo.
79 ASTRONOMY AND ASTROPHYSICS↗
VoroClust: Scalable Clustering for Remote Sensing
Although supervised machine learning provides a powerful framework for image classification and segmentation, it requires comprehensive consistent datasets, which are not available for many remote-sensing applications. Remote-sensing datasets are expensive to collect, and each is acquired under different environmental conditions or with significant variations in system operating parameters. Unsupervised clustering algorithms analyze the structure of each dataset independently, rather than drawing on similarities with existing “training” examples, and are thus well suited for practical remote-sensing applications. We introduce VoroClust, a fast density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. VoroClust runs as fast as distance-based clustering methods, while capturing complex regional geometries at least as well as current-density-based methods. It uses a data-centered sphere cover to reduce computational demands, while still capturing data topology. It then propagates clusters outward from local peaks in density. We show that VoroClust provides fast state-of-the-art clustering for both high-resolution polarimetric synthetic aperture radar and high-dimensional hyperspectral imaging datasets.
42 ENGINEERING↗
Getting leverage on inflation with a large photometric redshift survey
We assess the potential of a future large-volume photometric redshift survey to constrain observational inflationary parameters using three large-scale structure observables: the angular shear and galaxy power spectra, and the cluster mass function measured through weak lensing. When used in combination with Planck-like CMB measurements, we find that the spectral index n{sub s} can be constrained to a 1 σ precision of up to 0.0025. The sensitivity to the running of the spectral index can potentially improve to 0.0017, roughly a factor of five better than the present 1σ constraint from Planck and auxiliary CMB data, allowing us to test the assumptions of the slow-roll scenario with unprecedented accuracy. Interestingly, neither CMB+shear nor CMB+galaxy nor CMB+clusters alone can achieve this level of sensitivity; it is the combined power of all three probes that conspires to break the different parameter degeneracies inherent in each type of observations. We make our forecast software publicly available via download or upon request from the authors.
79 ASTRONOMY AND ASTROPHYSICS↗
Photocatalytic Ammonia Synthesis using Fe-Based MOFs: The Role of Ligand Functionalization
Photocatalytic ammonia (NH 3 ) synthesis offers a carbon-neutral alternative to the Haber−Bosch process, which generates 42 million metric tons of CO 2 equivalent emissions annually. However, solar-to-ammonia conversion with contemporary photocatalysts remains far from practical requirements, and understanding the limiting factors in systems with well-defined active sites is crucial. Here, we show how the μ 3 -oxo-centered trinuclear Fe cluster in MIL-101(Fe) functions as the catalytic motif for N 2 -to-NH 3 conversion through combined experimental and computational investigations. Comparative studies with a molecular analogue demonstrate that the cluster is stabilized within the MOF framework, sustaining redox cycling and maintaining high catalytic activity. We systematically functionalized the dicarboxylate ligands of MIL-101(Fe) with −NH 2 , −Br, −NO 2 , −F, and −CF 3 to probe how ligand chemistry modulates Fe electron density, N 2 adsorption capacity, and proton availability, correlating these properties with catalytic performance using spectroscopic and surface characterization techniques alongside timeresolved infrared to assess excited-state lifetimes. F-functionalization optimally balances N 2 activation, proton availability at Fe active sites, and excited-state lifetimes, boosting NH 3 production by ∼ 60% relative to unmodified MIL-101(Fe). This study of ligandfunctionalized MIL-101(Fe) MOFs uncovers the underlying structure-activity relationships and advances design principles for solardriven NH 3 synthesis.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Mesh-based multiphysics coupling acceleration for fusion neutronics through clustering for fusion blanket applications
Accurate modeling of particle transport within fusion blankets is essential for predicting performance metrics such as heat deposition and the tritium breeding ratio (TBR). However, high-fidelity coupling of thermal fluids from computational fluid dynamics (CFD) to neutronics simulations often incurs significant computational costs due to the complexity of surface intersection calculations in Monte Carlo codes. This paper presents an accelerated multiphysics coupling method for neutronics that utilizes hierarchical agglomerative clustering to map complex material property distributions to a neutronics model. Implemented within the fusion reactor design and assessment (FREDA) framework, the method leverages existing Python packages to automate the creation of clustered geometries for OpenMC. The approach is demonstrated on a sector model of an ARC-class tokamak with an immersion molten salt blanket, and an simple geometry with varying isotopic concentrations. Results show that the clustering method significantly reduces computational burden without compromising fidelity, providing a foundation for agile iteration of neutronics simulations involving multiple coupled material properties.
Bae, Jin Whan [ORNL] (ORCID:0000000326548907)↗
Finite-size effects in periodic coupled cluster calculations
Here, we provide the first rigorous study of the finite-size error in the simplest and representative coupled cluster theory, namely the coupled cluster doubles (CCD) theory, for gapped periodic systems. Given exact Hartree-Fock orbitals and their corresponding orbital energies, we demonstrate that the correlation energy obtained from the approximate CCD method, after a finite number of fixed-point iterations over the amplitude equation, exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Here $N_k$ is the number of discretization points in the Brillouin zone and characterizes the system size. Under additional assumptions ensuring the convergence of the fixed-point iterations, we demonstrate that the CCD correlation energy also exhibits a finite-size error scaling as $\mathcal{O}(N^{-\frac{1}{3}}_k)$. Our analysis shows that the dominant error lies in the coupled cluster amplitude calculation, and the convergence of the finite-size error in energy calculation can be boosted to $\mathcal{O}(N^{-1}_k)$ with accurate amplitudes. This also provides the first proof of the scaling of the finite-size error in the third order Møller-Plesset perturbation theory (MP3) for periodic systems.
97 MATHEMATICS AND COMPUTING↗
A Chemist’s Guide to Solid-State Qubits: Diamond Color Centers as Embedded Vacancy-Centered Molecules
Diamond point defects or color centers are at the crux of solid-state quantum technology applications, from computing to sensing. Modeling molecular qubits has advanced by leaps and bounds mainly due to the advanced quantum mechanical (QM) tools in the arsenal of quantum chemists for modeling (isolated) molecular systems, which should be easily translatable for analogous systems in the solid state. Here, we simulate a series of diamond defects: a carbon vacancy (V C ) and second row substitutions that are adjacent to a V C or D C V C , with D = B, N, and O, to evaluate their magnetic and optical properties. We applied molecular orbital principles, an embedded cluster method, and a multiconfigurational QM theory to computationally characterize the above-mentioned defects for a multitude of spin, charge, and excited states. Our computational approach delivered high-quality QM insights that compare well with experiments. Furthermore, with this framework, we confirm the spin-triplets B C V C – and O C V C 0 to be analogous to N C V C – , with calculated bright transitions that respectively correspond to UV (3.80 eV) and blue (2.65 eV) light absorption and emission lifetimes (τ) of 2.3 and 5.6 ns, which are higher in energy and more short-lived (and thus brighter) than that for N C V C – : green (2.26 eV), τ = 9.5 ns.
Martirez, John Mark P. [Princeton Plasma Physics L↗
Analysis and Visualization of Discrete Fracture Networks Using a Flow Topology Graph
We present an analysis and visualization prototype using the concept of a flow topology graph (FTG) for characterization of flow in constrained networks, with a focus on discrete fracture networks (DFN), developed collaboratively by geoscientists and visualization scientists. Our method allows users to understand and evaluate flow and transport in DFN simulations by computing statistical distributions, segment paths of interest, and cluster particles based on their paths. The new approach enables domain scientists to evaluate the accuracy of the simulations, visualize features of interest, and compare multiple realizations over a specific domain of interest. Geoscientists can simulate complex transport phenomena modeling large sites for networks consisting of several thousand fractures without compromising the geometry of the network. However, few tools exist for performing higher-level analysis and visualization of simulated DFN data. The prototype system we present addresses this need. Here, we demonstrate its effectiveness for increasingly complex examples of DFNs, covering two distinct use cases - hydrocarbon extraction from unconventional resources and transport of dissolved contaminant from a spent nuclear fuel repository.
97 MATHEMATICS AND COMPUTING↗