Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “clustering algorithm”

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 757 records · Page 42

Magnon heat transport in a two-dimensional Mott insulator

Whether or not anomalies in the thermal conductivity in insulating cuprates can be attributed to antiferromagnetic order and magnons in a 2D Mott insulator remains an intriguing open question. To shed light on this issue, we investigate the thermal conductivity $\kappa$ and its relationship with the specific heat $c_v$ in the half-filled 2D single-band Hubbard model, using the numerically exact determinant quantum Monte Carlo algorithm and maximum entropy analytic continuation. At low temperatures where the charge degrees of freedom are gapped-out and $c_v$ exhibits a clear magnon peak, we observe that thermal conductivity $\kappa$ also tends to form a peak at similar temperatures. Reducing temperature further produces a sharp upturn in $\kappa$, associated with an increasing mean-free path. Here we identify this as the high-temperature side of the anomalous peak in insulating cuprates, where the mean-free path eventually is cut-off by other scattering effects, including phonons, disorder, and physical size. Different scattering effects in our model are identified and analyzed in the thermal diffusivity.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Excited States of Crystalline Point Defects with Multireference Density Matrix Embedding Theory

Accurate and affordable methods to characterize the electronic structure of solids are important for targeted materials design. Embedding-based methods provide an appealing balance in the trade-off between cost and accuracy-particularly when studying localized phenomena. Here, we use the density matrix embedding theory (DMET) algorithm to study the electronic excitations in solid-state defects with a restricted open-shell Hartree-Fock (ROHF) bath and multireference impurity solvers, specifically, complete active space self-consistent field (CASSCF) and n-electron valence state second-order perturbation theory (NEVPT2). In this work, we apply the method to investigate the electronic excitations in an oxygen vacancy (OV) on a MgO(100) surface and find absolute deviations within 0.05 eV between DMET using the CASSCF/NEVPT2 solver, denoted as CAS-DMET/NEVPT2-DMET, and the nonembedded CASSCF/NEVPT2 approach. Next, we establish the practicality of DMET by extending it to larger supercells for the OV defect and a neutral silicon vacancy in diamond where the use of nonembedded CASSCF/NEVPT2 is extremely expensive.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Fast calculation of diffraction patterns from an ensemble of aligned molecules

We report an algorithm to calculate electron diffraction patterns for molecules with anisotropic angular distribution, which is significantly faster than existing methods. The algorithm uses a transform to convert the molecular orientation distribution, which is a function of three Euler angles, to the atom-pair distribution functions which depend on the polar and azimuthal angles. The diffraction signal can then be calculated from the atom-pair distributions. We demonstrate the computation method numerically by calculating electron diffraction patterns for a symmetric top molecule (trifluoroiodomethane) and an asymmetric top molecule (formaldehyde) and show that it reduces the calculation time by approximately two orders of magnitude compared to the standard brute-force method. Here, the method can also be applied to the calculation of x-ray diffraction patterns.

74 ATOMIC AND MOLECULAR PHYSICS↗

Cosmological angular trispectra and non-Gaussian covariance

Angular cosmological correlators are infamously difficult to compute due to the highly oscillatory nature of the projection integrals. Motivated by recent development on analytic approaches to cosmological perturbation theory, in this paper we present an efficient method for computing cosmological four-point correlations in angular space, generalizing previous works on lower-point functions. This builds on the FFTLog algorithm that approximates the matter power spectrum as a sum over power-law functions, which makes certain momentum integrals analytically solvable. The computational complexity is drastically reduced for correlators in a "separable" form—we define a suitable notion of separability for cosmological trispectra, and derive formulas for angular correlators of different separability classes. As an application of our formalism, we compute the angular galaxy trispectrum at tree level, with and without primordial non-Gaussianity. This includes effects of redshift space distortion and bias parameters up to cubic order. We also compute the non-Gaussian covariance of the angular matter power spectrum due to the connected four-point function, beyond the Limber approximation. Finally, we demonstrate that, in contrast to the standard lore, the Limber approximation can fail for the non-Gaussian covariance computation even for large multipoles.

