SEARCH · Engineering Papers

Results for “proximal algorithms”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Simulations suggest offshore wind farms modify low-level jets

Abstract. Offshore wind farms are scheduled to be constructed along the East Coast of the US in the coming years. Low-level jets (LLJs) – layers of relatively fast winds at low altitudes – also occur frequently in this region. Because LLJs provide considerable wind resources, it is important to understand how LLJs might change with turbine construction. LLJs also influence moisture and pollution transport; thus, the effects of wind farms on LLJs could also affect the region’s meteorology. In the absence of observations or significant wind farm construction as yet, we compare 1 year of simulations from the Weather Research and Forecasting (WRF) model with and without wind farms incorporated, focusing on locations chosen by their proximity to future wind development areas. We develop and present an algorithm to detect LLJs at each hour of the year at each of these locations. We validate the algorithm to the extent possible by comparing LLJs identified by lidar, constrained to the lowest 200 m, to WRF simulations of these very low LLJs (vLLJs). In the NOW-WAKES simulation data set, we find offshore LLJs in this region occur about 25 % of the time, most frequently at night, in the spring and summer months, in stably stratified conditions, and when a southwesterly wind is blowing. LLJ wind speed maxima range from 10 m s−1 to over 40 m s−1. The altitude of maximum wind speed, or the jet “nose”, is typically 300 m above the surface, above the height of most profiling lidars, although several hours of vLLJs occur in each month in the data set. The diurnal cycle for vLLJs is less pronounced than for all LLJs. Wind farms erode LLJs, as LLJs occur less frequently (19 %–20 % of hours) in the wind farm simulations than in the no-wind-farm (NWF) simulation (25 % of hours). When LLJs do occur in the simulation with wind farms, their noses are higher than in the NWF simulation: the LLJ nose has a mean altitude near 300 m for the NWF jets, but that nose height moves higher in the presence of wind farms, to a mean altitude near 400 m. Rotor region (30–250 m) wind veer is reduced across almost all months of the year in the wind farm simulations, while rotor region wind shear is similar in both simulations.

17 WIND ENERGY↗

DOE OSTI2025

Efficient proximal subproblem solvers for a nonsmooth trust-region method

In [R. J. Baraldi and D. P. Kouri, Mathematical Programming, (2022), pp. 1-40], we introduced an inexact trust-region algorithm for minimizing the sum of a smooth nonconvex and nonsmooth convex function. The principle expense of this method is in computing a trial iterate that satisfies the so-called fraction of Cauchy decrease condition—a bound that ensures the trial iterate produces sufficient decrease of the subproblem model. In this paper, we expound on various proximal trust-region subproblem solvers that generalize traditional trust-region methods for smooth unconstrained and convex-constrained problems. We introduce a simplified spectral proximal gradient solver, a truncated nonlinear conjugate gradient solver, and a dogleg method. Finally, we compare algorithm performance on examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

COMPASO : A new halo finder for competitive assignment to spherical overdensities

We describe a new method (compaso) for identifying groups of particles in cosmological N-body simulations. compaso builds upon existing spherical overdensity (SO) algorithms by taking into consideration the tidal radius around a smaller halo before competitively assigning halo membership to the particles. In this way, the compaso finder allows for more effective deblending of haloes in close proximity as well as the formation of new haloes on the outskirts of larger ones. This halo-finding algorithm is used in the abacussummit suite of N-body simulations, designed to meet the cosmological simulation requirements of the Dark Energy Spectroscopic Instrument (DESI) survey. compaso is developed as a highly efficient on-the-fly group finder, which is crucial for enabling good load-balancing between the GPU and CPU and the creation of high-resolution merger trees. In this paper, we describe the halo-finding procedure and its particular implementation in abacus, accompanying it with a qualitative analysis of the finder. We test the robustness of the compaso catalogues before and after applying the cleaning method described in an accompanying paper and demonstrate its effectiveness by comparing it with other validation techniques. We then visualize the haloes and their density profiles, finding that they are well fit by the NFW formalism. Finally, we compare other properties such as radius–mass relationships and two-point correlation functions with that of another widely used halo finder, rockstar.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2020

Predicting the proximity to macroscopic failure using local strain populations from dynamic in situ X-ray tomography triaxial compression experiments on rocks

