Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized 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 1,063 records · Page 59

Bayesian Optimization for Reactor Design Optimization

This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

Recursive algorithm for constructing antisymmetric fermionic states in first quantization mapping

We devise a deterministic quantum algorithm to produce antisymmetric states of single-particle orbitals in the first quantization mapping. Unlike sorting-based antisymmetrization algorithms, which require ordered input states and high Clifford-gate overhead, our approach initializes the state of each particle independently. For a system of $η$ particles and $N$ single-particle states, our algorithm prepares antisymmetrized states of non-trivial localized (e.g., Hartree-Fock) orbitals using $O(η^2\sqrt{N})$ $T$-gates, outperforming alternative algorithms when $η ≲ \sqrt{N}$. To achieve such scaling, we require $O(\sqrt{N})$ dirty ancilla qubits for intermediate calculations. Knowledge of the single-particle states to be antisymmetrized can be leveraged to further improve the efficiency of the circuit, and a measurement-based variant reduces gate cost by roughly a factor of two. We show example circuits for two- and three-particle systems and discuss the generalization to an arbitrary number of particles. For a specific three-particle example, we decompose the circuit into Clifford $+T$ gates and study the impact of noise on the prepared state.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Probabilistic partition of unity networks for high–dimensional regression problems

We explore the probabilistic partition of unity network (PPOU-Net) model in the context of high-dimensional regression problems and propose a general framework focusing on adaptive dimensionality reduction. With the proposed framework, the target function is approximated by a mixture of experts model on a low-dimensional manifold, where each cluster is associated with a fixed-degree polynomial. We present a training strategy that leverages the expectation maximization (EM) algorithm. During the training, we alternate between (i) applying gradient descent to update the DNN coefficients; and (ii) using closed-form formulae derived from the EM algorithm to update the mixture of experts model parameters. Under the probabilistic formulation, step (ii) admits the form of embarrassingly paralleliazable weighted least-squares solves. The PPOU-Nets consistently outperform the baseline fully-connected neural networks of comparable sizes in numerical experiments of various data dimensions. Here, we also explore the proposed model in applications of quantum computing, where the PPOU-Nets act as surrogate models for cost landscapes associated with variational quantum circuits.

97 MATHEMATICS AND COMPUTING↗

Improved stellarator permanent magnet designs through combined discrete and continuous optimizations

A common optimization problem in the areas of magnetized plasmas and fusion energy is the design of magnets to produce a given three-dimensional magnetic field distribution to high precision. When designing arrays of permanent magnets for stellarator plasma confinement, such problems have tens of thousands of degrees of freedom whose solutions, for practical reasons, should be constrained to discrete spaces. We perform a direct comparison between two algorithms that have been developed previously for this purpose, and demonstrate that composite procedures that apply both algorithms in sequence can produce substantially improved results. One approach uses a continuous, quasi-Newton procedure to optimize the dipole moments of a set of magnets and then projects the solution onto a discrete space. The second uses an inherently discrete greedy optimization procedure that has been enhanced and generalized for this work. Further, the approaches are both applied to design arrays cubic rare-Earth permanent magnets to confine a quasi-axisymmetric plasma with a magnetic field on axis of 0.5 T. The first approach tends to find solutions with higher field accuracy, whereas the second can find solutions with substantially (up to 30%) fewer magnets. When the approaches are combined, they can obtain solutions with magnet quantities comparable to the second approach while matching the field accuracy of the first.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Framework of compressive sensing and data compression for 4D-STEM

