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 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Bifurcations and sensitivity in parametric nonlinear programming

The parametric nonlinear programming problem is that of determining the behavior of solution(s) as a parameter or vector of parameters alpha belonging to R(sup r) varies over a region of interest for the problem: Minimize over x the set f(x, alpha):h(x, alpha) = 0, g(x, alpha) is greater than or equal to 0, where f:R(sup (n+r)) approaches R, h:R(sup (n+r)) approaches R(sup q) and g:R(sup (n+r)) approaches R(sup p) are assumed to be at least twice continuously differentiable. Some of these parameters may be fixed but not known precisely and others may be varied to enhance the performance of the system. In both cases a fundamentally important problem in the investigation of global sensitivity of the system is to determine the stability boundaries of the regions in parameter space which define regions of qualitatively similar solutions. The objective is to explain how numerical continuation and bifurcation techniques can be used to investigate the parametric nonlinear programming problem in a global sense. Thus, first the problem is converted to a closed system of parameterized nonlinear equations whose solution set contains all local minimizers of the original problem. This system, which will be represented as F(z,alpha) = O, will include all Karush-Kuhn-Tucker and Fritz John points, both feasible and infeasible solutions, and relative minima, maxima, and saddle points of the problem. The local existence and uniqueness of a solution path (z(alpha), alpha) of this system as well as the solution type persist as long as a singularity in the Jacobian D(sub z)F(z,alpha) is not encountered. Thus the nonsingularity of this Jacobian is characterized in terms of conditions on the problem itself. Then, a class of efficient predictor-corrector continuation procedures for tracing solution paths of the system F(z,alpha) = O which are tailored specifically to the parametric programming problem are described. Finally, these procedures and the obtained information are illustrated within the context of design optimization.

Lundberg, Bruce N.↗
DOE OSTI2022

Modeling design and control problems involving neural network surrogates

Here, we consider nonlinear optimization problems that involve surrogate models represented by neural networks. We demonstrate first how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence, and then characterize stationarity of such models. We then present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation: as a mixed-integer optimization problem and as a mathematical program with complementarity constraints. For the latter formulation we prove that stationarity at a point for this problem corresponds to stationarity of the embedded formulation. Each of these formulations may be solved with state-of-the-art optimization methods, and we show how to obtain good initial feasible solutions for these methods. We compare our formulations on three practical applications arising in the design and control of combustion engines, in the generation of adversarial attacks on classifier networks, and in the determination of optimal flows in an oil well network.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1995

Design of High-Accuracy Multiple Flyby Trajectories Using Constrained Optimization

The trajectory optimization technique described in this paper provides several distinct advantages over previous formulations. First, fully numerically integrated trajectory modeling is used. That is, no approximations to the trajectory are made and the inclusion of any level of complicated force models desired is allowed. Second, only trajectory propagation is used so there is no requirement for optimization. This is accomplished by the novel method of splitting the trajectory into independent legs, which are then subjected to constrained optimization. Third, each of the trajectory legs may be specified by any convenient set of parameters particularly useful for that leg. Any of these parameters may then be subject to constraints. Fourth, the nonlinear optimization problem is solved by solving a sequence of linear problems which converges to the optimal nonlinear solution. Fifth, the robustness of this formulation requires little or no user interaction with the optimization once a feasible problem has been posed.

flyby↗
DOE OSTI2024

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1994

Multilevel algorithms for nonlinear optimization

Multidisciplinary design optimization (MDO) gives rise to nonlinear optimization problems characterized by a large number of constraints that naturally occur in blocks. We propose a class of multilevel optimization methods motivated by the structure and number of constraints and by the expense of the derivative computations for MDO. The algorithms are an extension to the nonlinear programming problem of the successful class of local Brown-Brent algorithms for nonlinear equations. Our extensions allow the user to partition constraints into arbitrary blocks to fit the application, and they separately process each block and the objective function, restricted to certain subspaces. The methods use trust regions as a globalization strategy, and they have been shown to be globally convergent under reasonable assumptions. The multilevel algorithms can be applied to all classes of MDO formulations. Multilevel algorithms for solving nonlinear systems of equations are a special case of the multilevel optimization methods. In this case, they can be viewed as a trust-region globalization of the Brown-Brent class.

Alexandrov, Natalia↗
DOE OSTI2021

STreCH

Symbolic regression software that formulates a symbolic regression problem as a mixed-integer nonlinear optimization problem, and solves it using a sequential tree construction heuristic

Leyffer, Sven↗
NASA NTRS1983

Design for prevention of acoustic fatigue