Predicting the proximity of large-scale dynamic failure is a critical concern in the engineering and geophysical sciences. Here we use evolving contractive, dilatational, and shear strain deformation preceding failure in dynamic X-ray tomography experiments to examine which strain components best predict the proximity to failure. We develop machine learning models to predict the proximity to failure using time series of three-dimensional local incremental strain tensor fields acquired in rock deformation experiments under stress conditions of the upper crust. Three-dimensional scans acquired in situ throughout triaxial compression experiments provide a distribution of density contrasts from which we estimate the three-dimensional incremental strain that accumulates between each scan acquisition. Training machine learning models on multiple experiments of six rock types provides suites of feature importance that indicate the predictive power of each feature. Comparing the average importance of groups of features that include information about each strain component quantifies the ability of the contractive, dilatational and shear strain to predict the proximity of macroscopic failure. A total of 24 models of four machine learning algorithms with six rock types indicate that 1) the dilatational strain provides the best predictive power of the strain components, and 2) the intermediate values (25th-75th percentile) of the strain population provide the best predictive power of the statistics of the strain populations. In addition, the success of the predictions of models trained on one rock type and tested on other rock types quantifies the similarities and differences of the precursory strain accumulation process in the six rock types. These similarities suggest the potential existence of a unified theory of brittle rock deformation for a range of rock types.

58 GEOSCIENCES↗

DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

Substructure in the stellar halo near the Sun: I. Data-driven clustering in integrals-of-motion space

Context. Merger debris is expected to populate the stellar haloes of galaxies. In the case of the Milky Way, this debris should be apparent as clumps in a space defined by the orbital integrals of motion of the stars. Aims. Our aim is to develop a data-driven and statistics-based method for finding these clumps in integrals-of-motion space for nearby halo stars and to evaluate their significance robustly. Methods. We used data from Gaia EDR3, extended with radial velocities from ground-based spectroscopic surveys, to construct a sample of halo stars within 2.5 kpc from the Sun. We applied a hierarchical clustering method that makes exhaustive use of the single linkage algorithm in three-dimensional space defined by the commonly used integrals of motion energy E, together with two components of the angular momentum, L z and L ⊥ . To evaluate the statistical significance of the clusters, we compared the density within an ellipsoidal region centred on the cluster to that of random sets with similar global dynamical properties. By selecting the signal at the location of their maximum statistical significance in the hierarchical tree, we extracted a set of significant unique clusters. By describing these clusters with ellipsoids, we estimated the proximity of a star to the cluster centre using the Mahalanobis distance. Additionally, we applied the HDBSCAN clustering algorithm in velocity space to each cluster to extract subgroups representing debris with different orbital phases. Results. Our procedure identifies 67 highly significant clusters (> 3σ), containing 12% of the sources in our halo set, and 232 subgroups or individual streams in velocity space. In total, 13.8% of the stars in our data set can be confidently associated with a significant cluster based on their Mahalanobis distance. Inspection of the hierarchical tree describing our data set reveals a complex web of relations between the significant clusters, suggesting that they can be tentatively grouped into at least six main large structures, many of which can be associated with previously identified halo substructures, and a number of independent substructures. This preliminary conclusion is further explored in a companion paper, in which we also characterise the substructures in terms of their stellar populations. Conclusions. Our method allows us to systematically detect kinematic substructures in the Galactic stellar halo with a data-driven and interpretable algorithm. The list of the clusters and the associated star catalogue are provided in two tables available at the CDS.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Analysis and prediction of intersection traffic violations using automated enforcement system data

We report that the automated enforcement system (AES) is an effective way of supplementing traditional traffic enforcement, and the traffic violation data from AES can also be effectively used for safety research. In this study, traffic violation data were used to analyze the influencing factors associated with traffic violations and to predict the probability of violations at intersections. The potential factors influencing violations include 24 independent factors related to time, space, traffic and weather. Results from a logistic model showed that the midday period, weekends, residential districts, collector roads, congested traffic conditions, high traffic flow, lower wind speed and low temperature would increase the probability of traffic violations. The probability of violations was predicted by the random forest algorithm, which was proven to be the best traffic violation prediction model among logistic regression, Gaussian naive Bayes, and support vector machine. Moreover, the proximity weighted synthetic oversampling technique (ProWSyn) method was applied to reduce the impact of the imbalance ratio (IR) and improve the model’s prediction performance. The receiver operating characteristics (ROC) curves and Precision-Recall (PR) curves illustrated that the random forest algorithm using oversampling data had the best classifier prediction performance than undersampling data. The area under curve (AUC) and out-of-bag (OOB) error with IR = 1 reached 0.914 and 0.0787, which showed the better performance of the random forest algorithm using ProWSyn in dealing with imbalanced traffic violation data.

42 ENGINEERING↗

DOE OSTI2021

