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 127 records · Page 7

Sequential ensemble transform for Bayesian inverse problems

In this work, we present the Sequential Ensemble Transform (SET) method, an approach for generating approximate samples from a Bayesian posterior distribution. The method explores the posterior distribution by solving a sequence of discrete optimal transport problems to produce a series of transport plans which map prior samples to posterior samples. We prove that the sequence of Dirac mixture distributions produced by the SET method converges weakly to the true posterior as the sample size approaches infinity. Furthermore, our numerical results indicate that, when compared to standard Sequential Monte Carlo (SMC) methods, the SET approach is more robust to the choice of Markov mutation kernels and requires less computational efforts to reach a similar accuracy when used to explore complex posterior distributions. Finally, we describe adaptive schemes that allow to completely automate the use of the SET method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adjoint DSMC for nonlinear Boltzmann equation constrained optimization

Applications for kinetic equations such as optimal design and inverse problems often involve finding unknown parameters through gradient-based optimization algorithms. Based on the adjoint-state method, we derive two different frameworks for approximating the gradient of an objective functional constrained by the nonlinear Boltzmann equation. While the forward problem can be solved by the DSMC method, it is difficult to efficiently solve the high-dimensional continuous adjoint equation obtained by the “optimize-then-discretize” approach. This challenge motivates us to propose an adjoint DSMC method following the “discretize-then-optimize” approach for Boltzmann-constrained optimization. We also analyze the properties of the two frameworks and their connections. Here, several numerical examples are presented to demonstrate their accuracy and efficiency.

97 MATHEMATICS AND COMPUTING↗

Relaxation dynamics in quantum dissipative systems: The microscopic effect of intramolecular vibrational energy redistribution

We investigate the effect of inter-mode coupling on the vibrational relaxation dynamics of molecules in weak dissipative environments. The simulations are performed within the reduced density matrix formalism in the Markovian regime, assuming a Lindblad form for the system-bath interaction. The prototypical two-dimensional model system representing two CO molecules approaching a Cu(100) surface is adapted from an ab initio potential, while the diatom-diatom vibrational coupling strength is systematically varied. In the weak system-bath coupling limit and at low temperatures, only first order non-adiabatic uni-modal coupling terms contribute to surface-mediated vibrational relaxation. Since dissipative dynamics is non-unitary, the choice of representation will affect the evolution of the reduced density matrix. Two alternative representations for computing the relaxation rates and the associated operators are thus compared: the fully coupled spectral basis, and a factorizable ansatz. The former is well-established and serves as a benchmark for the solution of Liouville-von Neumann equation. In the latter, a contracted grid basis of potential-optimized discrete variable representation is tailored to incorporate most of the inter-mode coupling, while the Lindblad operators are represented as tensor products of one-dimensional operators, for consistency. This procedure results in a marked reduction of the grid size and in a much more advantageous scaling of the computational cost with respect to the increase of the dimensionality of the system. The factorizable method is found to provide an accurate description of the dissipative quantum dynamics of the model system, specifically of the time evolution of the state populations and of the probability density distribution of the molecular wave packet. The influence of intra-molecular vibrational energy redistribution appears to be properly taken into account by the new model on the whole range of coupling strengths. It demontrates that most of the mode mixing during relaxation is due to the potential part of the Hamiltonian and not to the coupling among relaxation operators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Full-dimensional vibrational calculations of five-atom molecules using a combination of Radau and Jacobi coordinates: Applications to methane and fluoromethane

Full quantum mechanical calculations of vibrational energies of methane and fluoromethane are carried out using a polyspherical description combining Radau and Jacobi coordinates. The Hamiltonian is built in a potential-optimized discrete variable representation, and vibrational energies are solved using an iterative eigensolver. This new approach can be applied to a large variety of molecules. In particular, we show that it is able to accurately and efficiently compute eigenstates for four different molecules : CH{sub 4}, CHD{sub 3}, CH{sub 2}D{sub 2}, and CH{sub 3}F. Very good agreement is obtained with the results reported previously in the literature with different approaches and with experimental data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum Distributed Unit Commitment: An Application in Microgrids

The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. Here, in this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing.

97 MATHEMATICS AND COMPUTING↗

Detailed Chemical Kinetics Based Simulation of Detonation-Containing Flows

Reliable and robust simulations of detonations in inhomogeneous and turbulent environments are of direct importance in the design of rotating detonation engines (RDEs). In particular, computational models will be especially useful in designing and optimizing discrete injectors that introduce fuel and air separately into the detonation chamber, but ensure appropriate level of mixing to sustain detonations but minimize backflow of detonation products and pressure waves into the feed plenums. Since the structure of detonations itself is non-ideal, models have to include a detailed description of this reacting flow in order to be predictive in nature. Here, a highly-scalable open source based solver has been developed for complex detonating flows such that a) the detonation processes are described using detailed chemical kinetics, b) the method is computationally efficient through the introduction of adaptive mesh refinement, and c) the solver can handle complex geometries of relevance to RDE design. Grid convergence of key metrics for detonations is evaluated using canonical flows. Further, the importance of the use of detailed chemical kinetics is illustrated by extracting the composition structure behind a two-dimensional detonation front. Finally, simulations of a practical RDE configuration are used to demonstrate the applicability of this solver to analyzing geometries. The simulation captures the general trends of the experiment well. It is found that the detonation occurs under partially-premixed conditions. Propagation of pressure waves to the injection system is observed which could influence flow behavior in the oxidizer plenum.

03 NATURAL GAS↗

LOGOS

