Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete 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 937 records · Page 52

Polynomial compensation, inversion, and approximation of discrete time linear systems

The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.

Baram, Yoram↗

Space Shuttle 2 advanced space transportation system, volume 2

To determine the best configuration from all candidate configurations, it was necessary first to calculate minimum system weights and performance. To optimize the design, it is necessary to vary configuration-specific variables such as total system weight, thrust-to-weight ratios, burn durations, total thrust available, and mass fraction for the system. Optimizing each of these variables at the same time is technically unfeasible and not necessarily mathematically possible. However, discrete sets of data can be generated which will eliminate many candidate configurations. From the most promising remaining designs, a final configuration can be selected. Included are the three most important designs considered: one which closely approximates the design criteria set forth in a Marshall Space Flight Center study of the Shuttle 2; the configuration used in the initial proposal; and the final configuration. A listing by cell of the formulas used to generate the aforementioned data is included for reference.

Adinaro, James N.↗

Fuel performance analysis of fully-resolved TRISO compact

The TRi-structural ISOtropic (TRISO) fuel multilayered coating structure offers multiple barriers to fission product release, enhancing safety and performance. The heterogeneous nature of TRISO fuel compacts, comprising thousands of randomly distributed coated fuel particles embedded in a graphite matrix, creates intricate stress fields and thermal gradients that cannot be accurately modeled using simplified one-dimensional or homogenized approaches. Consequently, three-dimensional modeling enables the prediction of fuel compact dimensional changes, internal pressure buildup, and fission product transport pathways under diverse irradiation and thermal conditions. This capability facilitates detailed analysis of particle-to-particle interactions, matrix cracking mechanisms, and the statistical distribution of coating failures, which directly impact fuel performance and safety margins. This capability is particularly critical for advanced reactors, such as high-temperature gas-cooled reactors and other Generation IV reactor designs where TRISO fuel operates at elevated temperatures and burn-up levels. This work introduces a novel method to generate an optimized packing of TRISO compacts and a complete 3D mesh with random distribution of TRISO particles, which are discretized into each coating component layer.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Adjoint-Based Design of Rotors Using the Navier-Stokes Equations in a Noninertial Reference Frame

Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated by using comparisons with a complex-variable technique, and a number of single- and multipoint optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

Nielsen, Eric J.↗

SU-F-T-350: Continuous Leaf Optimization (CLO) for IMRT Leaf Sequencing

Purpose: To study a new step-and-shoot IMRT leaf sequencing model that avoids the two main pitfalls of conventional leaf sequencing: (1) target fluence being stratified into a fixed number of discrete levels and/or (2) aperture leaf positions being restricted to a discrete set of locations. These assumptions induce error into the sequence or reduce the feasible region of potential plans, respectively. Methods: We develop a one-dimensional (single leaf pair) methodology that does not make assumptions (1) or (2) that can be easily extended to a multi-row model. The proposed continuous leaf optimization (CLO) methodology takes in an existing set of apertures and associated intensities, or solution “seed,” and improves the plan without the restrictiveness of 1or (2). It then uses a first-order descent algorithm to converge onto a locally optimal solution. A seed solution can come from models that assume (1) and (2), thus allowing the CLO model to improve upon existing leaf sequencing methodologies. Results: The CLO model was applied to 208 generated target fluence maps in one dimension. In all cases for all tested sequencing strategies, the CLO model made improvements on the starting seed objective function. The CLO model also was able to keep MUs low. Conclusion: The CLO model can improve upon existing leaf sequencing methods by avoiding the restrictions of (1) and (2). By allowing for more flexible leaf positioning, error can be reduced when matching some target fluence. This study lays the foundation for future models and solution methodologies that can incorporate continuous leaf positions explicitly into the IMRT treatment planning model. Supported by Cancer Prevention & Research Institute of Texas (CPRIT) - ID RP150485.

60 APPLIED LIFE SCIENCES↗

Density based topology optimization of turbulent flow heat transfer systems

