Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 397 records · Page 22

Optimal searches for asteroids

Optimal searches for a fixed object are discussed, and the rigorous analytical results of discrete search theory are presented. The totally optimal, the uniformly optimal, the locally optimal, and the fastest searches are shown to be identical under not too restrictive assumptions. The mathematical formalism is illustrated by an Earth-approaching asteroid search and optimal searches for such objects are explicitly constructed. The approximation that Earth-approaching asteroids are fixed is equivalent to having a very high ( equiv 100 sq degs/hour) search rate. Generalizations to other types of astronomical search are briefly mentioned.

Taff, L. G.↗

Optimal searches for asteroids

Optimal searches for a fixed object are discussed, and the rigorous analytical results of discrete search theory are presented. The totally optimal, the uniformly optimal, the locally optimal, and the fastest searches are shown to be identical under not too restrictive assumptions. The mathematical formalism is illustrated by an earth-approaching asteroid search and optimal searches for such objects are explicitly constructed. The approximation that earth-approaching asteroids are fixed is equivalent to having a very high (equiv 100 sq degs/hour) search rate. Generalizations to other types of astronomical search are briefly mentioned. Previously announced in STAR as N83-34657

Taff, L. G.↗

Closed loop models for analyzing the effects of simulator characteristics

The optimal control model of the human operator is used to develop closed loop models for analyzing the effects of (digital) simulator characteristics on predicted performance and/or workload. Two approaches are considered: the first utilizes a continuous approximation to the discrete simulation in conjunction with the standard optimal control model; the second involves a more exact discrete description of the simulator in a closed loop multirate simulation in which the optimal control model simulates the pilot. Both models predict that simulator characteristics can have significant effects on performance and workload.

Baron, S.↗

Viscous aerodynamic design using the adjoint variable approach

The use of classical optimal control methods, in particular variational methods, to solve the airfoil optimization problem, by deriving a set of adjoint (costate) equations and boundary conditions has already been done for inviscid (potential and Euler flows) and two dimensional, steady state, incompressible flow governed by the Navier-Stokes equations. The interior and boundary terms of the volume integral have been derived (in this work) for the steady Navier-Stokes equations in three dimensions for a viscous, compressible heat conducting fluid. This can be used to derive the adjoint equations and numerical boundary conditions for general classes of problems and hence paves the way for a solution to the aerodynamic optimization problem for compressible viscous flows. The next steps to the realization of that goal are projected as below. The usual square integral pressure functional as an objective function is being replaced by a more realistic drag functional subject to a lift constraint. The feasibility of attempting the more difficult time dependent problem is being investigated. It remains to get the full system of adjoint equations and boundary conditions with the new functional. The state and adjoint equations must be discretized and coded. An appropriate optimization program must be used (steepest descents seems inadequate) and various known airfoil shapes should be recovered in test cases of the computer program.

DeRise, George↗

Optimal Use of Data in Parallel Tempering Simulations for the Construction of Discrete-State Markov Models of Biomolecular Dynamics

Parallel tempering (PT) molecular dynamics simulations have been extensively investigated as a means of efficient sampling of the configurations of biomolecular systems. Recent work has demonstrated how the short physical trajectories generated in PT simulations of biomolecules can be used to construct the Markov models describing biomolecular dynamics at each simulated temperature. While this approach describes the temperature-dependent kinetics, it does not make optimal use of all available PT data, instead estimating the rates at a given temperature using only data from that temperature. This can be problematic, as some relevant transitions or states may not be sufficiently sampled at the temperature of interest, but might be readily sampled at nearby temperatures. Further, the comparison of temperature-dependent properties can suffer from the false assumption that data collected from different temperatures are uncorrelated. We propose here a strategy in which, by a simple modification of the PT protocol, the harvested trajectories can be reweighted, permitting data from all temperatures to contribute to the estimated kinetic model. The method reduces the statistical uncertainty in the kinetic model relative to the single temperature approach and provides estimates of transition probabilities even for transitions not observed at the temperature of interest. Further, the method allows the kinetics to be estimated at temperatures other than those at which simulations were run. We illustrate this method by applying it to the generation of a Markov model of the conformational dynamics of the solvated terminally blocked alanine peptide.

