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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

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↗
DOE OSTI2023

Multicomponent Cholesky Decomposition: Application to Nuclear–Electronic Orbital Theory

The Cholesky decomposition technique is commonly used to reduce the memory requirement for storing two-particle repulsion integrals in quantum chemistry calculations that use atomic orbital bases. However, when quantum methods use multicomponent bases, such as nuclear–electronic orbitals, additional challenges are introduced due to asymmetric two-particle integrals. This work proposes several multicomponent Cholesky decomposition methods for calculations using nuclear–electronic orbital density functional theory. To analyze the errors in different Cholesky decomposition components, benchmark calculations using water clusters are carried out. The largest benchmark calculation is a water cluster (H 2 O) 27 where all 54 protons are treated quantum mechanically. Furthermore, this study provides energetic and complexity analyses to demonstrate the accuracy and performance of the proposed multicomponent Cholesky decomposition method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Theoretical framework for new magnetic materials for quantum computing and information storage. Final report for the Award No. DE-SC0018910

The focus of this grant was on molecular magnetic materials for information storage and quantum computing. We have been developing robust, first-principle methods for computing relevant electronic and magnetic properties of molecular building blocks (SMMs) of novel magnetic materials and quantum computers. These tools enable theoretical modeling of SMMs’ behavior, facilitating the interpretation of experimental studies and aiding the design of novel magnetic materials. Our strategy is based on the spin-flip (SF) approach, which extends the hierarchy of black-box single-reference methods to strongly correlated systems. Specifically, we developed general scalable algorithms and computer codes for calculating molecular properties, with an emphasis on spin-related properties, such as zero-field splittings, hyperfine couplings, and g-tensors. While our primary focus was on SF wave functions and SF-TDDFT, the underlying theory and computer codes were formulated using reduced density matrices, such that these tools are applicable to a broader class of methods. To extend the scope of applicability of wave-function-based SF methods to larger systems, we developed reduced-scaling approaches for the equation-of-motion coupled-cluster (EOM-CC) methods and continue developing libtensor (our open-source general tensor contraction library for many-body methods). We carried out extensive benchmarks and also carried out several applications.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Convex relaxation for Fokker–Planck equation

We propose an approach to directly estimate the moments or marginals for a high-dimensional equilibrium distribution in statistical mechanics by solving the high-dimensional Fokker–Planck equation in terms of low-order cluster moments or marginals. With this approach, we bypass the exponential complexity of estimating the full high-dimensional distribution and directly solve the simplified partial differential equations for low-order moments/marginals. Moreover, the proposed moment/marginal relaxation is fully convex and can be solved via off-the-shelf solvers. We further propose a time-dependent version of the convex programs to study non-equilibrium dynamics. In a specific setting, we show the proposed method can recover a mean-field-type equilibrium density. Numerical results are provided to demonstrate the performance of the proposed algorithm for high-dimensional systems.

Chen, Yian↗
DOE OSTI2024

Shape effects on the local dynamics of suspensions of spheroidal particles

The effect of shape on the dynamics of suspensions of non-spherical heavy particles is examined by fully resolved numerical simulations of oblate and prolate spheroids, as well as spheres, for a density ratio of ten, volume fractions ranging from 0.5% to 5%, and Reynolds numbers between 20 and 30. The dynamics is determined both by the interactions of the particles with the fluid as well as by collisions, with the number and importance of collisions increasing with volume fractions. A single isolated oblate or prolate spheroid falling under gravity generally falls broadside on, for the governing parameters examined here, and at low-volume fractions, the majority of particles in a suspension fall that way. At higher-volume fractions, the orientation is more random. The slip velocity decreases as the volume fraction increases for all shapes, as expected, but the effect of the shape is much less than seen for a single particle. Furthermore, this seems to be due to two effects. For all volume fractions, the most deformed particles cluster more than spheres and less deformed particles, which increases their slip velocity. As the concentration increases, the increased particle interactions also causes more particles to fall short side-on, which reduces the frontal area and the resulting drag, increasing the slip velocity. This second effect is, of course, absent for spherical particles.

42 ENGINEERING↗
DOE OSTI2024

A computational approach to complex junctions and interfaces