79 ASTRONOMY AND ASTROPHYSICS↗

The General Atomic and Molecular Electronic Structure System (GAMESS): Novel Methods on Novel Architectures

The primary focus of GAMESS over the last 5 years has been the development of new high-performance codes that are able to take effective and efficient advantage of the most advanced computer architectures, both CPU and accelerators. These efforts include employing density fitting and fragmentation methods to reduce the high scaling of well-correlated (e.g., coupled-cluster) methods as well as developing novel codes that can take optimal advantage of graphical processing units and other modern accelerators. Because accurate wave functions can be very complex, an important new functionality in GAMESS is the quasi-atomic orbital analysis, an unbiased approach to the understanding of covalent bonds embedded in the wave function. Finally, best practices for the maintenance and distribution of GAMESS are also discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Development of a water source heat pump hardware-in-the-loop (HIL) testing facility for smart building applications

Over the last decade, the global fight against climate change through electrification has led to an increase in research on building heating, ventilation, and air conditioning (HVAC) systems that utilize intelligent control algorithms to provide demand-side grid service while maintaining the thermal comfort of building occupants. As the pivotalpoint between building electricity consumption and indoor thermal comfort, high-efficiency electrical heatpumps are at the center of these emerging studies, and various grid-interactive and occupant-comfort control algorithms have been developed for them. The impact of these algorithms on the heatpump operation andperformance under different weather, building load, and grid requests calls for investigation and verification via experimental tests with actual heat pumps integrated with real-time building and grid responses. This study presents a Water-Source Heat Pump Hardware-in-The-Loop (HIL) Test Facility developed with the capability to perform such tests. The hardware configuration for this testfacility introduces a hydronic system that emulates the conditions for the heat pump water-side, and a duct system that emulates conditions for the heat pump airside. Both data acquisition and emulator control are implemented through the National Instruments (NI) LabVIEW software running on an NI PXIplatform. The HIL mechanism based on the hardware-software integration that allows the testbed to communicate with a generic simulation environment is also discussed. Currently, the test facility setup includes a single heatpump and virtual building model in EnergyPlus coupled with an occupant behavioral model in MATLAB. Preliminary test results of the current setup demonstrate the building load emulator's ability to track the simulated gone temperature with a Root Mean Square Deviation (RSME) below 0.12°C (0.216°F). An uncertainty analysis based on sensor accuracies shows that the heat pump coefficient of performance (COP) can be measured with a relative uncertainty of 10.4% in cooling and 3.7% in heating. Apartfrom the current testing on a single heat pump, the test facility also provides the flexibility to include additional heat pumps to form a heat pump cluster, as well as coupling the heat pump with active thermal storage to provide enhanced demandflexibility.

Calfa, Caleb↗

