Search NASA⌕ Search

SEARCH · Search NASA

Results for “Numerical 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,099 records · Page 61

Optimal Design of Calibration Signals in Space Borne Gravitational Wave Detectors

Future space borne gravitational wave detectors will require a precise definition of calibration signals to ensure the achievement of their design sensitivity. The careful design of the test signals plays a key role in the correct understanding and characterization of these instruments. In that sense, methods achieving optimal experiment designs must be considered as complementary to the parameter estimation methods being used to determine the parameters describing the system. The relevance of experiment design is particularly significant for the LISA Pathfinder mission, which will spend most of its operation time performing experiments to characterize key technologies for future space borne gravitational wave observatories. Here we propose a framework to derive the optimal signals in terms of minimum parameter uncertainty to be injected to these instruments during its calibration phase. We compare our results with an alternative numerical algorithm which achieves an optimal input signal by iteratively improving an initial guess. We show agreement of both approaches when applied to the LISA Pathfinder case.

LISA Path_nder mission↗

Emulating the Deutsch-Josza algorithm with an inverse-designed terahertz gradient-index lens

An all-dielectric photonic metastructure is investigated for application as a quantum algorithm emulator (QAE) in the terahertz frequency regime; specifically, we show implementation of the Deustsh-Josza algorithm. The design for the QAE consists of a gradient-index (GRIN) lens as the Fourier transform subblock and patterned silicon as the oracle subblock. First, we detail optimization of the GRIN lens through numerical analysis. Then, we employed inverse design through a machine learning approach to further optimize the structural geometry. Through this optimization, we enhance the interaction of the incident light with the metamaterial via spectral improvements of the outgoing wave.

Blackwell, Ashley N.↗

Thermofluid Analysis of Magnetocaloric Refrigeration

While there have been extensive studies on thermofluid characteristics of different magnetocaloric refrigeration systems, a conclusive optimization study using non-dimensional parameters which can be applied to a generic system has not been reported yet. In this study, a numerical model has been developed for optimization of active magnetic refrigerator (AMR). This model is computationally efficient and robust, making it appropriate for running the thousands of simulations required for parametric study and optimization. The governing equations have been non-dimensionalized and numerically solved using finite difference method. A parametric study on a wide range of non-dimensional numbers has been performed. While the goal of AMR systems is to improve the performance of competitive parameters including COP, cooling capacity and temperature span, new parameters called “AMR performance index-1” have been introduced in order to perform multi objective optimization and simultaneously exploit all these parameters. The multi-objective optimization is carried out for a wide range of the non-dimensional parameters. The results of this study will provide general guidelines for designing high performance AMR systems.

Magnetic Refrigeration↗

Identifiability and characterization of transmon qutrits through Bayesian experimental design

Robust control of a quantum system is essential to utilize the current noisy quantum hardware to its full potential, such as quantum algorithms. To achieve such a goal, a systematic search for an optimal control for any given experiment is essential. The design of optimal control pulses requires accurate numerical models and, therefore, accurate characterization of the system parameters. We present an online Bayesian approach for quantum characterization of qutrit systems, which automatically and systematically identifies optimal experiments that provide maximum information on the system parameters, thereby greatly reducing the number of experiments that need to be performed on the quantum testbed. Unlike most characterization protocols that provide point-estimates of the parameters, the proposed approach is able to estimate their probability distribution. The applicability of the Bayesian experimental design technique was demonstrated on test problems, where each experiment was defined by a parameterized control pulse. In addition to this, we also present an approach for iterative pulse extension, which is robust under uncertainties in transition frequencies and coherence times, and shot noise, despite being initialized with wide uninformative priors. Furthermore, we provide a mathematical proof of the theoretical identifiability of the model parameters and present conditions on the quantum state under which the parameters are identifiable. The proof and conditions for identifiability are presented for both closed and open quantum systems using the Schrödinger equation and the Lindblad master equation, respectively.