Molecular- and nano- junctions, surfaces, interfaces, and interfacial processes have been the subjects of this DOE supported program for about 20 years. We have investigated electronic and magnetic structure, spin-dependent charge transport, and emerging phenomena at surfaces and interfaces in a number of physical systems ranging from nano-clusters, to nanowires, to two-dimensional (2D) crystals and their interactions, to bulk matter. Eighty-four refereed papers were published [1-84], with a majority effort from the group led by the PI, and over a hundred presentations were made at international conferences. We use first-principles methods in the framework of density functional theory in conjunction with nano-equilibrium Green function techniques, semi-empirical Boltzmann transport theory, tight-binding models, and the Hubbard model and many-body wavefunction approaches. In pursuing our scientific goals, we have also developed a number of computational algorithms and computational packages.

2D materials↗
DOE OSTI2025

Randomized Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SymNMF) is a technique in data analysis and machine learning that approximates a matrix with a product of a nonnegative, low-rank matrix and it transpose. To design faster and more scalable algorithms for SymNMF we develop two randomized algorithms for its computation. The first method uses randomized matrix sketching to compute an initial low-rank approximation to the input matrix and proceeds to uses this as a low-rank input to rapidly compute a SymNMF. The second methods uses randomized leverage score sampling to approximately solve constrained least squares problems. Many successful methods for SymNMF rely on (approximately) solving sequences of constrained least squares problems. Here, we prove theoretically that leverage score sampling can approximately solve constrained least squares problems to e-accuracy. Finally we demonstrate both methods work in practice by applying them to graph clustering tasks on large real world data sets. These experiments show that our methods approximately maintain solution quality and achieve significant speed ups for both large dense and large sparse problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

FY 2026 Midyear Report: Seismic Monitoring of Underground Vibration Sources Using Distributed Acoustic Sensing and Seismometers

Safeguards-relevant temporal changes in underground facilities can be observed using geophysical monitoring techniques. Seismic waves, in particular, provide valuable insights into subsurface activities and can serve as an important tool for detecting anomalous events that may indicate containment breaches at geological repositories. This midyear report summarizes ongoing efforts to automatically and rapidly detect and locate anomalous vibration signals that could be indicative of potential containment breaches. Previous work during FY25 focused on compiling continuous seismic datasets from two underground sites and developing a database of continuous waveforms and ground-truth event data derived from multiple sensing modalities. Building on this foundation, we are adapting anomaly detection and geolocation algorithms to explore methods for monitoring underground activities using two relatively low-maintenance sensing technologies: a dense surface geophone array deployed at the Pleasant Gap mine in Pennsylvania, and a three-dimensional fiber-optic cable array for distributed acoustic sensing (DAS) installed in the subsurface at the Sanford Underground Research Facility (SURF) in South Dakota. This report summarizes work conducted during the first two quarters of FY26, during which we refined a dynamic power spectral density (PSD)-based detector, applied it independently to each geophone station, and then combined the per‑station detections with density-based spatial clustering of applications with noise (DBSCAN) to cluster events and produce spatial maps over a nine‑day interval. In addition, we outline plans for a field trial at the Waste Isolation Pilot Plant (WIPP) in New Mexico to compare traditional seismic monitoring approaches with DAS techniques and to evaluate the benefits of combined data analysis. Activities during the past two quarters have included the preparation and submission of a Field Test Plan to WIPP for approval, as well as submission to headquarters for review and feedback.

58 GEOSCIENCES↗
DOE OSTI2026

Graph theory inspired anomaly detection at the LHC

Designing model-independent anomaly detection algorithms for analyzing LHC data remains a central challenge in the search for new physics, due to the high dimensionality of collider events. In this work, we develop a graph autoencoder as an unsupervised, model-agnostic tool for anomaly detection, using the LHC Olympics dataset as a benchmark. By representing jet constituents as a graph, we introduce a method to systematically control the information available to the model through sparse graph constructions that serve as physically motivated inductive biases. Specifically, (1) we construct graph autoencoders based on locally rigid Laman graphs and globally rigid unique graphs, and (2) we explore the clustering of jet constituents into subjets to interpolate between high- and low-level input representations. We obtain the best performance, measured in terms of the Significance Improvement Characteristic curve for an intermediate level of subjet clustering and certain sparse unique graph constructions. We further investigate the role of graph connectivity in jet classification tasks. Our results demonstrate the potential of leveraging graph-theoretic insights to refine and increase the interpretability of machine learning tools for collider experiments.