Compare linear-system solver and preconditioner stacks with emphasis on GPU performance and propose phase-2 NGP solver development pathway

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. In this report we evaluated GPU-performance baselines for the linear solvers in the Trilinos and hypre solver stacks using two representative Nalu-Wind simulations: an atmospheric boundary layer precursor simulation on a structured mesh, and a fixed-wing simulation using unstructured overset meshes. Both strong-scaling and weak-scaling experiments were conducted on the OLCF supercomputer Summit and similar proxy clusters. We focused on the performance of multi-threaded Gauss-Seidel and two-stage Gauss-Seidel that are extensions of classical Gauss-Seidel; of one-reduce GMRES, a communication-reducing variant of the Krylov GMRES; and algebraic multigrid methods that incorporate the afore-mentioned methods. The team has established that AMG methods are capable of solving linear systems arising from the fixed-wing overset meshes on CPU, a critical intermediate result for ExaWind FY20 Q3 and Q4 milestones. For the fixed-wing strong-scaling study (model with 3M grid-points), the team identified that Nalu-Wind simulations with the new Trilinos and hypre solvers scale to modest GPU counts, maintaining above 70% efficiency up to 6 GPUs. However, there still remain significant bottlenecks to performance: matrix assembly (hypre), AMG setup (hypre and Trilinos) In the weak-scaling experiments (going from 0.4M to 211M gridpoints), it's shown that the solver apply phases are faster on GPUs, but that Nalu-Wind simulation times grow, primarily due to the multigrid-setup process. Finally, based on the report outcomes, we propose a linear solver path-forward for the remainder of the ExaWind project. Near term, the NREL team will continue their work on GPU-based linear-system assembly. They will also investigate how the use of alternatives to the NVIDIA UVM (unified virtual memory) paradigm affects performance. Longer term, the NREL team will evaluate algorithmic performance on other types of accelerators and merge their improvements back to the main hypre repository branch. Near term, the Trilinos team will address performance bottlenecks identified in this milestone, such as implementing a GPU-based segregated momentum solve and reusing matrix graphs across linear-system assembly phases. Longer term, the Trilinos team will do detailed analysis and optimization of multigrid setup.

17 WIND ENERGY↗

Coupled Cluster Downfolding Methods: the effect of double commutator terms on the accuracy of ground-state energies

Downfolding coupled cluster (CC) techniques have recently been introduced into quantum chemistry as a tool for the dimensionality reduction of the many-body quantum problem. As opposed to earlier formulations in physics and chemistry based on the concept of effective Hamiltonians, the appearance of the downfolded Hamiltonians is a natural consequence of the single-reference exponential parametrization of the wave function. In this paper, we discuss the impact of higher-order terms originating in double commutators. In analogy to previous studies, we consider the case when only one- and two-body interactions are included in the downfolded Hamiltonians. We demonstrate the efficiency of the many-body expansions involving single and double commutators for the unitary extension of the downfolded Hamiltonians on the example of the beryllium atom, and bond-breaking processes in the Li2 and H2O molecules. For the H2O system, we also analyze energies obtained with downfolding procedures as functions of the active space size.

quantum computing, quantum algorithms, electronic ↗

Decomposition of high-rank factorized unitary coupled-cluster operators using ancilla and multiqubit controlled low-rank counterparts

The factorized form of the unitary coupled-cluster (UCC) approximation is one of the most promising methodologies to prepare trial states for strongly correlated systems within the variational quantum eigensolver framework. The factorized form of the UCC Ansatz can be systematically applied to a reference state to generate the desired entanglement. The difficulty associated with such an approach is the requirement of simultaneously entangling a growing number of qubits, which quickly exceeds the hardware limitations of today's quantum machines. In particular, while circuits for singles and double excitations can be performed on current hardware, higher-rank excitations require too many gate operations. In this work, we propose a set of schemes that trade off using extra qubits for a reduced gate depth to decompose high-rank UCC excitation operators into significantly lower depth circuits. These results will remain useful even when fault-tolerant machines are available to reduce the overall state-preparation circuit depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of Gamma Background Radiation Digital Twin with Machine Learning Algorithms: Application of Unsupervised Machine Learning to Detection of Anomalies and Nuisances in Gamma Background Radiation Environmental Screening Data