Four-dimensional Scanning Transmission Electron Microscopy (4D-STEM) is a powerful technique for high-resolution and high-precision materials characterization at multiple length scales, including the characterization of beam-sensitive materials. However, the field of view of 4D-STEM is relatively small, which in absence of live processing is limited by the data size required for storage. Furthermore, the rectilinear scan approach currently employed in 4D-STEM places a resolution- and signal-dependent dose limit for the study of beam sensitive materials. Improving 4D-STEM data and dose efficiency, by keeping the data size manageable while limiting the amount of electron dose, is thus critical for broader applications. Here we introduce a general method for reconstructing 4D-STEM data with subsampling in both real and reciprocal spaces at high fidelity. The approach is first tested on the subsampled datasets created from a full 4D-STEM dataset, and then demonstrated experimentally using random scan in real-space. The same reconstruction algorithm can also be used for compression of 4D-STEM datasets, leading to a large reduction (100 times or more) in data size, while retaining the fine features of 4D-STEM imaging, for crystalline samples.

4D-STEM↗

Sparse optimization of two-dimensional terahertz spectroscopy

Two-dimensional terahertz spectroscopy (2DTS) is a low-frequency analog of two-dimensional optical spectroscopy that is rapidly maturing as a probe of a wide variety of condensed matter systems. However, a persistent problem with 2DTS is the long experimental acquisition times, which prevent its broader adoption. A potential solution, requiring no increase in experimental complexity, is signal reconstruction via compressive sensing. In this work, we apply the sparse exponential mode analysis (SEMA) technique to 2DTS of a cuprate superconductor. We benchmark the performance of the algorithm in reconstructing terahertz nonlinearities and find that SEMA reproduces the asymmetric photon echo line shapes at sampling rates as low as 10%, reaching the reconstruction noise floor at sampling rates beyond 20%–30%. The success of SEMA in reproducing such subtle, asymmetric line shapes confirms compressive sensing as a general method to accelerate 2DTS and multidimensional spectroscopies more broadly.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Benchmark Solutions for Radiation Transport in Stochastic Media with Inhomogeneous Material Statistics

Accurately solving implicit Monte Carlo (IMC) thermal photon transport problems with mixed material cells is important in realistic applications. The production IMC package at LLNL treats mixed material cells arising from ALE remap and hydrodynamics using the same approximate model. The new Imp IMC thermal photon transport package currently under development has both a material interface reconstruction (MIR) algorithm and a Levermore-Pomraning (LP) stochastic medium algorithm for treating mixed material cells. Existing stochastic medium algorithms for treating mixed material cells in IMC lack a complete theoretical basis. The IMC LP algorithm implementation has been demonstrated to reproduce published deterministic LP solutions for the particular case of spatially homogeneous material statistics. Realistic simulations will include spatially inhomogeneous material statistics (material mean chord lengths). In a previous investigation, the LP-model for transport in binary stochastic media in rod geometry was generalized to accommodate spatially varying material chord lengths, i.e., the mixing statistics were allowed to be nonhomogeneous. Analytical solutions were obtained and used to produce a verifi cation suite for the Imp IMC Levermore-Pomraning implementation for different spatial variations of the chord lengths. However, the accuracy of the LP model when the mixing statistics are nonhomogeneous has not been assessed and leaves open the question of whether local accuracy is improved or further degraded when chord lengths are not uniform. This shortcoming is rectifi ed here by developing benchmark analytic solutions for transport in binary Markovian stochastic mixtures in rod geometry with nonhomogeneous mixing statistics, using spatially varying chord lengths considered in the previous investigation based on the LP model. Methods for sampling a nonhomogeneous Poisson process (NHPP) are first described and used to construct individual realizations of the binary mixtures in rod geometry. Analytic solutions are then obtained for the forward and backward directed fluxes on a given realization, now viewed as a deterministic medium with alternating layers of the two materials with known interface locations. Finally, material averaged scalar fluxes are obtained using these sampling schemes with spatially linear and quadratic chord lengths and used to assess the accuracy of the previously obtained LP-model results.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A new metrics framework for quantifying and intercomparing atmospheric rivers in observations, reanalyses, and climate models