Flow and heat transfer in the wake of a triangular arrangement of spheres

This research work seeks to investigate the influence of spacing and heat transfer on the wake behavior of a triangular arrangement of spheres. Four experimental configurations have been investigated at three Reynolds numbers, Re 1 = 350, Re 2 = 700, and Re 3 = 1050. Two isothermal cases were investigated with spacing between the spheres of zero and one sphere diameter, and two cases were investigated with an applied heat flux at the same spacing conditions. The time resolved particle image velocimetry results revealed various flow phenomena including flow separations, von Karman vortex shedding, and Kelvin–Helmholtz instabilities. The turbulent statistics reveal the effect of proximity and heat transfer on the time averaged values of the wake size, turbulent strengths, and Reynolds shear stress in the wake of each sphere, namely, the laminarization effects from the addition of heat and the suppression of the lead sphere wake from the proximity of the trailing spheres. These results are complemented by the application of proper orthogonal decomposition (POD) to the flow fields, which extracts the coherent structures from the flow. Here the modes that describe the coherent structures are extracted and described in detail, which provide further insight into effects of the experimental conditions on the temporal behavior of the flow. Many of the low order modes are found to be associated in pairs, corresponding to asymmetric structures or advection of a given structure downstream. The capability of POD to produce reduced order models of the flow is then utilized to facilitate vortex identification analysis. A turbulent kinetic energy based mode truncation criteria, which has been found to enhance vortex identification capability, is applied to select the POD modes and temporal coefficients to be used in the reduced order modeling. The reconstructed velocity fields are then analyzed with vortex identification algorithms to extract the vortex cores and boundaries. The combination of these approaches allows the study of the effect of proximity and heat transfer on the vortex characteristics, such as size, strength, and distribution.

42 ENGINEERING↗

DOE OSTI2022

Deep reinforcement learning based optimization for a tightly coupled nuclear renewable integrated energy system

New ways to integrate energy systems to maximize efficiency are being sought to meet carbon emissions goals. Nuclear-renewable integrated energy system (NR-IES) concepts are a leading solution that couples a nuclear power plant with renewable energy, hydrogen generation plants, and energy storage systems, such that thermal and electrical power are dispatchable to fulfill grid-flexibility requirements while also producing hydrogen and maximizing revenue. Here, this paper introduces a deep reinforcement learning (DRL)-based framework to address the complex decision-making tasks for NR-IES. The objective is to maximize revenue by generating and selling hydrogen and electricity simultaneously according to their time-varying prices while keeping the energy flow in the subsystems in balance. A Python-based simulator for a NR-IES concept has been developed to integrate with OpenAI Gym and Ray/RLlib to enable an efficient and flexible computational framework for DRL research and development. Three state-of-the-art DRL algorithms have been investigated, including two-delayed deep deterministic policy gradient (TD3), soft-actor critic (SAC), proximal policy optimization (PPO), to illustrate DRL’s superiority for controlling NR-IES by comparing it with a conventional control approach, particle swarm optimization (PSO). In this effort, PPO has shown more-stable performance and also better generalization capability than SAC and TD3. Comparisons with PSO have demonstrated that, on average, PPO can achieve 13.9% more mean episode returns from the training process and 29.4% more mean episode returns from the testing process when different hydrogen-production targets are applied.

08 HYDROGEN↗

DOE OSTI2025

A Reinforcement Learning Approach to Augment Conventional PID Control in Nuclear Power Plant Transient Operation

The ability of nuclear reactors to operate their power conversion cycles more flexibly will enhance their value to energy grids with variable pricing. Current nuclear control systems are typically classical controllers that are often based on proportional-integral-derivative (PID) control. This paper presents a method of augmenting the existing PID control for difficult transient operations in nuclear power plants using a reinforcement learning–derived feedforward signal applied in real time. The agents, which are trained on a test thermal load-following problem, are designed to improve steam generator outlet temperature control for a range of fast load-following scenarios covering ramp rates from 9%/min to 15%/min. Several reinforcement learning algorithms were initially investigated for the training of the feedforward agents with deep Q-learning (DQN) and proximal policy optimization (PPO) networks, which were found to be the most promising. The DQN controllers utilize discrete actions, giving them a better disturbance rejection at steady state but inconsistent response to initial temperature deviations. In contrast, PPO-trained agents, which take continuous actions except for a dead zone around zero, were shown to have the best combination of high disturbance rejection at steady state and good tracking of the desired temperature value. The ability of the PPO agent was also examined, with the average time of decision making found to be on the order of 1 ms. The fault properties of the controller under the loss of the reinforcement learning agent feedforward signal were also examined. The controller showed strong performance in situations of “no-signal” faults. but was less good at handling “stuck-at” faults, where the feedforward signal remains at a set value. In both cases, however, the PID was able to successfully maintain stability, eventually returning the system to a steady state. It is hoped that this work will allow for the proposed control architecture to be examined for more difficult control problems such that it may eventually be used to adapt existing nuclear plants for more aggressive load-following on grids of the future.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2024