Environmental screening of gamma radiation consists of detecting weak nuisance and anomaly signal in the presence of strong and highly varying background. In a typical scenario, a mobile detector-spectrometer continuously measures gamma radiation spectra in short, e.g., one-second, signal acquisition intervals. The measurement data is a 2D matrix, where one dimension is gamma ray energy, and the other dimension is the number of measurements or total time. In principle, gamma radiation sources can be detected and identified from the measured data by their unique spectral lines. Detecting sources from data measured in a search scenario is difficult due to the highly varying background because of naturally occurring radioactive material (NORM), and low signal-to-noise ratio (S/N) of spectral signal measured during one-second acquisition intervals. The objective of this work is to explore unsupervised machine learning (ML) algorithms for development of a digital twin of gamma radiation background, and for detection and identification of weak nuisances and anomalies events in the presence of highly fluctuating background. In one segment of work, we developed a gamma background estimation model using a Longshort term memory (LSTM) network for one-step CPS time series prediction. The LSTM model was validated with two data sets of measurements from two independent NaI detectors positioned on a mobile platform. The data sets contained background radiation only and no orphan isotope sources. The LSTM model was constructed and tested using data from one of the detectors. Performance of the LSTM model was validate through one-step prediction of CPS time series of another NaI detector without re-training. This approach allows to create a digital twin for nuclear background estimation. Using LSTM, it could be possible to detect a source through subtraction of the estimated counts from the measured background. In another segment of work, we investigated detection of gamma emitting sources in the presence of complex background using unsupervised machine learning. Spectral lines of isotopes are difficult to observe in one-second measurements. Averaging over the entire measurement campaign data set reveals spectral lines of most common background isotopes. Spectral lines of orphan sources, which might appear only in a few measurements during the campaign, will be washed out if averaging is performed over the entire measurement data set. The approach we have explored consists of extracting one-second measurements containing weak spectral features through data clustering. Averaging one-second spectra in a cluster should reveal the presence of anomaly sources. We created two ML models using K-means clustering and Neural Network Self-organizing Map (SOM). Performance of these ML models was benchmarked using search data. One data set contained 137 Cs source, and another dataset contained 131 I source.

54 ENVIRONMENTAL SCIENCES↗

Performance portable ice-sheet modeling with MALI

High-resolution simulations of polar ice sheets play a crucial role in the ongoing effort to develop more accurate and reliable Earth system models for probabilistic sea-level projections. These simulations often require a massive amount of memory and computation from large supercomputing clusters to provide sufficient accuracy and resolution; therefore, it has become essential to ensure performance on these platforms. Many of today’s supercomputers contain a diverse set of computing architectures and require specific programming interfaces in order to obtain optimal efficiency. In an effort to avoid architecture-specific programming and maintain productivity across platforms, the ice-sheet modeling code known as MPAS-Albany Land Ice (MALI) uses high-level abstractions to integrate Trilinos libraries and the Kokkos programming model for performance portable code across a variety of different architectures. In this article, we analyze the performance portable features of MALI via a performance analysis on current CPU-based and GPU-based supercomputers. The analysis highlights not only the performance portable improvements made in finite element assembly and multigrid preconditioning within MALI with speedups between 1.26 and 1.82x across CPU and GPU architectures but also identifies the need to further improve performance in software coupling and preconditioning on GPUs. We perform a weak scalability study and show that simulations on GPU-based machines perform 1.24–1.92x faster when utilizing the GPUs. The best performance is found in finite element assembly, which achieved a speedup of up to 8.65x and a weak scaling efficiency of 82.6% with GPUs. We additionally describe an automated performance testing framework developed for this code base using a changepoint detection method. The framework is used to make actionable decisions about performance within MALI. We provide several concrete examples of scenarios in which the framework has identified performance regressions, improvements, and algorithm differences over the course of 2 years of development.

54 ENVIRONMENTAL SCIENCES↗

Real‐time XFEL data analysis at SLAC and NERSC: A trial run of nascent exascale experimental data analysis

X‐ray scattering experiments using free electron lasers (XFELs) are a powerful tool to determine the molecular structure and function of unknown samples (such as COVID‐19 viral proteins). XFEL experiments are a challenge to computing in two ways: (i) due to the high cost of running XFELs, a fast turnaround time from data acquisition to data analysis is essential to make informed decisions on experimental protocols; (ii) data‐collection rates are growing exponentially, requiring new scalable algorithms. Here we report our experiences analyzing data from two experiments at the Linac Coherent Light Source (LCLS) during September 2020. Raw data were analyzed on NERSC's Cori XC40 system, using the Superfacility paradigm: our workflow automatically moves raw data between LCLS and NERSC, where it is analyzed using the software package CCTBX. We achieved real time data analysis with a turnaround time from data acquisition to full molecular reconstruction in as little as 10 min—sufficient time for the experiment's operators to make informed decisions. By hosting the data analysis on Cori, and by automating LCLS‐NERSC interoperability, we achieved a data analysis rate which matches the data acquisition rate. Completing data analysis within 10 min is a first for XFEL experiments and an important milestone if we are to keep up with data‐collection trends.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