97 MATHEMATICS AND COMPUTING↗

Optimal trajectories between Earth and Mars in their true planetary orbits.

The optimal transfers from Earth to Mars and from Mars to Earth, considering the actual planetary orbits, are presented as functions of the corresponding idealized Hohmann transfers. The numerically exact two-impulse optimal trajectories are given in graphical form for all possible Hohmann windows. The two-impulse transfers which are absolute optimals and those for which a third impulse provides the absolute optimal are delineated. These data are designed to provide all the information necessary for quick orbit calculations for preliminary Martian mission analysis. In this form, they are as easy to use as the standard Hohmann transfer approximations and provide much greater accuracy.

Gravier, J. P.↗

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗

Theory of the optimally coupled Q-switched laser

The general equations describing Q-switched laser operation are transcendental in nature and require numerical solutions, which greatly complicates the optimization of real devices. Here, it is shown that, using the mathematical technique of Lagrange multipliers, one can derive simple analytic expressions for all of the key parameters of the optimally coupled laser, i.e., one which uses an optimum reflector to obtain maximum laser efficiency for a given pump level. These parameters can all be expressed as functions of a single dimensionless variable z, defined as the ratio of the unsaturated small-signal gain to the dissipative (nonuseful) optical loss, multiplied by a few simple constants. Laser design tradeoff studies and performance projections can be accomplished quickly with the help of several graphs and a simple hand calculator. Sample calculations for a high-gain Nd:YAG and a low-gain alexandrite laser are presented as illustrations of the technique.

Degnan, John J.↗

Gate-free state preparation for fast variational quantum eigensolver simulations

Abstract The variational quantum eigensolver is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. The algorithm involves implementing a sequence of parameterized gates on quantum hardware to generate a target quantum state, and then measuring the molecular energy. Due to finite coherence times and gate errors, the number of gates that can be implemented remains limited. In this work, we propose an alternative algorithm where device-level pulse shapes are variationally optimized for the state preparation rather than using an abstract-level quantum circuit. In doing so, the coherence time required for the state preparation is drastically reduced. We numerically demonstrate this by directly optimizing pulse shapes which accurately model the dissociation of H 2 and HeH + , and we compute the ground state energy for LiH with four transmons where we see reductions in state preparation times of roughly three orders of magnitude compared to gate-based strategies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamic systems modeling of the spallation neutron source cryogenic moderator system to optimize transient control and prepare for power upgrades

Through support of the US Department of Energy's Office of Basic Energy Sciences, Oak Ridge National Laboratory has begun applying machine learning methods to improve accelerator and target performance of the Spallation Neutron Source (SNS). These methods are being applied to the control optimization and power upgrade of the SNS Cryogenic Moderator System (CMS). A numerical model of the CMS has been developed to study these optimizations and system modifications using EcosimPro. This paper compares steady-state and transient numerical results with experimental data. Control optimization studies focused on dampening mass flow, temperature, and pressure fluctuations during sudden losses of accelerator beam power. This analysis was conducted by adjusting five proportional-integral-derivative controllers connected to four flow control valves and one heater. Future efforts include power uprate studies focused on increasing the CMS cooling capacity. The current accelerator power is 1.4 MW; the first target station is being upgraded to 2.0 MW as part of the Proton Power Upgrade effort. The CMS cooling capacity is sufficient for 2.0 MW operation.

47 OTHER INSTRUMENTATION↗

BiRD (BioReactorDesign) [SWR-24-35]

Numerical simulations can accelerate scale up and optimization of bioreactors. This project provides a toolbox to facilitate such numerical simulations in OpenFOAM. The tool box contains 1) mesh generations tools for several typical bio reactor types in OpenFOAM 2) Inverse modeling tools to calibrate models using available experimental data 3) post processing tools that accelerate and streamline the analysis of the numerical simulations.

Hassanaly, Malik↗

