Search NASA⌕ Search

SEARCH · Search NASA

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.

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

At least 685 records · Page 38

Delamination and Stitched Failure in Stitched Composite Joints

The effect of stitches on the failure of a single lap joint configuration was determined in a combined experimental and finite element study. The experimental program was conducted to determine debond growth under static monotonic loading. The stitches were shown to delay the initiation of the debond and provide load transfer beyond the load necessary to completely debond the stitched lap joint. The experimentally determined debond length vs. applied load was used as an input parameter in the finite element analysis of both configurations. The strain energy release rates at the debond from were calculated using plate finite elements. Nonlinear fastener elements were used to model the stitches and multipoint constraints were used to model the contact problem. Models of the unstitched configuration showed significant values of modes I and II across the width of the joint and showed that mode III is zero at the centerline but increases near the free edge. Models of the stitched configuration showed that the stitches were effective in reducing mode I to zero, but had less of an effect on modes II and III.

Glaessgen, E. H.↗

An automated data management/analysis system for space shuttle orbiter tiles

An engineering data management system was combined with a nonlinear stress analysis program to provide a capability for analyzing a large number of tiles on the space shuttle orbiter. Tile geometry data and all data necessary of define the tile loads environment accessed automatically as needed for the analysis of a particular tile or a set of tiles. User documentation provided includes: (1) description of computer programs and data files contained in the system; (2) definitions of all engineering data stored in the data base; (3) characteristics of the tile anaytical model; (4) instructions for preparation of user input; and (5) a sample problem to illustrate use of the system. Description of data, computer programs, and analytical models of the tile are sufficiently detailed to guide extension of the system to include additional zones of tiles and/or additional types of analyses

Giles, G. L.↗

Two-dimensional computer simulation of EMVJ and grating solar cells under AMO illumination

A computer program, SCAP2D (Solar Cell Analysis Program in 2-Dimensions), is used to evaluate the Etched Multiple Vertical Junction (EMVJ) and grating solar cells. The aim is to demonstrate how SCAP2D can be used to evaluate cell designs. The cell designs studied are by no means optimal designs. The SCAP2D program solves the three coupled, nonlinear partial differential equations, Poisson's Equation and the hole and electron continuity equations, simultaneously in two-dimensions using finite differences to discretize the equations and Newton's Method to linearize them. The variables solved for are the electrostatic potential and the hole and electron concentrations. Each linear system of equations is solved directly by Gaussian Elimination. Convergence of the Newton Iteration is assumed when the largest correction to the electrostatic potential or hole or electron quasi-potential is less than some predetermined error. A typical problem involves 2000 nodes with a Jacobi matrix of order 6000 and a bandwidth of 243.

Gray, J. L.↗

Poblano v1.0 : a Matlab toolbox for gradient-based optimization.

We present Poblano v1.0, a Matlab toolbox for solving gradient-based unconstrained optimization problems. Poblano implements three optimization methods (nonlinear conjugate gradients, limited-memory BFGS, and truncated Newton) that require only first order derivative information. In this paper, we describe the Poblano methods, provide numerous examples on how to use Poblano, and present results of Poblano used in solving problems from a standard test collection of unconstrained optimization problems.

99 GENERAL AND MISCELLANEOUS↗

A design philosophy for multi-layer neural networks with applications to robot control

A system is proposed which receives input information from many sensors that may have diverse scaling, dimension, and data representations. The proposed system tolerates sensory information with faults. The proposed self-adaptive processing technique has great promise in integrating the techniques of artificial intelligence and neural networks in an attempt to build a more intelligent computing environment. The proposed architecture can provide a detailed decision tree based on the input information, information stored in a long-term memory, and the adapted rule-based knowledge. A mathematical model for analysis will be obtained to validate the cited hypotheses. An extensive software program will be developed to simulate a typical example of pattern recognition problem. It is shown that the proposed model displays attention, expectation, spatio-temporal, and predictory behavior which are specific to the human brain. The anticipated results of this research project are: (1) creation of a new dynamic neural network structure, and (2) applications to and comparison with conventional multi-layer neural network structures. The anticipated benefits from this research are vast. The model can be used in a neuro-computer architecture as a building block which can perform complicated, nonlinear, time-varying mapping from a multitude of input excitory classes to an output or decision environment. It can be used for coordinating different sensory inputs and past experience of a dynamic system and actuating signals. The commercial applications of this project can be the creation of a special-purpose neuro-computer hardware which can be used in spatio-temporal pattern recognitions in such areas as air defense systems, e.g., target tracking, and recognition. Potential robotics-related applications are trajectory planning, inverse dynamics computations, hierarchical control, task-oriented control, and collision avoidance.

Vadiee, Nader↗

On the theory of the synthesis of offset dual-shaped reflectors - Case examples

