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 577 records · Page 32

Local element operations for curved simplex meshes

Summary Mesh optimization procedures are generally a combination of node smoothing and discrete operations which affect a small number of elements to improve the quality of the overall mesh. These procedures are useful as a post‐processing step in mesh generation procedures and in applications such as fluid simulations with severely deforming domains. In order to perform high‐order mesh optimization, these ingredients must also be extended to high‐order (curved) meshes. In this work, we present a method to perform local element operations on curved meshes. The mesh operations discussed in this work are edge/face swaps, edge collapses, and edge splitting (more generally refinement) for triangular and tetrahedral meshes. These local operations are performed by first identifying the patch of elements which contain the edge/face being acted on, performing the operation as a “straight‐sided one" by placing the high‐order nodes via an isoparametric mapping from the master element, and smoothing the high‐order nodes on the elements in the patch by minimizing a Jacobian‐based high‐order mesh distortion measure. Since the initial “straight‐sided guess” from the placement of the nodes via the isoparametric mapping frequently results in invalid elements, the distortion measure must be regularized which allows for mesh untangling for the optimization to succeed. We present several examples in 2D and 3D to demonstrate these local operations and how they can be combined with a high‐order node smoothing procedure to maintain mesh quality when faced with severe deformations.

Shi, A.↗

Optimization methods, flux conserving methods for steady state Navier-Stokes equation

Navier-Stokes equation as discretized by new flux conserving method proposed by Chang and Scott results in the system: vector F(vector x) = 0, where F is a vector valued function. The Optimization method we use is based on Quasi-Newton methods: given a nonlinear function vector F(vector x) = 0, we solve, Delta(vector x) = -BF(vector x), where Delta(vector x) is the correction term and B is the inverse Jacobian of F(x). Then, iteratively, vector(x(sub (i+1))) = vector(x (sub i)) + alpha.Delta(vector x(sub i)), where alpha is a line search correction term determined by a line search routine. We use the BFCG's update the Jacobian matrix B(sub k) at each iteration. It is well known that B(sub k) approaches B(*) at the solution X(*). This algorithm has several advantages over the Newton-Raphson method. For example, we do not need to calculate the Jacobian matrix at each iteration which is computationally very expensive.

Adeyeye, John↗

Optimum shape of a Kirkpatrick-Baez X-ray reflector supported at discrete points for on-axis performance

A method is proposed for optimizing the on-axis resolution of a Kirkpatrick-Baez reflecting element. The proposed procedure provides a way to determine the location of each of the 11,200 support points (175 different points plus repeats) by using a computer-assisted structural-optical software package. This automated procedure will make it possible to determine the optical characteristics of an entire telescope module consisting of seventy mirrors.

Cohen, L. M.↗

Edge-Based Viscous Method for Mixed-Element Node-Centered Finite-Volume Solvers

A novel, efficient, edge-based viscous (EBV) discretization method has been recently developed, implemented in a practical, unstructured-grid, node-centered, finite-volume flow solver, and applied to viscous-kernel computations that include evaluations of meanflow viscous fluxes, turbulence-model and chemistry-model diffusion terms, and the corresponding Jacobian contributions. Initially, the EBV method had been implemented for tetrahedral grids and demonstrated multifold acceleration of all viscous-kernel computations. This paper presents an extension of the EBV method for mixed-element grids. In addition to the primal edges of a given mixed-element grid, virtual edges are introduced to connect cell nodes that are not connected by a primal edge. The EBV method uses an efficient loop over all (primal and virtual) edges and features a compact discretization stencil based on the nearest neighbors. This study verifies the EBV method and assesses its efficiency on mixed-element grids by comparing the EBV solution accuracy and iterative convergence with those of well-established solutions obtained using a cell-based viscous (CBV) discretization method. The EBV solver’s memory footprint is optimized and often smaller than the memory footprint of the CBV solver. A multifold speedup is demonstrated for all viscous-kernel computations resulting in significant reduction of the time to solutions for several benchmark mixed-element-grid computations, including simulations of a flow around NASA’s juncture-flow model and a hypersonic, chemically reacting flow around a blunt body.

CFD↗