The focus of this article is on topology optimization of heat sinks with turbulent forced convection. The goal is to demonstrate the extendibility, and the scalability of a previously developed fluid solver to coupled multi-physics and large 3D problems. The gradients of the objective and the constraints are obtained with the help of automatic differentiation applied on the discrete system without any simplifying assumptions. Thus, as demonstrated in earlier works of the authors, the sensitivities are exact to machine precision. The framework is applied to the optimization of 2D and 3D problems. Comparison between the simplified 2D setup and the full 3D optimized results is provided. A comparative study is also provided between designs optimized for laminar and turbulent flows. Overall, the comparisons highlight the importance and the benefits of full 3D optimization and including turbulence modeling in the optimization process, while also demonstrating extension of the methodology to include coupling of heat transfer with turbulent flows.

42 ENGINEERING↗

Superconvergence of Online Optimization for Model Predictive Control

We develop a one-Newton-step-per-horizon, online, lag-L, model predictive control (MPC) algorithm for solving discrete-time, equality-constrained, nonlinear dynamic programs. Based on recent sensitivity analysis results for the target problems class, we prove that the approach exhibits a behavior that we call superconvergence; that is, the tracking error with respect to the full horizon solution is not only stable for successive horizon shifts, but also decreases with increasing shift order to a minimum value that decays exponentially in the length of the receding horizon. The key analytical step is the decomposition of the one-step error recursion of our algorithm into algorithmic error and perturbation error. We show that the perturbation error decays exponentially with the lag between two consecutive receding horizons, while the algorithmic error, determined by Newton’s method, achieves quadratic convergence instead. Overall this approach induces our local exponential convergence result in terms of the receding horizon length for suitable values of L. In conclusion, numerical experiments validate our theoretical findings.

97 MATHEMATICS AND COMPUTING↗

Optimizing the violacein biosynthetic pathway using droplet microfluidics

© 17CBMS-0001. We have developed a microfluidic platform that uses aqueous droplets suspended in an oil phase as discrete reaction chambers to carry out molecular biology steps. It integrates and automates all critical procedures of synthetic biology including combinatorial gene assembly, transformation by electroporation, addition of selection medium, culture, assay and sorting on a single device.

Gach, PC↗

Multi-Objective Hybrid Optimal Control for Multiple-Flyby Interplanetary Mission Design Using Chemical Propulsion

Preliminary design of high-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys and the bodies at which those flybys are performed. For some missions, such as surveys of small bodies, the mission designer also contributes to target selection. In addition, real-valued decision variables, such as launch epoch, flight times, maneuver and flyby epochs, and flyby altitudes must be chosen. There are often many thousands of possible trajectories to be evaluated. The customer who commissions a trajectory design is not usually interested in a point solution, but rather the exploration of the trade space of trajectories between several different objective functions. This can be a very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very desirable. This work presents such an approach by posing the impulsive mission design problem as a multiobjective hybrid optimal control problem. The method is demonstrated on several real-world problems.

Trajectory↗

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.

Nemec, Marian↗

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

DISCRETE ELEMENT MODELING OF BLADE–STRIKE FREQUENCY AND SURVIVAL OF FISH PASSING THROUGH HYDROKINETIC TURBINES

Evaluating the consequences from blade-strike of fish on marine hydrokinetic (MHK) turbine blades is essential for incorporating environmental objectives into the integral optimization of machine performance. For instance, experience with conventional hydroelectric turbines has shown that innovative shaping of the blade and other machine components can lead to improved designs that generate more power without increased impacts to fish and other aquatic life. In this work, we used unsteady computational fluid dynamics (CFD) simulations of turbine flow and discrete element modeling (DEM) of particle motion to estimate the frequency and severity of collisions between a horizontal axis MHK tidal energy device and drifting aquatic organisms or debris. Two metrics are determined with the method: the strike frequency and survival rate estimate. To illustrate the procedure step-by-step, an exemplary case of a simple runner model was run and compared against a probabilistic model widely used for strike frequency evaluation. The results for the exemplary case showed a strong correlation between the two approaches. In the application case of the MHK turbine flow, turbulent flow was modeled using detached eddy simulation (DES) in conjunction with a full moving rotor at full scale. The CFD simulated power and thrust were satisfactorily comparable to experimental results conducted in a water tunnel on a reduced scaled (1:8.7) version of the turbine design. A cloud of DEM particles was injected into the domain to simulate fish or debris that were entrained into the turbine flow. The strike frequency was the ratio of the count of colliding particles to the crossing sample size. The fish length and approaching velocity were test conditions in the simulations of the MHK turbine. Comparisons showed that DEM-based frequencies tend to be greater than previous results from Lagrangian particles and probabilistic models, mostly because the DEM scheme accounts for both the geometric aspects of the passage event ---which the probabilistic method does--- as well as the fluid-particle interactions ---which the Lagrangian particle method does. The DEM-based survival rates were comparable to laboratory results for small fish but not for mid-size fish because of the considerably different turbine diameters. The modeling framework can be used for applications that aim at evaluating the biological performance of MHK turbine units during the design phase and to provide information to regulatory agencies needed for the environmental permitting process.

