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 541 records · Page 30

Deterministic Design Optimization of Structures in OpenMDAO Framework

Nonlinear programming algorithms play an important role in structural design optimization. Several such algorithms have been implemented in OpenMDAO framework developed at NASA Glenn Research Center (GRC). OpenMDAO is an open source engineering analysis framework, written in Python, for analyzing and solving Multi-Disciplinary Analysis and Optimization (MDAO) problems. It provides a number of solvers and optimizers, referred to as components and drivers, which users can leverage to build new tools and processes quickly and efficiently. Users may download, use, modify, and distribute the OpenMDAO software at no cost. This paper summarizes the process involved in analyzing and optimizing structural components by utilizing the framework s structural solvers and several gradient based optimizers along with a multi-objective genetic algorithm. For comparison purposes, the same structural components were analyzed and optimized using CometBoards, a NASA GRC developed code. The reliability and efficiency of the OpenMDAO framework was compared and reported in this report.

Coroneos, Rula M.↗

Proximal Galerkin: A Structure-Preserving Finite Element Method for Pointwise Bound Constraints

The proximal Galerkin finite element method is a high-order, low iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of pointwise bound constraints in infinite-dimensional function spaces. This paper introduces the proximal Galerkin method and applies it to solve free boundary problems, enforce discrete maximum principles, and develop a scalable, mesh-independent algorithm for optimal design with pointwise bound constraints. This paper also introduces the latent variable proximal point (LVPP) algorithm, from which the proximal Galerkin method derives. When analyzing the classical obstacle problem, we discover that the underlying variational inequality can be replaced by a sequence of second-order partial differential equations (PDEs) that are readily discretized and solved with, e.g., the proximal Galerkin method. Throughout this work, we arrive at several contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and certain infinite-dimensional Lie groups; and (3) a gradient-based, bound-preserving algorithm for two-field, density-based topology optimization. The complete proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. Open-source implementations of our methods accompany this work to facilitate reproduction and broader adoption.

97 MATHEMATICS AND COMPUTING↗

A preliminary prediction of the (ν{sub 2} + ν{sub 4}) combination band of {sup 34}SF{sub 6}

Sulfur hexafluoride appears to be a species of growing importance in the field of atmospheric physics and chemistry as a pollutant that can contribute to the greenhouse effect. The infrared spectroscopy of SF6 is essential for quantitative measurements in the atmosphere, is still insufficiently known. In this work, we present a new contribution to this topic concerning (ν{sub 2}+ν{sub 4}) combination band. The prediction of this band is based on the tensorial formalism and vibrational extrapolation methods developed in Dijon. The effective Hamiltonian contains contribution from the ground state level GS, ν{sub 2} and ν{sub 4} witch are known from previous studies. The analysis has been performed using nonlinear least squares fit procedure included in the XTDS program to Jup=95.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PETSc/TAO Users Manual V.3.21

This manual describes the use of the Portable, Extensible Toolkit for Scientific Computation (PETSc) and the Toolkit for Advanced Optimization (TAO) for the numerical solution of partial differential equations (PDEs) and related problems on high-performance computers. PETSc/TAO is a suite of data structures and routines that provide the building blocks for implementing large-scale application codes on parallel (and serial) computers. PETSc uses the MPI standard for all distributed memory communication. PETSc/TAO includes a large suite of parallel linear solvers, nonlinear solvers, time integrators, and optimizers that may be used in application codes written in Fortran, C, C++, and Python (via petsc4py; see Getting Started ). The library is organized hierarchically, enabling users to employ the abstraction level most appropriate for a particular problem. By using techniques of object-oriented programming, PETSc provides enormous flexibility for users.

97 MATHEMATICS AND COMPUTING↗

A direct method for synthesizing low-order optimal feedback control laws with application to flutter suppression