In an earlier paper by Galindo-Israel et al. (1987), the geometrical optics (GO) principles, constraints, and requirements of the dual- and single-offset-shaped reflector synthesis problem were collected and developed into a set of nonlinear first-order PDEs. An extension of the methods by which solutions to the PDEs can be obtained is presented, together with several case examples. These examples are independently analyzed by GO and physical optics diffraction methods. The starting point for the integration over each reflector can be taken on the outer rim, at the center, or at an intermediate point-the intermediate starting point being the more general case. The utility of the speed of this synthesis method is demonstrated. For example, the program utilized completes a synthesis in less than 45 s on a 386/20 personal computer and within a fraction of a second on a mainframe Cray. This makes practical the incorporation of the synthesis into a search algorithm that can optimize one or more parameters of the reflector system. As an example, the optimization of the mapping equations for low cross polarization is discussed.

Galindo-Israel, Victor↗

Dynamic force matching: A method for constructing dynamical coarse-grained models with realistic time dependence

Coarse-grained (CG) models of molecular systems, with fewer mechanical degrees of freedom than an all-atom model, are used extensively in chemical physics. It is generally accepted that a coarse-grained model that accurately describes equilibrium structural properties (as a result of having a well constructed CG potential energy function) does not necessarily exhibit appropriate dynamical behavior when simulated using conservative Hamiltonian dynamics for the CG degrees of freedom on the CG potential energy surface. Attempts to develop accurate CG dynamic models usually focus on replacing Hamiltonian motion by stochastic but Markovian dynamics on that surface, such as Langevin or Brownian dynamics. However, depending on the nature of the system and the extent of the coarse-graining, a Markovian dynamics for the CG degrees of freedom may not be appropriate. In this paper, we consider the problem of constructing dynamic CG models within the context of the Multi-Scale Coarse-graining (MS-CG) method of Voth and coworkers. We propose a method of converting a MS-CG model into a dynamic CG model by adding degrees of freedom to it in the form of a small number of fictitious particles that interact with the CG degrees of freedom in simple ways and that are subject to Langevin forces. The dynamic models are members of a class of nonlinear systems interacting with special heat baths that were studied by Zwanzig [J. Stat. Phys. 9, 215 (1973)]. The properties of the fictitious particles can be inferred from analysis of the dynamics of all-atom simulations of the system of interest. This is analogous to the fact that the MS-CG method generates the CG potential from analysis of equilibrium structures observed in all-atom simulation data. The dynamic models generate a non-Markovian dynamics for the CG degrees of freedom, but they can be easily simulated using standard molecular dynamics programs. We present tests of this method on a series of simple examples that demonstrate that the method provides realistic dynamical CG models that have non-Markovian or close to Markovian behavior that is consistent with the actual dynamical behavior of the all-atom system used to construct the CG model. Both the construction and the simulation of such a dynamic CG model have computational requirements that are similar to those of the corresponding MS-CG model and are good candidates for CG modeling of very large systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

The influence of galaxy formation physics on weak lensing tests of general relativity

Forthcoming projects such as the Dark Energy Survey, Joint Dark Energy Mission, and the Large Synoptic Survey Telescope, aim to measure weak lensing shear correlations with unprecedented accuracy. Weak lensing observables are sensitive to both the distance-redshift relation and the growth of structure in the Universe. If the cause of accelerated cosmic expansion is dark energy within general relativity, both cosmic distances and structure growth are governed by the properties of dark energy. Consequently, one may use lensing to check for this consistency and test general relativity. After reviewing the phenomenology of such tests, we address a major challenge to such a program. The evolution of the baryonic component of the Universe is highly uncertain and can influence lensing observables, manifesting as modified structure growth for a fixed cosmic distance scale. Using two proposed methods, we show that one could be led to reject the null hypothesis of general relativity when it is the true theory if this uncertainty in baryonic processes is neglected. Recent simulations suggest that we can correct for baryonic effects using a parameterized model in which the halo mass-concentration relation is modified. The correction suffices to render biases small compared to statistical uncertainties. We study the ability of future weak lensing surveys to constrain the internal structures of halos and test the null hypothesis of general relativity simultaneously. Compared to alternative methods which null information from small-scales to mitigate sensitivity to baryonic physics, this internal calibration program should provide limits on deviations from general relativity that are several times more constraining. Specifically, we find that limits on general relativity in the case of internal calibration are degraded by only {approx} 30% or less compared to the case of perfect knowledge of nonlinear structure.

79 ASTRONOMY AND ASTROPHYSICS↗

Biomimetic model-based advanced control strategy integrated with multi-agent optimization for nonlinear chemical processes