Automation↗
DOE OSTI2020

Ab Initio Nuclear Thermodynamics

Here, we propose a new Monte Carlo method called the pinhole trace algorithm for ab initio calculations of the thermodynamics of nuclear systems. For typical simulations of interest, the computational speedup relative to conventional grand-canonical ensemble calculations can be as large as a factor of one thousand. Using a leading-order effective interaction that reproduces the properties of many atomic nuclei and neutron matter to a few percent accuracy, we determine the location of the critical point and the liquid-vapor coexistence line for symmetric nuclear matter with equal numbers of protons and neutrons. We also present the first ab initio study of the density and temperature dependence of nuclear clustering.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

A Hydro-particle-mesh Code for Efficient and Rapid Simulations of the Intracluster Medium

We introduce the cosmological HYPER code based on an innovative hydro-particle-mesh (HPM) algorithm for efficient and rapid simulations of gas and dark matter. For the HPM algorithm, we update the approach of Gnedin & Hui to expand the scope of its application from the lower-density intergalactic medium (IGM) to the higher-density intracluster medium (ICM). While the original algorithm tracks only one effective particle species, the updated version separately tracks the gas and dark matter particles, as they do not exactly trace each other on small scales. For the approximate hydrodynamics solver, the pressure term in the gas equations of motion is calculated using robust physical models. In particular, we use a dark matter halo model, ICM pressure profile, and IGM temperature–density relation, all of which can be systematically varied for parameter-space studies. We show that the HYPER simulation results are in good agreement with the halo model expectations for the density, temperature, and pressure radial profiles. Simulated galaxy cluster scaling relations for Sunyaev–Zel’dovich (SZ) and X-ray observables are also in good agreement with mean predictions, with scatter comparable to that found in hydrodynamic simulations. HYPER also produces lightcone catalogs of dark matter halos and full-sky tomographic maps of the lensing convergence, SZ effect, and X-ray emission. These simulation products are useful for testing data analysis pipelines, generating training data for machine learning, understanding selection and systematic effects, and for interpreting astrophysical and cosmological constraints.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Accelerating and stabilizing the convergence of vibrational self-consistent field calculations via the direct inversion of the iterative subspace (vDIIS) algorithm

The vibrational self-consistent field (VSCF) method yields anharmonic states and spectra for molecular vibrations, and it serves as the starting point for more sophisticated correlated-vibration methods. Convergence of the iterative, non-linear optimization in VSCF calculations can be erratic or altogether unsuccessful, particularly for chemical systems involving low-frequency motions. In this work, a vibrational formulation of the Direct Inversion of the Iterative Subspace method of Pulay is presented and investigated. This formulation accounts for distinct attributes of the vibrational and electronic cases, including the expansion of each single-mode vibrational wavefunction in its own basis set. The resulting Direct Inversion of the Iterative Subspace method is shown to substantially accelerate VSCF convergence in all convergent cases as well as rectify many cases where Roothaan-based methods fail. Performance across systems ranging from small, rigid molecules to weakly bound molecular clusters is investigated in this analysis.

Chemistry↗
DOE OSTI2023

Nonequilibrium design strategies for functional colloidal assemblies

Here, we use a nonequilibrium variational principle to optimize the steady-state, shear-induced interconversion of self-assembled nanoclusters of DNA-coated colloids. Employing this principle within a stochastic optimization algorithm allows us to identify design strategies for functional materials. We find that far-from-equilibrium shear flow can significantly enhance the flux between specific colloidal states by decoupling trade-offs between stability and reactivity required by systems in equilibrium. For isolated nanoclusters, we find nonequilibrium strategies for amplifying transition rates by coupling a given reaction coordinate to the background shear flow. We also find that shear flow can be made to selectively break detailed balance and maximize probability currents by coupling orientational degrees of freedom to conformational transitions. For a microphase consisting of many nanoclusters, we study the flux of colloids hopping between clusters. We find that a shear flow can amplify the flux without a proportional compromise on the microphase structure. This approach provides a general means of uncovering design principles for nanoscale, autonomous, functional materials driven far from equilibrium.

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

