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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Adaptive Finite Element Methods for Continuum Damage Modeling

The paper presents an application of adaptive finite element methods to the modeling of low-cycle continuum damage and life prediction of high-temperature components. The major objective is to provide automated and accurate modeling of damaged zones through adaptive mesh refinement and adaptive time-stepping methods. The damage modeling methodology is implemented in an usual way by embedding damage evolution in the transient nonlinear solution of elasto-viscoplastic deformation problems. This nonlinear boundary-value problem is discretized by adaptive finite element methods. The automated h-adaptive mesh refinements are driven by error indicators, based on selected principal variables in the problem (stresses, non-elastic strains, damage, etc.). In the time domain, adaptive time-stepping is used, combined with a predictor-corrector time marching algorithm. The time selection is controlled by required time accuracy. In order to take into account strong temperature dependency of material parameters, the nonlinear structural solution a coupled with thermal analyses (one-way coupling). Several test examples illustrate the importance and benefits of adaptive mesh refinements in accurate prediction of damage levels and failure time.

Min, J. B.↗
NASA NTRS1979

Classification and equivalence in estimation theory

A method is proposed for classifying estimation problems based on the Lie algebra generated by the operators which appear in the conditional density equation. A natural class of automorphisms of this algebra is examined and a systematic method of generating equivalent problems is developed. Finally, a new class of nonlinear filtering problems with essentially nonlinear filtering equations are presented.

Brockett, R. W.↗
DOE OSTI2024

Paired autoencoders for likelihood-free estimation in inverse problems

Abstract We consider the solution of nonlinear inverse problems where the forward problem is a discretization of a partial differential equation. Such problems are notoriously difficult to solve in practice and require minimizing a combination of a data-fit term and a regularization term. The main computational bottleneck of typical algorithms is the direct estimation of the data misfit. Therefore, likelihood-free approaches have become appealing alternatives. Nonetheless, difficulties in generalization and limitations in accuracy have hindered their broader utility and applicability. In this work, we use a paired autoencoder framework as a likelihood-free estimator (LFE) for inverse problems. We show that the use of such an architecture allows us to construct a solution efficiently and to overcome some known open problems when using LFEs. In particular, our framework can assess the quality of the solution and improve on it if needed. We demonstrate the viability of our approach using examples from full waveform inversion and inverse electromagnetic imaging.

Chung, Matthias (ORCID:0000000178224539)↗
NASA NTRS1989

A connectionist model for diagnostic problem solving

A competition-based connectionist model for solving diagnostic problems is described. The problems considered are computationally difficult in that (1) multiple disorders may occur simultaneously and (2) a global optimum in the space exponential to the total number of possible disorders is sought as a solution. The diagnostic problem is treated as a nonlinear optimization problem, and global optimization criteria are decomposed into local criteria governing node activation updating in the connectionist model. Nodes representing disorders compete with each other to account for each individual manifestation, yet complement each other to account for all manifestations through parallel node interactions. When equilibrium is reached, the network settles into a locally optimal state. Three randomly generated examples of diagnostic problems, each of which has 1024 cases, were tested, and the decomposition plus competition plus resettling approach yielded very high accuracy.

Peng, Yun↗
NASA NTRS1993

A global path planning approach for redundant manipulators

A new approach for global path planning of redundant manipulators is proposed. It poses the path planning problem as a finite time nonlinear control problem. The solution is found by a Newton-Raphson type algorithm. This technique is capable of handling various goal task descriptions as well as incorporating both joint and task space constraints. The algorithm has shown promising preliminary results in planning joint path sequences for 3R and 4R planar robots to meet Cartesian tip tracking and goal endpoint planning. It is robust with respect to local path planning problems such as singularity considerations and local minimum problems. Repetitive joint path solutions for cyclic end-effector tasks are also generated. Eventual goals of this work include implementation on full spatial robots, as well as provision of an interface for supervisory input to aid in path planning for more complex problems.

Seereeram, Sanjeev↗
NASA NTRS1994

Optimizations on Designing High-Resolution Finite-Difference Schemes