blade strike↗

Problem size, parallel architecture and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Problem size, parallel architecture, and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Adjoint-Based Design of Rotors using the Navier-Stokes Equations in a Noninertial Reference Frame

Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated using comparisons with a complex-variable technique, and a number of single- and multi-point optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

Nielsen, Eric J.↗

Improving ADAM through an implicit-explicit (IMEX) time-stepping approach

The ADAM optimizer, often used in machine learning for neural network training, corresponds to an underlying ordinary differential equation (ODE) in the limit of very small learning rates. Here, this work shows that the classical ADAM algorithm is a first-order implicit-explicit (IMEX) Euler discretization of the underlying ODE. Employing the time discretization point of view, we propose new extensions of the ADAM scheme obtained by using higher-order IMEX methods to solve the ODE. Based on this approach, we derive a new optimization algorithm for neural network training that performs better than classical ADAM on several regression and classification problems.

97 MATHEMATICS AND COMPUTING↗

Optimization-based mesh correction with volume and convexity constraints

Here, we consider the problem of finding a mesh such that 1) it is the closest, with respect to a suitable metric, to a given source mesh having the same connectivity, and 2) the volumes of its cells match a set of prescribed positive values that are not necessarily equal to the cell volumes in the source mesh. Also, this volume correction problem arises in important simulation contexts, such as satisfying a discrete geometric conservation law and solving transport equations by incremental remapping or similar semi-Lagrangian transport schemes. In this paper we formulate volume correction as a constrained optimization problem in which the distance to the source mesh defines an optimization objective, while the prescribed cell volumes, mesh validity and/or cell convexity specify the constraints. We solve this problem numerically using a sequential quadratic programming (SQP) method whose performance scales with the mesh size. To achieve scalable performance we develop a specialized multigrid-based preconditioner for optimality systems that arise in the application of the SQP method to the volume correction problem. Numerical examples illustrate the importance of volume correction, and showcase the accuracy, robustness and scalability of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Binomial Stochastic Framework for Efficiently Modeling Discrete Statistics of Convective Populations

Abstract Understanding the coupling between convective clouds and the general circulation, as well as addressing the gray zone problem in convective parameterization, requires insight into the genesis and maintenance of spatial patterns in cumulus cloud populations. In this study, a simple toy model for recreating populations of interacting convective objects as distributed over a two‐dimensional Eulerian grid is formulated to this purpose. Key elements at the foundation of the model include i) a fully discrete formulation for capturing discrete behavior in convective properties at small population sample sizes, ii) object age‐dependence for representing life‐cycle effects, and iii) a prognostic number budget allowing for object interactions and co‐existence of multiple species. A primary goal is to optimize the computational efficiency of this system. To this purpose the object birth rate is represented stochastically through a spatially aware Bernoulli process. The same binomial stochastic operator is applied to horizontal advection of objects, conserving discreteness in object number. The applicability to atmospheric convection as well as behavior implied by the formulation is assessed. Various simple applications of the BiOMi model (Binomial Objects on Microgrids) are explored, suggesting that important convective behavior can be captured at low computational cost. This includes i) subsampling effects and associated powerlaw scaling in the convective gray zone, ii) stochastic predator‐prey behavior, iii) the downscale turbulent energy cascade, and iv) simple forms of spatial organization and convective memory. Consequences and opportunities for convective parameterization in next‐generation weather and climate models are discussed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