Search for Fast Magnetic Monopoles with NOvA Far Detector

The NOvA experiment at Fermilab consists of two functionally identical liquid scintillator detectors called near detector and far detector to study neutrino oscillations using GeV-scale neutrinos from the Fermilab NuMI beam. Due to its location close to the earth’s surface, surface area of over 4,000 $(m^{2})$, and little overburden, the NOvA far detector is sensitive to an extensive range of magnetic monopole masses and velocities. With the help of the far detector, we are looking for signals of relic monopoles in the cosmic rays flux that might have been produced in the early universe. We have developed the data-driven trigger(DDT), a robust trigger algorithm optimized for continuously searching the magnetic monopole-like patterns in the live data. Due to the surface proximity of the far detector, the major challenge for this analysis at the offline level is the rejection of cosmic ray background in the collected data. In this talk, I will present the status of the search for fast-moving magnetic monopoles using the data collected by the NOvA far detector.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Toward a scalable robust security-constrained optimal power flow using a proximal projection bundle method

Robust security-constrained optimal power flow (rSCOPF) aims to find the worst-case contingencies of alternating current optimal power flow (ACOPF) in power systems. With the rise of GPU architectures on the upcoming supercomputer architectures, optimization algorithms that rely on sparse linear algebra and indefinite linear systems are becoming increasingly hard to solve efficiently (e.g. interior-point method). To address this we revisit a maximin optimization formulation of the rSCOPF and the single-level mixed-integer semidefinite programming (MISDP) reformulation, which is obtained by taking the Lagrangian relaxation of the inner minimization ACOPF problem. In this paper, we focus on the development of a proximal projection bundle method (PPBM) for solving continuous relaxation node subproblems of the MISDP problem, based primarily on the well-known alternating direction method of multipliers. Cutting planes reminiscent of bundle method ideas are also applied in coordination with updates of the proximal parameter. The cutting-plane method can generate a large number of linear inequalities, leading to a large scale but decomposable quadratic programming (QP) subproblem that is amenable to GPUs. We present the numerical results on the IEEE 30, 57, 118, and 300-bus systems by using our PBMM method. We discuss the main computational bottleneck of our method, which is the time taken to solve each iteration of a QP subproblem instance of the PPBM, and how GPU architectures can accelerate this solution process.

bundle method↗

DOE OSTI2026

Particle Filter Based Inference Testing

The primary intent of PAR-FIT (Particle Filter based Inference Testing) is to provide hard inductive evidence that a machine learning model is capable and proven for an individual test input. By examining training data used to form the underlying model functional correlation, an estimate of the reliability that a model will make the correct prediction can be made. The Sequential Probability Ratio Test is used to derive a qualitative evaluation for reliability based on hypothesis testing. The PAR-FIT framework achieves this by implementing a particle filter and the sequential probability ratio test algorithms on the machine learning model training data to determine relevancy of new individual test samples to the training dataset. The kernel function evaluates the local proximity and density of training data used to derive a prediction outcome. Particles are used to probabilistically determine which training data to evaluate for proximity. For test samples that are within a close proximity to and surrounded by multiple training data points, the evaluated reliability of the prediction is high. For test samples that are anomalies not represented by the training dataset, in low density data clusters, or are far from existing data points, the evaluated reliability is low as insufficient training evidence exists to suggest the model is capable of making the correct prediction. Sequential Probability Ratio Test is further used to determine when a hypothesis on whether a signal can be rejected or accepted for use. The ratio test collects sequence information from the particle filter to test whether the signal is anomalous or normal via hypothesis testing of the underlying distributions.

