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 1,585 records · Page 88

Optimized Gating System for Steel Castings

Computer modeling using a commercially available software package was used to explore the optimization of filling systems based on the relatively new concepts of avoiding entrainment of air bubbles and oxides by avoiding surface turbulence. The test casting was based on a pattern for a traditional top poured test bar, whose cross section was a tri-lobed clover-like shape. The study illustrates clearly that the detailed design of the filling system has a major influence on the conditions for defect generation during filling. Traditional steel casting systems using the widely popular assembly of preformed refractory tubes were found to behave poorly. Systems were demonstrated which were capable of delivering highly controlled filling behavior. The latest systems to be developed employed (1) a naturally pressurized filling system and (2) the use of filters placed flush on the top of the runner to act as bubble diverters, together with (3) terminal spin traps. These novel filling systems demonstrated excellent performance in simulation, in agreement with practical experience of the capability (of the trident gate in particular) to produce, for the first time in the history of casting, defect-free castings on a routine basis.

36 MATERIALS SCIENCE↗

Sequential Testing Algorithms for Multiple Fault Diagnosis

In this paper, we consider the problem of constructing optimal and near-optimal test sequencing algorithms for multiple fault diagnosis. The computational complexity of solving the optimal multiple-fault isolation problem is super-exponential, that is, it is much more difficult than the single-fault isolation problem, which, by itself, is NP-hard. By employing concepts from information theory and AND/OR graph search, we present several test sequencing algorithms for the multiple fault isolation problem. These algorithms provide a trade-off between the degree of suboptimality and computational complexity. Furthermore, we present novel diagnostic strategies that generate a diagnostic directed graph (digraph), instead of a diagnostic tree, for multiple fault diagnosis. Using this approach, the storage complexity of the overall diagnostic strategy reduces substantially. The algorithms developed herein have been successfully applied to several real-world systems. Computational results indicate that the size of a multiple fault strategy is strictly related to the structure of the system.

Shakeri, Mojdeh↗

Distribution-Agnostic Stochastic Optimal Power Flow for Distribution Grids

This paper outlines a data-driven, distributionally robust approach to solve chance-constrained AC optimal power flow problems in distribution networks. Uncertain forecasts for loads and power generated by photovoltaic (PV) systems are considered, with the goal of minimizing PV curtailment while meeting power flow and voltage regulation constraints. A data- driven approach is utilized to develop a distributionally robust conservative convex approximation of the chance-constraints; particularly, the mean and covariance matrix of the forecast errors are updated online, and leveraged to enforce voltage regulation with predetermined probability via Chebyshev-based bounds. By combining an accurate linear approximation of the AC power flow equations with the distributionally robust chance constraint reformulation, the resulting optimization problem becomes convex and computationally tractable.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimizing $\mathrm{ACRT}$ to reduce inclusion formation during the $\mathrm{VGF}$ growth of cadmium zinc telluride: II. Application to experiments

Here two different accelerated crucible rotation technique (ACRT) rotation schedules are assessed, via theoretical computations and growth experiments, according to their ability to reduce tellurium-rich inclusions during the vertical gradient freeze (VGF) of cadmium zinc telluride (CZT). A vigorous rotation schedule based on classical ACRT guidelines produces a well-mixed melt that is expected to reduce tellurium inclusions compared to growth without crucible rotation. In contrast, a new ACRT schedule, derived from model-based optimization for interface stability, employs slower rotation with longer periods and is predicted to further reduce inclusions. Growth experiments corroborate these expectations. Namely, both ACRT schedules result in crystals with inclusion size and volume significantly decreased from levels found in material grown with no rotation, and material grown using the computationally optimized ACRT parameters exhibits a median inclusion size that is smaller and with a sharper distribution than in material grown via classical ACRT.

36 MATERIALS SCIENCE↗

Distributed Rules-Based Deconfliction of ADMS Applications - Part 2: Conceptual Implementation

This work introduces a rules-based deconfliction methodology for resolving conflicting device control commands issued by advanced power applications considering a range of technical, economic, environmental, and social objectives. The methodology is designed to serve as one of multiple alternative implementations (along with application cooperation and global optimization) for the numerical component of the Deconfliction Pipeline. Development of the methodology is divided into two parts. The first document previously defined the requirements, context, and methods for decomposing the deconfliction problem using the Laminar Coordination Framework and Variable Grid Structures. The deconfliction problem was decomposed into a distributed optimization problem based on the concept of quasi-static grid segments, which form independent distributed areas for control and coordination. It was recommended that selection of the optimal number of decompositions of the deconfliction problem be made based on a tradeoff analysis between computational speed and global optimality. This second document defines an initial set of technical, economic, and environmental criteria, as well as thirty specific qualitative rules that are used as part of the deconfliction methodology to eliminate non-viable setpoint alternatives. The deconfliction optimization problem is converted into a ranking of individual discrete setpoints, which are scored by the extent to which they satisfy specific decision criteria. The ranking is determined through the concepts of deconfliction exclusivity, priority, and preference. Several multi-criteria decision-making frameworks are examined with the simple multi-attribute rating technique exploiting ranks (SMARTER) recommended as a simple implementation alternative that aligns with the steps of the rules-based deconfliction methodology.

