Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “approximation 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 559 records · Page 31

A Bayesian Approach for Statistical–Physical Bulk Parameterization of Rain Microphysics. Part II: Idealized Markov Chain Monte Carlo Experiments

Observationally informed development of a new framework for bulk rain microphysics, the Bayesian Observationally Constrained Statistical–Physical Scheme (BOSS; described in Part I of this study), is demonstrated. This scheme’s development is motivated by large uncertainties in cloud and weather simulations associated with approximations and assumptions in existing microphysics schemes. Here, a proof-of-concept study is introduced using a Markov chain Monte Carlo sampling algorithm with BOSS to probabilistically estimate microphysical process rates and parameters directly from a set of synthetically generated rain observations. The framework utilized is an idealized steady-state one-dimensional column rainshaft model with specified column-top rain properties and a fixed thermodynamical profile. Different configurations of BOSS—flexibility being a key feature of this approach—are constrained via synthetic observations generated from a traditional three-moment bulk microphysics scheme. The ability to retrieve correct parameter values when the true parameter values are known is illustrated. For cases when there is no set of true parameter values, the accuracy of configurations of BOSS that have different levels of complexity is compared. It is found that addition of the sixth moment as a prognostic variable improves prediction of the third moment (proportional to bulk rain mass) and rain rate. In contrast, increasing process rate formulation complexity by adding more power terms has little benefit—a result that is explained using further-idealized experiments. BOSS rainshaft simulations are shown to well estimate the true process rates from constraint by bulk rain observations, with the further benefit of rigorously quantified uncertainty of these estimates.

58 GEOSCIENCES↗

CosTuuM: Polarized Thermal Dust Emission by Magnetically Oriented Spheroidal Grains

We present the new open-source C++-based Python library CosTuuM that can be used to generate infrared absorption and emission coefficients for arbitrary mixtures of spheroidal dust grains that are (partially) aligned with a magnetic field. We outline the algorithms underlying the software, demonstrate the accuracy of our results using benchmarks from literature, and use our tool to investigate some commonly used approximative recipes. We find that the linear polarization fraction for a partially aligned dust grain mixture can be accurately represented by an appropriate linear combination of perfectly aligned grains and grains that are randomly oriented, but that the commonly used picket fence alignment breaks down for short wavelengths. We also find that for a fixed dust grain size, the absorption coefficients and linear polarization fraction for a realistic mixture of grains with various shapes cannot both be accurately represented by a single representative grain with a fixed shape, but that instead an average over an appropriate shape distribution should be used. Insufficient knowledge of an appropriate shape distribution is the main obstacle in obtaining accurate optical properties. CosTuuM is available as a standalone Python library and can be used to generate optical properties to be used in radiative transfer applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Breakups are complicated: an efficient representation of collisional breakup in the superdroplet method

Abstract. A key constraint of particle-based methods for modeling cloud microphysics is the conservation of total particle number, which is required for computational tractability. The process of collisional breakup poses a particular challenge to this framework, as breakup events often produce many droplet fragments of varying sizes, which would require creating new particles in the system. This work introduces a representation of collisional breakup in the so-called “superdroplet” method which conserves the total number of superdroplets in the system. This representation extends an existing stochastic collisional-coalescence scheme and samples from a fragment size distribution in an additional Monte Carlo step. This method is demonstrated in a set of idealized box model and single-column warm-rain simulations. We further discuss the effects of the breakup dynamic and fragment size distribution on the particle size distribution, hydrometeor population, and microphysical process rates. Box model experiments serve to characterize the impacts of properties such as coalescence efficiency and fragmentation function on the relative roles of collisional breakup and coalescence. The results demonstrate that this representation of collisional breakup can produce a stationary particle size distribution, in which breakup and coalescence rates are approximately equal, and that it recovers expected behavior such as a reduction in precipitate-sized particles in the column model. The breakup algorithm presented here contributes to an open-source pythonic implementation of the superdroplet method, PySDM, which will facilitate future research using particle-based microphysics.

de Jong, Emily (ORCID:0000000253104554)↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

Filament-induced breakdown spectroscopy signal enhancement using optical wavefront control

