Search NASA⌕ Search

SEARCH · Search NASA

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 235 records · Page 13

Enhancing carbon dioxide capture under humid conditions by optimizing the pore surface structure

Metal–organic frameworks (MOFs) exhibit significant potential for mitigating carbon emissions due to their high porosity and tunability. Despite numerous reports on CO 2 capture by MOF sorbents, a common challenge is their poor selectivity for CO 2 over water. Moreover, in-depth studies are much needed to elucidate the relationships among the pore surface structure, hydrophobicity, and CO 2 uptake capacity/selectivity. In this work, we investigate the factors influencing CO 2 adsorption capacity and selectivity under humidity in a series of isoreticular pillar-layer structures, Ni 2 (L) 2 (dabco) (L = bdc, ndc, adc). Our study shows that increasing ligand conjugation not only results in increased hydrophobicity, decreased pore size and BET surface area, but also leads to the change of primary binding sites of water molecules and higher binding energy of CO 2 , all of which contribute to largely increased CO 2 uptake capacity under humid conditions. Additionally, increasing ligand conjugation and consequently hydrophobicity slow down and reduce competitive water adsorption drastically. Notably, the MOF made of ligand with the highest conjugation, Ni 2 (adc) 2 (dabco), exhibits significantly enhanced CO 2 adsorption in N 2 /CO 2 binary mixtures under relatively high humidity (50% RH), with an increase of ~31% and ~36% for the composition of 15/85 and 50/50, respectively, compared to dry conditions. An experimental FTIR study and DFT theoretical calculations confirm that H 2 O occupies different primary binding site in Ni 2 (bdc) 2 (dabco) and Ni 2 (adc) 2 (dabco), and under humid conditions a higher binding energy of CO 2 is achieved with preferential H 2 O/CO 2 co-adsorption in Ni 2 (adc) 2 (dabco), potentially creating additional adsorption sites for CO 2 .

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

PSA 2025 DPRA for Cyber Optimization

Cyberattacks can have many different attack paths, durations, and goals. There are also many different mitigation options involving hardware, software, and/or humans. Evaluating defense options should include quantitative evaluation of overall effectiveness to make cost and risk-informed decisions. Typical cyberattack modeling methods only provide a qualitative evaluation and have difficulty with time dependent scenarios. The main areas of cybersecurity are confidentiality, integrity, and availability. For companies with cyber-physical systems such as advanced nuclear reactors, cyber-related integrity is a requirement set by the U.S. Nuclear Regulatory Commission. But companies are also concerned about availability or reliability as a business case. As cyber threats are evolving to a business-for-hire structure, more attacks focus on disrupting business success and reliability, causing financial and economic stability risk. Companies want reliability analysis while optimizing cost, which requires more than safety modeling methods. Dynamic-state-based and Markov-based modeling provides a method for better cyber scenario modeling with timing and conditional features not found in other numerical evaluation methods. EMRALD (Event Modeling Risk Assessment using Lined Diagrams) is a dynamic risk analysis modeling and simulation tool and has features that reduce modeling issues such as state-base explosion found in Markov-based tools. It has been used to model different time-dependent events including plant behavior and operator procedures. As a general modeling tool, EMRALD can also be used to model cyberattack scenarios with varying mitigation options and quantify effectiveness, producing numerical data for risk-informed decisions. This paper uses EMRALD to demonstrate that dynamic risk analysis can be used for cyber threat modeling to provide insights for design decision-making and optimize defense strategies.

97 - MATHEMATICS AND COMPUTING↗

Efficient sensitivity analysis of the thermal profile in powder bed fusion of metals using hypercomplex automatic differentiation finite element method

