SEARCH · Engineering Papers

Results for “nonlinear programming problem”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 271 records · Page 15

All sources NASA NTRS DOE OSTI

NASA NTRS1990

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

NASA NTRS1976

A steady and oscillatory kernel function method for interfering surfaces in subsonic, transonic and supersonic flow

The theory, results and user instructions for an aerodynamic computer program are presented. The theory is based on linear lifting surface theory, and the method is the kernel function. The program is applicable to multiple interfering surfaces which may be coplanar or noncoplanar. Local linearization was used to treat nonuniform flow problems without shocks. For cases with imbedded shocks, the appropriate boundary conditions were added to account for the flow discontinuities. The data describing nonuniform flow fields must be input from some other source such as an experiment or a finite difference solution. The results are in the form of small linear perturbations about nonlinear flow fields. The method was applied to a wide variety of problems for which it is demonstrated to be significantly superior to the uniform flow method. Program user instructions are given for easy access.

Cunningham, A. M., Jr.↗

DOE OSTI2024

Towards reverse mode automatic differentiation of Kokkos-based codes

Derivative computation is a key component of optimization, sensitivity analysis, uncertainty quantification, and the solving of nonlinear problems. Automatic differentiation (AD) is a powerful technique for evaluating such derivatives, and in recent years, has been integrated into programming environments such as Jax, PyTorch, and TensorFlow to support derivative computations needed for training of machine learning models, facilitating wide-spread use of these technologies. The C++ language has become the de facto standard for scientific computing due to numerous factors, yet language complexity has made the wide-spread adoption of AD technologies for C++ difficult, hampering the incorporation of powerful differentiable programming approaches into C++ scientific simulations. This is exacerbated by the increasing emergence of architectures, such as GPUs, with limited memory capabilities and requiring massive thread-level concurrency. C++ AD tools must effectively use these environments to bring novel scientific simulations to next-generation DOE experimental and observational facilities. In this project, we investigated source transformation-based automatic differentiation using LLVM compiler infrastructure to automatically generate portable and efficient gradient computations of Kokkos-based code. We have demonstrated that our proposed strategy is feasible by investigating the usage of a prototype LLVM-based source transformation tool to generate gradients of simple functions made of sequences of simple Kokkos parallel regions. Speedups of up to 500x compared to Sacado were observed on NVIDIA V100 GPU.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1990

Determining structural performance

An overview of the methods and concepts developed to enhance and predict structural dynamic characteristics of advanced aeropropulsion systems is presented. Aeroelasticity, vibration control, dynamic systems, and computational structural methods are four disciplines that make up the structural dynamic effort at LeRC. The aeroelasticity program develops analytical and experimental methods for minimizing flutter and forced vibration of aerospace propulsion systems. Both frequency domain and time domain methods were developed for applications on the turbofan, turbopump, and advanced turboprop. In order to improve life and performance, the vibration control program conceives, analyzes, develops, and demonstrates new methods for controlling vibrations in aerospace systems. Active and passive vibration control is accomplished with electromagnetic dampers, magnetic bearings, and piezoelectric crystals to control rotor vibrations. The dynamic systems program analyzes and verifies the dynamics of interacting systems, as well as develops concepts and methods for high-temperature dynamic seals. Work in this field involves the analysis and parametric identification of large, nonlinear, damped, stochastic systems. The computational structural methods program exploits modern computer science as an aid to the solutions of structural problems.

Ernst, Michael A.↗

DOE OSTI2024

Solving the Grid Optimization Competition Challenge 3 Problem

The Grid Optimization Competition Challenge 3 Problem posed a multiperiod security-constrained unit commitment problem with base-case AC power flow. The problem formulation includes binary unit commitment decisions, nonlinear AC power flow and balance, dispatchable loads, and linearized contingency real power flow, among other features. This talk will present a modified consensus ADMM algorithm, which splits the problem into mixed-integer linear and nonlinear components, as a heuristic solution method for this large-scale mixed integer nonlinear program. We will present some computational results from the competition for our implementation and reflect on the challenges of participating the grid optimization competition.