Filament-induced breakdown spectroscopy (FIBS) is an analytical method that holds significant promise for remote sensing. In FIBS, it is desirable to maximize the intensity and improve the reproducibility of a selected spectroscopic feature. Here, we demonstrate the use of wavefront control in conjunction with a genetic algorithm in FIBS of metallic copper and show that this approach can increase the efficacy of filament-induced breakdown signal production. Through wavefront optimization, we enhance the intensity of a chosen characteristic spectroscopic feature of copper by a factor of approximately 3 when performing filamentation over a 1-meter distance. The relative standard deviation of signal intensity is reduced from ~17% to ~12% after optimization. We find that modification of the wavefront by introduction of astigmatism and coma maximizes the signal intensity, and these aberrations appear in two distinct trials of the genetic algorithm. We compare these findings to previous work on multiple filament control and discuss the possible mechanisms that lead to signal enhancement associated with both the beam amplitude and phase profile. A broader use of wavefront control with feedback may improve the performance of FIBS in remote sensing applications.

42 ENGINEERING↗

A Frequency-Domain-Based Algorithm for Detecting Microseismicity Using Dense Surface Seismic Arrays

We propose a new frequency-domain-based algorithm for detecting small-magnitude seismic events using dense surface seismic arrays. Our proposed method takes advantage of the high energy carried by S waves, and approximate known source locations, which are used to rotate the horizontal components to obtain the maximum amplitude. By surrounding the known source area with surface geophones, we achieve a favorable geometry for locating the detected seismic events with the backprojection method. To test our new detection method, we used a dense circular array, consisting of 151 5 Hz three-component geophones, over a 5 km aperture that was in operation at the Utah Frontier Observatory for Research in Geothermal Energy (FORGE) in southcentral Utah. We apply the new detection method during a small-scale test injection phase at FORGE, and during an aftershock sequence of an Mw 4.1 earthquake located ~30 km north of the geophone array, within the Black Rock volcanic field. We are able to detect and locate microseismic events (Mw<0) during injections, despite the high level of anthropogenic activity, and several aftershocks that are missing from the regional catalog. By comparing our method with known algorithms that operate both in the time and frequency domain, we show that our proposed method performs better in the case of the FORGE injection monitoring, and equally well for the off-array aftershock sequence. Our new method has the potential to improve microseismic event detections even in extremely noisy environments, and the proposed location scheme serves as a direct discriminant between true and false detections.

Geochemistry & Geophysics↗

Quantum algorithms for geologic fracture networks

Abstract Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approach known as coarse-graining. For many practical applications, such as flow in porous, homogenous materials, coarse-graining offers a sufficiently-accurate approximation of the solution. Unfortunately, fractured systems cannot be accurately coarse-grained, as critical network topology exists at the smallest scales, including topology that can push the network across a percolation threshold. Therefore, new techniques are necessary to accurately model important fracture systems. Quantum algorithms for solving linear systems offer a theoretically-exponential improvement over their classical counterparts, and in this work we introduce two quantum algorithms for fractured flow. The first algorithm, designed for future quantum computers which operate without error, has enormous potential, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size (order 10–1000 nodes), which we demonstrate experimentally and explain theoretically. We expect further improvements by leveraging quantum error mitigation and preconditioning.

58 GEOSCIENCES↗

GAAF: Searching Activation Functions for Binary Neural Networks Through Genetic Algorithm

Binary neural networks (BNNs) show promising utilization in cost and power-restricted domains such as edge devices and mobile systems. This is due to its significantly less computation and storage demand, but at the cost of degraded performance. To close the accuracy gap, in this paper we propose to add a complementary activation function (AF) ahead of the sign based binarization, and rely on the genetic algorithm (GA) to automatically search for the ideal AFs. These AFs can help extract extra information from the input data in the forward pass, while allowing improved gradient approximation in the backward pass. Fifteen novel AFs are identified through our GA-based search, while most of them show improved performance (up to 2.54% on ImageNet) when testing on different datasets and network models. Interestingly, periodic functions are identified as a key component for most of the discovered AFs, which rarely exist in human designed AFs. Our method offers a novel approach for designing general and application-specific BNN architecture.