A direct method of synthesizing a low-order optimal feedback control law for a high order system is presented. A nonlinear programming algorithm is employed to search for the control law design variables that minimize a performance index defined by a weighted sum of mean square steady state responses and control inputs. The controller is shown to be equivalent to a partial state estimator. The method is applied to the problem of active flutter suppression. Numerical results are presented for a 20th order system representing an aeroelastic wind-tunnel wing model. Low-order controllers (fourth and sixth order) are compared with a full order (20th order) optimal controller and found to provide near optimal performance with adequate stability margins.

Mukhopadhyay, V.↗

Parallel processors and nonlinear structural dynamics algorithms and software

Techniques are discussed for the implementation and improvement of vectorization and concurrency in nonlinear explicit structural finite element codes. In explicit integration methods, the computation of the element internal force vector consumes the bulk of the computer time. The program can be efficiently vectorized by subdividing the elements into blocks and executing all computations in vector mode. The structuring of elements into blocks also provides a convenient way to implement concurrency by creating tasks which can be assigned to available processors for evaluation. The techniques were implemented in a 3-D nonlinear program with one-point quadrature shell elements. Concurrency and vectorization were first implemented in a single time step version of the program. Techniques were developed to minimize processor idle time and to select the optimal vector length. A comparison of run times between the program executed in scalar, serial mode and the fully vectorized code executed concurrently using eight processors shows speed-ups of over 25. Conjugate gradient methods for solving nonlinear algebraic equations are also readily adapted to a parallel environment. A new technique for improving convergence properties of conjugate gradients in nonlinear problems is developed in conjunction with other techniques such as diagonal scaling. A significant reduction in the number of iterations required for convergence is shown for a statically loaded rigid bar suspended by three equally spaced springs.

Belytschko, Ted↗

Parallel solver for trajectory optimization search directions

A key algorithmic element of a real-time trajectory optimization hardware/software implementation is presented, the search step solver. This is one piece of an algorithm whose overall goal is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter or the National Aerospace Plane. Many methods of nonlinear programming require the solution of a quadratic program (QP) at each iteration to determine the search step. In the trajectory optimization case, the QP has a special dynamic programming structure. The algorithm exploits this special structure with a divide- and conquer type of parallel implementation. The algorithm solves a (p.N)-stage problem on N processors in O(p + log2 N) operations. The algorithm yields a factor of 8 speed-up over the fastest known serial algorithm when solving a 1024-stage test problem on 32 processors.

Psiaki, M. L.↗

Optimal Power Flow of Radial Networks and Its Variations: A Sequential Convex Optimization Approach

This paper proposes a sequential convex optimization method to solve broader classes of optimal power flow (OPF) problems over radial networks. The non-convex branch power flow equation is decomposed as a second-order cone inequality and a non-convex constraint involving the difference of two convex functions. Provided with an initial solution offered by an inexact second-order cone programming relaxation model, this approach solves a sequence of convexified penalization problems, where concave terms are approximated by linear functions and updated in each iteration. It could recover a feasible power flow solution, which usually appears to be very close, if not equal, to the global optimal one. Two variations of the OPF problem, in which non-cost related objectives are optimized subject to power flow constraints and the convex relaxation is generally inexact, are elaborated in detail. One is the maximum loadability problem, which is formulated as a special OPF problem that seeks the maximal distance to the boundary of power flow insolvability. The proposed method is shown to outperform commercial nonlinear solvers in terms of robustness and efficiency. The other is the bi-objective OPF problem. A non-parametric scalarization model is suggested, and is further reformulated as an extended OPF problem by convexifying the objective function. It provides a single trade-off solution without any subjective preference. The proposed computation framework also helps retrieve the Pareto front of the bi-objective OPF via the e-constraint method or the normal boundary intersection method. This paper also discusses extensions for OPF problems over meshed networks based on the semidefinite programming relaxation method.

bi-objective optimization↗

Application of symbolic/numeric matrix solution techniques to the NASTRAN program

The matrix solving algorithm of any finite element algorithm is extremely important since solution of the matrix equations requires a large amount of elapse time due to null calculations and excessive input/output operations. An alternate method of solving the matrix equations is presented. A symbolic processing step followed by numeric solution yields the solution very rapidly and is especially useful for nonlinear problems.

