Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational 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 847 records · Page 47

Transport Analysis & Optimization in a MW-Scale CO2 Electrolyzer (Final Report)

As Twelve continues to scale up their CO2 electrolyzers, both in the size of a single cell and in the number of cells used in a stack, thermal management becomes a growing concern, since excess heat can affect reaction yield and accelerate degradation. In this project, we aim to computationally explore how the anode flow fields used in Twelve’s CO2 electrolyzers function as heat exchangers. In particular, using a homogenized model of a CO2 electrolyzer, we first estimate the amount of heat generated in a cell. Then, we develop a computational fluid dynamics (CFD) model of the so-called “flow field”, i.e. a flow manifold, based on Twelve’s CAD drawings, to evaluate how these flow fields perform as a heat exchanger for the generated heat. We explore both a single cell and a 3-cell stack operating in parallel, where heat generated in one cell can now be transferred to another cell. We evaluate how performance is affected when environmental heat losses are taken into account. Finally, we leverage topology optimization to explore the types of design features a computational optimization algorithm would suggest to supplement our intuition. Overall, our work aims to provide design recommendations for CO2 electrolyzer flow fields and provides a foundation for future studies of flow field optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Propagation of Model Form Uncertainty for Thermal Hydraulics using RANS Turbulence Models in Drekar

This document summarizes the results from a level 3 milestone study within the CASL VUQ effort. It demonstrates the propagation of model form uncertainty that arises from the presence of multiple turbulence models within the context of thermal hydraulics analyses. The lack of knowledge associated with an inability to a priori identify an appropriate turbulence model is modeled as discrete epistemic uncertainty. This approach provides an alternative to model selection processes, for use when data is unavailable or inadequate for reducing the model form uncertainty. In this case, the alternative is to propagate the model form uncertainty and report UQ results that include this epistemic uncertainty source alongside other parametric sources. The study calculates epistemic intervals on aleatory statistics for several quantities of interest, where the epistemic intervals are computed using mixed continuous-discrete optimization methods and the aleatory statistics are computed using polynomial chaos expansions. We first investigate two simple algebraic test problems with multiple model forms and then deploy the methods to the Drekar thermal hydraulics application. The Drekar study employs a set of Reynolds-averaged Navier-Stokes (RANS) turbulence models, including Spalart-Allmaras and k-ε. Results highlight the utility of employing efficient mixed continuous-discrete optimizers based on surrogate emulation.

Eldred, Michael Scott↗

Battery Electric Vehicle Eco-Cooperative Adaptive Cruise Control in the Vicinity of Signalized Intersections

This study develops a connected eco-driving controller for battery electric vehicles (BEVs), the BEV Eco-Cooperative Adaptive Cruise Control at Intersections (Eco-CACC-I). The developed controller can assist BEVs while traversing signalized intersections with minimal energy consumption. The calculation of the optimal vehicle trajectory is formulated as an optimization problem under the constraints of (1) vehicle acceleration/deceleration behavior, defined by a vehicle dynamics model; (2) vehicle energy consumption behavior, defined by a BEV energy consumption model; and (3) the relationship between vehicle speed, location, and signal timing, defined by vehicle characteristics and signal phase and timing (SPaT) data shared under a connected vehicle environment. The optimal speed trajectory is computed in real-time by the proposed BEV eco-CACC-I controller, so that a BEV can follow the optimal speed while negotiating a signalized intersection. The proposed BEV controller was tested in a case study to investigate its performance under various speed limits, roadway grades, and signal timings. In addition, a comparison of the optimal speed trajectories for BEVs and internal combustion engine vehicles (ICEVs) was conducted to investigate the impact of vehicle engine types on eco-driving solutions. Lastly, the proposed controller was implemented in microscopic traffic simulation software to test its networkwide performance. The test results from an arterial corridor with three signalized intersections demonstrate that the proposed controller can effectively reduce stop-and-go traffic in the vicinity of signalized intersections and that the BEV Eco-CACC-I controller produces average savings of 9.3% in energy consumption and 3.9% in vehicle delays.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Power-Capping Metric Evaluation for Improving Energy Efficiency in HPC Applications