59 BASIC BIOLOGICAL SCIENCES↗

Velocity reconstruction in the era of DESI and Rubin/LSST. II. Realistic samples on the light cone

Reconstructing the galaxy peculiar velocity field from the distribution of large-scale structure plays an important role in cosmology. On one hand, it gives us an insight into structure formation and gravity; on the other, it allows us to selectively extract the kinetic Sunyaev-Zel’dovich (kSZ) effect from cosmic microwave background maps. In this work, we employ high-accuracy synthetic galaxy catalogs on the light cone to investigate how well we can recover the velocity field when utilizing the three-dimensional spatial distribution of the galaxies in a modern large-scale structure experiment such as the Dark Energy Spectroscopic Instrument (DESI) and the Rubin Observatory Legacy Survey of Space and Time. In particular, we adopt the standard technique used in baryon acoustic oscillation analysis for reconstructing the Zel’dovich displacements of galaxies through the continuity equation, which yields a first-order approximation to their large-scale velocities. We investigate variations in the number density, bias, mask, area, redshift noise, and survey depth, as well as modifications to the settings of the standard reconstruction algorithm. Since our main goal is to provide guidance for planned kSZ analysis between DESI and the Atacama Cosmology Telescope, we apply velocity reconstruction to a faithful representation of DESI spectroscopic and photometric targets. We report the cross-correlation coefficient between the reconstructed and the true velocities along the line of sight. For the DESI Y1 spectroscopic survey, we expect the correlation coefficient to be r ≈ 0.64, while for a photometric survey with δ z /(1+z) = 0.02, as is approximately the case for the Legacy Survey used in the target selection of DESI galaxies, r shrinks by half to r ≈ 0.31. Here, we hope the results in this paper can be used to inform future kSZ stacking studies and other velocity reconstruction analyses planned with the next generation of cosmology experiments.

79 ASTRONOMY AND ASTROPHYSICS↗

Differentiable Predictions for Large Scale Structure with SHAMNet

In simulation-based models of the galaxy-halo connection, theoretical predictions for galaxy clustering and lensing are typically made based on Monte Carlo realizations of a mock universe. In this paper, we use Subhalo Abundance Matching (SHAM) as a toy model to introduce an alternative to stochastic predictions based on mock population, demonstrating how to make simulation-based predictions for clustering and lensing that are both exact and differentiable with respect to the parameters of the model. Conventional implementations of SHAM are based on iterative algorithms such as Richardson-Lucy deconvolution; here we use the JAX library for automatic differentiation to train SHAMNet, a neural network that accurately approximates the stellar-to-halo mass relation (SMHM) defined by abundance matching. In our approach to making differentiable predictions of large-scale structure, we map parameterized PDFs onto each simulated halo, and calculate gradients of summary statistics of the galaxy distribution by using autodiff to propagate the gradients of the SMHM through the statistical estimators used to measure one- and two-point functions. Our techniques are quite general, and we conclude with an overview of how they can be applied in tandem with more complex, higher-dimensional models, creating the capability to make differentiable predictions for the multi-wavelength universe of galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

Degradation of performance in ICF implosions due to Rayleigh–Taylor instabilities: A Hamiltonian perspective

The Rayleigh–Taylor instability (RTI) is an ubiquitous phenomenon that occurs in inertial-confinement-fusion (ICF) implosions and is recognized as an important limiting factor of ICF performance. To analytically understand the RTI dynamics and its impact on ICF capsule implosions, we develop a first-principle variational theory that describes an imploding spherical shell undergoing RTI. The model is based on a thin-shell approximation and includes the dynamical coupling between the imploding spherical shell and an adiabatically compressed fluid within its interior. Using a quasilinear analysis, we study the degradation trends of key ICF performance metrics (e.g., stagnation pressure, residual kinetic energy, and areal density) as functions of initial RTI parameters (e.g., the initial amplitude and Legendre mode), as well as the 1D implosion characteristics (e.g., the convergence ratio). We compare analytical results from the theory against nonlinear results obtained by numerically integrating the governing equations of this reduced model. Our findings emphasize the need to incorporate polar flows in the calculation of residual kinetic energy and demonstrate that higher convergence ratios in ICF implosions lead to significantly greater degradation of key performance metrics.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