AC power flow↗

DOE OSTI2022

On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control

Here, we study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all subproblems defined over subdomains in parallel. The convergence is attained by updating primal-dual information at the boundaries of overlapping subdomains. We show that the algorithm exhibits local linear convergence, and that the convergence rate improves exponentially with the overlap size. We also establish global convergence results for a general quadratic programming, which enables the application of the Schwarz scheme inside second-order optimization algorithms (e.g., sequential quadratic programming). The theoretical foundation of our convergence analysis is a sensitivity result of nonlinear OCPs, which we call "exponential decay of sensitivity" (EDS). Intuitively, EDS states that the impact of perturbations at domain boundaries (i.e., initial and terminal time) on the solution decays exponentially as one moves into the domain. Here, we expand a previous analysis available in the literature by showing that EDS holds for both primal and dual solutions of nonlinear OCPs, under uniform second-order sufficient condition, controllability condition, and boundedness condition. We conduct experiments with a quadrotor motion planning problem and a partial differential equations (PDE) control problem to validate our theory, and show that the approach is significantly more efficient than alternating direction method of multipliers and as efficient as the centralized interior-point solver.

42 ENGINEERING↗

DOE OSTI2020

Optimal Network Topology for Node-Breaker Representations With AC Power Flow Constraints

It has been demonstrated that network topology optimization (NTO) may change the topology of power system networks, and consequently, provide additional flexibility to reduce network congestion and violations. Most NTO problems are formulated based on the bus-branch model in which it is challenging to represent a realistic picture of all substation configurations. In this paper, we explore advantages of substation reconfiguration modeling based on node-breaker representations for NTO problem with full nonlinear alternating current power flow. It also proposes a tailored solution algorithm to solve this nonconvex mixed-integer nonlinear programming through the outer approximation method. The proposed solution approach iterates between a mixed-integer linear programming and a nonlinear subproblem. Additional enhancements to further accelerate the iteration process are illustrated. Numerical case studies demonstrate the relative economic and operational impact of optimal network topology with node-breaker representations.

42 ENGINEERING↗

NASA NTRS1972

A simplified satellite navigation system for an autonomous Mars roving vehicle.

The use of a retroflecting satellite and a laser rangefinder to navigate a Martian roving vehicle is considered in this paper. It is shown that a simple system can be employed to perform this task. An error analysis is performed on the navigation equations and it is shown that the error inherent in the scheme proposed can be minimized by the proper choice of measurement geometry. A nonlinear programming approach is used to minimize the navigation error subject to constraints that are due to geometric and laser requirements. The problem is solved for a particular set of laser parameters and the optimal solution is presented.

Janosko, R. E.↗

NASA NTRS1987

Interactive application of quadratic expansion of chi-square statistic to nonlinear curve fitting

This report contains a detailed theoretical description of an all-purpose, interactive curve-fitting routine that is based on P. R. Bevington's description of the quadratic expansion of the Chi-Square statistic. The method is implemented in the associated interactive, graphics-based computer program. Taylor's expansion of Chi-Square is first introduced, and justifications for retaining only the first term are presented. From the expansion, a set of n simultaneous linear equations is derived, then solved by matrix algebra. A brief description of the code is presented along with a limited number of changes that are required to customize the program of a particular task. To evaluate the performance of the method and the goodness of nonlinear curve fitting, two typical engineering problems are examined and the graphical and tabular output of each is discussed. A complete listing of the entire package is included as an appendix.

Badavi, F. F.↗

NASA NTRS1977

Sonic boom analysis for high-altitude flight at high Mach number