We present a new atmospheric river (AR) analysis and benchmarking tool, namely Atmospheric River Metrics Package (ARMP). It includes a suite of new AR metrics that are designed for quick analysis of AR characteristics via statistics in gridded climate datasets such as model output and reanalysis. This package can be used for climate model evaluation in comparison with reanalysis and observational products. Integrated metrics such as mean bias and spatial pattern correlation are efficient for diagnosing systematic AR biases in climate models. For example, the package identifies the fact that, in CMIP5 and CMIP6 (Coupled Model Intercomparison Project Phases 5 and 6) models, AR tracks in the South Atlantic are positioned farther poleward compared to ERA5 reanalysis, while in the South Pacific, tracks are generally biased towards the Equator. For the landfalling AR peak season, we find that most climate models simulate a completely opposite seasonal cycle over western Africa. This tool can also be used for identifying and characterizing structural differences among different AR detectors (ARDTs). For example, ARs detected with the Mundhenk algorithm exhibit systematically larger size, width, and length compared to the TempestExtremes (TE) method. The AR metrics developed from this work can be routinely applied for model benchmarking and during the development cycle to trace performance evolution across model versions or generations and set objective targets for the improvement of models. They can also be used by operational centers to perform near-real-time climate and extreme event impact assessments as part of their forecast cycle.

58 GEOSCIENCES↗

Using Neural Networks to Identify Mixture Components in Hyperspectral Reflectance Data

Neural networks have been employed to identify materials of interest from hyperspectral data (generally imagery) based on their unique spectral signatures. This approach assumes that there is a single material that is standing out from the rest of the spectrum to be identified. However, pixels often contain more than one material, or a material of interest may itself be a mixture of multiple materials. Neural networks are only as good as the data used to train them, and it takes a great deal of work in the laboratory to identify, make, and measure all potential mixtures of interest. Thus, researchers often calculate synthetic spectra using algorithms with varying degrees of fidelity to the physics that govern the interactions between light and multiple materials. In this work, we have (1) adapted a neural network designed to identify mixture components from Raman spectroscopy to work with visible to near‐infrared reflectance data and (2) tested three common mixture algorithms to determine the most accurate and least computationally expensive method to build synthetic training datasets. With our initial test dataset, we have achieved accuracies of > 90% and found that the synthetic training dataset produced using the Hapke mixture model provides the best results.

99 GENERAL AND MISCELLANEOUS↗

Block Krylov Subspace Methods for Functions of Matrices II: Modified Block FOM

We analyze an expansion of the generalized block Krylov subspace framework of [Electron. Trans. Numer. Anal., 47 (2017), pp. 100--126]. This expansion allows the use of low-rank modifications of the matrix projected onto the block Krylov subspace and contains, as special cases, the block GMRES method and the new block Radau--Arnoldi method. Within this general setting, we present results that extend the interpolation property from the nonblock case to a matrix polynomial interpolation property for the block case, and we relate the eigenvalues of the projected matrix to the latent roots of these matrix polynomials. Some error bounds for these modified block FOM methods for solving linear systems are presented. We then show how cospatial residuals can be preserved in the case of families of shifted linear block systems. This result is used to derive computationally practical restarted algorithms for block Krylov approximations that compute the action of a matrix function on a set of several vectors simultaneously. Finally, we prove some error bounds and present numerical results showing that two modifications of FOM, the block harmonic and the block Radau--Arnoldi methods for matrix functions, can significantly improve the convergence behavior.

97 MATHEMATICS AND COMPUTING↗

Simple Algorithms for a Physics Code Base

Project 1: Developing a container for state variables in a physics code. Project 2: Setting up near-continuous performance and usage metrics monitoring of a physics code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiobjective optimization of nuclear microreactor reactivity control system operation with swarm and evolutionary algorithms