Genarris 2.0: A Random Structure Generator for Molecular Crystals

Genarris is an open source Python package for generating random molecular crystal structures with physical constraints for seeding crystal structure prediction algorithms and training machine learning models. Here we present a new version of the code, containing several major improvements. A MPI-based parallelization scheme has been implemented, which facilitates the seamless sequential execution of user-defined workflows. A new method for estimating the unit cell volume based on the single molecule structure has been developed using a machine-learned model trained on experimental structures. A new algorithm has been implemented for generating crystal structures with molecules occupying special Wyckoff positions. A new hierarchical structure check procedure has been developed to detect unphysical close contacts efficiently and accurately. New intermolecular distance settings have been implemented for strong hydrogen bonds. To demonstrate these new features, we study two specific cases: benzene and glycine. Genarris finds the experimental structures of the two polymorphs of benzene and the three polymorphs of glycine. Program summary Program Title: Genarris 2.0 Program Files doi: http://dx.doi.org/10.17632/grx6mz4pjn.1 Licensing provisions: BSD-3 Clause Programming language: Python, C External routines/libraries: Spglib, ASE, pymatgen, SciPy, mpi4py, scikit-learn, PyTorch, FHI-aims. Nature of problem: Molecular crystal structure prediction. Solution method: Genarris 2.0 generates molecular crystal structures over the 230 space groups, on general and special Wyckoff positions, using physical constraints. Down-sampling of the generated structures may be performed subsequently, based on molecular crystal packing descriptors and an unsupervised machine learning algorithm. Lastly, ab initio structure relaxation may be performed for the final pool. Depending on the user-defined workflow implemented, Genarris may be used to generate diverse molecular crystal datasets to seed evolutionary algorithms or to train machine learning algorithms or as a standalone crystal structure prediction method. Restrictions: For crystal structure generation, the molecule of interest must be semi-rigid with no bond rotational degrees of freedom. Unusual features: Genarris 2.0 is a highly distributed program, making use of MPI for Python parallelization. The user has the ability to design and implement workflows by executing a user-defined list of procedures. Genarris 2.0 offers new features including a machine learning model for estimating the molecular volume in the solid state from the single molecule structure, structure generation in special Wyckoff positions of space groups, hierarchical structure checks including rigorous treatment of non-orthogonal structures, and clustering and down-selection workflows combining first principles simulations with machine learning. (C) 2020 Elsevier B.V. All rights reserved.

Crystal structure prediction↗
DOE OSTI2022

The Pristine survey – XVI. The metallicity of 26 stellar streams around the Milky Way detected with the STREAMFINDER in Gaia EDR3

ABSTRACT We use the photometric metallicities provided by the panoramic Pristine survey to study the veracity and derive the metallicities of the numerous stellar streams found by the application of the STREAMFINDER algorithm to the Gaia Early Data Release 3 data. All 26 streams present in Pristine show a clear metallicity distribution function, which provides an independent check of the reality of these structures, supporting the reliability of STREAMFINDER in finding streams and the power of Pristine to measure precise metallicities. We further present six candidate structures with coherent phase-space and metallicity signals that are very likely streams. The majority of studied streams are very metal-poor (14 structures with [Fe/H] < −2.0) and include three systems with [Fe/H] < −2.9 (C-11, C-19, and C-20). These streams could be the closest debris of low-luminosity dwarf galaxies or may have originated from globular clusters of significantly lower metallicity than any known current Milky Way globular cluster. Our study shows that the promise of the Gaia data for Galactic Archeology studies can be substantially strengthened by quality photometric metallicities, allowing us to peer back into the earliest epochs of the formation of our Galaxy and its stellar halo constituents.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

DELVE Milky Way Satellite Galaxy Census. I. Satellite Population and Survey Selection Function in DES, DELVE, and Pan-STARRS