It is pointed out that new noise prediction methods and acoustic life estimation methods have matured to the point where they can be combined into a unified engineering procedure. "Life derivatives" can be extracted from parametric charts to furnish design data for preventing acoustic fatigue. The acoustic fatigue life is shown to be sensitive to the damping ratio through the use of life derivatives. The localized nature of propeller noise can be quantified with an "isodecibel" contour diagram.Even though the peak sound pressure level may be high, the directional derivatives show the noise decay rates with distance. Acoustic fatigue design is discussed from the overall design methodology and is shown to be similar to other structural design problems. While nonlinearities present a formidable design engineering problem, they are manageable by proven semi-empirical techniques. For new design problems, it is imperative to determine whether the data base completely spans the design variables.

Smith, H. W.↗
NASA NTRS1993

Space Shuttle Main Engine performance analysis

For a number of years, NASA has relied primarily upon periodically updated versions of Rocketdyne's power balance model (PBM) to provide space shuttle main engine (SSME) steady-state performance prediction. A recent computational study indicated that PBM predictions do not satisfy fundamental energy conservation principles. More recently, SSME test results provided by the Technology Test Bed (TTB) program have indicated significant discrepancies between PBM flow and temperature predictions and TTB observations. Results of these investigations have diminished confidence in the predictions provided by PBM, and motivated the development of new computational tools for supporting SSME performance analysis. A multivariate least squares regression algorithm was developed and implemented during this effort in order to efficiently characterize TTB data. This procedure, called the 'gains model,' was used to approximate the variation of SSME performance parameters such as flow rate, pressure, temperature, speed, and assorted hardware characteristics in terms of six assumed independent influences. These six influences were engine power level, mixture ratio, fuel inlet pressure and temperature, and oxidizer inlet pressure and temperature. A BFGS optimization algorithm provided the base procedure for determining regression coefficients for both linear and full quadratic approximations of parameter variation. Statistical information relative to data deviation from regression derived relations was also computed. A new strategy for integrating test data with theoretical performance prediction was also investigated. The current integration procedure employed by PBM treats test data as pristine and adjusts hardware characteristics in a heuristic manner to achieve engine balance. Within PBM, this integration procedure is called 'data reduction.' By contrast, the new data integration procedure, termed 'reconciliation,' uses mathematical optimization techniques, and requires both measurement and balance uncertainty estimates. The reconciler attempts to select operational parameters that minimize the difference between theoretical prediction and observation. Selected values are further constrained to fall within measurement uncertainty limits and to satisfy fundamental physical relations (mass conservation, energy conservation, pressure drop relations, etc.) within uncertainty estimates for all SSME subsystems. The parameter selection problem described above is a traditional nonlinear programming problem. The reconciler employs a mixed penalty method to determine optimum values of SSME operating parameters associated with this problem formulation.

Santi, L. Michael↗
NASA NTRS1995

Time accurate application of the MacCormack 2-4 scheme on massively parallel computers

Many recent computational efforts in turbulence and acoustics research have used higher order numerical algorithms. One popular method has been the explicit MacCormack 2-4 scheme. The MacCormack 2-4 scheme is second order accurate in time and fourth order accurate in space, and is stable for CFL's below 2/3. Current research has shown that the method can give accurate results but does exhibit significant Gibbs phenomena at sharp discontinuities. The impact of adding Jameson type second, third, and fourth order artificial viscosity was examined here. Category 2 problems, the nonlinear traveling wave and the Riemann problem, were computed using a CFL number of 0.25. This research has found that dispersion errors can be significantly reduced or nearly eliminated by using a combination of second and third order terms in the damping. Use of second and fourth order terms reduced the magnitude of dispersion errors but not as effectively as the second and third order combination. The program was coded using Thinking Machine's CM Fortran, a variant of Fortran 90/High Performance Fortran, and was executed on a 2K CM-200. Simple extrapolation boundary conditions were used for both problems.

Hudson, Dale A.↗
DOE OSTI2023

Linearization errors in discrete goal-oriented error estimation

This paper is concerned with goal-oriented a posteriori error estimation for nonlinear functionals in the context of nonlinear variational problems solved with continuous Galerkin finite element discretizations. A two-level, or discrete, adjoint-based approach for error estimation is considered. The traditional method to derive an error estimate in this context requires linearizing both the nonlinear variational form and the nonlinear functional of interest which introduces linearization errors into the error estimate. In this paper, we investigate these linearization errors. In particular, we develop a novel discrete goal-oriented error estimate that accounts for traditionally neglected nonlinear terms at the expense of greater computational cost. We demonstrate how this error estimate can be used to drive mesh adaptivity. Here, we show that accounting for linearization errors in the error estimate can improve its effectivity for several nonlinear model problems and quantities of interest. We also demonstrate that an adaptive strategy based on the newly proposed estimate can lead to more accurate approximations of the nonlinear functional with fewer degrees of freedom when compared to uniform refinement and traditional adjoint-based approaches.

42 ENGINEERING↗
NASA NTRS1987

Dynamic optimization problems with bounded terminal conditions

Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm (SGRA) via a simple augmentation of the unknown parameter vector pi. Three example problems with bounded terminal conditions are solved to verify this technique.