Rapid cyclic temperature fluctuation occurring in powder bed fusion of metals using a laser beam (PBF-LB/M) influences the formation of flaws in printed parts. Consequently, there is a pressing need to enhance the quality of printed parts by developing innovative methodologies that can predict thermal histories and help uncover the intricate relationships between process parameters and thermal profiles. Sensitivity Analysis (SA) emerges as an essential tool for this, offering the potential for process optimization and enhanced quality control. Nonetheless, conventional SA methodologies often incur in excessive computational costs and potential numerical approximation errors. Here, to address this technical challenge, we present a novel method for SA that integrates the HYPercomplex-based Automatic Differentiation (HYPAD) technique with transient thermal simulations conducted via the finite element method (FEM). Leveraging this methodology, we efficiently and accurately perform SA for PBF-LB/M processes in a post-processing step. Compared to traditional methods like Finite Differences (FD), HYPAD-FEM required 96 % less computational time for obtaining sensitivities for 22 process parameters, under a comparative study conducted within the context of the 2018–02 AM benchmark of the National Institute of Standards and Technology. In summary, HYPAD-FEM offers superior efficiency and accuracy in SA over conventional methods, delivering the best sensitivity of a model without the need for step-size selection and problem or parameter-based implementations.

36 MATERIALS SCIENCE↗

Optimal Coordination of Electric Vehicles for Grid Services using Deep Reinforcement Learning

Recent research has shown the effectiveness of reinforcement learning (RL) in coordinating electric vehicles (EVs) with vehicle-to-grid capabilities for grid services. However, many of these studies rely on lookup table and deep Q-network techniques, which can be impractical when dealing with continuous states and actions. In addition, existing RL designs inadequately account for battery aging effects, EV user satisfaction, uncertain departure and arrival time, and trip distance, which may compromise effective coordination. This paper aims to bridge these gaps by developing an innovative deep deterministic policy gradient-based RL framework for optimal coordination of EVs. Case studies were carried out using a test system with 100 EVs, and numerical analysis results showed that the proposed RL framework can effectively coordinate EVs to maximize economic benefits and user satisfaction while ensuring the expected battery lifespan.

Das, Avijit↗

Sparse Phase Ansatzes for Resource-Efficient Qudit State Preparation via the SNAP-Displacement Protocol

Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in bosonic qudit systems using the SNAP-displacement (SD) protocol. Existing SD-based approaches typically require a large number of gates and SNAP phases, resulting in complex control pulses with longer ansatz durations and amplified impact of photon-loss and control errors. In this work, we focus on the near- to medium-term regime, in which noisy quantum devices impose trade-offs on the fidelity that can be achieved, which must be taken into account. Specifically, we propose to optimize only a subset of the SNAP phases and introduce three progressively more general sparse ansatzes. To provide fine-grained control and identify the most suitable ansatz for a given target fidelity, we further employ a scalarized multi-objective optimization that trades off fidelity against either the number of phases or the duration of the ansatz. Numerical results for several target states and qudit dimensions up to $d=64$, evaluated through the hypervolume of the Pareto frontiers, show that these sparse ansatzes achieve favorable trade-offs over the fully parameterized SD protocol in both ideal and noisy settings. The advantage is strongest and most consistent when minimizing the number of phases, while improvements in ansatz duration are smaller and more dependent on the target-state family and noise level, suggesting a practical route to more efficient near- and medium-term bosonic state preparation.

Ferrari Dacrema, Maurizio [Milan Polytechnic] (ORC↗

From Data to Knowledge: A Graph-Based Reliability Approach to Assess System Health

With the goal of maximizing plant reliability and availability, complex systems such as nuclear power plants continuously monitor and record the performance and the health status of many components, assets, and systems. Such data may take the form of online monitoring data, condition reports, and maintenance reports and it carries the potential to provide system engineers with insights into anomalous behaviors or degradation trends as well as the possible causes behind them and to predict their direct consequences. The analysis of such data poses however few challenges. While some of these challenges are technical in nature (i.e., data are often distributed over several physical servers or databases), others are conceptual in nature (i.e., data elements come in different formats, numeric or textual), and measured values have different scales (e.g., vibration spectra and oil temperature). This paper directly tackles these challenges, and it focuses on the integration of all these data elements in order to assist plant system engineers in analyzing component, assets, and systems performances and optimize maintenance activities. This is performed by 1) extracting knowledge from textual data via technical language processing methods, and 2) quantifying system, asset, and component health from numeric condition-based data. We rely on model-based system engineering (MBSE) models of systems and assets to identify their architecture and functional (i.e., cause and effect) relations. Numeric and textual data elements are then associated with an MBSE graph element, based on their nature. This bonding of MBSE models and data elements constitutes a first-of-its-kind knowledge graph of a nuclear power plants system, with data elements being organized in a structured manner that enables system engineers to identify cause-effect trends in data elements and carry out appropriate actions in response.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