Buturla, E. M.↗

Elevated temperature crack growth

The objective of the Elevated Temperature Crack Growth Program is to evaluate proposed nonlinear fracture mechanics methods for application to hot section components of aircraft gas turbine engines. Progress during the past year included linear-elastic fracture mechanics data reduction on nonlinear crack growth rate data on Alloy 718. The bulk of the analytical work centered on thermal gradient problems and proposed fracture mechanics parameters. Good correlation of thermal gradient experimental displacement data and finite element prediction was obtained.

Malik, S. N.↗

The pEst version 2.1 user's manual

This report is a user's manual for version 2.1 of pEst, a FORTRAN 77 computer program for interactive parameter estimation in nonlinear dynamic systems. The pEst program allows the user complete generality in definig the nonlinear equations of motion used in the analysis. The equations of motion are specified by a set of FORTRAN subroutines; a set of routines for a general aircraft model is supplied with the program and is described in the report. The report also briefly discusses the scope of the parameter estimation problem the program addresses. The report gives detailed explanations of the purpose and usage of all available program commands and a description of the computational algorithms used in the program.

Murray, James E.↗

Development of an integrated BEM for hot fluid-structure interaction

A boundary element approach is developed for problems of hot fluid-structure interaction. The structure is idealized as a thermoelastic solid, and a time-domain, boundary-only integral formulation is described. Meanwhile, several approaches are discussed for the hot fluid. Integrals equations are developed for both compressible and incompressible thermoviscous flow. Due to the presence of nonlinear convective terms in the governing differential equations, domain discretization is generally required. However, with the introduction of reference velocities, volume modeling often can be confined to regions near obstacles and walls. All formulations are implemented for two-dimensional problems in GPO-BEST, a general purpose boundary element computer program. An overview of this numerical implementation is provided, along with several illustrative examples. The present fluid formulations are appropriate in the low to medium Reynolds number ranges; however, some enhancements required for higher speed simulations are noted.

Dargush, G. F.↗

NEUTRON-IRRADIATION–INDUCED DAMAGE ASSESSMENT IN CONCRETE USING COMBINED PHASE CHARACTERIZATION AND NONLINEAR FAST FOURIER TRANSFORM SIMULATION

Understanding irradiation effects in concrete cavities of light water reactors is critical to the long-term operation (60+ years) of US nuclear power plants. Susceptibility of concrete to neutron irradiation greatly varies as a function of its constituents: coarse aggregates, sand, and hardened cement paste (hcp). In particular, higher irradiation–susceptibility of aggregates was found to be a direct function of radiation-induced volumetric expansion (RIVE), or the propensity of aggregates to swell as a function of mineral contents, structures and textures. Irradiation-induced amorphization is accompanied by significant swelling, especially in silicates. For example, the maximum volumetric expansions of quartz and feldspars have been shown to be as large as ≈ 18% and ≈ 8%, respectively, while the change of density in calcite remains rather low (≈ 0.3–0.5%). High swelling is associated with a high number of covalent bonds (Si–O) and a high degree of polymerization of [SiO4] tetrahedrons. Differential RIVEs between rock-forming minerals cause high stresses and may potentially develop cracking within the aggregates at the interface between aggregates and the hcp and within the hcp. Modeling neutron-irradiation effects in concrete requires addressing the problem at a scale that captures both the details of the aggregates’ mineralogy and texture, which is <~ 100 μm, and the representative size of concrete, which is ~ 10 cm. This requires high-resolution, large mapping capabilities. To this end, the US Department of Energy (DOE) Light Water Reactor Sustainability (LWRS) Program developed an original tool suite called Microstructure Oriented Scientific Analysis of Irradiated Concrete (MOSAIC) in which Nonlinear 2D-fast Fourier transform (FFT) techniques are employed to model mechanical or irradiation-induced cracking of high-resolution complex microstructures derived from combined mapping techniques, including micro x-ray fluorescence (m-XRF), energy-dispersive x-ray spectroscopy (EDS), electron backscatter diffraction (EBSD), ellipsometry, and scanning electron microscopy (SEM). Irradiated mineral properties are derived from the Irradiated Minerals, Aggregate and Concrete (IMAC) database, which includes available relevant literature data. Rigorous coupled damage-creep simulations are obtained through sequential linear analysis. Illustrations of actual accelerated irradiation-damage propagation in a complex microstructures are presented herein.