Here, a novel framework is proposed for integrating biomimetic-based advanced control and multi-agent optimization approaches for nonlinear chemical process applications. In particular, a Biologically-Inspired Optimal Control Strategy, denoted as BIO-CS, is combined with multi-agent optimization (MAO) techniques to provide optimal solutions for dynamic systems. In this combined framework, the BIO-CS algorithm employs gradient-based optimal control solvers for the intermediate problems associated with the leader-follower agents’ local interactions. Also, the MAO uses the capabilities of heuristic-based optimization techniques by sharing process information to obtain optimal operating setpoints for the controller considering an overall process objective. The applicability of the proposed method is demonstrated using a nonlinear, multivariable, process model of a fermentation system. Specifically, the optimal operating points are computed by the MAO implementation for setpoint tracking, trajectory tracking and plant-model mismatch scenarios for BIO-CS application. Results of the developed framework are compared to a gradient-based Sequential Quadratic Programming (SQP) technique and a classical proportional-integral (PI) controller in terms of optimization and control studies, respectively. As an additional contribution, BIO-CS is also cast as a model predictive controller (MPC) for the first time and compared to the agent-based BIO-CS approach in terms of computational time and tracking error. Closed-loop control results show up to 46% improvement in tracking performance during transient for the multi-agent BIO-CS when compared to BIO-CS as MPC for additional computational expense. The obtained results illustrate the capabilities of this novel integrated framework including BIO-CS as MPC to achieve desired nonlinear system performance for various scenarios.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗

Unsteady flow through compressor stages

The application of the nonsteady Lax-Wendroff technique to problems with asymptotically periodic solution which offers a potentially powerful method for the investigation of the interaction of rotating and stationary blade rows in turbomachinery is reported. A technique for specifying boundary conditions with phase lag was developed to accomplish this. A complete nonlinear analysis is carried out numerically to determine the entire flow field without recourse to the assumption of small disturbances of linear equations which underlie the previous acoustic theories. The result, obtained for the case of equal number of rotor and stator blades shows that transonic flow can be handled without difficulty. In addition, the program is not limited with regard to blade thickness, camber or loading. Extension of this method to incorporate viscous wakes and to analysis of fully three dimensional configuration is feasible, and would greatly expand its utility in practical applications.

Alzner, E.↗

Polarized Bidirectional Reflectance of Optically Thick Sparse Particulate Layers: an Efficient Numerically Exact Radiative-Transfer Solution

We describe a simple yet efficient numerical algorithm for computing polarized bidirectional reflectance of an optically thick (semi-infinite), macroscopically flat layer composed of statistically isotropic and mirror symmetric random particles. The spatial distribution of the particles is assumed to be sparse, random, and statistically uniform. The 44 Stokes reflection matrix is calculated by iterating the Ambartsumian's vector nonlinear integral equation. The result is a numerically exact solution of the vector radiative transfer equation and as such fully satisfies the energy conservation law and the fundamental reciprocity relation. Since this technique bypasses the computation of the internal radiation field, it is very fast and highly accurate. The FORTRAN implementation of the technique is publicly available on the World Wide Web at http://www.giss.nasa.gov/staff/ mmishchenko/brf. It can be combined with several existing computer programs providing the requisite single-scattering properties of spherical or morphologically complex particles and applied to a wide range of optical characterization problems. Benchmark results obtained with this program can be used for testing alternative solvers of the vector radiative transfer equation.

radiative transfer↗

Stacking-sequence optimization for buckling of laminated plates by integer programming

Integer-programming formulations for the design of symmetric and balanced laminated plates under biaxial compression are presented. Both maximization of buckling load for a given total thickness and the minimization of total thickness subject to a buckling constraint are formulated. The design variables that define the stacking sequence of the laminate are zero-one integers. It is shown that the formulation results in a linear optimization problem that can be solved on readily available software. This is in contrast to the continuous case, where the design variables are the thicknesses of layers with specified ply orientations, and the optimization problem is nonlinear. Constraints on the stacking sequence such as a limit on the number of contiguous plies of the same orientation and limits on in-plane stiffnesses are easily accommodated. Examples are presented for graphite-epoxy plates under uniaxial and biaxial compression using a commercial software package based on the branch-and-bound algorithm.

Haftka, Raphael T.↗

Spatial and Spin Symmetry Breaking in Semidefinite-Programming-Based Hartree–Fock Theory