Synchronization and Rebound Effects in Residential Loads

Increasing fuel prices and capacity investment deferral place an increasing demand for peak reduction from distribution level systems. Residential and commercial devices, such as HVAC systems and water heaters, are increasingly involved in load control programs, and their use may generate synchronization and rebound effects, such as artificial peaks caused by device optimization. While there have been concerns over device synchronization, few studies quantify the extent of this effect with numerical values. In this study, we attempt to investigate whether control efforts result in device synchronization or rebound effects. We focus on three clustering methods – Ward’s clustering, Euclidean K-means, and Density-based spatial clustering of applications with noise – to evaluate the extent of synchronization of a fleet of water heaters and HVAC systems in Atlanta, Georgia. Our findings show that synchronization and rebound effects are present in the neighborhood’s water heaters, but none were found in the HVAC systems. Further, high usage water heaters are more susceptible to synchronization and rebound effects.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Transactive Approach for Service Restoration Utilizing Customer Load Flexibility and Grid-Edge Resources

This paper develops a transactive energy system model to restore electricity to customers in an isolated distribution system after an outage. The model is developed to engage a variety of customer types - prosumers, flexible loads, critical/noncritical customers, and distributed generators - as active participants in the restoration process. Unlike many existing transactive approaches, the proposed model is developed for service restoration and accounts for various customer types and their autonomy and privacy through an iterative approach to determine the optimal market price, while maintaining systemlevel power flow and voltage constraints. The advantages of the proposed approach are numerically validated on a modified IEEE 123-bus test system.

distributed energy resources↗

Moltensaltpropnet

MoltenSaltPropnet is a physics-informed machine learning framework that aims to predict the thermophysical properties of molten fluoride and chloride salt mixtures, which are crucial for the design and safety of Generation IV molten salt reactors. The code processes data from the Molten-Salt Thermal Properties Database (MSTDB-TP) and the Janz compendium, converting critically evaluated correlations into fast, differentiable surrogate models for density, viscosity, thermal conductivity, and heat capacity across 448 distinct salt systems. The implementation consists of several key components: 1. Data Curation: The code parses and cleans the raw data, normalizing elemental mole fractions and extracting relevant regression coefficients for various thermophysical properties. 2. Feature Engineering: It generates fixed-length numerical descriptors that encapsulate the composition and temperature, incorporating polynomial interaction terms and dimensionality-reduction techniques to optimize model performance. 3. Coefficient Learning: Four different machine learning architectures are employed: a deep residual network (ResNet), a Kolmogorov–Arnold network (KAN), a sparsity-inducing neural network (SNN), and classical regression models. Each model learns to predict coefficients that define the temperature-dependent correlations for the thermophysical properties. 4. Property Reconstruction: The predicted coefficients are used to compute temperature-dependent property values, ensuring positivity and monotonic trends through a composite loss function that enforces physical constraints. 5. User Interface: An open-source web application enables users to filter the database, train task-specific models, and visualize the results, allowing for rapid exploration of candidate salt mixtures. MoltenSaltPropnet bridges the gap between limited experimental data and high-fidelity reactor simulations, providing a powerful tool for researchers in the field of molten salt reactors and advanced nuclear energy systems.