Le Pape, Yann↗

A quasi-Newton approach to optimization problems with probability density constraints

A quasi-Newton method is presented for minimizing a nonlinear function while constraining the variables to be nonnegative and sum to one. The nonnegativity constraints were eliminated by working with the squares of the variables and the resulting problem was solved using Tapia's general theory of quasi-Newton methods for constrained optimization. A user's guide for a computer program implementing this algorithm is provided.

Tapia, R. A.↗

Three dimensional inelastic finite element analysis of laminated composites

Formulations of the inelastic response of laminated composites to thermal and mechanical loading are used as the basis for development of the computer NALCOM (Nonlinear Analysis of Laminated Composites) computer program which uses a fully three dimensional isoparametric finite element with 24 nodes and 72 degrees of freedom. An incremental solution is performed with nonlinearities introduced as pseudoloads computed for initial strains. Equilibrium iteration may be performed at every step. Elastic and elastic-plastic response of boron/epoxy and graphite/epoxy graphite/epoxy and problems of curing 0/90 sub s Gr/Ep laminates with and without circular holes are analyzed. Mechanical loading of + or - 45sub s Gr/Ep laminates is modeled and symmetry conditions which exist in angle-ply laminates are discussed. Results are compared to experiments and other analytical models when possible. All models are seen to agree reasonably well with experimetnal results for off-axis tensile coupons. The laminate analyses show the three dimensional effects which are present near holes and free corners.

Griffin, O. H., Jr.↗

Using Hough harmonics to validate and assess nonlinear shallow-water models

The implementation of a technique for locating programming errors in shallow-water codes, establishing the correctness of the code, and assessing the performance of the numerical model under various flow conditions is described. The right-hand side of the differential equations is modified in such a way that the exact solution of the nonlinear initial-value problem is known, so that the truncation errors of the numerical scheme can be studied in detail. The exact solution is prescribed to be any linear combination of Hough harmonics which propagate in time according to their natural frequencies.

Dee, Dick P.↗

TROJID: A portable software package for upper-stage trajectory optimization

Performance optimization for upper-stage exoatmospheric vehicles often is performed within the framework of a full capability trajectory simulation package requiring either a large mainframe computer or powerful work-station. Since these software packages tend to include capabilities providing for high-fidelity boost and reentry simulations, the programs usually are quite large and not very portable. The program TROJID is an attempt to provide an environment for the optimization of upper-stage trajectories within a small package capable of being run on a standard desktop microcomputer. Utilizing a state-of-the-art nonlinear programming algorithm and a trajectory simulator implementing impulsive burns and an analytic coast phase propagator, TROJID is capable of producing trajectories for optimal multi-burn upper-stage orbit transfers. The package has been designed to allow full generality in definition of both the trajectory simulator and the parameter optimization problem.

Hammes, Steven M.↗

Communications, Signal Processing, and Telemetering Research Program Review

A Communications, Signal Processing, and Telemetering Research Program Review was held on February 23, 1999. Research conducted under the grant was presented and reviewed, for progress, and for possible technology transfers. The research reviewed was in the following areas: (1) Bandwidth-efficient Modulation and nonlinear equalization; (2) Investigation of an architecture for parallel signal processing applicable to communications problems; (3)Coded partial response over satellites; (4) synchronization at Low SNR; (5) Serial concatenated convolutional codes and some implementation issues on high rate turbo codes; (6) Flight experiments; (7) Real time doppler tracking; (8) Space protocol testing; (9) Lightweight optical communications without carrying a laser in space. The presentations are given by the graduate students who performed the research.

Source record↗