Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Numerical optimization”

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,711 records · Page 95

Comprehensive assessment of deep reinforcement learning approaches for economic dispatch in nuclear-driven microgrids

As the electrical grid integrates more variable renewable energy sources such as wind and solar, the demand for distributed and flexible systems to address this increased variability becomes critical. Nuclear-driven microgrids provide a promising solution by offering stable generation to complement intermittent renewables, ensuring grid reliability and operating efficiency. This paper proposes a recurrent deep reinforcement learning framework for optimal economic dispatch in a nuclear-powered microgrid integrating renewable energy sources, small modular reactors, battery storage systems, and balance-of-plant dynamics. A three-agent control architecture is developed, where demand and renewable energy agents act as forecasters, and a reinforcement learning-based dispatch agent performs real-time energy allocation. A nonlinear programming formulation is first used to generate an optimal baseline for benchmarking. The proposed dispatch controller, based on Proximal Policy Optimization enhanced with Long Short-Term Memory networks, exploits temporal correlations in system dynamics by taking advantage of the time series used as inputs to improve policy robustness under uncertainty. Comparative analysis against established deep reinforcement learning methods, including Proximal Policy Optimization with a feedforward architecture, Soft Actor-Critic, and Twin Delayed Deep Deterministic Policy Gradient, demonstrates superior performance. Numerical results indicate that the proposed controller achieves a 0.39% cost reduction relative to the nonlinear programming benchmark and outperforms other learning-based methods by generating additional revenue of up to 0.35%. All reinforcement learning controllers compute dispatch actions in less than 0.3 s, resulting in a computational speedup of more than three orders of magnitude over the nonlinear programming baseline. The findings of this paper highlight their applicability for real-time operation and control in nuclear-integrated microgrids under volatile operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization

Abstract An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes ${\mathscr O}(\varepsilon ^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\varepsilon $ and can take ${\mathscr O}(\varepsilon ^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\varepsilon $. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularization using Cubics (arc) method and the recently proposed Trust-Region Algorithm with Contractions and Expansions (trace). The generality of our method is achieved through the introduction of generic conditions that each trial step is required to satisfy, which in particular allows for inexact regularized Newton steps to be used. These conditions center around a new subproblem that can be approximately solved to obtain trial steps that satisfy the conditions. A new instance of the framework, distinct from arc and trace, is described that may be viewed as a hybrid between quadratically and cubically regularized Newton methods. Numerical results demonstrate that our hybrid algorithm outperforms a cubically regularized Newton method.

Mathematics↗

An experimental apparatus for diffraction-limites soft x-ray nanofocusing

Realizing the experimental potential of high-brightness, next generation synchrotron and free-electron laser light sources requires the development of reflecting x-ray optics capable of wavefront preservation and high-resolution nano-focusing. At the Advanced Light Source (ALS) beamline 5.3.1, we are developing broadly applicable, high-accuracy, in situ, at-wavelength wavefront measurement techniques to surpass 100-nrad slope measurement accuracy for diffraction-limited Kirkpatrick-Baez (KB) mirrors. The at-wavelength methodology we are developing relies on a series of wavefront-sensing tests with increasing accuracy and sensitivity, including scanning-slit Hartmann tests, grating-based lateral shearing interferometry, and quantitative knife-edge testing. We describe the original experimental techniques and alignment methodology that have enabled us to optimally set a bendable KB mirror to achieve a focused, FWHM spot size of 150 nm, with 1 nm (1.24 keV) photons at 3.7 mrad numerical aperture. The predictions of wavefront measurement are confirmed by the knife-edge testing.The side-profiled elliptically bent mirror used in these one-dimensional focusing experiments was originally designed for a much different glancing angle and conjugate distances. This work demonstrates that high-accuracy, at-wavelength wavefront-slope feedback can be used to optimize the pitch, roll, and mirror-bending forces in situ, using procedures that are deterministic and repeatable.

42 ENGINEERING↗

Stochastic Richardson Extrapolation Based Numerical Error Estimation for Kinetic Plasma Simulations

We present a numerical error estimation technique specifically formulated to deal with stochastic code output with multiple discretization parameters. This method is based on multiple fits to an error model with arbitrary convergence rates and cross-coupling terms, performed using nonlinear optimization. The fitting approach varies by the type of residual norm which influences the importance of outliers, and weights which influences the relative importance of data points in the coarse and refined regions of discretization parameter space. To account for the influence of stochastic noise, these fits are performed on multiple bootstrap values based on the underlying response data set. Using an automated discretization domain selection scheme, the fits are performed on a series of reduced sets of discretization levels in order to find an optimal fully-converged result estimate in the minimum variance sense; this automated approach enables straightforward analysis of multiple quantities of interest and/or time and spatially-dependent response data. The overall numerical error analysis method is useful for verification and validation problems for stochastic simulation methods and forms a key component in the overall uncertainty quantification process. The method was demonstrated for steady and unsteady electron diode problems simulated using a particle-in-cell kinetic plasma code, demonstrating excellent results.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Adaptive Space-Time Methods for Large Scale Optimal Design

When modeling complex physical systems with advanced dynamics, such as shocks and singularities, many classic methods for solving partial differential equations can return inaccurate or unusable results. One way to resolve these complex dynamics is through r-adaptive refinement methods, in which a fixed number of mesh points are shifted to areas of high interest. The mesh refinement map can be found through the solution of the Monge-Ampére equation, a highly nonlinear partial differential equation. Due to its nonlinearity, the numerical solution of the Monge-Ampére equation is nontrivial and has previously required computationally expensive methods. In this report, we detail our novel optimization-based, multigrid-enabled solver for a low-order finite element approximation of the Monge-Ampére equation. This fast and scalable solver makes r-adaptive meshing more readily available for problems related to large-scale optimal design. Beyond mesh adaptivity, our report discusses additional applications where our fast solver for the Monge-Ampére equation could be easily applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal charging scheduling and management for a fast-charging battery electric bus system

Herein we discuss how battery electric buses (BEBs) are rapidly being embraced by public transit agencies because of their environmental and economic benefits. To address the problems of limited driving range and time-consuming charging for BEBs, manufacturers have developed rapid on-route charging technology that utilizes typical layovers at terminals to charge buses in operation using high power. With on-route fast-charging, BEBs are as capable as their diesel counterparts in terms of range and operating time. However, on-route fast-charging makes it more challenging to schedule and manage charging events for a BEB system. First, on-route fast-charging may lead to high electricity power demand charges. Second, it may increase electricity energy charges because of charging that occurs during on-peak hours. Without careful charging scheduling and management, on-route fast-charging may significantly increase fuel costs and reduce the economic attractiveness of BEBs. The present study proposes a network modeling framework to optimize the charging scheduling and management for a fast-charging BEB system, effectively minimizing total charging costs. The charging schedule determines when to charge a BEB, while the charging management strategically controls the actual charging power. Charging costs include both electricity demand charges and energy charges. The charging scheduling and management problem is first formulated as a nonlinear nonconvex program with time-continuous variables. A discretizing method and a linear reformulation technique are then adopted to reformulate the model as a linear program, which can be easily solved using off-the-shelf solvers, even for large-scale problems. Finally, the model is demonstrated with extensive numerical studies based on two real-world bus networks. The results demonstrate that the proposed model can effectively determine the optimal charging scheduling and management for a fast-charging BEB system, which carries the potential for use in large-scale real-world bus networks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Demand-adaptive Transit Design for Urban Transportation Hubs

In this study, we proposed a novel three-stage framework for planning the optimal demand-adaptive transit (DAT) at urban transportation hubs. Given the potential trip demand and road traffic condition, the proposed framework sequentially generates the optimal set of candidate routes, combines the outgoing routes and incoming routes at the hub, and derives the optimal fleet size and corresponding route frequency under the fixed budget. In particular, we build the route generation algorithm which maximizes passenger demand coverage with travel time deviation constraint. And a heuristic algorithm is further developed which yields near-optimal operation routes for real-time demand. The fleet optimization problem is formulated to minimize the weighted cost of energy savings, operation cost and trip revenue. We conduct comprehensive numerical experiments for planning DAT with electric buses at JFK airport in NYC using NYC taxi and for-hire vehicle trip data and GoogleMap speed data. The results show the superior performance of the proposed route generation algorithm which is able to cover citywide passenger demand with only 61 DAT routes. The results also suggest that the proposed DAT planning framework may serve over 47% of existing taxi and FHV demand by operating 18 routes using the fleet of 62 electric buses.

demand adaptive↗

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

Component-wise reduced order model lattice-type structure design

Lattice-type structures can provide a combination of stiffness with light weight that is desirable in a variety of applications. Design optimization of these structures must rely on approximations of the governing physics to render solution of a mathematical model feasible. In this paper, we propose a topology optimization (TO) formulation that approximates the governing physics using component-wise reduced order modeling as introduced in Huynh et al. (2013); Eftang and Patera (2013), which can reduce solution time by multiple orders of magnitude over a full-order finite element model while providing a relative error in the solution of 1%. In addition, the offline training data set from such component-wise models is reusable, allowing its application to many design problems for only the cost of a single offline training phase, and the component-wise method is nearly embarrassingly parallel. We also show how the parameterization chosen in our optimization allows a simplification of the component-wise reduced order model (CWROM) not noted in previous literature, for further speedup of the optimization process. Furthermore, the sensitivity of the compliance with respect to the particular parameterization is derived solely at the component level. In numerical examples, we demonstrate a 1000x speedup over a full-order FEM model with relative error of 1% and show minimum compliance designs for two different cantilever beam examples, one smaller and one larger. Finally, error bounds for the displacement field, compliance, and compliance sensitivity of the CWROM are derived.

97 MATHEMATICS AND COMPUTING↗

Design Optimization of a Criticality Experiment for the Molten Chloride Reactor Experiment Facility

Neutronics simulations of Molten Chloride Fast Reactors have quantifiable biases that arise from nuclear data, modeling choices, or numerical methods. The multiphysics nature of molten salt reactors makes it challenging to disentangle neutronics modeling biases from biases originating from other physical phenomena. In comparison to a mock-up reactor, criticality experiments can specifically assess the neutronics modeling bias while limiting multiphysics effects. The criticality experiment must be neutronically representative of the full-scale reactor to be valuable. Here, in this paper, we describe the design of a criticality experiment to validate only the neutronics of TerraPower’s Molten Chloride Reactor Experiment (MCRE) and its criticality safety upset scenarios. The proposed experiment uses different chlorine-containing materials to maximize its similarity to the MCRE. The design process uses a constrained Bayesian optimization algorithm to investigate different objective functions that use covariance information for 35 Cl nuclear data. The experiments could reduce the nuclear data–induced uncertainty in k eff of the MCRE from 2161 to 886 pcm. They would also increase the upper subcritical limit of the MCRE criticality safety upset scenario from 0.94101 to 0.94476 when using the WHISPER analysis framework.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Innovations in underground hydrogen storage with multiphysics simulations, optimization, and monitoring: A review

Underground Hydrogen Storage (UHS) is a promising solution for large-scale energy storage and a critical component in advancing low-carbon energy system. Ensuring the safety and efficiency of UHS necessitates a comprehensive understanding of multiphysical interactions driven by cyclic pore fluid pressure fluctuations and coupled physicochemical processes. Here, this review examines the key geomechanical responses in UHS, including rock property variations under cyclic loading, fracture evolution and propagation, reservoir stress sensitivity, and fault stability. It also explores the impact of geochemical and microbial reactions on geomechanical characteristics. We provide an in-depth analysis of Thermal-Hydraulic-Mechanical-Chemical (THMC) coupled numerical simulations, highlighting their potential for future multi-scale modeling. Limitations of current machine learning (ML) approaches in addressing UHS challenges are highlighted, emphasizing the need for innovative ML-based methodologies. Operational strategies for hydrogen injection and production are reviewed, focusing on safety, efficiency, and economic viability. The necessity for multi-objective optimization (MOO) to balance storage efficiency, risk mitigation, and cost-effectiveness is also discussed. Current monitoring technologies are evaluated to ensure safe and efficient UHS operations. Finally, this review identifies critical knowledge gaps and underscores the importance of advancing geomechanical understanding under multiphysics-coupling. We highlight the need for ML-driven multiphysics theories, enhanced modeling techniques, and robust optimization strategies to improve UHS performance. This study serves as a comprehensive reference for future research and the large-scale implementation of UHS systems.

25 ENERGY STORAGE↗

A novel partitioning method for block-structured adaptive meshes

We propose a novel partitioning method for block-structured adaptive meshes utilizing the meshless Lagrangian particle concept. With the observation that an optimum partitioning has high analogy to the relaxation of a multi-phase fluid to steady state, physically motivated model equations are developed to characterize the background mesh topology and are solved by multi-phase smoothed-particle hydrodynamics. In contrast to well established partitioning approaches, all optimization objectives are implicitly incorporated and achieved during the particle relaxation to stationary state. Distinct partitioning sub-domains are represented by colored particles and separated by a sharp interface with a surface tension model. In order to obtain the particle relaxation, special viscous and skin friction models, coupled with a tailored time integration algorithm are proposed. Numerical experiments show that the present method has several important properties: generation of approximately equal-sized partitions without dependence on the mesh-element type, optimized interface communication between distinct partitioning sub-domains, continuous domain decomposition which is physically localized and implicitly incremental. Therefore it is particularly suitable for load-balancing of high-performance CFD simulations.

97 MATHEMATICS AND COMPUTING↗

Uncertainty-aware mixed-variable machine learning for materials design

Abstract Data-driven design shows the promise of accelerating materials discovery but is challenging due to the prohibitive cost of searching the vast design space of chemistry, structure, and synthesis methods. Bayesian optimization (BO) employs uncertainty-aware machine learning models to select promising designs to evaluate, hence reducing the cost. However, BO with mixed numerical and categorical variables, which is of particular interest in materials design, has not been well studied. In this work, we survey frequentist and Bayesian approaches to uncertainty quantification of machine learning with mixed variables. We then conduct a systematic comparative study of their performances in BO using a popular representative model from each group, the random forest-based Lolo model (frequentist) and the latent variable Gaussian process model (Bayesian). We examine the efficacy of the two models in the optimization of mathematical functions, as well as properties of structural and functional materials, where we observe performance differences as related to problem dimensionality and complexity. By investigating the machine learning models’ predictive and uncertainty estimation capabilities, we provide interpretations of the observed performance differences. Our results provide practical guidance on choosing between frequentist and Bayesian uncertainty-aware machine learning models for mixed-variable BO in materials design.

36 MATERIALS SCIENCE↗

Real-time nonlinear optimization as a generalized equation.

We establish results for the problem of tracking a time-dependent manifold arising in real-time optimization by casting this as a parametric generalized equation. We demonstrate that if points along a solution manifold are consistently strongly regular, it is possible to track the manifold approximately by solving a single linear complementarity problem (LCP) at each time step. We derive sufficient conditions guaranteeing that the tracking error remains bounded to second order with the size of the time step even if the LCP is solved only approximately. We use these results to derive a fast, augmented Lagrangian tracking algorithm and demonstrate the developments through a numerical case study.

36 MATERIALS SCIENCE↗

Newton trust-region methods with primary variable switching for simulating high temperature multiphase porous media flow

Coupling multiphase flow with energy transport due to high temperature heat sources introduces significant new challenges since boiling and condensation processes can lead to dry-out conditions with subsequent re-wetting. The transition between two-phase and single-phase behavior can require changes to the primary dependent variables adding discontinuities as well as extending constitutive nonlinear relations to extreme physical conditions. Practical simulations of large-scale engineered domains lead to Jacobian systems with a very large number of unknowns that must be solved efficiently using iterative methods in parallel on high-performance computers. Performance assessment of potential nuclear repositories, carbon sequestration sites and geothermal reservoirs can require numerous Monte-Carlo simulations to explore uncertainty in material properties, boundary conditions, and failure scenarios. Due to the numerical challenges, standard NR iteration may not converge over the range of required simulations and require more sophisticated optimization method like trust-region. In this study, we use the open-source simulator PFLOTRAN for the important practical problem of the safety assessment of future nuclear waste repositories in the U.S. DOE geologic disposal safety assessment Framework. The simulator applies the PETSc parallel framework and a backward Euler, finite volume discretization. We demonstrate failure of the conventional NR method and the success of trust-region modifications to Newton’s method for a series of test problems of increasing complexity. Trust-region methods essentially modify the Newton step size and direction under some circumstances where the standard NR iteration can cause the solution to diverge or oscillate. Furthermore, we show how the Newton Trust-Region method can be adapted for Primary Variable Switching (PVS) when the multiphase state changes due to boiling or condensation. The simulations with high-temperature heat sources which led to extreme nonlinear processes with many state changes in the domain did not converge with NR, but they do complete successfully with the trust-region methods modified for PVS. This implementation effectively decreased weeks of simulation time needing manual adjustments to complete a simulation down to a day. Finally, we show the strong scalability of the methods on a single node and multiple nodes in an HPC cluster.

54 ENVIRONMENTAL SCIENCES↗

Embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods

We construct a family of embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods of order 2 ≤ p ≤ 4 to be used to obtain numerical solution of spatially discretized hyperbolic PDEs. In this construction, the goals include non-defective property, large stability region, and small error values as defined in Dekker and Verwer (1984) and Kennedy et al. (2000). The new family of embedded pairs offer the ability for strong stability preserving (SSP) methods to adapt by varying the step-size. Through several numerical experiments, we assess the overall effectiveness in terms of work versus precision while also taking into consideration accuracy and stability.

97 MATHEMATICS AND COMPUTING↗

hp -VPINNs: Variational physics-informed neural networks with domain decomposition

We formulate a general framework for hp-variational physics-informed neural networks (hp-VPINNs) based on the nonlinear approximation of shallow and deep neural networks and hp-refinement via domain decomposition and projection onto the space of high-order polynomials. The trial space is the space of neural network, which is defined globally over the entire computational domain, while the test space contains piecewise polynomials. Specifically in this study, the hp-refinement corresponds to a global approximation with a local learning algorithm that can efficiently localize the network parameter optimization. Here, we demonstrate the advantages of hp-VPINNs in both accuracy and training cost for several numerical examples of function approximation and in solving differential equations.

42 ENGINEERING↗

Large eddy simulation of wind farm performance in horizontally and vertically staggered layouts

This numerical investigation employs Large Eddy Simulation (LES) coupled with Actuator Disk Model (ADM) to evaluate wind farm layout optimization strategies. The study presents a systematic analysis of aligned, horizontal staggering, vertical staggering, and mixed (combination of horizontal and vertical) staggering configurations, aiming to establish optimal design parameters for enhanced power production. The investigation examines key performance metrics including mean velocity distributions, turbulence intensity characteristics, and power generation efficiency. Results demonstrate better performance of both horizontal and vertical staggering patterns compared to conventional aligned configurations, with horizontal staggering exhibiting notably higher power output than vertical arrangements. Our findings also suggest that mixed configurations, incorporating both horizontal and vertical staggering, can offer optimal performance characteristics. As a result, this research advances the understanding of wake interactions in complex wind farm layouts and provides design guidelines for maximizing wind farm power generation efficiency through strategic turbine positioning.

17 WIND ENERGY↗