Retamales, Mauricio Eduardo Tano [Idaho National L↗

Near-Efficient and Non-Asymptotic Multiway Inference

We establish non-asymptotic efficiency guarantees for tensor decomposition–based inference in count data models. Under a Poisson framework, we consider two related goals: (i) parametric inference , the estimation of the full distributional parameter tensor, and (ii) multiway analysis , the recovery of its canonical polyadic (CP) decomposition factors. Our main result shows that in the rank-one setting, a rank-constrained maximum-likelihood estimator achieves multiway analysis with variance matching the Cramér–Rao Lower Bound (CRLB) up to absolute constants and logarithmic factors. This provides a general framework for studying “near-efficient” multiway estimators in finite-sample settings. For higher ranks, we illustrate that our multiway estimator may not attain the CRLB; nevertheless, CP-based parametric inference remains nearly minimax optimal, with error bounds that improve on prior work by offering more favorable dependence on the CP rank. Numerical experiments corroborate near-efficiency in the rank-one case and highlight the efficiency gap in higher-rank scenarios.

97 MATHEMATICS AND COMPUTING↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

Optimal Transfer Operators in Algebraic Two-Level Methods for Nonsymmetric and Indefinite Problems

Consider an algebraic two-level method applied to the 𝑛-dimensional linear system 𝐴⁢𝒙 = 𝒃 using fine-space preconditioner (i.e., “relaxation” or “smoother”) 𝑀, with 𝑀 ≈ 𝐴, restriction and interpolation 𝑅 and 𝑃, and algebraic coarse-space operator 𝐴 𝑐 : = 𝑅 ∗ ⁢𝐴⁢𝑃. Then, what are the best possible transfer operators 𝑅 and 𝑃 of a given dimension 𝑛 𝑐 < 𝑛? Brannick et al. [12] showed that when 𝐴 and 𝑀 are Hermitian positive definite (HPD), the optimal interpolation is such that its range contains the 𝑛 𝑐 smallest generalized eigenvectors of the matrix pencil (𝐴, 𝑀). Recently, in Ali et al. [5] we generalized this framework to the non-HPD setting, by considering both right (interpolation) and left (restriction) generalized eigenvectors of (𝐴, 𝑀) and defining corresponding nonsymmetric transfer operators {𝑅#, 𝑃#}. Tight convergence bounds for {𝑅#, 𝑃#} are derived in spectral radius, as well as a proof of pseudo-optimality. Note, {𝑅#, 𝑃#} are typically complex valued, which is not practical for real-valued problems. Here, in this work, we build on [5], first characterizing all inner products in which the coarse-space correction defined by {𝑅#, 𝑃#} is orthogonal. We then develop tight two-level convergence bounds in these norms, and prove that the underlying transfer operators {𝑅#, 𝑃#} are genuinely optimal. As a special case, our theory both recovers and extends the HPD results from [12]. Finally, we show how to construct optimal, real-valued transfer operators in the case of that 𝐴 and 𝑀 are real valued, but are not HPD. Numerical examples arising from a discretized advection-reaction equation, wave-equation, and Stokes equations are used to verify and illustrate the theory.

97 MATHEMATICS AND COMPUTING↗

Designing a Framework for Solving Multiobjective Simulation Optimization Problems

Multiobjective simulation optimization (MOSO) problems are optimization problems with multiple conflicting objectives, where evaluation of at least one of the objectives depends on a black-box numerical code or real-world experiment, which we refer to as a simulation. Whereas an extensive body of research is dedicated to developing new algorithms and methods for solving these and related problems, it is challenging and time-consuming to integrate these techniques into real-world production-ready solvers. This is partly because of the diversity and complexity of modern state-of-the-art MOSO algorithms and methods and partly because of the complexity and specificity of many real-world problems and their corresponding computing environments. The complexity of this problem is only compounded when introducing potentially complex and/or domain-specific surrogate-modeling techniques, problem formulations, design spaces, and data acquisition functions. Here, this paper carefully surveys the current state of the art in MOSO algorithms, techniques, and solvers, as well as problem types and computational environments where MOSO is commonly applied. We then present several key challenges in the design of a parallel multiobjective simulation optimization framework (ParMOO) and how they have been addressed. Finally, we provide two case studies demonstrating how customized ParMOO solvers can be quickly built and deployed to solve real-world MOSO problems.

engineering design optimization↗