The Power of Many: An Ensemble Approach to Spectral Similarity

Quantifying the similarity between two mass spectra─a known reference mass spectrum and an unidentified sample mass spectrum─is at the heart of compound identification workflows in gas chromatography–mass spectrometry (GC-MS). The reference spectrum most like the sample is assigned as its identification (provided some quantitative similarity threshold is met, e.g., 80%) and thus accurately measuring similarity is essential. Significant research has gone toward developing metrics for this purpose, each of which has attempted to improve upon existing methods by incorporating GC-MS-specific information (e.g., peak ratios or retention times) or adopting various statistical and algorithmic frameworks. While this active development has led to a plethora of similarity metrics with demonstrated value across different contexts, the unfortunate consequence has been confusion surrounding which metric should be used as a global standard. No such metric is currently accepted as the standard method because different metrics have demonstrated optimal performance in different contexts. In this work, we propose an ensemble approach to spectral similarity scoring that combines the collective information from across existing similarity metrics to form an improved, globally representative similarity metric as a step toward establishing a global standard method. In conclusion, the resulting ensemble metrics are evaluated on over 88,000 spectra of varying complexity and demonstrate improved abilities to accurately rank the correct reference spectrum as the top-matching candidate for a sample relative to the rankings generated by individual similarity scores.

Carbohydrates↗

Acceleration of Graph Neural Network-Based Prediction Models in Chemistry via Co-Design Optimization on Intelligence Processing Units

Atomic structure prediction and associated property calculations are the bedrock of chemical physics. Since high-fidelity ab initio modeling techniques for computing the structure and properties can be prohibitively expensive, this motivates the development of machine-learning (ML) models that make these predictions more efficiently. Training graph neural networks over large atomistic databases introduces unique computational challenges such as the need to process millions of small graphs with variable size and support communication patterns that are distinct from learning over large graphs such as social networks. We demonstrate a novel hardware-software co-design approach to scale up the training of atomistic graph neural networks (GNN) for structure and property prediction. First, to eliminate redundant computation and memory associated with alternative padding techniques and to improve throughput via minimizing communication, we formulate the effective coalescing of the batches of variable-size atomistic graphs as the bin packing problem and introduce a hardware-agnostic algorithm to pack these batches. In addition, we propose hardware-specific optimizations including a planner and vectorization for the gather-scatter operations targeted for Graphcore’s Intelligence Processing Unit (IPU), as well as model-specific optimizations such as merged communication collectives and optimized softplus. Putting these all together, we demonstrate the effectiveness of the proposed co-design approach by providing an implementation of a well-established atomistic GNN on the Graphcore IPUs. We evaluate the training performance on multiple atomistic graph databases with varying degrees of graph counts, sizes and sparsity. Here, we demonstrate that such a co-design approach can reduce the training time of atomistic GNNs and can improve the performance by up to 1.5× compared to the baseline implementation of the model on the IPUs. Additionally, we compare our IPU implementation with a Nvidia GPU-based implementation and show that our atomistic GNN implementation on the IPUs can run 1.8× faster on average compared to the execution time on the GPUs.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

New constraints on sodium production in globular clusters from the Na 23 ( He 3 , d ) Mg 24 reaction