97 MATHEMATICS AND COMPUTING↗

DUKSUP: A Computer Program for High Thrust Launch Vehicle Trajectory Design and Optimization

From the late 1960s through 1997, the leadership of NASAs Intermediate and Large class unmanned expendable launch vehicle projects resided at the NASA Lewis (now Glenn) Research Center (LeRC). One of LeRCs primary responsibilities --- trajectory design and performance analysis --- was accomplished by an internally-developed analytic three dimensional computer program called DUKSUP. Because of its Calculus of Variations-based optimization routine, this code was generally more capable of finding optimal solutions than its contemporaries. A derivation of optimal control using the Calculus of Variations is summarized including transversality, intermediate, and final conditions. The two point boundary value problem is explained. A brief summary of the codes operation is provided, including iteration via the Newton-Raphson scheme and integration of variational and motion equations via a 4th order Runge-Kutta scheme. Main subroutines are discussed. The history of the LeRC trajectory design efforts in the early 1960s is explained within the context of supporting the Centaur upper stage program. How the code was constructed based on the operation of the AtlasCentaur launch vehicle, the limits of the computers of that era, the limits of the computer programming languages, and the missions it supported are discussed. The vehicles DUKSUP supported (AtlasCentaur, TitanCentaur, and ShuttleCentaur) are briefly described. The types of missions, including Earth orbital and interplanetary, are described. The roles of flight constraints and their impact on launch operations are detailed (such as jettisoning hardware on heating, Range Safety, ground station tracking, and elliptical parking orbits). The computer main frames on which the code was hosted are described. The applications of the code are detailed, including independent check of contractor analysis, benchmarking, leading edge analysis, and vehicle performance improvement assessments. Several of DUKSUPs many major impacts on launches are discussed including Intelsat, Voyager, Pioneer Venus, HEAO, Galileo, and Cassini.

Launch vehicle performance optimization↗

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↗

Discrete-State Simulated Annealing For Traveling-Wave Tube Slow-Wave Circuit Optimization

Algorithms based on the global optimization technique of simulated annealing (SA) have proven useful in designing traveling-wave tube (TWT) slow-wave circuits for high RF power efficiency. The characteristic of SA that enables it to determine a globally optimized solution is its ability to accept non-improving moves in a controlled manner. In the initial stages of the optimization, the algorithm moves freely through configuration space, accepting most of the proposed designs. This freedom of movement allows non-intuitive designs to be explored rather than restricting the optimization to local improvement upon the initial configuration. As the optimization proceeds, the rate of acceptance of non-improving moves is gradually reduced until the algorithm converges to the optimized solution. The rate at which the freedom of movement is decreased is known as the annealing or cooling schedule of the SA algorithm. The main disadvantage of SA is that there is not a rigorous theoretical foundation for determining the parameters of the cooling schedule. The choice of these parameters is highly problem dependent and the designer needs to experiment in order to determine values that will provide a good optimization in a reasonable amount of computational time. This experimentation can absorb a large amount of time especially when the algorithm is being applied to a new type of design. In order to eliminate this disadvantage, a variation of SA known as discrete-state simulated annealing (DSSA), was recently developed. DSSA provides the theoretical foundation for a generic cooling schedule which is problem independent, Results of similar quality to SA can be obtained, but without the extra computational time required to tune the cooling parameters. Two algorithm variations based on DSSA were developed and programmed into a Microsoft Excel spreadsheet graphical user interface (GUI) to the two-dimensional nonlinear multisignal helix traveling-wave amplifier analysis program TWA3. The algorithms were used to optimize the computed RF efficiency of a TWT by determining the phase velocity profile of the slow-wave circuit. The mathematical theory and computational details of the DSSA algorithms will be presented and results will be compared to those obtained with a SA algorithm.

Wilson, Jeffrey D.↗

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)↗

Singular perturbation techniques for real time aircraft trajectory optimization and control

The usefulness of singular perturbation methods for developing real time computer algorithms to control and optimize aircraft flight trajectories is examined. A minimum time intercept problem using F-8 aerodynamic and propulsion data is used as a baseline. This provides a framework within which issues relating to problem formulation, solution methodology and real time implementation are examined. Theoretical questions relating to separability of dynamics are addressed. With respect to implementation, situations leading to numerical singularities are identified, and procedures for dealing with them are outlined. Also, particular attention is given to identifying quantities that can be precomputed and stored, thus greatly reducing the on-board computational load. Numerical results are given to illustrate the minimum time algorithm, and the resulting flight paths. An estimate is given for execution time and storage requirements.

Calise, A. J.↗

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↗