Numerical programs for the computation of the flow field from the airplane at the flight altitude to the ground are presented. They take into account the nonlinear effects of high Mach number, the entropy change across the shock, the entropy and enthalpy variations in the atmospheric layer, and the gravitational effect. Extension of the programs for the axisymmetric problems to handle nonaxisymmetric terms is described. The asymmetry can be caused by the geometry of the body and the lift, and also by the fact that the variations in the atmospheric layer are two-dimensional. Numerical results for ground level signatures of several configurations at various flight conditions are presented and compared with existing approximate theories to demonstrate the influences of these nonlinear effects.

Ferri, A.↗

NASA NTRS1976

Computational alternatives to obtain time optimal jet engine control

Two computational methods to determine an open loop time optimal control sequence for a simple single spool turbojet engine are described by a set of nonlinear differential equations. Both methods are modifications of widely accepted algorithms which can solve fixed time unconstrained optimal control problems with a free right end. Constrained problems to be considered have fixed right ends and free time. Dynamic programming is defined on a standard problem and it yields a successive approximation solution to the time optimal problem of interest. A feedback control law is obtained and it is then used to determine the corresponding open loop control sequence. The Fletcher-Reeves conjugate gradient method has been selected for adaptation to solve a nonlinear optimal control problem with state variable and control constraints.

Basso, R. J.↗

NASA NTRS1985

Minimal norm constrained interpolation

In computational fluid dynamics and in CAD/CAM, a physical boundary is usually known only discreetly and most often must be approximated. An acceptable approximation preserves the salient features of the data such as convexity and concavity. In this dissertation, a smooth interpolant which is locally concave where the data are concave and is locally convex where the data are convex is described. The interpolant is found by posing and solving a minimization problem whose solution is a piecewise cubic polynomial. The problem is solved indirectly by using the Peano Kernal theorem to recast it into an equivalent minimization problem having the second derivative of the interpolant as the solution. This approach leads to the solution of a nonlinear system of equations. It is shown that Newton's method is an exceptionally attractive and efficient method for solving the nonlinear system of equations. Examples of shape-preserving interpolants, as well as convergence results obtained by using Newton's method are also shown. A FORTRAN program to compute these interpolants is listed. The problem of computing the interpolant of minimal norm from a convex cone in a normal dual space is also discussed. An extension of de Boor's work on minimal norm unconstrained interpolation is presented.

Irvine, L. D.↗

NASA NTRS1996

Optimization of Air-Breathing Engine Concept

The design optimization of air-breathing propulsion engine concepts has been accomplished by soft-coupling the NASA Engine Performance Program (NEPP) analyzer with the NASA Lewis multidisciplinary optimization tool COMETBOARDS. Engine problems, with their associated design variables and constraints, were cast as nonlinear optimization problems with thrust as the merit function. Because of the large number of mission points in the flight envelope, the diversity of constraint types, and the overall distortion of the design space; the most reliable optimization algorithm available in COMETBOARDS, when used by itself, could not produce satisfactory, feasible, optimum solutions. However, COMETBOARDS' unique features-which include a cascade strategy, variable and constraint formulations, and scaling devised especially for difficult multidisciplinary applications-successfully optimized the performance of subsonic and supersonic engine concepts. Even when started from different design points, the combined COMETBOARDS and NEPP results converged to the same global optimum solution. This reliable and robust design tool eliminates manual intervention in the design of air-breathing propulsion engines and eases the cycle analysis procedures. It is also much easier to use than other codes, which is an added benefit. This paper describes COMETBOARDS and its cascade strategy and illustrates the capabilities of the combined design tool through the optimization of a high-bypass- turbofan wave-rotor-topped subsonic engine and a mixed-flow-turbofan supersonic engine.

Patnaik, Surya N.↗

NASA NTRS1989

A NASTRAN/TREETOPS solution to a flexible, multi-body dynamics and controls problem on a UNIX workstation