Minimal time trajectories for two-level quantum systems with two bounded controls

In this paper we consider the minimum time population transfer problem for a two level quantum system driven by two external fields with bounded amplitude. The controls are modeled as real functions and we do not use the Rotating Wave Approximation. After projection on the Bloch sphere, we treat the time-optimal control problem with techniques of optimal synthesis on 2D manifolds. Based on the Pontryagin Maximum Principle, we characterize a restricted set of candidate optimal trajectories. Properties on this set, crucial for complete optimal synthesis, are illustrated by numerical simulations. Furthermore, when the two controls have the same bound and this bound is small with respect to the difference of the two energy levels, we get a complete optimal synthesis up to a small neighborhood of the antipodal point of the initial condition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems

We develop a framework for goal-oriented optimal design of experiments (GOODE) for large-scale Bayesian linear inverse problems governed by PDEs. This framework differs from classical Bayesian optimal design of experiments (ODE) in the following sense: we seek experimental designs that minimize the posterior uncertainty in the experiment end-goal, e.g. a quantity of interest (QoI), rather than the estimated parameter itself. This is suitable for scenarios in which the solution of an inverse problem is an intermediate step and the estimated parameter is then used to compute a QoI. In such problems, a GOODE approach has two benefits: the designs can avoid wastage of experimental resources by a targeted collection of data, and the resulting design criteria are computationally easier to evaluate due to the often low-dimensionality of the QoIs. We present two modified design criteria, A-GOODE and D-GOODE, which are natural analogues of classical Bayesian A- and D-optimal criteria. We analyze the connections to other ODE criteria, and provide interpretations for the GOODE criteria by using tools from information theory. Then, we develop an efficient gradient-based optimization framework for solving the GOODE optimization problems. Additionally, we present comprehensive numerical experiments testing the various aspects of the presented approach. The driving application is the optimal placement of sensors to identify the source of contaminants in a diffusion and transport problem. As a result, we enforce sparsity of the sensor placements using an L1-norm penalty approach, and propose a practical strategy for specifying the associated penalty parameter.

97 MATHEMATICS AND COMPUTING↗

C3PU:Real-Time Predictive Charge Control Software for Battery Management Systems (Code for Charge Control and Predictive Unit) [SWR-21-48]

C3PU sets up a model predictive control formulation for the optimal charging control of battery packs and can be deployed for real-time operation on an embedded microprocessor. C3PU uses electrochemical and thermal models of battery packs to predict the charging trajectories of the battery pack over a time horizon under different operating conditions. It then selects the optimal charging trajectory such that a pre-defined objective is minimized, which in the present state of the code is to minimize the charging duration of the battery pack. The optimal charging trajectory is obtained by solving an underlying mathematical problem. However, C3PU is flexible to incorporate other charging objectives. The underlying battery models can be swapped as well, as long as they follow certain mathematical properties. Mathematically, optimal control problems (in this case, optimally controlling the charging current of the battery pack) are computationally expensive. C3PU implements advanced numerical techniques, namely pseudo-spectral optimization, to reduce the computational burden of the underlying problem to solve. This allows for the problem to be solved in real-time in an embedded system. Once the optimal charging trajectory is computed over a time horizon, C3PU can package such data and send it out via appropriate communication protocols.

Mishra, Partha↗

Data Structure and Parallel Decomposition Considerations on a Fibonacci Grid