Chen, Edward [Idaho National Laboratory (INL), Ida↗

DOE OSTI2024

Improving Property Graph Layouts by Leveraging Attribute Similarity for Structurally Equivalent Nodes

Many real-world networks contain structurally-equivalent nodes. These are defined as vertices that share the same set of neighboring nodes, making them interchangeable with a traditional graph layout approach. However, many real-world graphs also have properties associated with nodes, adding additional meaning to them. We present an approach for swapping locations of structurally-equivalent nodes in graph layout so that those with more similar properties have closer proximity to each other. This improves the usefulness of the visualization from an attribute perspective without negatively impacting the visualization from a structural perspective. We include an algorithm for finding these sets of nodes in linear time, as well as methodologies for ordering nodes based on their attribute similarity, which works for scalar, ordinal, multidimensional, and categorical data.

graph drawing, network visualization, property gra↗

DOE OSTI2020

A geospatial model for the analysis of time-dependent land subsidence induced by reservoir depletion

Land subsidence due to fluid depletion is an outcome of physical processes operating across a wide range of time and length scales. Although geomechanical models are crucial to simulate reservoir compaction and predict its long-term fate, their use across large regions often bears prohibitive computational costs. To overcome this obstacle, this paper proposes a simplified modelling framework consisting of (i) a near-field numerical solver simulating the coupling between fluid flow and rock deformation with reference to a simplified one-dimensional geometry and (ii) a far-field geospatial algorithm mapping ground settlements across a region through the superposition of poroelastic computations at multiple wells. The model computes the delay between depletion history and reservoir compaction in proximity of a producing well by assuming basal depletion of a fluid-saturated deformable disk, while the Geertsma solution of nucleus of strain is used to extrapolate the impact of such time-varying reservoir compaction around the well. This approach has been used to back-analyze the spatio-temporal progression of subsidence at the Groningen gas field. The results are compared against measurements collected over 50 year of production at 25 benchmark locations scattered over an area of 900 km 2 . It is shown that coupled simulations based on average values of rock compressibility and permeability lead to nonlinear trends of subsidence evolution in good agreement with field measurements, while uncoupled analyses overpredict settlements by more than 70%. Lastly, synthetic forecasts based on different rates of depletion were provided. The results suggest that slower depletion rates lead to lower subsidence at a given time, and that residual subsidence may continue to develop for several decades after interruption of production activities.

58 GEOSCIENCES↗

DOE OSTI2022

PWR loading pattern optimization with reinforcement learning

The core loading pattern optimization problem belongs to the class of combinatorial optimization problem and has been studied since the dawn of commercial nuclear energy industry. It is characterized by multiple objectives and constraints, with a very high number of candidate patterns, which makes it impossible to solve explicitly. Stochastic optimization methodologies including Genetic Algorithms and Simulated Annealing are used by different nuclear utilities and vendors to perform fuel cycle reload design. Nevertheless, hand-designed solutions continue to be the prevalent method in the industry. To improve the state-of-the-art core reload patterns, we aim to create a method as scalable as possible, that agrees with the designer's goal of performance and safety. To help in this task Deep Reinforcement Learning (DRL), in particular Proximal Policy Optimization is leveraged. DRL has recently experienced a strong impetus from its successes applied to games, sometimes even reaching 'super-human' performances. This paper lays out the foundation of this method and proposes to study the behavior of several hyper-parameters that influence the DRL algorithm. The algorithm is highly dependent on multiple factors such as an exploration/exploitation trade-off that manifests through different parameters such as the number of loading patterns seen and the number of samples collected before a policy update, but also the shape of the objective function derived for the core design. Experimental results also demonstrate the effectiveness of the method in finding high-quality solutions from scratch within a reasonable amount of time. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2025

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Spatiotemporal Plasma-Particle Characterization of Dry Aerosols Using Nanosecond, Femtosecond, and Filament Laser-Produced Plasmas

The ability to rapidly characterize dry aerosols in air using laser-induced breakdown spectroscopy (LIBS) with femtosecond laser pulses promises advancement towards real-time atmospheric sampling and standoff capabilities. Of particular interest is the ability to apply LIBS in the context of low-particle loaded environments where discrete particle interactions must be observed within the sampling volume of the laser-produced plasma (LPP). In this study, dry nanoparticles in suspension are generated from a standard solution and sampled in air using Q-switched nanosecond (ns-) pulses, short-focus (SF) femtosecond (fs-) pulses, and filaments. Short time-gated plasma images are captured to observe spatially and temporally varying discrete plasma-particle interactions, which is shown to influence early air breakdown behavior and subsequent plasma evolution. Along with images, photo-multiplier tube (PMT) measurements are conducted where strong spatiotemporal dependencies are exhibited by the collected emission signal on particle proximity and plasma expansion behavior. Finally, conditional analysis is performed on LIBS measurements to determine associated sampling probabilities and filter out spectra with poor or absent emission peaks with an adaptive threshold algorithm.

42 ENGINEERING↗