Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “nonlinear problems”

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 811 records · Page 45

Linear and nonlinear dynamic analysis by boundary element method

An advanced implementation of the direct boundary element method (BEM) applicable to free-vibration, periodic (steady-state) vibration and linear and nonlinear transient dynamic problems involving two and three-dimensional isotropic solids of arbitrary shape is presented. Interior, exterior, and half-space problems can all be solved by the present formulation. For the free-vibration analysis, a new real variable BEM formulation is presented which solves the free-vibration problem in the form of algebraic equations (formed from the static kernels) and needs only surface discretization. In the area of time-domain transient analysis, the BEM is well suited because it gives an implicit formulation. Although the integral formulations are elegant, because of the complexity of the formulation it has never been implemented in exact form. In the present work, linear and nonlinear time domain transient analysis for three-dimensional solids has been implemented in a general and complete manner. The formulation and implementation of the nonlinear, transient, dynamic analysis presented here is the first ever in the field of boundary element analysis. Almost all the existing formulation of BEM in dynamics use the constant variation of the variables in space and time which is very unrealistic for engineering problems and, in some cases, it leads to unacceptably inaccurate results. In the present work, linear and quadratic isoparametric boundary elements are used for discretization of geometry and functional variations in space. In addition, higher order variations in time are used. These methods of analysis are applicable to piecewise-homogeneous materials, such that not only problems of the layered media and the soil-structure interaction can be analyzed but also a large problem can be solved by the usual sub-structuring technique. The analyses have been incorporated in a versatile, general-purpose computer program. Some numerical problems are solved and, through comparisons with available analytical and numerical results, the stability and high accuracy of these dynamic analysis techniques are established.

Ahmad, Shahid↗

Time-lapse seismic inversion for CO 2 saturation with SeisCO2Net: An application to Frio-II site

Seismic monitoring of geological CO 2 storage (GCS) involves highly nonlinear seismic inversion and petrophysical inversion, making it challenging to estimate CO 2 volume efficiently and detect possible early CO 2 leakages. Deep learning (DL) using convolutional neural networks (CNNs) has shown promise in solving highly nonlinear seismic inversion problems. However, direct estimation of CO 2 plume extent/saturation from time-lapse seismic gathers using DL is still underexplored, with no reported field applications to date. The investigation of field data is primarily hindered by scarcity of field data for neural network training. Other obstacles include highly nonlinear seismic-petrophysics inverse relationship, and presence of noise in field seismic data. We introduce SeisCO2Net, a deep CNN that predicts CO 2 saturation maps directly from time-lapse full waveform shot gathers. For training, we use site-specific geological information, fluid flow physics, rock physics, and seismic modeling to generate synthetic datasets that closely resemble the CO 2 storage site. Synthetic tests show promising results, inspiring us to apply SeisCO2Net's trained weights on field data collected at Frio-II GCS site by leveraging transfer learning principles. As reference, we compare SeisCO2Net's predicted CO 2 saturation maps with results obtained from physics-based inversion. Our analyses show both methods display similar CO 2 plume shapes, reasonable CO 2 plume characteristics, and comparable saturation values. Our results suggest pre-training CNNs on physics-informed synthetic datasets and then applying the learned weights to field data is a viable approach to estimating field CO 2 saturation. This method effectively addresses the scarcity of field training data, thus encouraging the feasibility of long-term GCS monitoring.

58 GEOSCIENCES↗

Layer-Parallel Training of Deep Residual Neural Networks

Residual neural networks (ResNets) are a promising class of deep neural networks that have shown excellent performance for a number of learning tasks, e.g., image classification and recognition. Mathematically, ResNet architectures can be interpreted as forward Euler discretizations of a nonlinear initial value problem whose time-dependent control variables represent the weights of the neural network. Hence, training a ResNet can be cast as an optimal control problem of the associated dynamical system. For similar time-dependent optimal control problems arising in engineering applications, parallel-in-time methods have shown notable improvements in scalability. This paper demonstrates the use of those techniques for efficient and effective training of ResNets. The proposed algorithms replace the classical (sequential) forward and backward propagation through the network layers with a parallel nonlinear multigrid iteration applied to the layer domain. This adds a new dimension of parallelism across layers that is attractive when training very deep networks. From this basic idea, we derive multiple layer-parallel methods. The most efficient version employs a simultaneous optimization approach where updates to the network parameters are based on inexact gradient information in order to speed up the training process. Finally, using numerical examples from supervised classification, we demonstrate that the new approach achieves a training performance similar to that of traditional methods, but enables layer-parallelism and thus provides speedup over layer-serial methods through greater concurrency.

97 MATHEMATICS AND COMPUTING↗

Aeroelastic Analysis of Highly Flexible Wings with Linearized Frequency-Domain Aerodynamics

