Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS”

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 19 records

COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS FOR APS-U

Many different objectives and genetic algorithms have been proposed for storage ring nonlinear dynamics performance optimization. These optimization objectives include nonlinear chromaticities and driving/detuning terms, on-momentum and off-momentum dynamic acceptance, chromatic detuning, local momentum acceptance, variation of transverse invariant, Touschek lifetime, etc. In this paper, the effectiveness of several different optimization methods and objectives are compared for the nonlinear beam dynamics optimization of the Advanced Photon Source upgrade (APS-U) lattice. The optimized solutions from these different methods are preliminarily compared in terms of the dynamic acceptance, local momentum acceptance, chromatic detuning, and other performance measures.

APS-U∗↗

Visual/motion simulation of CTOL flare and touchdown comparing data obtained from two model board display systems

Acquisition of a modern terrain model board display system for 'out-the-window' scene presentation has allowed for the repetition of an evaluation study of combined visual/motion cues for CTOL flare and touchdown control that was originally carried out on a 1965 vintage landing display system. The motion drive system used in both studies was a nonlinear coordinated adaptive washout based on the method of continuous steepest descent optimization. Comparisons of the results of the studies present flare and touchdown data, as well as dynamic response data, from the two visual landing systems. The new visual system also allowed for the repetition, under visual conditions, of a subjective comparison of a linear and a nonlinear motion washout method done previously under instrument conditions.

Parrish, R. V.↗

Dynamic Modeling from Flight Data with Unknown Time Skews

A method for estimating dynamic model parameters from flight data with unknown time skews is described and demonstrated. The method combines data reconstruction, nonlinear optimization, and equation-error parameter estimation in the frequency domain to accurately estimate both dynamic model parameters and the relative time skews in the data. Data from a nonlinear F-16 aircraft simulation with realistic noise, instrumentation errors, and arbitrary time skews were used to demonstrate the approach. The approach was further evaluated using flight data from a subscale jet transport aircraft, where the measured data were known to have relative time skews. Comparison of modeling results obtained from time-skewed and time-synchronized data showed that the method accurately estimates both dynamic model parameters and relative time skew parameters from flight data with unknown time skews.

Morelli, Eugene A.↗

Bilinear dynamic mode decomposition for quantum control

Abstract Data-driven methods for establishing quantum optimal control (QOC) using time-dependent control pulses tailored to specific quantum dynamical systems and desired control objectives are critical for many emerging quantum technologies. We develop a data-driven regression procedure, bilinear dynamic mode decomposition (biDMD), that leverages time-series measurements to establish quantum system identification for QOC. The biDMD optimization framework is a physics-informed regression that makes use of the known underlying Hamiltonian structure. Further, the biDMD can be modified to model both fast and slow sampling of control signals, the latter by way of stroboscopic sampling strategies. The biDMD method provides a flexible, interpretable, and adaptive regression framework for real-time, online implementation in quantum systems. Further, the method has strong theoretical connections to Koopman theory, which approximates nonlinear dynamics with linear operators. In comparison with many machine learning paradigms minimal data is needed to construct a biDMD model, and the model is easily updated as new data is collected. We demonstrate the efficacy and performance of the approach on a number of representative quantum systems, showing that it also matches experimental results.

97 MATHEMATICS AND COMPUTING↗

Structural dynamics analysis

Dynamic analysis of large space antenna systems must treat the deployment as well as vibration and control of the deployed antenna. Candidate computer programs for deployment dynamics, and issues and needs for future program developments are reviewed. Some results for mast and hoop deployment are also presented. Modeling of complex antenna geometry with conventional finite element methods and with repetitive exact elements is considered. Analytical comparisons with experimental results for a 15 meter hoop/column antenna revealed the importance of accurate structural properties including nonlinear joints. Slackening of cables in this antenna is also a consideration. The technology of designing actively damped structures through analytical optimization is discussed and results are presented.

Housner, J. M.↗

First Use of Synoptic Vector Magnetograms for Global Nonlinear, Force-Free Coronal Magnetic Field Models