The properties of Milky Way satellite galaxies have important implications for galaxy formation, reionization, and the fundamental physics of dark matter. However, the population of Milky Way satellites includes the faintest known galaxies, and current observations are incomplete. To understand the impact of observational selection effects on the known satellite population, we perform rigorous, quantitative estimates of the Milky Way satellite galaxy detection efficiency in three wide-field survey datasets: the Dark Energy Survey Year 6, the DECam Local Volume Exploration Data Release 3, and the Pan-STARRS1 Data Release 1. Together, these surveys cover ∼13,600 deg 2 to g ∼ 24.0 and ∼27,700 deg 2 to g ∼ 22.5, spanning ∼91% of the high-Galactic-latitude sky (∣b∣ ≥ 15°). We apply multiple detection algorithms over the combined footprint and recover 49 known satellites above a strict census detection threshold. To characterize the sensitivity of our census, we run our detection algorithms on a large set of simulated galaxies injected into the survey data, which allows us to develop models that predict the detectability of satellites as a function of their properties. We then fit an empirical model to our data and infer the luminosity function, radial distribution, and size–luminosity relation of Milky Way satellite galaxies. Our empirical model predicts a total of $265^{+79}_{-47}$ satellite galaxies with −20 ≤ M V ≤ 0, half-light radii of 15 ≤ r 1/2 , (pc) ≤ 3000, and galactocentric distances of 10 ≤ D GC (kpc) ≤ 300. We also identify a mild anisotropy in the angular distribution of the observed galaxies, at a significance of ∼2σ, which can be attributed to the clustering of satellites associated with the LMC.

Tan, Chin Yi [Univ. of Chicago, IL (United States)↗
DOE OSTI2022

Characterizing Drought Behavior in the Colorado River Basin Using Unsupervised Machine Learning

Drought is a pressing issue for the Colorado River Basin (CRB) due to the social and economic value of water resources in the region and the significant uncertainty of future drought under climate change. Here, we use climate simulations from various Earth System Models (ESMs) to force the Variable Infiltration Capacity hydrologic model and project multiple drought indicators for the sub-watersheds within the CRB. We apply an unsupervised machine learning (ML) based on Non-Negative Matrix Factorization using K-means clustering (NMFk) to synthesize the simulated historical, future, and change in drought indicators. The unsupervised ML approach can identify sub-watersheds where key changes to drought indicator behavior occur, including shifts in snowpack, snowmelt timing, precipitation, and evapotranspiration. While changes in future precipitation vary across ESMs, the results indicate that the Upper CRB will experience increasing evaporative demand and surface-water scarcity, with some locations experiencing a shift from a radiation-limited to a water-limited evaporation regime in the summer. Large shifts in peak runoff are observed in snowmelt-dominant sub-watersheds, with complete disappearance of the snowmelt signal for some sub-watersheds. The work demonstrates the utility of the NMFk algorithm to efficiently identify behavioral changes of drought indicators across space and time and to quickly analyze and interpret hydro climate model results.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2021

Removal of spurious data in Bragg coherent diffraction imaging: an algorithm for automated data preprocessing

Bragg coherent diffraction imaging (BCDI) provides a powerful tool for obtaining high-resolution structural information from nanocrystalline materials. Here a BCDI sample consisting of a large number of randomly oriented nanoscale crystals is considered. Ideally, only one crystal is oriented to produce a Bragg peak on the detector. However, diffraction from other crystals often produces additional signals on the detector. Before the measured diffraction patterns can be processed into structural images, scientists routinely need to manually identify and remove the `alien' intensities from sources other than the intended crystal. With the development of modern high-coherence storage rings, such as the upgraded Advanced Photon Source (APS), the already slow process of manual preprocessing will be untenable for the large volumes of data that will be produced. An automated method of identifying and deleting alien intensities is proposed. This method exploits the fact that BCDI of a perfect crystal produces diffraction data with inversion symmetry around the Bragg peak. This approach uses the machine learning clustering method DBSCAN to distinguish between diffraction from multiple sources, and then calculates cluster size and inversion symmetry to assess whether clusters of intensity belong to desired data or alien signals. This approach can dramatically reduce the amount of time spent manually processing data, allowing BCDI data processing capabilities to keep pace with the technological advances of fourth-generation synchrotron light sources.

36 MATERIALS SCIENCE↗