Flutter analysis of configurations with geometric structural nonlinearities typically is done with time-domain analysis. The results from this process are computationally expensive and can yield cumbersome results that may be difficult to manage/interpret. Compared to time-domain methods, frequency-domain flutter analysis can provide additional insight into the characteristics of a flutter stability problem. By linearizing the aeroelastic problem about the nonlinear equilibrium state, this work applies frequency-domain aeroelastic analysis to the Pazy wing, the subject of the Large Deformation Working Group in the Aeroelastic Prediction Workshop. Generalized aerodynamic forces (GAFs) are computed with both a doublet-lattice method and a computational fluid dynamics solver at a range of reduced frequencies as well as a range of dynamic pressures to account for the dependence of the mode shapes on the nonlinear equilibrium state. These GAFs are used in a p-k flutter solver, which is modified to handle the dependence of the stiffness matrix and GAFs on the dynamic pressure.

Bret K Stanford↗

Dynamics of Nuclear Regions of Galaxies

Current research carried out with the help of the ASEE-NASA Summer Faculty Program, at NASA-Ames, is concentrated on the dynamics of nuclear regions of galaxies. From a dynamical point of view a galaxy is a collection of around 10(sup 11) stars like our Sun, each of which moves in the summed gravitational field of all the remaining stars. Thus galaxy dynamics becomes a self-consistent n-body problem with forces given by Newtonian gravitation. Strong nonlinearity in the gravitational force and the inherent nonlinearity of self-consistent problems both argue for a numerical approach. The technique of numerical experiments consis of constructing an environment in the computer that is as close as possible to the physical conditions in a real galaxy and then carrying out experiments much like laboratory experiments in physics or engineering, in this environment. Computationally, an experiment is an initial value problem, and a good deal of thought and effort goes into the design of the starting conditions that serve as initial values. Experiments are run at Ames because all the 'equipment' is in place-the programs, the necessary computational power, and good facilities for post-run analysis. Our goal for this research program is to study the nuclear regions in detail and this means replacing most of the galaxy by a suitable boundary condition to allow the full capability of numerical experiments to be brought to bear on a small region perhaps 1/1000 of the linear dimensions of an entire galaxy. This is an extremely delicate numerical problem, one in which some small feature overlook, can easily lead to a collapse or blow-up of the entire system. All particles attract each other in gravitational problems, and the 1/r(sup 2) force is: (1) nonlinear; (2) strong at short range; (3) long-range, and (4) unscreened at any distance.

Miller, Richard H.↗

Shortest path network interdiction with asymmetric uncertainty

Abstract This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using a path of shortest length, and an interdictor, who maximizes the length of the evader's shortest path by interdicting arcs on the network. It is usually assumed that the parameters defining the network are known exactly by both players. We consider the situation where the evader assumes the nominal parameter values while the interdictor uses robust optimization techniques to account for parameter uncertainty or sensor degradation. We formulate this problem as a nonlinear mixed‐integer semi‐infinite bilevel program and show that it can be converted into a mixed‐integer linear program with a second order cone constraint. We use random geometric networks and transportation networks to perform computational studies and demonstrate the unique decision strategies that our variant produces. Solving the shortest path interdiction problem with asymmetric uncertainty protects the interdictor from investing in a strategy that hinges on key interdictions performing as promised. It also provides an alternate strategy that mitigates the risk of these worst‐case possibilities.

Punla‐Green, She'ifa Z.↗

Development of the NASA/FLAGRO computer program for analysis of airframe structures

The NASA/FLAGRO (NASGRO) computer program was developed for fracture control analysis of space hardware and is currently the standard computer code in NASA, the U.S. Air Force, and the European Agency (ESA) for this purpose. The significant attributes of the NASGRO program are the numerous crack case solutions, the large materials file, the improved growth rate equation based on crack closure theory, and the user-friendly promptive input features. In support of the National Aging Aircraft Research Program (NAARP); NASGRO is being further developed to provide advanced state-of-the-art capability for damage tolerance and crack growth analysis of aircraft structural problems, including mechanical systems and engines. The project currently involves a cooperative development effort by NASA, FAA, and ESA. The primary tasks underway are the incorporation of advanced methodology for crack growth rate retardation resulting from spectrum loading and improved analysis for determining crack instability. Also, the current weight function solutions in NASGRO or nonlinear stress gradient problems are being extended to more crack cases, and the 2-d boundary integral routine for stress analysis and stress-intensity factor solutions is being extended to 3-d problems. Lastly, effort is underway to enhance the program to operate on personal computers and work stations in a Windows environment. Because of the increasing and already wide usage of NASGRO, the code offers an excellent mechanism for technology transfer for new fatigue and fracture mechanics capabilities developed within NAARP.