59 BASIC BIOLOGICAL SCIENCES↗

A variational framework for residual-based adaptivity in neural PDE solvers and operator learning

Residual-based adaptive strategies are widely used in scientific machine learning yet remain largely heuristic. We introduce a variational framework that formalizes these methods through convex transformations of the residual, where different transformations correspond to distinct objective functionals. For instance, exponential weights target uniform error minimization, while linear weights recover quadratic error minimization. This perspective reveals adaptive weighting as a means of selecting sampling distributions that optimize a primal objective, directly linking discretization choices to error metrics. This principled approach yields three key benefits: it enables systematic design of adaptive schemes, reduces discretization error by lowering estimator variance, and enhances learning dynamics by improving gradient signal-to-noise ratio. Extending the framework to operator learning, we demonstrate substantial performance gains across diverse optimizers and architectures. Our results provide a theoretical perspective for residual-based adaptivity and establish a foundation for principled discretization and training.

97 MATHEMATICS AND COMPUTING↗

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

Optimal design of compact spur gear reductions

The optimal design of compact spur gear reductions includes the selection of bearing and shaft proportions in addition to gear mesh parameters. Designs for single mesh spur gear reductions are based on optimization of system life, system volume, and system weight including gears, support shafts, and the four bearings. The overall optimization allows component properties to interact, yielding the best composite design. A modified feasible directions search algorithm directs the optimization through a continuous design space. Interpolated polynomials expand the discrete bearing properties and proportions into continuous variables for optimization. After finding the continuous optimum, the designer can analyze near optimal designs for comparison and selection. Design examples show the influence of the bearings on the optimal configurations.

Savage, M.↗

Shape optimization of single- and two-element airfoils on multiblock grids

A multiblock, discrete sensitivity analysis method is used to couple a direct optimization method and a flow analysis method. The domain is divided into smaller subdomains for which the sensitivities are obtained separately. Then, an effective sensitivity equation is solved to complete the coupling of all the sensitivity information. The flow analysis is based on the thin-layer Navier-Stokes equations solved by an implicit, upwind-biased, finite-volume method. The method of feasible directions is used for the present gradient-based optimization approach. First, a transonic airfoil is optimized to investigate the behavior of the method in highly nonlinear flows as well as the effect of different blocking strategies on the procedure. A supercritical airfoil is produced from an initially symmetric airfoil with multiblocking affecting the path but not the final shape. Secondly, a two-element airfoil is shape optimized in subsonic flow to demonstrate the present method's capability of shaping aerodynamically interfering elements simultaneously. For a very low and a very high Reynolds number cases, the shape of the main airfoil and the flap are optimized to yield improved lift-to-drag ratios.

Lacasse, James M.↗

Closed loop models for analyzing the effects of simulator characteristics

The optimal control model (OCM) of the human operator is used to develop closed-loop models for analyzing the effects of (digital) simulator characteristics on predicted performance and/or workload. Two approaches are considered: the first utilizes a continuous approximation to the discrete simulation in conjunction with the standard optimal control model; the second involves a more exact discrete description of the simulator in a closed-loop multi-rate simulation in which the optimal control model 'simulates' the pilot. Both models predict that simulator characteristics can have significant effects on performance and workload.

Baron, S.↗

Preconditioned domain decomposition scheme for three-dimensional aerodynamic sensitivity analysis

A discrete sensitivity analysis algorithm had previously been developed and applied to two-dimensional aerodynamic optimization problems, where the computational domains were discretized by using single grids. The sparse, unsymmetric systems of linear equations resulting from this algorithm were solved by a direct matrix inversion matrix. However, for large two-dimensional problems and, practically, all three-dimensional problems, direct inversion methods become inapplicable, primarily due to the prohibitive computer storage needed. In an attempt to alleviate such hindrances, the sensitivity analysis with domain decomposition (SADD) scheme was developed. This scheme divides the computational domain into smaller and nonoverlapping subdomains (multiblock grids) that are solved separately. Then, the final solution is constructed from the subdomain solutions. As the number of grid points in the interface boundaries of the subdomains becomes large, the computer memory required to store the effective coefficient matrix of these interface points starts to increase. Presented in this Technical Note is a preconditioned iterative procedure to overcome this particular problem.