The star-to-star anticorrelation of sodium and oxygen is a defining feature of globular clusters, but, to date, the astrophysical site responsible for this unique chemical signature remains unknown. Sodium enrichment within these clusters depends sensitively on reaction rate of the sodium destroying reactions 23 Na(p, γ) and 23 Na(p,α). In this paper, we report the results of a 23 Na( 3 He,d) 24 Mg transfer reaction carried out at Triangle Universities Nuclear Laboratory using a 21 MeV 3 He beam. Astrophysically relevant states in 24 Mg between 11 < E x < 12 MeV were studied using high-resolution magnetic spectroscopy, thereby allowing the extraction of excitation energies and spectroscopic factors. Bayesian methods are combined with the distorted wave Born approximation to assign statistically meaningful uncertainties to the extracted spectroscopic factors. For the first time, these uncertainties are propagated through to the estimation of proton partial widths. Our experimental data are used to calculate the reaction rate. The impact of the new rates are investigated using asymptotic giant branch star models. Furthermore, it is found that while the astrophysical conditions still dominate the total uncertainty, intramodel variations on sodium production from the 23 Na(p, γ) and 23 Na(p,α) reaction channels are a lingering source of uncertainty.

20 ≤ A ≤ 38↗

Continuous Filament Network of the Local Universe

Simulated galaxy distributions are suitable for developing filament detection algorithms. However, samples of observed galaxies, being of limited size, cause difficulties that lead to a discontinuous distribution of filaments. We created a new galaxy filament catalog composed of a continuous cosmic web with no lone filaments. The core of our approach is a ridge filter used within the framework of image analysis. We considered galaxies from the HyperLeda database with redshifts 0.02 ≤ z ≤ 0.1, and in the solid angle 120° ≤ R.A. ≤ 240°, 0° ≤ decl. ≤ 60°. We divided the sample into 16 two-dimensional celestial projections with redshift bin Δ z = 0.005, and compared our continuous filament network with a similar recent catalog covering the same region of the sky. We tested our catalog on two application scenarios. First, we compared the distributions of the distances to the nearest filament of various astrophysical sources (Seyfert galaxies and other active galactic nuclei, radio galaxies, low-surface-brightness galaxies, and dwarf galaxies), and found that all source types trace the filaments well, with no systematic differences. Next, among the HyperLeda galaxies, we investigated the dependence of the g - r color distribution on the distance to the nearest filament, and confirmed that early-type galaxies are located on average further from the filaments than late-type ones.

79 ASTRONOMY AND ASTROPHYSICS↗

Fossil group origins

Aims: We analyse the large-scale structure out to 100 Mpc around a sample of 16 confirmed fossil systems using spectroscopic information from the Sloan Digital Sky Survey Data Release 16. Methods: We computed the distance between our fossil groups (FGs) and the centres of filaments and nodes from the literature. We also studied the density of bright galaxies, since this parameter is thought to be a good mass tracers, as well as the projected over-densities of galaxies. Finally, we applied a friends-of-friends (FoF) algorithm to detect virialised structures around our FGs and obtain an estimate of the mass available in their surroundings. Results: We find that FGs are mainly located close to filaments, with a mean distance of 3.7 ± 1.1 R 200 and a minimum distance of 0.05 R 200 . On the other hand, none of our FGs were found close to intersections, with a mean and minimum distance of 19.3 ± 3.6 and 6.1 R 200 , respectively. There is a correlation that indicates FGs at higher redshifts are found in denser regions, when we use bright galaxies as tracers of the mass. At the same time, FGs with the largest magnitude gaps (Δm 12 > 2.5) are found in less dense environments and tend to host (on average) smaller central galaxies. Conclusions: Our results suggest that FGs formed in a peculiar position within the cosmic web, close to filaments and far from nodes, whereby their interaction with the cosmic web itself may be limited. We deduce that FGs with brightest central galaxies (BCGs) that are relatively faint, high values of Δm 12 , and low redshifts could, in fact, be systems that are at the very last stage of their evolution. Moreover, we confirm theoretical predictions that systems with the largest magnitude gap are not massive.

79 ASTRONOMY AND ASTROPHYSICS↗