LOGOS is a software package which contains a set of discrete optimization models that can be employed for capital budgeting optimization problems. More specifically, provided a set of items (characterized by cost and reward values) and constraints, these models select the best combination of items which maximizes overall reward and satisfies the provided constraints. The developed models are based on different versions of the knapsack optimization algorithms. Two main classes of optimization models have been initially developed: deterministic and stochastic. Stochastic optimization models evolve deterministic models by explicitly considering data uncertainties (associated to constraints or item cost and reward). These models can be employed as stand-alone models or interfaced with the INL developed RAVEN code to propagate data uncertainties and analyze the generated data (i.e., sensitivity analysis).

Wang, Congjian↗

Unconventional Quantum Advantages for Computation (U-QuAC)

While quantum computing offers the promise of exponential advantages, limited quantum speedups are known, especially for practical applications. To open new avenues for quantum advantages, we propose Unconventional Quantum Advantages for Computation (U-QuACs), with respect to unconventional resources such as space (number of bits or quantum bits of memory required to solve a problem), accuracy of solution, communication, or energy consumption. We focus on space-efficient quantum algorithms, where we seek to design algorithms that solve a problem using much less space than the total size of the input. A natural setting in which space is critical is the streaming model of computation, where the input data arrives sequentially in pieces that must each be processed individually. Streaming is motivated by a variety of problems including analysis of internet traffic or social networks. We design the first exponential quantum space advantage for a natural streaming problem, which also constitutes the first quantum advantage for approximating a discrete optimization problem, albeit with respect to space.

97 MATHEMATICS AND COMPUTING↗

An algorithm for a general class of routing problems derived from Huygens' principle

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

Avis, L. M.↗

Digital adaptive controllers using second order models with transport lag

Design of a discrete optimal regulator requires the a priori knowledge of a mathematical model for the system of interest. Because a second-order model with transport lag is very amenable to control computations and because this type of model has been used previously to represent certain high order single input-single output processes, an adaptive controller was designed based upon adjustment of controls computed for such a model. An extended Kalman filter was utilized for tracking the model parameters which were subsequently used to update a set of optimal control gains. Favorable results were obtained in applying this procedure to the control of several examples including a ninth order nonlinear process.

Joshi, S.↗

On the optimal minimum order observer-based compensator and the limited state variable feedback controller

Four design problems are considered: two on the optimal minimum order observer-based compensator design and two on the optimal limited state variable feedback controller. The problem of designing an optimal discrete time linear time-invariant observer-based compensator for the regulation of an n dimensional linear discrete time time-invariant plant with m independent outputs is considered. This is a stochastic design problem to the extent that the initial plant state is assumed to be a random vector with known first and second order statistics. The compensator parameters are obtained by minimizing the expectation, with respect to the initial conditions, of the standard cost, quadratic in the state and control vectors with the inclusion of cross terms.

Llorens-Ortiz, B.↗

The human operator in manual preview tracking /an experiment and its modeling via optimal control/

A manual preview tracking experiment and its results are presented. The preview drastically improves the tracking performance compared to zero-preview tracking. Optimal discrete finite preview control is applied to determine the structure of a mathematical model of the manual preview tracking experiment. Variable parameters in the model are adjusted to values which are consistent to the published data in manual control. The model with the adjusted parameters is found to be well correlated to the experimental results.

Tomizuka, M.↗

Application of an adaptive blade control algorithm to a gust alleviation system

The feasibility of an adaptive control system designed to alleviate helicopter gust induced vibration was analytically investigated for an articulated rotor system. This control system is based on discrete optimal control theory, and is composed of a set of measurements (oscillatory hub forces and moments), an identification system using a Kalman filter, a control system based on the minimization of the quadratic performance function, and a simulation system of the helicopter rotor. The gust models are step and sinusoidal vertical gusts. Control inputs are selected at the gust frequency, subharmonic frequency, and superharmonic frequency, and are superimposed on the basic collective and cyclic control inputs. The response to be reduced is selected to be that at the gust frequency because this is the dominant response compared with sub- and superharmonics. Numerical calculations show that the adaptive blade pitch control algorithm satisfactorily alleviates the hub gust response. Almost 100% reduction of the perturbation thrust response to a step gust and more than 50% reduction to a sinusoidal gust are achieved in the numerical simulations.

Saito, S.↗

Application of an adaptive blade control algorithm to a gust alleviation system

The feasibility of an adaptive control system designed to alleviate helicopter gust induced vibration was analytically investigated for an articulated rotor system. This control system is based on discrete optimal control theory, and is composed of a set of measurements (oscillatory hub forces and moments), an identification system using a Kalman filter, a control system based on the minimization of the quadratic performance function, and a simulation system of the helicopter rotor. The gust models are step and sinusoidal vertical gusts. Control inputs are selected at the gust frequency, subharmonic frequency, and superharmonic frequency, and are superimposed on the basic collective and cyclic control inputs. The response to be reduced is selected to be that at the gust frequency because this is the dominant response compared with sub- and superharmonics. Numerical calculations show that the adaptive blade pitch control algorithm satisfactorily alleviates the hub gust response. Almost 100 percent reduction of the perturbation thrust response to a step gust and more than 50 percent reduction to a sinusoidal gust are achieved in the numerical simulations.

Saito, S.↗

Application of variable-gain output feedback for high-alpha control

This paper describes a variable-gain optimal discrete output-feedback design approach that is applied to a nonlinear flight regime covering a wide angle-of-attack range that includes stall and poststall. The paper includes brief descriptions of the variable-gain formulation, the discrete-control structure and flight equations used to apply the design approach, and the high performance airplane model used in the application. Both linear and nonlinear analyses are shown for a longitudinal four-model design case with angles of attack of 5, 15, 35, and 60 deg.

Ostroff, Aaron J.↗