Eleshaky, Mohamed E.↗

Mixed Integer Nonlinear Programming Approaches to Enhance Resiliency and Response Strategies in Critical Infrastructure

Motivation. Critical infrastructures are large, complex engineered systems that must be operated robustly under abnormal conditions resulting from natural hazards or intentional acts. For example, electric power systems must be robust to line faults, water utilities must rapidly mitigate contamination incidents, and computing networks must adapt to adversarial intrusions to protect critical information. Problem. It is difficult for decision-makers within resiliency analysis in critical infrastructure to optimize designs and develop effective response strategies that can account for uncertainties. Facing incomplete information and the sheer scope that a natural hazard or attack vector may incorporate, response can be ineffective without reliable, scalable decision support tools. These problems are intrinsically nonlinear and involve discrete decisions, and unfortunately, existing off-the-shelf mathematical programming methods cannot support optimization-based decision-making of these nonlinear at scale. Method/Approach and Results. This project emphasized development of fundamental optimization strategies that supported real- time mitigation and response for critical infrastructures. In particular, the project developed multi- tree approaches based on piecewise outer-approximations for solution of mixed-integer nonlinear programming (MINLP) problems. These techniques alternate between an MILP or MISOCP relaxation to obtain a lower bound and candidate discrete solutions and an NLP subproblem to obtain upper bounds. Using tailored relaxations based on problem structure, these methods were used to solve several key applications in resilience and response of critical infrastructure. This work resulted in two open-source, copyrighted software packages: CORAMIN (https://github.com/Coramin/Coramin) -- an object-oriented mathematical programming framework that supports tailored multi-tree algorithms for solution of large- scale mixed-integer nonlinear programming; and EGRET (Electrical Grid Research and Engineering Toolkit) (https://github.com/grid- parity-exchange/Egret) -- a declarative mathematical programming framework built upon CORAMIN and Pyomo for formulation and solution of resilience and operations problems in power grid systems. Furthermore, these tools resulted in several important published results, including the following: The first known global optimization approach that could solve the unit-commitment problem with nonlinear power flow constraints on medium-sized test problems; Improved parallel optimization-based bounds tightening and strengthening of relaxations of AC power flow constraints; and, Optimization-based approaches for improved grid resilience and use of demand response to improve grid resilience with reduction in capital requirements. Result Implications. This project developed first-of-a-kind algorithms for decision-making in critical infrastructure resilience operations and planning, as well as a next-generation toolkit for MINLP researchers. These approaches leveraged high-performance computing architectures to solve some of the largest, most challenging nonlinear discrete optimization problems to global optimality, and these successes were captured in open-source software to enable optimization-based decision-making, and efficient solution of MINLP formulations for electric power transmission grids.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Investigation of the N 2 O emission strength in the U. S. Corn Belt

Nitrous oxide (N 2 O) has a high global warming potential and depletes stratospheric ozone. The U. S. Corn Belt plays an important role in the global anthropogenic N 2 O budget. To date, studies on local surface N 2 O emissions and the atmospheric N 2 O budget have commonly used Lagrangian models. Here, in the present study, we used an Eulerian model - Weather Research and Forecasting Chemistry (WRF-Chem) model to investigate the relationships between N 2 O emissions in the Corn Belt and observed atmospheric N 2 O mixing ratios. We derived a simple equation to relate the emission strengths to atmospheric N 2 O mixing ratios, and used the derived equation and hourly atmospheric N 2 O measurements at the KCMP tall tower in Minnesota to constrain agricultural N 2 O emissions. The modeled spatial patterns of atmospheric N 2 O were evaluated against discrete observations at multiple tall towers in the NOAA flask network. After optimization of the surface flux, the model reproduced reasonably well the hourly N 2 O mixing ratios monitored at the KCMP tower. Agricultural N 2 O emissions in the EDGAR42 database needed to be scaled up by 19.0 to 28.1 fold to represent the true emissions in the Corn Belt for June 1–20, 2010 - a peak emission period. Optimized mean N 2 O emissions were 3.00–4.38, 1.52–2.08, 0.61–0.81 and 0.56–0.75 nmol m -2 s -1 for June 1–20, August 1–20, October 1–20 and December 1–20, 2010, respectively. The simulated spatial patterns of atmospheric N 2 O mixing ratios after optimization were in good agreement with the NOAA discrete observations during the strong emission peak in June. Such spatial patterns suggest that the underestimate of emissions using IPCC (Inter-governmental Panel on Climate Change) inventory methodology is not dependent on tower measurement location.

54 ENVIRONMENTAL SCIENCES↗

Mesh independency in topology optimization

The topology optimization community has regularly employed optimization algorithms from the operations research community. However, these algorithms are implemented in the sequence space l2 instead of the proper function space where the design variable resides. In this software, we benchmark the mesh independent implementation of pyMMAopt with three common problems in topology optimization. We show how the volume fraction variable discretization on non-uniform meshes affects the convergence of l2 based optimization algorithms and how pyMMAopt successfully achieves mesh independent convergence.

Salazar De Troya, Miguel↗

A low temperature unitized regenerative fuel cell realizing 60% round trip efficiency and 10 000 cycles of durability for energy storage applications

Unitized regenerative fuel cells (URFC) convert electrical energy to and from chemical bonds in hydrogen. URFCs have the potential to provide economical means for efficient long-term, seasonal, energy storage and on-demand conversion back to electrical energy. We first optimize the catalyst layer for discrete electrolyzer and fuel cell and then configure the URFC. The goal is to identify a cost competitive configuration for URFCs, and demonstrate it in terms of upper limit of round trip efficiencies (RTEs). Two possible configurations of URFCs are compared via experiments and techno-economic analysis (TEA), which emphasize the advantages of the unconventional constant-electrode (CE) URFC over the traditional constant-gas (CG) configuration. We also study the stability via accelerated stress tests (ASTs) and demonstrate steady state operation in a daily cycle for day to night energy shifting. From the investigations, the optimum composition of the URFC anode catalyst layer is 90 at% Ir-black balanced by Pt-black for both CE and CG configurations. At 80 °C and 1 A cm -2 , the optimized CE URFC achieves 57% and 60% RTE with air and O 2 as the reductant gases, respectively. We then evaluated the differences in durability using an AST over 10k charge–discharge cycles; the results reveal that the wider potential window at the anode in CE (0.05–1.55 V) has minimal effect on catalyst layer stability compared to CG (0.55–1.55 V). Furthermore, there was no degradation up to the range of 2k–5k cycles; beyond that the fuel cell (discharge) performance degraded while the electrolyzer (charge) performance was still stable. Finally, the observations here indicate substantial potential to employ URFCs as efficient and cost-effective bidirectional energy-conversion devices within energy storage and utilization systems after appropriate technological and operational optimizations.

25 ENERGY STORAGE↗

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

97 MATHEMATICS AND COMPUTING↗

Aeroelastic Tailoring Study of N+2 Low Boom Supersonic Commerical Transport Aircraft

The Lockheed Martin N+2 Low - boom Supersonic Commercial Transport (LSCT) aircraft was optimized in this study through the use of a multidisciplinary design optimization tool developed at the National Aeronautics and S pace Administration Armstrong Flight Research Center. A total of 111 design variables we re used in the first optimization run. Total structural weight was the objective function in this optimization run. Design requirements for strength, buckling, and flutter we re selected as constraint functions during the first optimization run. The MSC Nastran code was used to obtain the modal, strength, and buckling characteristics. Flutter and trim analyses we re based on ZAERO code, and landing and ground control loads were computed using an in - house code. The w eight penalty to satisfy all the design requirement s during the first optimization run was 31,367 lb, a 9.4% increase from the baseline configuration. The second optimization run was prepared and based on the big-bang big-crunch algorithm. Six composite ply angles for the second and fourth composite layers were selected as discrete design variables for the second optimization run. Composite ply angle changes can't improve the weight configuration of the N+2 LSCT aircraft. However, this second optimization run can create more tolerance for the active and near active strength constraint values for future weight optimization runs.

low boom supersonic civil transport↗