Optimized Finite-Difference Coefficients for Acoustic Modeling.

Although using standard Taylor series coefficients for finite-difference operators is optimal in the sense that in the limit of infinitesimal space and time discretization, the solution approaches the correct analytic solution to the acousto-dynamic system of differential equations, other finite-difference operators may provide optimal computational run time given certain error bounds or source bandwidth constraints. This report describes the results of investigation of alternative optimal finite-difference coefficients based on several optimization/accuracy scenarios and provides recommendations for minimizing run time while retaining error within given error bounds.

58 GEOSCIENCES↗

Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting

This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.

97 MATHEMATICS AND COMPUTING↗

Reconfigurable Model Execution in the OpenMDAO Framework

NASA's OpenMDAO framework facilitates constructing complex models and computing their derivatives for multidisciplinary design optimization. Decomposing a model into components that follow a prescribed interface enables OpenMDAO to assemble multidisciplinary derivatives from the component derivatives using what amounts to the adjoint method, direct method, chain rule, global sensitivity equations, or any combination thereof, using the MAUD architecture. OpenMDAO also handles the distribution of processors among the disciplines by hierarchically grouping the components, and it automates the data transfer between components that are on different processors. These features have made OpenMDAO useful for applications in aircraft design, satellite design, wind turbine design, and aircraft engine design, among others. This paper presents new algorithms for OpenMDAO that enable reconfigurable model execution. This concept refers to dynamically changing, during execution, one or more of: the variable sizes, solution algorithm, parallel load balancing, or set of variables-i.e., adding and removing components, perhaps to switch to a higher-fidelity sub-model. Any component can reconfigure at any point, even when running in parallel with other components, and the reconfiguration algorithm presented here performs the synchronized updates to all other components that are affected. A reconfigurable software framework for multidisciplinary design optimization enables new adaptive solvers, adaptive parallelization, and new applications such as gradient-based optimization with overset flow solvers and adaptive mesh refinement. Benchmarking results demonstrate the time savings for reconfiguration compared to setting up the model again from scratch, which can be significant in large-scale problems. Additionally, the new reconfigurability feature is applied to a mission profile optimization problem for commercial aircraft where both the parametrization of the mission profile and the time discretization are adaptively refined, resulting in computational savings of roughly 10% and the elimination of oscillations in the optimized altitude profile.

Hwang, John T.↗

Assessment of Tritium Activities in Bailed versus Pumped Samples from Wells at the Nevada National Security Site

The Underground Test Area (UGTA) Activity uses a variety of methods to collect groundwater samples to identify radionuclide migration from underground nuclear tests. These include depth-discrete bailing, pumping with low-volume rod pumps, and pumping with electrical submersible pumps. The Nevada National Security Site (NNSS) Integrated Groundwater Sampling Plan specifies that when sampling with a pump, a minimum of three effective well volumes are withdrawn and then samples are collected after water-quality parameters have stabilized. In locations where pumping is not feasible, depth-discrete bailing is used and purging prior to sampling is usually not required. A recent study evaluated three sampling technologies and recommended that historical tritium results be evaluated where both pumped and bailed samples are available to identify preferred sampling protocols for the collection of tritium samples. The tritium ( 3 H) activities were obtained from the UGTA chemistry data base. Wells were identified with known 3 H activities above method detection limits, and then evaluated if both bailed and pumped samples had been collected. Twenty two wells and piezometers with bailed samples, pumped samples, and 3 H activities above background were identified for further consideration. The conclusions from this analysis are: Bailed samples collected for 3 H analysis near the water surface in a well are lower in 3 H activity than bailed samples from within screened intervals and pumped samples. Depth-discrete bailed samples from within the screened intervals are generally in good agreement with pumped samples from developed wells and piezometers. Depth-discrete bailed samples from undeveloped wells and piezometers are in good agreement with the first pumped samples. However, the next pumped samples increased in 3 H activity, resulting in a greater percent difference between the undeveloped bailed samples and later pumped samples. Continuous pumping over extended periods removing large purge volumes from wells can perturbate the surrounding groundwater system for long periods of time. These perturbations can cause large changes in 3 H activities in the aquifer near the well because of the mixing of groundwater with variable 3 H activities. Recommendations include: Bailed samples for 3 H should not be collected near the water surface in the well. Bailed samples should be collected from within the well screen. Logs of temperature, chemistry, and thermal flow should be evaluated to identify optimal depths within the well screen to collect depth-discrete bailer samples. Purging of large volumes of water from the well over extended periods of time should be avoided when collecting 3 H samples. Sufficient time should be allowed after pumping large volumes of water from the well (e.g., after well development) for the surrounding aquifer and 3 H activities to return to ambient conditions