We describe a general optimization procedure for both maximizing the resolution characteristics of existing finite differencing schemes as well as designing finite difference schemes that will meet the error tolerance requirements of numerical solutions. The procedure is based on an optimization process. This is a generalization of the compact scheme introduced by Lele in which the resolution is improved for single, one-dimensional spatial derivative, whereas in the present approach the complete scheme, after spatial and temporal discretizations, is optimized on a range of parameters of the scheme and the governing equations. The approach is to linearize and Fourier analyze the discretized equations to check the resolving power of the scheme for various wave number ranges in the solution and optimize the resolution to satisfy the requirements of the problem. This represents a constrained nonlinear optimization problem which can be solved to obtain the nodal weights of discretization. An objective function is defined in the parametric space of wave numbers, Courant number, Mach number and other quantities of interest. Typical criterion for defining the objective function include the maximization of the resolution of high wave numbers for acoustic and electromagnetic wave propagations and turbulence calculations. The procedure is being tested on off-design conditions of non-uniform mesh, non-periodic boundary conditions, and non-constant wave speeds for scalar and system of equations. This includes the solution of wave equations and Euler equations using a conventional scheme with and without optimization and the design of an optimum scheme for the specified error tolerance.

Liu, Yen↗
NASA NTRS1990

Optimal aeroassisted orbital transfer with plane change using collocation and nonlinear programming

The fuel optimal control problem arising in the non-planar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) with orbital plane change. The basic strategy here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the aeroassisted HEO to LEO transfer consists of three phases. In the first phase, the orbital transfer begins with a deorbit impulse at HEO which injects the vehicle into an elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and bank angle modulations to perform the desired orbital plane change and to satisfy heating constraints. Because of the energy loss during the turn, an impulse is required to initiate the third phase to boost the vehicle back to the desired LEO orbital altitude. The third impulse is then used to circularize the orbit at LEO. The problem is solved by a direct optimization technique which uses piecewise polynomial representation for the state and control variables and collocation to satisfy the differential equations. This technique converts the optimal control problem into a nonlinear programming problem which is solved numerically. Solutions were obtained for cases with and without heat constraints and for cases of different orbital inclination changes. The method appears to be more powerful and robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun. Y.↗
NASA NTRS1991

Minimum fuel coplanar aeroassisted orbital transfer using collocation and nonlinear programming

The fuel optimal control problem arising in coplanar orbital transfer employing aeroassisted technology is addressed. The mission involves the transfer from high energy orbit (HEO) to low energy orbit (LEO) without plane change. The basic approach here is to employ a combination of propulsive maneuvers in space and aerodynamic maneuvers in the atmosphere. The basic sequence of events for the coplanar aeroassisted HEO to LEO orbit transfer consists of three phases. In the first phase, the transfer begins with a deorbit impulse at HEO which injects the vehicle into a elliptic transfer orbit with perigee inside the atmosphere. In the second phase, the vehicle is optimally controlled by lift and drag modulation to satisfy heating constraints and to exit the atmosphere with the desired flight path angle and velocity so that the apogee of the exit orbit is the altitude of the desired LEO. Finally, the second impulse is required to circularize the orbit at LEO. The performance index is maximum final mass. Simulation results show that the coplanar aerocapture is quite different from the case where orbital plane changes are made inside the atmosphere. In the latter case, the vehicle has to penetrate deeper into the atmosphere to perform the desired orbital plane change. For the coplanar case, the vehicle needs only to penetrate the atmosphere deep enough to reduce the exit velocity so the vehicle can be captured at the desired LEO. The peak heating rates are lower and the entry corridor is wider. From the thermal protection point of view, the coplanar transfer may be desirable. Parametric studies also show the maximum peak heating rates and the entry corridor width are functions of maximum lift coefficient. The problem is solved using a direct optimization technique which uses piecewise polynomial representation for the states and controls and collocation to represent the differential equations. This converts the optimal control problem into a nonlinear programming problem which is solved numerically by using a modified version of NPSOL. Solutions were obtained for the described problem for cases with and without heating constraints. The method appears to be more robust than other optimization methods. In addition, the method can handle complex dynamical constraints.

Shi, Yun Yuan↗
NASA NTRS1995

Solutions of the benchmark problems by the dispersion-relation-preserving scheme