With high-performance computing systems now running at exascale, optimizing power-scaling management and resource utilization has become more critical than ever. This paper explores runtime power-capping optimizations that leverage integrated CPU-GPU power management on architectures like the NVIDIA GH200 superchip. We evaluate energy-performance metrics that account for simultaneous CPU and GPU power-capping effects by using two complementary approaches: speedup-energy-delay and a Euclidean distance-based multi-objective optimization method. By targeting a mostly compute-bound exascale science application, the Locally Self-Consistent Multiple Scattering (LSMS), we explore challenging scenarios to identify potential opportunities for energy savings in exascale applications, and we recognize that even modest reductions in energy consumption can have significant overall impacts. Our results highlight how GPU task-specific dynamic power-cap adjustments combined with integrated CPU-GPU power steering can improve the energy utilization of certain GPU tasks, thereby laying the groundwork for future adaptive optimization strategies.

Patrou, Maria [ORNL] (ORCID:0000000339754638)↗

Applicability study of Bayesian optimization in core neutronic design using a toy model

At the Japan Atomic Energy Agency (JAEA), an innovative design approach named ARKADIA (Advanced Reactor Knowledge- and AI-aided Design Integration Approach through the whole plant life cycle) for advanced nuclear reactors is currently under development. One task in ARKADIA is to build a system that automatically optimizes core and fuel designs by conducting core neutronic and thermal-hydraulic calculations, fuel integrity evaluations, and plant dynamic analyses. This system will be implemented to automatically find an optimal design that minimizes (or maximizes) objective function defined by core performance while varying the core and fuel design parameters such as fuel pin diameter, core height and diameter. In this study, as the first step of system development, we focused only on core neutronic design and conducted a study of automatic optimization. As the optimization algorithm, Bayesian optimization (BO), an effective method for optimization problems with expensive computational cost of objective function, was utilized. The applicability of BO was studied based on single- and two-objective optimization examples of core neutronic design in a toy model. As a result, in the former, it was shown that BO can give the optimal solution, which matches the reference solution calculated by a brute force calculation well, with a small number of required calculations. Usability on core neutronic designs, where the computational cost per case is high, was confirmed. In the latter, it was found that BO can give a Pareto solutions-set that shows good agreement with the reference solution. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Computing intramolecular charge and energy transfer rates using optimal modes

In our recent work [X. Yang and E. R. Bittner, J. Phys. Chem. A 118, 5196 (2014)], we showed how to construct a reduced set of nuclear motions that capture the coupling between electronic and nuclear degrees of freedom over the course of an electronic transition. We construct these modes, referred to as “Lanczos modes,” by applying a search algorithm to find linear combinations of vibrational normal modes that optimize the electronic/nuclear coupling operator. Here, we analyze the irreducible representations of the dominant contributions of these modes and find that for the cases considered here, these belong to totally symmetric irreducible representations of the donor and acceptor moieties. Upon investigating the molecular geometry changes following the transition, we propose that the electronic transition process can be broken into two steps, in the agreement of Born-Oppenheimer approximation: a fast excitation transfer occurs, facilitated by the “primary Lanczos mode,” followed by slow nuclear relaxation on the final electronic diabatic surface.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Strong and Weak Scaling of the Sierra/SD Eigenvector Problem to a Billion Degrees of Freedom

Sierra/SD is a structural dynamics finite element software package that is known for its scalability and performance on DOE supercomputers. While there are historical documents demonstrating weak and strong scaling on DOE systems such as Redsky, no such formal studies have been done on modern architectures. This report demonstrates that Sierra/SD still scales on modern architectures. Non structured meshes in the shape of an I-Beam are solved in sizes ranging from fifty thousand degrees of freedom in serial up to one and a half billion degrees of freedom on over eighteen thousand processors using only default solver options. The report serves as a baseline for users to estimate computation cost of finite element analyses in Sierra/SD, understand how solver options relate to computational costs, and pick optimal processor counts to solve a given problem size, as well as a baseline for evaluating computational cost and scalability on next generation architectures.

42 ENGINEERING↗

Runtime optimization of an application executing on a parallel computer

Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.

97 MATHEMATICS AND COMPUTING↗

Runtime optimization of an application executing on a parallel computer

Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.

97 MATHEMATICS AND COMPUTING↗

Runtime optimization of an application executing on a parallel computer

Identifying a collective operation within an application executing on a parallel computer; identifying a call site of the collective operation; determining whether the collective operation is root-based; if the collective operation is not root-based: establishing a tuning session and executing the collective operation in the tuning session; if the collective operation is root-based, determining whether all compute nodes executing the application identified the collective operation at the same call site; if all compute nodes identified the collective operation at the same call site, establishing a tuning session and executing the collective operation in the tuning session; and if all compute nodes executing the application did not identify the collective operation at the same call site, executing the collective operation without establishing a tuning session.

97 MATHEMATICS AND COMPUTING↗