Forman, R. G.↗

Sensor/actuator placement for flexible space structures

A new approach for the placement of sensors and actuators in the active control of flexible space structures is developed. The approach converts the discrete nature of the sensor and actuator positioning problem to a nonlinear programming optimization through approximation of the control forces and output measurements by spatially continuous functions. The locations of the sensors and actuators are optimized in order to move the transmission zeros of the system farther to the left of the imaginary axis. The criterion for sensor/actuator placement can be quite useful for optimal regulation and tracking problems, as well as for low-authority controller designs. Two performance metrics are considered for the optimization and are applied to the sensor/actuator positioning of a large-order flexible space structure.

Maghami, P. G.↗

Deep Learning Explicit Differentiable Predictive Control Laws for Buildings

We present a differentiable predictive control (DPC) methodology for learning constrained control laws for unknown nonlinear systems. DPC poses an approximate solution to multiparametric programming problems emerging from explicit nonlinear model predictive control (MPC). Contrary to approximate MPC, DPC does not require supervision by an expert controller. Instead, a system dynamics model is learned from a small dataset of recorded observations of the perturbed system's dynamics and the control law is optimized offline by interaction with the learned system model. The DPC method is based on two sequential steps, i) system identification using a constrained neural state-space model, and ii) optimization of an explicit control law parametrized by another neural network in closed-loop simulation with the identified neural state-space model. The combination of a differentiable closed-loop system and penalty methods for constraint handling of system outputs and inputs allows us to optimize the control law's parameters directly by backpropagating economic MPC loss through the learned system model. By incorporating domain knowledge and leveraging established techniques from optimal control, our method leverages deep neural networks as nonlinear function approximators for system identification and control while avoiding concomitant costs of intractably large datasets, and computationally expensive over-parametrized models. The scalability, data efficiency, and constrained optimal control capability of the proposed DPC method are demonstrated in simulation using a multi-zone building emulator.

Drgona, Jan↗

Effects of certain control-system nonlinearities on stability and pointing of an attached double-gimbal experiment package in presence of random crew-motion disturbances

The effects of two types of control-system nonlinearities, sensor deadband and actuator breakout torque, on the pointing capability of a Apollo Telescope Mount (ATM) double-gimbal experiment isolation and control system are investigated. A composite structural model of a flexible experiment package connected through frictionless double gimbals to a flexible carrier vehicle is used for this investigation. Contributions of the primary carrier control system to experiment pointing are neglected. Pointing errors onboard the experiment package due to random crew-motion input into the carrier vehicle are computed. A stability investigation is performed to verify control-system stability with nominal nonlinearities and gains. Indications are that there is no stability problem due to the nonlinearities. A nonlinearity sensitivity study is carried out to determine the effects on pointing accuracy. Its results indicate that nominal ATM control system nonlinearities limit the pointing accuracy to approximately 0.4 arc second in the presence of crew motion. Methods of reducing the error to less than 0.1 arc second are discussed.

Shaughnessy, J. D.↗

Operation of Natural Gas Pipeline Networks With Storage Under Transient Flow Conditions

Here, we formulate a nonlinear optimal control problem for intraday operation of a natural gas pipeline network that includes storage reservoirs. The dynamics of compressible gas flow through pipes, compressors, reservoirs, and wells are considered. In particular, a reservoir is modeled as a rigid, hollow container that stores gas under isothermal conditions and uniform density, and a well is modeled as a vertical pipe. For each pipe, flow dynamics are described by a coupled partial differential equation (PDE) system in density and mass flux variables, with momentum dissipation modeled using the Darcy–Wiesbach friction approximation. Compressors are modeled as scaling up the pressure of gas between the inlet and outlet. The governing equations for all network components are spatially discretized and assembled into a nonlinear differential-algebraic equation (DAE) system, which synthesizes above-ground pipeline and subsurface reservoir dynamics into a single reduced-order model. We seek to maximize an objective function that quantifies economic profit and network efficiency subject to the flow equations and inequalities that represent operating limitations. The problem is solved using a primal–dual interior point solver, and the solutions are validated in computational experiments and simulations on several pipeline test networks to demonstrate the effectiveness of the proposed methodology.

03 NATURAL GAS↗

Nonlinear system approximations

The approximation of a nonlinear system by a feedback linearizable system instead of a linear system is considered. Two approaches presently exist in the literature. One involves the concept of involutivity to a certain order, and the other considers a canonical expansion and pure feedback approximation. The relationship between these two methods is shown. This provides insight into lower-order invariants in the equivalence problem for two nonlinear systems. The output time responses for a nonlinear system and its feedback linearizable approximation are outlined.

Goldthwait, Richard G.↗