54 ENVIRONMENTAL SCIENCES↗

Control Improvement for Jump-Diffusion Processes with Applications to Finance

We consider stochastic control problems with jump-diffusion processes and formulate an algorithm which produces, starting from a given admissible control {pi}, a new control with a better value. If no improvement is possible, then {pi} is optimal. Such an algorithm is well-known for discrete-time Markov Decision Problems under the name Howard's policy improvement algorithm. The idea can be traced back to Bellman. Here we show with the help of martingale techniques that such an algorithm can also be formulated for stochastic control problems with jump-diffusion processes. As an application we derive some interesting results in financial portfolio optimization.

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↗

An optimal numerical filter for wide-field-of-view measurements of earth-emitted radiation

A technique is described in which all data points along an arc of the orbit may be used in an optimal numerical filter for wide-field-of-view measurements of earth emitted radiation. The statistical filter design is derived whereby the filter is required to give a minimum variance estimate of the radiative exitance at discrete points along the ground track of the satellite. An equation for the optimal numerical filter is given by minimizing the estimate error variance equation with respect to the filter weights, resulting in a discrete form of the Wiener-Hopf equation. Finally, variances of the errors in the radiant exitance can be computed along the ground track and in the cross track directions.

Smith, G. L.↗

Online Stochastic Optimization of Networked Distributed Energy Resources

Our work investigates distributed control and incentive mechanisms to coordinate distributed energy resources (DERs) with both continuous and discrete decision variables as well as device dynamics in distribution grids. We formulate a multi-period social welfare maximization problem, and based on its convex relaxation propose a distributed stochastic dual gradient algorithm for managing DERs. Moreover, we extend it to an online realtime setting with time-varying operating conditions, asynchronous updates by devices, and feedback being leveraged to account for nonlinear power flows as well as reduce communication overhead. The resulting algorithm provides a general online stochastic optimization algorithm for coordinating networked DERs with discrete power setpoints and dynamics to meet operational and economic objectives and constraints. We characterize the convergence of the algorithm analytically and evaluate its performance numerically.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Alternating Direction Decomposition with Strong Bounding and Convexification (ADDSBC) for Solving Security Constrained AC Unit Commitment Problems

This project aims to develop efficient and robust computational methods for solving the security-constrained unit commitment and alternating current optimal power flow problem (SC-UC-ACOPF). The SC-UC-ACOPF problem is at the center of the short-term operation of the U.S. Power Grid. It is solved every week, every day, and every 10 minutes to plan for the optimal action of electricity generation and consumption by minimizing the generation cost and maintaining power system reliability against potential disruptions of equipment failures. In mathematical terms, SC-UC-ACOPF is a challenging large-scale mixed-integer nonlinear optimization model. This means that the decisions involve both discrete variables, e.g. the turning on and off of generators and switching of transmission lines and transformers, and continuous decisions, e.g. the amount of energy generated by each generator and the power flows in the power grid. The physics of the power flow is described by nonlinear equations involving real and reactive power and bus voltages. Another key feature is the large number of contingencies, i.e. the system needs to stay reliable in face of failure of any one equipment, such as transmission lines and generators. The U.S. power grids are extremely complicated and large scale with more than 5,000 generators, 50,000 buses, and 100,000 high-voltage transmission lines, making the SC-UC-ACOPF a very large-scale computation challenge. The research developed in this project aims to solve the SC-UC-ACOPF problems in the three timescales, i.e. weekly, daily, and every 10-min. The proposed computational methods are built on a principled algorithmic approach of decomposition and penalization. More specifically, the algorithm develops spatial and temporal decomposition by exploiting the strong temporal coupling and weak spatial coupling of the UC problem and the complementary feature, i.e. weak temporal coupling and strong spatial coupling of the ACOPF problem. The algorithm also leverages recent progresses in strong convex relaxation of ACOPF. A unique feature of the proposed approach is that it generates a valid, global upper bound on the optimal maximum profit. In this way, a global optimality gap is available to measure the quality of the solution. To further speed up computation, the research team has developed a plethora of effective heuristics to strengthen the iterative penalty-based decomposition framework. For instance, a heuristic is developed to construct inner approximations of the time coupling constraints within the time decoupled problems. Contingencies are pre-screened and low-rank matrix computation is exploited to find the almost unique solution to each contingency. A novel heuristic for line switching is proposed and tested with positive impacts on instances where line switching is beneficial. Taking a systematic approach and carefully handling every detail of the problem pays off. The TIM-GO’s performance throughout the trials and the final event was stellar. TIM-GO garnered the second highest total prize money and is ranked in the top three positions across all categories of comparison.