Context. The magnetic field permeating the solar atmosphere is generally thought to provide the energy for much of the activity seen in the solar corona, such as flares, coronal mass ejections (CMEs), etc. To overcome the unavailability of coronal magnetic field measurements, photospheric magnetic field vector data can be used to reconstruct the coronal field. Currently, there are several modelling techniques being used to calculate three-dimensional field lines into the solar atmosphere. Aims. For the first time, synoptic maps of a photospheric-vector magnetic field synthesized from the vector spectromagnetograph (VSM) on Synoptic Optical Long-term Investigations of the Sun (SOLIS) are used to model the coronal magnetic field and estimate free magnetic energy in the global scale. The free energy (i.e., the energy in excess of the potential field energy) is one of the main indicators used in space weather forecasts to predict the eruptivity of active regions. Methods. We solve the nonlinear force-free field equations using an optimization principle in spherical geometry. The resulting threedimensional magnetic fields are used to estimate the magnetic free energy content E(sub free) = E(sub nlfff) − E(sub pot), which is the difference of the magnetic energies between the nonpotential field and the potential field in the global solar corona. For comparison, we overlay the extrapolated magnetic field lines with the extreme ultraviolet (EUV) observations by the atmospheric imaging assembly (AIA) on board the Solar Dynamics Observatory (SDO). Results. For a single Carrington rotation 2121, we find that the global nonlinear force-free field (NLFFF) magnetic energy density is 10.3% higher than the potential one. Most of this free energy is located in active regions.

Sun: corona↗

Control of Fractional Diffusion Problems via Dynamic Programming Equations

In this study, we explore the approximation of feedback control of integro-differential equations containing a fractional Laplacian term. To obtain feedback control for the state variable of this nonlocal equation, we use the Hamilton–Jacobi–Bellman equation. It is well known that this approach suffers from the curse of dimensionality, and to mitigate this problem we couple semi-Lagrangian schemes for the discretization of the dynamic programming principle with the use of Shepard approximation. This coupling enables approximation of high-dimensional problems. Numerical convergence toward the solution of the continuous problem is provided together with linear and nonlinear examples. The robustness of the method with respect to disturbances of the system is illustrated by comparisons with an open-loop control approach.

97 MATHEMATICS AND COMPUTING↗

A systematic comparison of machine learning methods for modeling of dynamic processes applied to combustion emission rate modeling

Ten established, data-driven dynamic algorithms are surveyed and a practical guide for understanding these methods generated. Existing Python programming packages for implementing each algorithm are acknowledged, and the model equations necessary for prediction are presented. A case study on a coal-fired power plant’s NO x emission rates is performed, directly comparing each modeling method’s performance on a mutual system. Each model is evaluated by its root mean squared error (RMSE) on out-of-sample future horizon predictions. Optimal hyperparameters are identified using either an exhaustive search or genetic algorithm. The top five model structures of each method are used to recursively predict future NO x emission rates over a 60-step time horizon. The RMSE at each future timestep is determined, and the recursive output prediction trends compared against measurements in time. The GRU neural network is identified as the best candidate for representing the system, demonstrating accurate and stable predictions across the future horizon by all considered models, while satisfactory performance was observed in several of the ARX/NARX formulations. Finally, these efforts have contributed 1) a concise resource of multiple proven dynamic machine learning methods, 2) a practical guide explaining the use of these methods, effectively lowering the “barrier-to-entry” of deploying such models in control systems, 3) a comparison study evaluating each method’s performance on a mutual system, 4) demonstration of accurate multi-timestep emissions modeling suitable for systems-level control, and 5) generalizable results demonstrating the suitability of each method for prediction over a multi-step future horizon to other complex dynamic systems.

42 ENGINEERING↗

DeepONet-Assisted Optimization of Surface Topography for Transition Delay in a Mach 4.5 Boundary Layer

We use deep learning, an ensemble variational technique (EnVar), and direct numerical simulations(DNS) to design an optimal topography for a two-dimensional roughness element that delays the on-set of laminar-turbulent transition in a Mach 4.5 flat-plate boundary layer. Deep operator networks (DeepONets), which have the known ability to learn complex nonlinear operators within dynamical systems, are used for machine learning. For the baseline configuration of a smooth flat plate, the second-mode waves at the DNS inflow cause a quick nonlinear breakdown of the high-speed boundary layer within the computational domain. Results reported in the present study validate the ability of DeepONets to model the transition delay via a given topography of the roughness element. The computing cost to optimize the rough-ness element for minimal skin-friction drag is substantially lowered by the DeepONets-based reduced-order model. In comparison to the baseline method of EnVar optimization based on DNS alone, the DeepONets-based EnVar optimizer is able to delay transition past the outflow boundary of the computational domain while utilizing almost 5–6 times fewer DNS.

Machine Learning↗

Encoding nonlinear and unsteady aerodynamics of limit cycle oscillations using nonlinear sparse Bayesian learning