COWALKER:EFFECTIVE TRANSPORT PROPERTIES OF COMPOSITE MATERIALS

SF-23-026 This software computes effective transport properties of composite materials involving fibers and nanoparticles using a random-walk algorithm that efficiently scales to an arbitrary number of processes and cores. Effective transport properties (thermal, electrical) are key to bridge the microstructure of complex materials with its macroscopic behavior. Traditional approaches either use effective medium approximations (closed mathematical expressions that are approximation for certain conditions) or continuum simulation models such as finite element or finite volume, which require the generation of a mesh for each configuration explored. cowalker leverages the equivalence between laplacian or heat equation-based models and random walks to compute the asymptotic transport properties from an ensemble of first sojourn times of a random walker moving through the composite material. This allows us to directly define a composite material as a collection of particles and use algorithms developed for molecular dynamics to quickly compute the intersection of the walker with the different interfaces in the material. cowalker is developed in C++, and it relies on the GNU Scientific Library for random generation. cowalker is currently delivered as source code, so the GSL library is not included in cowalker's distribution. A more userfriendly version, cowalker.jl is currently in development and will be released as part of cowalker.

YANGUAS-GIL, ANGEL↗

thornado-hydro: A Discontinuous Galerkin Method for Supernova Hydrodynamics with Nuclear Equations of State

This paper describes algorithms for non-relativistic hydrodynamics in the toolkit for high-order neutrino radiation hydrodynamics (thornado), which is being developed for multiphysics simulations of core-collapse supernovae (CCSNe) and related problems with Runge–Kutta discontinuous Galerkin (RKDG) methods. More specifically, thornado employs a spectral type nodal collocation approximation, and we have extended limiters — a slope limiter to prevent non-physical oscillations and a bound-enforcing limiter to prevent non-physical states — from the standard RKDG framework to be able to accommodate a tabulated nuclear equation of state (EoS). To demonstrate the efficacy of the algorithms with a nuclear EoS, we first present numerical results from basic test problems in idealized settings in one and two spatial dimensions, employing Cartesian, spherical-polar, and cylindrical coordinates. Then, we apply the RKDG method to the problem of adiabatic collapse, shock formation, and shock propagation in spherical symmetry, initiated with a 15 M ⊙ progenitor. Herein, we find that the extended limiters improve the fidelity and robustness of the RKDG method in idealized settings. The bound-enforcing limiter improves robustness of the RKDG method in the adiabatic collapse application, while we find that slope limiting in characteristic fields is vulnerable to structures in the EoS — more specifically, in the phase transition from nuclei and nucleons to bulk nuclear matter. The success of these applications marks an important step toward applying RKDG methods to more realistic CCSN simulations with thornado in the future.

Nuclear astrophysics (1129)↗

Prediction of vacancy defect diffusion paths in high entropy alloys via machine learning on molecular dynamics data

Identifying the diffusion path of point defects is a critical step in understanding their evolution and the mechanisms of related phenomena. Defect diffusion occurs at small length and time scales, with impacts on material properties that may continue to evolve over ns to μs, ms, and the continuum scale (s, min, etc., and cm, m, etc.). The time scale accessible to molecular dynamics (MD) simulations is limited by small step sizes, typically in the fs range. Thus, surrogate models of MD simulations through machine learning (ML)-based algorithms are of great interest, especially for complex systems such as high entropy alloys (HEAs). In this work, dynamics governing vacancy migration in HEA were approximated with graph convolutional network (GCN) models as ansatzes for kinetic Monte Carlo (KMC) rate catalogs. Network design considered that diffusion in crystalline solids generally depends on interactions between defects and their immediate neighbor atoms. Graphs represented the vacancy surroundings, MD-generated trajectories provided training and comparison datasets, and unsupervised GCN models approximated interatomic dynamics governing vacancy migration in HEAs as ansatzes for KMC. A proof-of-concept model trained on MD data for the Fe, Ni, Cr, Co, and Cu HEA environment was used with two different neighbor interactions to assess the feasibility of training a GCN to predict vacancy defect transition rates in the HEA environment. The resulting setup rapidly generated MD-formatted synthetic trajectories based on dynamics learned from the MD training set, with a time acceleration of roughly two orders of magnitude and a similar diffusion coefficient to MD observations. Additionally, Nudged Elastic Band (NEB) calculations were performed on randomly generated FeNiCrCoCu HEA structures to determine vacancy migration barriers across nearest-neighbor sites. Transition probabilities for each jump, categorized by atomic type, were extracted from these calculations. NEB-based and GCN-based approaches led to similar outcomes.