97 MATHEMATICS AND COMPUTING↗

Optimal Control of a Degenerate PDE for Surface Shape

Controlling the shapes of surfaces provides a novel way to direct self-assembly of colloidal particles on those surfaces and may be useful for material design. This motivates the investigation of an optimal control problem for surface shape in this paper. Specifically, we consider an objective (tracking) functional for surface shape with the prescribed mean curvature equation in graph form as a state constraint. The control variable is the prescribed curvature. We prove existence of an optimal control, and using improved regularity estimates, we show sufficient differentiability to make sense of the first order optimality conditions. This allows us to rigorously compute the gradient of the objective functional for both the continuous and discrete (finite element) formulations of the problem. Numerical results are shown to illustrate the minimizers and optimal controls on different domains.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TEAM project review, year 1

This note summarizes our research activities within the TEAM project between October 2019 and November 2020, funded by the ASCR Advanced Research in Quantum Computing program. Three research efforts have begun during the review period. The first effort, resulting in the JuQBox software, implemented a novel algorithm for optimal control in closed quantum systems based on symplectic time integration and exact calculations of the gradient of the discretized objective function. In our second effort, resulting in a code called Quandary, we consider the optimal control problem for open quantum systems. Here the evolution of the quantum system is modeled by the Lindblad master equation. In this code, we are considering both the realization of quantum gates as well as the optimal reset problem in which a general mixed quantum state is driven towards its ground state. In our third research effort we have begun the development of computational software for what we call Lindblad learning, i.e. the process of characterizing the equations governing our quantum computing hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving complex maintenance planning optimization problems using stochastic simulation and multi-criteria fuzzy decision making

One of the most important factors in the operations of many cooperations today is to maximize profit and one important tool to that effect is the optimization of maintenance activities. Maintenance activities is at the largest level divided into two major areas, corrective maintenance (CM) and preventive maintenance (PM). When optimizing maintenance activities, by a maintenance plan or policy, we seek to find the best activities to perform at each point in time, be it PM or CM. We explore the use of stochastic simulation, genetic algorithms and other tools for solving complex maintenance planning optimization problems in terms of a suggested framework model based on discrete event simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Hierarchical models and iterative optimization of hybrid systems

A class of hybrid control systems on the base of two-level discrete-continuous model is considered. The concept of this model was proposed and developed in preceding works as a concretization of the general multi-step system with related optimality conditions. A new iterative optimization procedure for such systems is developed on the base of localization of the global optimality conditions via contraction the control set.

97 MATHEMATICS AND COMPUTING↗

Radiograph and passive data analysis using mixed variable optimization

Disclosed herein are representative embodiments of methods, apparatus, and systems for performing radiography analysis. For example, certain embodiments perform radiographic analysis using mixed variable computation techniques. One exemplary system comprises a radiation source, a two-dimensional detector for detecting radiation transmitted through a object between the radiation source and detector, and a computer. In this embodiment, the computer is configured to input the radiographic image data from the two-dimensional detector and to determine one or more materials that form the object by using an iterative analysis technique that selects the one or more materials from hierarchically arranged solution spaces of discrete material possibilities and selects the layer interfaces from the optimization of the continuous interface data.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