The Fibonacci grid, proposed by Swinbank and Purser (see companion abstract), provides attractive properties for global numerical atmospheric prediction by offering an optimally homogeneous, geometrically regular, and approximately isotropic discretization, with only the polar regions requiring special numerical treatment. It is a mathematical idealization, applied to the sphere, of the multi-spiral patterns often found in botanical structures, such as in pine cones and sunflower heads. Computationally, it is natural to organize the domain, into zones, in each of which the same pair, or triple, of "Fibonacci spirals" dominate. But the further subdivision of such zones into "tiles" of a shape and size suitable for distribution to the processors of a massively parallel computer requires very careful consideration if the subsequent spatial computations along the respective spirals, especially those computations (such as compact differencing schemes) that involve recursion, can be implemented in an efficient "load-balanced "manner without requiring excessive amounts of inter-processor communications. In this paper we show how certain "number theoretic" properties of the Fibonacci sequence (whose numbers prescribe the multiplicity of successive spirals) may be exploited in the decomposition of grid zones into tidy arrangements of triangular grid tiles, each tile possessing one side approximately parallel to the constant-latitude zone boundary. We also describe how the spatially recursive processes may be decomposed across such a tiling, and the directionality of the recursions reversed on alternate grid lines, to ensure a very high degree of load balancing throughout the execution of the computations required for one time step of a global model.

Michalakes, John↗

Performance Analysis of Magnetohydrodynamic Drag Modulation for Actively Controlled Aerocapture at Neptune

Missions to the Ice Giants are a top priority for flagship missions this coming decade. However, a fully propulsive orbital insertion into these planets requires an immense amount of fuel, taking a significant portion of the spacecraft mass and restricting the scientific payload. To mitigate this, aerocapture has been heavily investigated. Although simulations have shown that aerodynamically controlled aerocapture can successfully insert into an orbit around both Ice Giants, the deep atmospheric pass required necessitates a complex, mass expensive, and sometimes prohibitive thermal protection system. Magnetohydrodynamic drag modulation serves as a potential alternative control method for aerocapture which could not only save propellant mass compared to fully propulsive orbital insertion, but also save thermal protection system mass compared to conventional aerocapture methods. Both aerodynamically controlled and magnetohydrodynamically controlled aerocapture methodologies were simulated in NASA Langley’s high-fidelity six degree-of-freedom flight dynamics code, the Program to Optimize Simulated Trajectories II. Each method was simulated to identical missions to Neptune using a numerical predictor-corrector algorithm to optimize the control towards the target orbit. The results concluded that magnetohydrodynamic drag modulation can successfully capture and performs on par with aerodynamic drag modulation while significantly reducing the heatflux and aeroshell complexity.

Danny N Nguyen↗

Application of optimal input synthesis to aircraft parameter identification

The Frequency Domain Input Synthesis procedure is used in identifying the stability and control derivatives of an aircraft. By using a frequency-domain approach, one can handle criteria that are not easily handled by the time-domain approaches. Numerical results are presented for optimal elevator deflections to estimate the longitudinal stability and control derivatives subject to root-mean square constraints on the input. The applicability of the steady state optimal inputs to finite duration flight testing is investigated. The steady state approximation of frequency-domain synthesis is good for data lengths greater than two time cycles for the short period mode of the aircraft longitudinal motions. Phase relationships between different frequency components become important for shorter data lengths. The frequency domain inputs are shown to be much better than the conventional doublet inputs.

Gupta, N. K.↗

The expanded LaGrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrainted optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗

The expanded Lagrangian system for constrained optimization problems

Smooth penalty functions can be combined with numerical continuation/bifurcation techniques to produce a class of robust and fast algorithms for constrained optimization problems. The key to the development of these algorithms is the Expanded Lagrangian System which is derived and analyzed in this work. This parameterized system of nonlinear equations contains the penalty path as a solution, provides a smooth homotopy into the first-order necessary conditions, and yields a global optimization technique. Furthermore, the inevitable ill-conditioning present in a sequential optimization algorithm is removed for three penalty methods: the quadratic penalty function for equality constraints, and the logarithmic barrier function (an interior method) and the quadratic loss function (an interior method) for inequality constraints. Although these techniques apply to optimization in general and to linear and nonlinear programming, calculus of variations, optimal control and parameter identification in particular, the development is primarily within the context of nonlinear programming.

Poore, A. B.↗