KETCHUP: Parameterizing of large-scale kinetic models using multiple datasets with different reference states

Large-scale kinetic models provide the computational means to dynamically link metabolic reaction fluxes to metabolite concentrations and enzyme levels while also conforming to substrate level regulation. However, the development of broadly applicable frameworks for efficiently and robustly parameterizing models remains a challenge. Challenges arise due to both the heterogeneity, paucity, and difficulty in obtaining flux and/or concentration data but also due to the computational difficulties of the underlying parameter identification problem. Both the computational demands for parameterization, degeneracy of obtained parameter solutions and interpretability of results has so far limited widespread adoption of large-scale kinetic models despite their potential. Herein, we introduce the Kinetic Estimation Tool Capturing Heterogeneous Datasets Using Pyomo (KETCHUP), a flexible parameter estimation tool that leverages a primal-dual interior-point algorithm to solve a nonlinear programming (NLP) problem that identifies a set of parameters capable of recapitulating the (non)steady-state fluxes and concentrations in wild-type and perturbed metabolic networks. KETCHUP is benchmarked against previously parameterized large-scale kinetic models demonstrating an at least an order of magnitude faster convergence than the tool K-FIT while at the same time attaining better data fits. Finally, this versatile toolbox accepts different kinetic descriptions, metabolic fluxes, enzyme levels and metabolite concentrations, under either steady-state or instationary conditions to enable robust kinetic model construction and parameterization. KETCHUP supports the SBML format and can be accessed at https://github.com/maranasgroup/KETCHUP.

59 BASIC BIOLOGICAL SCIENCES↗

Pfaffian systems and feedback linearization/obstructions

The concept of Cartan-Vessiot filtered Lie algebra/module is defined in terms of previous feedback linearizations constructed through canonical forms of Pfaffian systems associated with nonlinear systems. Nonlinearization/Cartan-Vessiot algebras are regarded as deformations of linear ones. It is shown how certain problems of interest in nonlinear system theory translate over to algebraic problems involving this sort of algebraic structure.

Hermann, R.↗

Supercomputer optimizations for stochastic optimal control applications

Supercomputer optimizations for a computational method of solving stochastic, multibody, dynamic programming problems are presented. The computational method is valid for a general class of optimal control problems that are nonlinear, multibody dynamical systems, perturbed by general Markov noise in continuous time, i.e., nonsmooth Gaussian as well as jump Poisson random white noise. Optimization techniques for vector multiprocessors or vectorizing supercomputers include advanced data structures, loop restructuring, loop collapsing, blocking, and compiler directives. These advanced computing techniques and superconducting hardware help alleviate Bellman's curse of dimensionality in dynamic programming computations, by permitting the solution of large multibody problems. Possible applications include lumped flight dynamics models for uncertain environments, such as large scale and background random aerospace fluctuations.

Chung, Siu-Leung↗

Optimized System Identification

In system identification, one usually cares most about finding a model whose outputs are as close as possible to the true system outputs when the same input is applied to both. However, most system identification algorithms do not minimize this output error. Often they minimize model equation error instead, as in typical least-squares fits using a finite-difference model, and it is seen here that this distinction is significant. Here, we develop a set of system identification algorithms that minimize output error for multi-input/multi-output and multi-input/single-output systems. This is done with sequential quadratic programming iterations on the nonlinear least-squares problems, with an eigendecomposition to handle indefinite second partials. This optimization minimizes a nonlinear function of many variables, and hence can converge to local minima. To handle this problem, we start the iterations from the OKID (Observer/Kalman Identification) algorithm result. Not only has OKID proved very effective in practice, it minimizes an output error of an observer which has the property that as the data set gets large, it converges to minimizing the criterion of interest here. Hence, it is a particularly good starting point for the nonlinear iterations here. Examples show that the methods developed here eliminate the bias that is often observed using any system identification methods of either over-estimating or under-estimating the damping of vibration modes in lightly damped structures.

Juang, Jer-Nan↗

Preconditioning for Hyper-reduction in Reduced Order Models

Many projection-based reduced order models (pROM) that utilize the governing equation and data to accelerate physical simulations can be applied to nonlinear dynamical systems. To avoid full order model (FOM) scale update for each time step, hyperreduction techniques are developed to sample high dimensional nonlinear terms. Our study aims to investigate if preconditioning the least-squares problem used for the nonlinear approximation can improve the robustness of the condition number of the problem while achieving high accuracy. In our study, we use the row-normalization matrix motivated by the Christoffel function as the preconditioner and solve the corresponding weighted least-squares problem. Numerical results for Lagrangian hydrodynamics examples are analyzed to explore how the preconditioner works compared to existing hyper-reduction techniques.

97 MATHEMATICS AND COMPUTING↗