To improve the marketability of novel microreactor designs, there is a need for automated and optimal control of these reactors. This paper presents a methodology for performing multiobjective optimization of control drum operation for a microreactor under normal and off-nominal conditions. Here, two different case studies are used where the control drum configuration is optimized for the reactor to be critical with some desired power distribution that would satisfy peaking limits. A surrogate model for power distribution is developed based on a feedforward neural network. The process for determining weights for scalarization of the multiobjective optimization problem is also detailed. Six optimization algorithms: evolutionary strategies, differential evolution, grey wolf optimization, Harris hawks optimization, moth flame optimization and particle swarm optimization, are all applied to these cases and the results analyzed. Although all these algorithms will demonstrate optima-seeking behavior, for real-time control it is necessary to identify the best algorithm to efficiently provide reasonable optima without operator interference. The moth flame optimization algorithm was found to perform particularly well on both cases. Overall, it was found that the algorithms capable of supplying the best optima were also the most consistent. Finally, the found optima were verified with the original model used to train surrogates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Synthetic data generation for machine learning model training for energy theft scenarios using cosimulation

Abstract Technical and non‐technical losses in distribution circuits result in significant economic costs to power utilities. One type of non‐technical loss is energy theft by various means including illegal tapping of feeders, bypassing the meter, and billing fraud. These losses are usually hard to detect, and can remain undetected for long periods of time. Machine learning models have been proven effective in detecting these conditions, but rely on the availability of large, good‐quality training data sets. The problem is exacerbated by the imbalanced nature of data related to these conditions—energy theft, though costly, is very rare. The available data sets generally have very few samples of theft with most of the data pertaining to normal operation. Such data sets are generally not suitable to train machine learning models. In this paper, an overview of energy theft detection techniques, the challenges with their data needs, and the limitations of current techniques to bridge such data limitations is presented. A co‐simulation framework is proposed to generate reliable training data for machine learning algorithms for theft detection. An example scenario is presented and a machine learning model is built to detect certain kinds of energy theft.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Two-temperature warm dense hydrogen as a test of quantum protons driven by orbital-free density functional theory electronic forces

We consider a steady-state (but transient) situation in which a warm dense aggregate is a two-temperature system with equilibrium electrons at temperature Te, ions at Ti, and Te ≠ Ti. Such states are achievable by pump–probe experiments. For warm dense hydrogen in such a two-temperature situation, we investigate nuclear quantum effects (NQEs) on structure and thermodynamic properties, thereby delineating the limitations of ordinary ab initio molecular dynamics. We use path integral molecular dynamics (PIMD) simulations driven by orbital-free density functional theory (OFDFT) calculations with state-of-the-art noninteracting free-energy and exchange-correlation functionals for the explicit temperature dependence. We calibrate the OFDFT calculations against conventional (explicit orbitals) Kohn–Sham DFT. We find that when the ratio of the ionic thermal de Broglie wavelength to the mean interionic distance is larger than about 0.30, the ionic radial distribution function is meaningfully affected by the inclusion of NQEs. Moreover, NQEs induce a substantial increase in both the ionic and electronic pressures. This confirms the importance of NQEs for highly accurate equation-of-state data on highly driven hydrogen. For Te > 20 kK, increasing Te in the warm dense hydrogen has slight effects on the ionic radial distribution function and equation of state in the range of densities considered. In addition, we confirm that compared with thermostatted ring-polymer molecular dynamics, the primitive PIMD algorithm overestimates electronic pressures, a consequence of the overly localized ionic description from the primitive scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exponential Time Differencing Schemes for Fuel Depletion and Transport in Molten Salt Reactors: Theory and Implementation

A numerical framework for modeling depletion and mass transport in liquid-fueled molten salt reactions is presented based on exponential time differencing. The solution method involves using the finite volume method to transform the system of partial differential equations (PDEs) into a much larger system of ordinary differential equations. The key part of this method involves solving for the exponential of a matrix. We explore six different algorithms to compute the exponential in a series of progression problems that explore physical transport phenomena in molten salt reactors. This framework shows good results for solving linear parabolic PDEs with each of the six matrix exponential algorithms. For large problems, the series solvers such as Padé and Taylor have large run times, which can be mitigated by using the Krylov subspace.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Generalized representative structures for atomistic systems