Reimer, C↗

Clustering at Massive Scale

ClaMS provides hierarchical clustering technology for use on massive, high-dimensional datasets that require distributed memory for processing. The algorithm employed is inspired by the popular HDBSCAN algorithm but makes use of computational kernels better suited for distributed computing. ClaMS is built on scalable nearest neighbor graph construction, metric forest completion, and approximate minimum spanning tree techniques.

Stanley, ThomasA [Lawrence Livermore National Labo↗

WRF-simulated low-level jets over Iowa: characterization and sensitivity studies

Abstract. Output from 6 months of high-resolution simulations with the Weather Research and Forecasting (WRF) model are analyzed to characterize local low-level jets (LLJs) over Iowa for winter and spring in the contemporary climate. Low-level jets affect rotor plane aerodynamic loading, turbine structural loading and turbine performance, and thus accurate characterization and identification are pertinent. Analyses using a detection algorithm wherein the wind speed above and below the jet maximum must be below 80 % of the jet wind speed within a vertical window of approximately 20–530 m a.g.l. (above ground level) indicate the presence of an LLJ in at least one of the 14 700 4 km×4 km grid cells over Iowa on 98 % of nights. Nocturnal LLJs are most frequently associated with stable stratification and low turbulent kinetic energy (TKE) and hence are more frequent during the winter months. The spatiotemporal mean LLJ maximum (jet core) wind speed is 9.55 m s−1, and the mean height is 182 m. Locations of high LLJ frequency and duration across the state are seasonally varying, with a mean duration of 3.5 h. The highest frequency occurs in the topographically complex northwest of the state in winter and in the flatter northeast of the state in spring. Sensitivity of LLJ characteristics to the (i) LLJ definition and (ii) vertical resolution at which the WRF output is sampled is examined. LLJ definitions commonly used in the literature are considered in the first sensitivity analysis. These sensitivity analyses indicate that LLJ characteristics are highly variable with definition. Use of different definitions identifies both different frequencies of LLJs and different LLJ events. Further, when the model output is down-sampled to lower vertical resolution, the mean jet core wind speed height decreases, but spatial distributions of regions of high frequency and duration are conserved. Implementation of a polynomial interpolation to extrapolate down-sampled output to full-resolution results in reduced sensitivity of LLJ characteristics to down-sampling.

17 WIND ENERGY↗

Online Energy-optimal Routing for Electric Vehicles with Combinatorial Multi-arm Semi-Bandit

We have seen a rapid growth in the adoption of electric vehicle in today’s commercial mobility service market, from carrying passengers to the delivery of goods. One cardinal issue concerning the operation of EVs is the optimal routing of EV fleets with limited battery capacity. In this study, we investigate the energy-optimal online routing problem for the fleet of EVs, which focuses on identifying real-time minimum electricity consumption paths (MECP) for multiple OD pairs with limited information. We develop a multi-OD combinatorial multi-arm semi-bandit model (MCMAB) that uses the fleet of EVs as sensors in the transportation network and promotes the utilization of common information shared by different OD pairs. We further enrich the model with the path elimination policy to obtain MECP of high confidence while significantly reducing the number of learning iterations and the number of explorations needed. We demonstrate the effectiveness of the MCMAB and the efficiency of the path elimination policy with comprehensive numerical experiments in Manhattan, NYC. The results show that the proposed online routing algorithms can achieve near-optimal MECPs efficiently, and the quality of the solutions is significantly better than using the shortest travel time paths as approximate MECPs.

Chen, Xiaowei↗