The 7-point stencil Dispersion-Relation-Preserving scheme of Tam and Webb is used to solve all the six categories of the CAA benchmark problems. The purpose is to show that the scheme is capable of solving linear, as well as nonlinear aeroacoustics problems accurately. Nonlinearities, inevitably, lead to the generation of spurious short wave length numerical waves. Often, these spurious waves would overwhelm the entire numerical solution. In this work, the spurious waves are removed by the addition of artificial selective damping terms to the discretized equations. Category 3 problems are for testing radiation and outflow boundary conditions. In solving these problems, the radiation and outflow boundary conditions of Tam and Webb are used. These conditions are derived from the asymptotic solutions of the linearized Euler equations. Category 4 problems involved solid walls. Here, the wall boundary conditions for high-order schemes of Tam and Dong are employed. These conditions require the use of one ghost value per boundary point per physical boundary condition. In the second problem of this category, the governing equations, when written in cylindrical coordinates, are singular along the axis of the radial coordinate. The proper boundary conditions at the axis are derived by applying the limiting process of r approaches 0 to the governing equations. The Category 5 problem deals with the numerical noise issue. In the present approach, the time-independent mean flow solution is computed first. Once the residual drops to the machine noise level, the incident sound wave is turned on gradually. The solution is marched in time until a time-periodic state is reached. No exact solution is known for the Category 6 problem. Because of this, the problem is formulated in two totally different ways, first as a scattering problem then as a direct simulation problem. There is good agreement between the two numerical solutions. This offers confidence in the computed results. Both formulations are solved as initial value problems. As such, no Kutta condition is required at the trailing edge of the airfoil.

Tam, Christopher K. W.↗
NASA NTRS1960

Solution of Nonlinear Systems

The problem of solving systems of nonlinear equations has been relatively neglected in the mathematical literature, especially in the textbooks, in comparison to the corresponding linear problem. Moreover, treatments that have an appearance of generality fail to discuss the nature of the solutions and the possible pitfalls of the methods suggested. Probably it is unrealistic to expect that a unified and comprehensive treatment of the subject will evolve, owing to the great variety of situations possible, especially in the applied field where some requirement of human or mechanical efficiency is always present. Therefore we attempt here simply to pose the problem and to describe and partially appraise the methods of solution currently in favor.

Turner, L. R.↗
NASA NTRS1988

An approximation theory for the identification of nonlinear distributed parameter systems

An abstract approximation framework for the identification of nonlinear distributed parameter systems is developed. Inverse problems for nonlinear systems governed by strongly maximal monotone operators (satisfying a mild continuous dependence condition with respect to the unknown parameters to be identified) are treated. Convergence of Galerkin approximations and the corresponding solutions of finite dimensional approximating identification problems to a solution of the original finite dimensional identification problem is demonstrated using the theory of nonlinear evolution systems and a nonlinear analog of the Trotter-Kato approximation result for semigroups of bounded linear operators. The nonlinear theory developed here is shown to subsume an existing linear theory as a special case. It is also shown to be applicable to a broad class of nonlinear elliptic operators and the corresponding nonlinear parabolic partial differential equations to which they lead. An application of the theory to a quasilinear model for heat conduction or mass transfer is discussed.

Banks, H. T.↗
NASA NTRS1990

An approximation theory for the identification of nonlinear distributed parameter systems

An abstract approximation framework for the identification of nonlinear distributed parameter systems is developed. Inverse problems for nonlinear systems governed by strongly maximal monotone operators (satisfying a mild continuous dependence condition with respect to the unknown parameters to be identified) are treated. Convergence of Galerkin approximations and the corresponding solutions of finite dimensional approximating identification problems to a solution of the original finite dimensional identification problem is demonstrated using the theory of nonlinear evolution systems and a nonlinear analog of the Trotter-Kato appproximation result for semigroups of bounded linear operators. The nonlinear theory developed here is shown to subsume an existing linear theory as a special case. It is also shown to be applicable to a broad class of nonlinear elliptic operators and the corresponding nonlinear parabolic partial differential equations to which they lead. An application of the theory to a quasilinear model for heat conduction or mass transfer is discussed.

Banks, H. T.↗
NASA NTRS1999

Determination of Nonlinear Stiffness Coefficients for Finite Element Models with Application to the Random Vibration Problem

In this paper, a method for obtaining nonlinear stiffness coefficients in modal coordinates for geometrically nonlinear finite-element models is developed. The method requires application of a finite-element program with a geometrically non- linear static capability. The MSC/NASTRAN code is employed for this purpose. The equations of motion of a MDOF system are formulated in modal coordinates. A set of linear eigenvectors is used to approximate the solution of the nonlinear problem. The random vibration problem of the MDOF nonlinear system is then considered. The solutions obtained by application of two different versions of a stochastic linearization technique are compared with linear and exact (analytical) solutions in terms of root-mean-square (RMS) displacements and strains for a beam structure.

Muravyov, Alexander A.↗
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↗