Lee, A. Y.↗
NASA NTRS1972

Application of Contraction Mappings to the Control of Nonlinear Systems

The theoretical and applied aspects of successive approximation techniques are considered for the determination of controls for nonlinear dynamical systems. Particular emphasis is placed upon the methods of contraction mappings and modified contraction mappings. It is shown that application of the Pontryagin principle to the optimal nonlinear regulator problem results in necessary conditions for optimality in the form of a two point boundary value problem (TPBVP). The TPBVP is represented by an operator equation and functional analytic results on the iterative solution of operator equations are applied. The general convergence theorems are translated and applied to those operators arising from the optimal regulation of nonlinear systems. It is shown that simply structured matrices and similarity transformations may be used to facilitate the calculation of the matrix Green functions and the evaluation of the convergence criteria. A controllability theory based on the integral representation of TPBVP's, the implicit function theorem, and contraction mappings is developed for nonlinear dynamical systems. Contraction mappings are theoretically and practically applied to a nonlinear control problem with bounded input control and the Lipschitz norm is used to prove convergence for the nondifferentiable operator. A dynamic model representing community drug usage is developed and the contraction mappings method is used to study the optimal regulation of the nonlinear system.

Killingsworth, W. R., Jr.↗
DOE OSTI2022

Non-intrusive reduced order modeling of natural convection in porous media using convolutional autoencoders: Comparison with linear subspace techniques

Natural convection in porous media is a highly nonlinear multiphysical problem relevant to many engineering applications (e.g., the process of CO 2 sequestration). Here, we extend and present a non-intrusive reduced order model of natural convection in porous media employing deep convolutional autoencoders for the compression and reconstruction and either radial basis function (RBF) interpolation or artificial neural networks (ANNs) for mapping parameters of partial differential equations (PDEs) on the corresponding nonlinear manifolds. To benchmark our approach, we also describe linear compression and reconstruction processes relying on proper orthogonal decomposition (POD) and ANNs. Further, we present comprehensive comparisons among different models through three benchmark problems. The reduced order models, linear and nonlinear approaches, are much faster than the finite element model, obtaining a maximum speed-up of 7 × 10 6 because our framework is not bound by the Courant–Friedrichs–Lewy condition; hence, it could deliver quantities of interest at any given time contrary to the finite element model. Our model’s accuracy still lies within a relative error of 7% in the worst-case scenario. We illustrate that, in specific settings, the nonlinear approach outperforms its linear counterpart and vice versa. We hypothesize that a visual comparison between principal component analysis (PCA) and t-Distributed Stochastic Neighbor Embedding (t-SNE) could indicate which method will perform better prior to employing any specific compression strategy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An improved framework for the dynamic likelihood filtering approach to data assimilation

Here, we propose improvements to the Dynamic Likelihood Filter (DLF), a Bayesian data assimilation filtering approach, specifically tailored to wave problems. The DLF approach was developed to address the common challenge in the application of data assimilation to hyperbolic problems in the geosciences and in engineering, where observation systems are sparse in space and time. When these observations have low uncertainties, as compared to model uncertainties, the DLF exploits the inherent nature of information and uncertainties to propagate along characteristics to produce estimates that are phase aware as well as amplitude aware, as would be the case in the traditional data assimilation approach. Along characteristics, the stochastic partial differential equations underlying the linear or nonlinear stochastic dynamics are differential equations. This study focuses on developing the explicit challenges of relating dynamics and uncertainties in the Eulerian and Lagrangian frames via dynamic Gaussian processes. It also implements the approach using the ensemble Kalman filter (EnKF) and compares the DLF approach to the conventional one with respect to wave amplitude and phase estimates in linear and nonlinear wave problems. Numerical comparisons show that the DLF/EnKF outperforms the EnKF estimates, when applied to linear and nonlinear wave problems. This advantage is particularly noticeable when sparse, low uncertainty observations are used.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1980

Energy minimization versus pseudo force technique for nonlinear structural analysis

The effectiveness of using minimization techniques for the solution of nonlinear structural analysis problems is discussed and demonstrated by comparison with the conventional pseudo force technique. The comparison involves nonlinear problems with a relatively few degrees of freedom. A survey of the state-of-the-art of algorithms for unconstrained minimization reveals that extension of the technique to large scale nonlinear systems is possible.

Kamat, M. P.↗
DOE OSTI2022

Asynchronous domain decomposition methods for nonlinear PDEs

One- and two-level parallel asynchronous methods for the numerical solution of nonlinear systems of equations, especially those arising from (nonlinear) partial differential equations, are studied. The proposed methods are based on domain decomposition techniques. Local convergence theorems are presented in several cases, with appropriate hypotheses. Computational results on a shared memory multiprocessor machine for various problems exhibiting nonlinearities are reported, illustrating the potential of these asynchronous methods, especially for heterogeneous clusters.

97 MATHEMATICS AND COMPUTING↗