This article investigates the applicability of a recently proposed, nonlinear sparse Bayesian learning (NSBL) algorithm to identify and estimate the complex aerodynamics of limit cycle oscillations. NSBL provides a semi-analytical framework for determining the data-optimal sparse model nested within a (potentially) over-parameterized model. This is particularly relevant to nonlinear dynamical systems where modelling approaches involve the use of physics-based and data-driven components. In such cases, the data-driven components, where analytical descriptions of the physical processes are not readily available, are often prone to overfitting, meaning that the empirical aspects of these models will often involve the calibration of an unnecessarily large number of parameters. While an overparameterized model may fit the observed data well, such models may be inadequate for making predictions in regimes that are different from those wherein the data were recorded. In view of this, it is desirable to not only calibrate the model parameters, but also identify the optimal compromise between data fit and model complexity. In this article, we exhibit the optimal model discovery for an aeroelastic system wherein the structural dynamics are well-known and described by a differential equation model, coupled with a semi-empirical aerodynamic model for laminar separation flutter, resulting in low-amplitude limit cycle oscillations (LCO). To illustrate the performance of the algorithm, in this article, we use synthetic data and demonstrate the ability of the algorithm to correctly rediscover the optimal model and model parameters, given a known data-generating model. The synthetic data are generated from a forward simulation of a known differential equation model with parameters selected so as to mimic the dynamics observed in wind-tunnel experiments. Subsequently, we demonstrate the performance of the algorithm for model selection using noisy LCO data from wind tunnel experiments. As there is no ground truth available for the experimental data case, we provide a comparison between NSBL and Bayesian model selection to validate the results, and demonstrate the use of NSBL as an efficient alternative to traditional methods.

97 MATHEMATICS AND COMPUTING↗

DeepONet-Assisted Optimization of Surface Topography for Transition Delay in A Mach 4.5 Boundary Layer

We use deep learning, an ensemble variationaltechnique (EnVar), and direct numerical simulations(DNS) to design an optimal topography for a two-dimensional roughness element that delays the on-set of laminar-turbulent transition in a Mach 4.5 flat-plate boundary layer. Deep operator networks (Deep-ONets), which have the known ability to learn com-plex nonlinear operators within dynamical systems,are used for machine learning. For the baseline config-uration of a smooth flat plate, the second-mode wavesat the DNS inflow cause a quick nonlinear breakdownof the high-speed boundary layer within the computa-tional domain. Results reported in the present studyvalidate the ability of DeepONets to model the tran-sition delay via a given topography of the roughnesselement. The computing cost to optimize the rough-ness element for minimal skin-friction drag is substan-tially lowered by the DeepONets-based reduced-ordermodel. In comparison to the baseline method of EnVaroptimization based on DNS alone, the DeepONets-based EnVar optimizer is able to delay transition pastthe outflow boundary of the computational domainwhile utilizing almost 5–6 times fewer DNS.

Machine Learning↗

Enabling in-time Prognostics with Surrogate Modeling through Physics-enhanced Dynamic Mode Decomposition Method

Computational models provide essential quantitative tools for assessing and predicting the health and performance of physical systems. However, high-fidelity models are rarely used in real-time operations or large optimization loops, due to their time-intensive nature. A common approach to improving computational efficiency of prognosis is to employ surrogate models. Such models can significantly decrease computation time for some accuracy loss. In this context, use of Dynamic Mode Decomposition (DMD) is proposed to generate surrogate models for lithium-ion (Li-ion) battery discharge. DMD has been suggested and used successfully in the area of fluid dynamics for over a decade, but it has not been applied to the PHM domain, where far-ahead prediction of nonlinear behavior is crucial to propagate faults or predict Remaining Useful Life (RUL). For Li-ion battery health management, the standard application of DMD using only the observable quantities of interest was unable to capture the nonlinear discharge of batteries exhibited in lab testing. The Koopman theory, however, provides a mechanism to tradeoff low dimensional nonlinear models with high-dimensional linear ones in a DMD framework, by augmenting nonlinear state variables into the system representation. In this way, DMD allows for configurable simulation accuracy dependent on the dimensionality of the Koopman operator. For battery health management, we augmented the observable variables with the hidden states of a higher-fidelity physics model to build the DMD surrogate. In comparison to a high-fidelity model, the surrogate improved computational efficiency with only a minimal loss of accuracy, and enabled long-term prognostics horizons. A generalized method for this was implemented in the prog models python package.

prognostics and health management↗

Parallel processors and nonlinear structural dynamics algorithms and software