Demands for nonlinear time history simulations of large, flexible multibody dynamic systems has created a need for efficient interfaces between finite-element modeling programs and time-history simulations. One such interface, TREEFLX, an interface between NASTRAN and TREETOPS, a nonlinear dynamics and controls time history simulation for multibody structures, is presented and demonstrated via example using the proposed Space Station Mobile Remote Manipulator System (MRMS). The ability to run all three programs (NASTRAN, TREEFLX and TREETOPS), in addition to other programs used for controller design and model reduction (such as DMATLAB and TREESEL, both described), under a UNIX Workstation environment demonstrates the flexibility engineers now have in designing, developing and testing control systems for dynamically complex systems.

Benavente, Javier E.↗

NASA NTRS2006

Pattern-Recognition Algorithm for Locking Laser Frequency

A computer program serves as part of a feedback control system that locks the frequency of a laser to one of the spectral peaks of cesium atoms in an optical absorption cell. The system analyzes a saturation absorption spectrum to find a target peak and commands a laser-frequency-control circuit to minimize an error signal representing the difference between the laser frequency and the target peak. The program implements an algorithm consisting of the following steps: Acquire a saturation absorption signal while scanning the laser through the frequency range of interest. Condition the signal by use of convolution filtering. Detect peaks. Match the peaks in the signal to a pattern of known spectral peaks by use of a pattern-recognition algorithm. Add missing peaks. Tune the laser to the desired peak and thereafter lock onto this peak. Finding and locking onto the desired peak is a challenging problem, given that the saturation absorption signal includes noise and other spurious signal components; the problem is further complicated by nonlinearity and shifting of the voltage-to-frequency correspondence. The pattern-recognition algorithm, which is based on Hausdorff distance, is what enables the program to meet these challenges.

Karayan, Vahag↗

NASA NTRS2024

Global Optimization via Quadratic Disjunctive Programming for Water Networks Design with Energy Recovery

Generalized disjunctive programming (GDP) models with bilinear and concave constraints, often seen in water network design, are challenging optimization problems. This work proposes quadratic and piecewise linear approximations for nonlinear terms to reformulate GDP models into quadratic GDP (QGDP) models that suitable solvers may solve more efficiently. We illustrate the benefits of the quadratic reformulation with a water treatment network design problem in which nonconvexities arise from bilinear terms in the mixers’ mass balances and concave investment cost functions of treatment units. Given the similarities with water network design problems, we suggest quadratic approximation for the GDP model for the optimal design of a large-scale reverse electrodialysis (RED) process. This power technology can recover energy from salinity differences between by-product streams of the water sector, such as desalination brine mixed with regenerated wastewater effluents. The solver Gurobi excels in handling QGDP problems, but weighing the problem’s precision and tractability balance is crucial. The piecewise linear approximation yields more accurate, yet larger QGDP models that may require longer optimization times in large-scale process synthesis problems.

Water Networks↗

NASA NTRS1992

Optimization by nonhierarchical asynchronous decomposition

Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. The algorithm is carefully analyzed for quadratic programs, and a number of modifications are suggested to improve its robustness.

Shankar, Jayashree↗

NASA NTRS1993

Application of artificial neural networks to the design optimization of aerospace structural components

The application of artificial neural networks to capture structural design expertise is demonstrated. The principal advantage of a trained neural network is that it requires trivial computational effort to produce an acceptable new design. For the class of problems addressed, the development of a conventional expert system would be extremely difficult. In the present effort, a structural optimization code with multiple nonlinear programming algorithms and an artificial neural network code NETS were used. A set of optimum designs for a ring and two aircraft wings for static and dynamic constraints were generated by using the optimization codes. The optimum design data were processed to obtain input and output pairs, which were used to develop a trained artificial neural network with the code NETS. Optimum designs for new design conditions were predicted by using the trained network. Neural net prediction of optimum designs was found to be satisfactory for most of the output design parameters. However, results from the present study indicate that caution must be exercised to ensure that all design variables are within selected error bounds.

Berke, Laszlo↗