The Hartree–Fock problem was recently recast as a semidefinite optimization over the space of rank-constrained two-body reduced-density matrices (RDMs) [ Phys. Rev. A 2014, 89, 010502(R)]. This formulation of the problem transfers the nonconvexity of the Hartree–Fock energy functional to the rank constraint on the two-body RDM. We consider an equivalent optimization over the space of positive semidefinite one-electron RDMs (1-RDMs) that retains the nonconvexity of the Hartree–Fock energy expression. The optimized 1-RDM satisfies ensemble N-representability conditions, and ensemble spin-state conditions may be imposed as well. The spin-state conditions place additional linear and nonlinear constraints on the 1-RDM. We apply this RDM-based approach to several molecular systems and explore its spatial (point group) and spin (Ŝ 2 and Ŝ 3 ) symmetry breaking properties. When imposing Ŝ 2 and Ŝ 3 symmetry but relaxing point group symmetry, the procedure often locates spatial-symmetry-broken solutions that are difficult to identify using standard algorithms. For example, the RDM-based approach yields a smooth, spatial-symmetry-broken potential energy curve for the well-known Be–H 2 insertion pathway. We also demonstrate numerically that, upon relaxation of Ŝ 2 and Ŝ 3 symmetry constraints, the RDM-based approach is equivalent to real-valued generalized Hartree–Fock theory.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids

Mission proposals that land on asteroids are becoming popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site. The problem under investigation is how to design a fuel-optimal powered descent trajectory that can be quickly computed on- board the spacecraft, without interaction from ground control. An optimal trajectory designed immediately prior to the descent burn has many advantages. These advantages include the ability to use the actual vehicle starting state as the initial condition in the trajectory design and the ease of updating the landing target site if the original landing site is no longer viable. For long trajectories, the trajectory can be updated periodically by a redesign of the optimal trajectory based on current vehicle conditions to improve the guidance performance. One of the key drivers for being completely autonomous is the infrequent and delayed communication between ground control and the vehicle. Challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies and low thrust vehicles. There are two previous studies that form the background to the current investigation. The first set looked in-depth at applying convex optimization to a powered descent trajectory on Mars with promising results.1, 2 This showed that the powered descent equations of motion can be relaxed and formed into a convex optimization problem and that the optimal solution of the relaxed problem is indeed a feasible solution to the original problem. This analysis used a constant gravity field. The second area applied a successive solution process to formulate a second order cone program that designs rendezvous and proximity operations trajectories.3, 4 These trajectories included a Newtonian gravity model. The equivalence of the solutions between the relaxed and the original problem is theoretically established. The proposed solution for designing the asteroid powered descent trajectory is to use convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process to design the fuel optimal trajectory. The solution to the convex optimization problem is the thrust profile, magnitude and direction, that will yield the minimum fuel trajectory for a soft landing at the target site, subject to various mission and operational constraints. The equations of motion are formulated in a rotating coordinate system and includes a high fidelity gravity model. The vehicle's thrust magnitude can vary between maximum and minimum bounds during the burn. Also, constraints are included to ensure that the vehicle does not run out of propellant, or go below the asteroid's surface, and any vehicle pointing requirements. The equations of motion are discretized and propagated with the trapezoidal rule in order to produce equality constraints for the optimization problem. These equality constraints allow the optimization algorithm to solve the entire problem, without including a propagator inside the optimization algorithm.

Pinson, Robin M.↗

An Interactive MATLAB Program for Fitting Transfer Functions to Frequency Responses

A computer program called FRFit (Frequency Response Fitting) is described for fitting single-input single-output transfer function models to empirical frequency response data. The program is interactive in that the user specifies ``elementary factors'' (gain, delay, pure differentiators and integrators, and first- and second-order zeros and poles) by entering numerical values or moving sliders in a graphical user interface. A nonlinear optimization can then be performed to obtain maximum likelihood estimates of transfer function parameters and uncertainties to provide feedback on the modeling and refine estimates. Several examples are discussed, including the identification of aircraft pitch dynamics from simulation data and data reported in the literature, approximating Theodorsen's function of unsteady aerodynamics, and obtaining a reduced-order model of a computational fluid dynamics code describing the unsteady aerodynamics around an aeroelastic wing. The program has some usefulness as a teaching aid, and can be applied to model structure determination, reduced-order modeling, preliminary analysis, and simple system identification problems. The program was written in MATLAB and is planned for public release through the NASA Software Catalog.

System identification↗

Multidisciplinary optimization of controlled space structures with global sensitivity equations

A new method for the preliminary design of controlled space structures is presented. The method coordinates standard finite element structural analysis, multivariable controls, and nonlinear programming codes and allows simultaneous optimization of the structures and control systems of a spacecraft. Global sensitivity equations are a key feature of this method. The preliminary design of a generic geostationary platform is used to demonstrate the multidisciplinary optimization method. Fifteen design variables are used to optimize truss member sizes and feedback gain values. The goal is to reduce the total mass of the structure and the vibration control system while satisfying constraints on vibration decay rate. Incorporating the nonnegligible mass of actuators causes an essential coupling between structural design variables and control design variables. The solution of the demonstration problem is an important step toward a comprehensive preliminary design capability for structures and control systems. Use of global sensitivity equations helps solve optimization problems that have a large number of design variables and a high degree of coupling between disciplines.

Padula, Sharon L.↗