Techniques are discussed for the implementation and improvement of vectorization and concurrency in nonlinear explicit structural finite element codes. In explicit integration methods, the computation of the element internal force vector consumes the bulk of the computer time. The program can be efficiently vectorized by subdividing the elements into blocks and executing all computations in vector mode. The structuring of elements into blocks also provides a convenient way to implement concurrency by creating tasks which can be assigned to available processors for evaluation. The techniques were implemented in a 3-D nonlinear program with one-point quadrature shell elements. Concurrency and vectorization were first implemented in a single time step version of the program. Techniques were developed to minimize processor idle time and to select the optimal vector length. A comparison of run times between the program executed in scalar, serial mode and the fully vectorized code executed concurrently using eight processors shows speed-ups of over 25. Conjugate gradient methods for solving nonlinear algebraic equations are also readily adapted to a parallel environment. A new technique for improving convergence properties of conjugate gradients in nonlinear problems is developed in conjunction with other techniques such as diagonal scaling. A significant reduction in the number of iterations required for convergence is shown for a statically loaded rigid bar suspended by three equally spaced springs.

Belytschko, Ted↗

Application of the Two-Step Filter to Process Ranging Measurements for Relative Navigation in an Elliptical Orbit

This estimator breaks a nonlinear estimation problem into a set of over determined 'first step' states which are linear in the observations and 'second step' states which are ultimately the states of interest. Linear estimation methods are applied to filter the observations and produce the optimal first step state estimate. The 'second step' states are obtained through iterative nonlinear parameter estimation considering the first step states as observations. It has been shown that this process exactly minimizes the least squares cost function for static problems and provides a better solution than the iterated extended Kalman filter (EKF) for dynamic problems. The two step filter is applied in this paper to process range and range rate measurements between the two spacecraft. Details of the application of the two step estimator to this problem will be given, highlighting the use of a test for ill-conditioned covariance estimates that can result from the first order covariance propagation. A comparison will be made between the performance of the two step filter and the IEKF.

Garrison, James L.↗

Stoichiometrically-informed symbolic regression for extracting chemical reaction mechanisms from data

A data-driven computational method is introduced to extract chemical reaction mechanisms from time series chemical concentration data. It is realized through the use of dynamic symbolic regression in which a sparse analytical form for a dynamical system is discoverable from the underlying data. We specifically develop the stoichiometrically-informed symbolic regression (SISR) method to address a standing challenge in complex chemical reaction networks: given a time-series dataset of concentrations of several components, what is the mechanism and the associated rate constants? SISR finds the optimal mechanism, kinetic equations and rate constants by combining differential optimization with a genetic optimization approach that searches a symbolic space of possible reaction mechanisms. Use of SISR in several paradigmatic examples spanning linear and nonlinear reaction schemes results in excellent agreement between true and predicted mechanisms, including when the method is applied to noisy data. The advantages of a stoichiometrically-informed approach such as SISR to address reaction discovery is illustrated through comparison with the use of generic state-of-the-art data-driven approaches.

36 MATERIALS SCIENCE↗

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

Closed-Loop Wind Turbine Controllers for Active Wake Mixing Strategies

Wind turbine active wake mixing (AWM) is an exciting new field of research where dynamic actuation, usually on the blade pitch angles, is used to increase wind farm-wide power production. From a controls perspective, the current state-of-the-art AWM strategies are very simple: a dynamic, usually periodic, reference signal is prescribed to actuators in an open-loop (OL) fashion. The actuation is then presumed to have a certain desired effect on the system, i.e., the wind turbine and the flow it affects. However, this system is highly nonlinear and experiences disturbances in the form of wind variations that are not known a priori. As a result, the OL approach might not yield optimal results. In this article, a novel approach is presented, which closes the loop on AWM controllers. A feedback loop is implemented, which uses measurements of the individual blade bending moments that are widely available on modern wind turbines to determine the individual blade pitch angles. A proof of concept of this implementation is presented in this article, and a thorough comparison with the OL method is executed using high-fidelity flow simulations. These simulations show that the novel closed-loop controller does not substantially increase wake mixing but achieves similar performance as the OL controller while reducing fatigue loads on the controlled turbine.

17 WIND ENERGY↗

Nonlinear zero-sum differential game analysis by singular perturbation methods

A class of nonlinear, zero-sum differential games, exhibiting time-scale separation properties, can be analyzed by singular-perturbation techniques. The merits of such an analysis, leading to an approximate game solution, as well as the 'well-posedness' of the formulation, are discussed. This approach is shown to be attractive for investigating pursuit-evasion problems; the original multidimensional differential game is decomposed to a 'simple pursuit' (free-stream) game and two independent (boundary-layer) optimal-control problems. Using multiple time-scale boundary-layer models results in a pair of uniformly valid zero-order composite feedback strategies. The dependence of suboptimal strategies on relative geometry and own-state measurements is demonstrated by a three dimensional, constant-speed example. For game analysis with realistic vehicle dynamics, the technique of forced singular perturbations and a variable modeling approach is proposed. Accuracy of the analysis is evaluated by comparison with the numerical solution of a time-optimal, variable-speed 'game of two cars' in the horizontal plane.

Sinar, J.↗