A new method is presented to generate atomic structures that reproduce the essential characteristics of arbitrary material systems, phases, or ensembles. Previous methods allow one to reproduce the essential characteristics (e.g. the chemical disorder) of a large random alloy within a small crystal structure. The ability to generate small representations of random alloys, along with the restriction to crystal systems, results from using the fixed-lattice cluster correlations to describe structural characteristics. A more general description of the structural characteristics of atomic systems is obtained using complete sets of atomic environment descriptors. These are used within for generating representative atomic structures without restriction to fixed lattices. A general data-driven approach is provided here utilizing the atomic cluster expansion (ACE) basis. The N-body ACE descriptors are a complete set of atomic environment descriptors that span both chemical and spatial degrees of freedom and are used within for describing atomic structures. The generalized representative structure (GRS) method presented within generates small atomic structures that reproduce ACE descriptor distributions corresponding to arbitrary structural and chemical complexity. It is shown that systematically improvable representations of crystalline systems on fixed parent lattices, amorphous materials, liquids, and ensembles of atomic structures may be produced efficiently through optimization algorithms. With the GRS method, we highlight reduced representations of atomistic machine-learning training datasets that contain similar amounts of information and small 40–72 atom representations of liquid phases. The ability to use GRS methodology as a driver for informed novel structure generation is also demonstrated. The advantages over other data-driven methods and state-of-the-art methods restricted to high-symmetry systems are highlighted.

atomic cluster expansion↗

A Non-cooperative Game-based Approach to Distributed Beam Scheduling in Millimeter-Wave Networks

We consider the distributed beam scheduling problem in mm-Wave networks where the base stations may belong to different operators and there is no centralized coordination among them. Our goal is to design distributed beam scheduling algorithms such that the network utility, which is defined as a logarithm function of the average throughput of the user equipment, can be maximized. We propose a non-cooperative game-based scheduling approach where the base stations are modeled as players that greedily maximize their own utilities. The Nash Equilibrium (NE) then provides a distributed solution to the network utility maximization problem. By employing the Lyapunov optimization, the asymptotic optimality of the proposed scheduling can be guaranteed. We prove the existence and provide sufficient conditions which guarantee the uniqueness of the NE by establishing an equivalence to the Variational Inequality (VI) problem. We also propose a parallel power adaptation algorithm which is proved to converge to the NE. Numerical results show the superiority of the proposed scheduling over several distributed baseline schemes.

99 GENERAL AND MISCELLANEOUS↗

Minimizing Ground Risk in Cellular-Connected Drone Corridors With mmWave Links

Unmanned Aircraft Systems (UASs) have been receiving significant interest and support from academia, industry, and regulatory bodies over the past decade due to their various use cases. To safely integrate UAS operations into the national airspace, particularly overpopulated regions, the risk posed to ground users, buildings, and vehicles due to unmanned aerial vehicle (UAV) flight should be minimized. This risk can be represented by a numerical metric, which we refer to in this article as the “ground risk.” Many UAS applications also depend on the presence of a reliable wireless communication link between the UAV and a control station for the transmission of UAV position, surveillance video, UAV payload commands, and other mission-related data. Such wireless communication requirements also need to be considered in the design of UAS operations. In this article, we consider both these aspects and study the design of nonintersecting trajectories for UAS operations to minimize ground risk, subject to constraints on the wireless signal strength and geometry of the trajectory, specified in terms of: 1) an enclosing cylinder within which the trajectory must lie and 2) an integrated angular change along the UAV's trajectory. The performance of a computationally expensive optimal algorithm is compared with that of a computationally faster heuristic approach within the dense urban environment of Manhattan, NY, USA. Performance evaluation using ray-tracing simulations shows that the heuristic approach performs close to the optimal algorithm at a reduced computation cost. In conclusion, this research can be utilized to make UAS operations safe and reliable and accelerate their adoption.

99 GENERAL AND MISCELLANEOUS↗