Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear 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 631 records · Page 35

Survey and development of finite elements for nonlinear structural analysis. Volume 2: Nonlinear shell finite elements

The development of two new shell finite elements for applications to large deflection problems is considered. The elements in question are doubly curved and of triangular and quadrilateral planform. They are restricted to small strains of elastic materials, and can accommodate large rotations. The elements described, which are based on relatively simple linear elements, make use of a new displacement function approach specifically designed for strongly nonlinear problems. The displacement function development for nonlinear applications is based on certain beam element formulations, and the strain-displacement equations are of a shallow shell type. Additional terms were included in these equations in an attempt to avoid the large errors characteristic of shallow shell elements in certain types of problems. An incremental nonlinear solution procedure specifically adopted to the element formulation was developed. The solution procedure is of combined incremental and total Lagrangian type, and uses a new updating scheme. A computer program was written to evaluate the developed formulations. This program can accommodate small element groups in arbitrary arrangements. Two simple programs were successfully solved. The results indicate that this new type of element has definite promise and should be a fruitful area for further research.

Source record↗

Evaluation and Improvement of Liquid Propellant Rocket Chugging Analysis Techniques. Part 1: A One-Dimensional Analysis of Low Frequency Combustion Instability in the Fuel Preburner of the Space Shuttle Main Engine

Low frequency combustion instability, known as chugging, is consistently experienced during shutdown in the fuel and oxidizer preburners of the Space Shuttle Main Engines. Such problems always occur during the helium purge of the residual oxidizer from the preburner manifolds during the shutdown sequence. Possible causes and triggering mechanisms are analyzed and details in modeling the fuel preburner chug are presented. A linearized chugging model, based on the foundation of previous models, capable of predicting the chug occurrence is discussed and the predicted results are presented and compared to experimental work performed by NASA. Sensitivity parameters such as chamber pressure, fuel and oxidizer temperatures, and the effective bulk modulus of the liquid oxidizer are considered in analyzing the fuel preburner chug. The computer program CHUGTEST is utilized to generate the stability boundary for each sensitivity study and the region for stable operation is identified.

Lim, Kair Chuan↗

Modal forced vibration analysis of aerodynamically excited turbosystems

Theoretical aspects of a new capability to determine the vibratory response of turbosystems subjected to aerodynamic excitation are presented. Turbosystems such as advanced turbopropellers with highly swept blades, and axial-flow compressors and turbines can be analyzed using this capability. The capability has been developed and implemented in the April 1984 release of the general purpose finite element program NASTRAN. The dynamic response problem is addressed in terms of the normal modal coordinates of these tuned rotating cyclic structures. Both rigid and flexible hubs/disks are considered. Coriolis and centripetal accelerations, as well as differential stiffness effects are included. Generally non-uniform steady inflow fields and uniform flow fields arbitrarily inclined at small angles with respect to the axis of rotation of the turbosystem are considered sources of aerodynamic excitation. The spatial non-uniformities are considered to be small deviations from a principally uniform inflow. Subsonic and supersonic relative inflows are addressed, with provision for linearly interpolating transonic airloads.

Elchuri, V.↗

Applications of singular value analysis and partial-step algorithm for nonlinear orbit determination

An adaptive method in which cruise and nonlinear orbit determination problems can be solved using a single program is presented. It involves singular value decomposition augmented with an extended partial step algorithm. The extended partial step algorithm constrains the size of the correction to the spacecraft state and other solve-for parameters. The correction is controlled by an a priori covariance and a user-supplied bounds parameter. The extended partial step method is an extension of the update portion of the singular value decomposition algorithm. It thus preserves the numerical stability of the singular value decomposition method, while extending the region over which it converges. In linear cases, this method reduces to the singular value decomposition algorithm with the full rank solution. Two examples are presented to illustrate the method's utility.

Ryne, Mark S.↗

On the factorization of block-tridiagonals without storage constraints

In many programs solving difference equations, problem size is restricted by the number of available memory cells. A strategy has been developed to permit trade-offs between the number of floating point operations required and storage requirements for the solution of certain problems such as block tridiagonal systems of equations. This is done by recomputing some intermediate results instead of storing them. Reducing the storage to the square root of the current requirement will roughly double the number of computations. In theory, if m is the order of each sub-matrix in the block tridiagonal matrix, one can solve any linear system with only 5 sq m + 1 temporary storage cells. This method lends itself to efficient use on computers with parallel processing or vector processing architectures. On these computers the larger number of floating point operations is more than offset by the decrease in I/O and the increased percentage of vector operations made possible by this algorithm.

Merriam, M. L.↗

Comparison of aerobic fitness and space motion sickness during the Shuttle program

Space motion sickness (SMS) is an important problem for short-duration space flight; 71 percent of STS crewmembers develop SMS symptoms. The search for effective countermeasures and factors that correlate with sensitivity has been extensive. Recently, several investigators have linked aerobic fitness with motion sickness sensitivity in the 1-G or high-G environment. This paper compares the aerobic fitness of 125 Shuttle crewmembers with their SMS symptom category. Aerobic fitness data were obtained from the exercise tolerance test conducted nearest the time of launch. SMS data were derived from the medical debrief summaries. Mean maximum oxygen consumption values for crewmembers in four SMS categories (none, mild, moderate, severe) were 44.55, 44.08, 46.5, and 44.24 ml/kg per min, respectively. Scattergrams with linear regression analysis, comparing aerobic fitness and SMS symptom classification are presented. Correlation coefficients comparing SMS categories vs. aerobic fitness for men and women reveal no definite relationship between the two factors.

Jennings, Richard T.↗

Three-dimensional elastic-plastic finite-element analysis of fatigue crack propagation

Fatigue cracks are a major problem in designing structures subjected to cyclic loading. Cracks frequently occur in structures such as aircraft and spacecraft. The inspection intervals of many aircraft structures are based on crack-propagation lives. Therefore, improved prediction of propagation lives under flight-load conditions (variable-amplitude loading) are needed to provide more realistic design criteria for these structures. The main thrust was to develop a three-dimensional, nonlinear, elastic-plastic, finite element program capable of extending a crack and changing boundary conditions for the model under consideration. The finite-element model is composed of 8-noded (linear-strain) isoparametric elements. In the analysis, the material is assumed to be elastic-perfectly plastic. The cycle stress-strain curve for the material is shown Zienkiewicz's initial-stress method, von Mises's yield criterion, and Drucker's normality condition under small-strain assumptions are used to account for plasticity. The three-dimensional analysis is capable of extending the crack and changing boundary conditions under cyclic loading.

Goglia, G. L.↗

Disjunctive optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems

This paper proposes a new optimization model and algorithm for long-term capacity expansion planning of reliable power generation systems. The model optimizes both investment decisions (e.g., size, location, and time to install, retire and decommission facilities) and operation decisions (e.g., on/off status, operating capacity, and expected power output). It is also able to optimize reserve systems (or backup systems), as well as the main systems, to improve power systems reliability. An impact of operational strategies of generators (i.e., participating in electricity production vs. remaining as idle units during operation) on power systems reliability is considered. Probability of equipment failures and capacity failure states are used to rigorously estimate the power systems reliability depending on design and operation strategies. The optimization model is formulated with Generalized Disjunctive Programming (GDP), which is reformulated as a mixed-integer linear programming (MILP) model using the Hull relaxation. Two reliability-related penalties, such as downtime penalty and unmet demand penalty, are included in the objective function to maximize reliability while minimizing the total net present cost. Furthermore, a bilevel decomposition with tailored cuts is developed to reduce computational times of the multi-scale optimization model. The effectiveness of the proposed model is shown by comparing the results with the results obtained from the expansion planning models that do not explicitly consider reliability. In conclusion, we also show that the proposed bilevel decomposition is computationally efficient for solving large scale problems through 5-years and 10-years planning case studies.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

97 MATHEMATICS AND COMPUTING↗

pvplr-python: Python package implementation of PVplr for Performance Loss Rate (PLR) analysis

Due to software fragmentation, PV system modeling teams can be limited to language specific packages, preventing cross-sectional analysis of different modeling techniques and workflows. To this end, PVplr, a popular PV performance modeling R software package, has been ported to the Python programming language. To verify and test the robustness of the port, NSRDB data has been used to simulated PV installations at native resolution (~2 million Sites), with a variety of degradation rates, degradation patterns, and modules. Performance Ratios were calculated using the ported functions from pvplr-python and compared against Rdtools YoY values. Due to the complicated nature of degradation, a new metric has been proposed to quantify the performance loss of a system. The cumulative production loss, is the total amount of energy lost due to the degrading performance of the system. Cumulative production loss alleviates the problems with fitting linear functions to non-linear degradation. Cumulative Production loss was shown to better estimate the total lost revenue for non-linear degradation patterns. $XbX + UTC$ was found to most accurately predict the total lost revenue in simulated systems.

Kumar, Suraj↗

Overvoltage Prevention and Curtailment Reduction Using Adaptive Droop-Based Supplementary Control in Smart Inverters

Recent developments in the renewable energy sector have seen an unprecedented growth in residential photovoltaic (PV) installations. However, high PV penetration levels often lead to overvoltage problems in low-voltage (LV) distribution feeders. Smart inverter control such as active power curtailment (APC)-based overvoltage control can be implemented to overcome these challenges. The APC technique utilizes a constant droop-based approach which curtails power rigidly, which can lead to significant energy curtailment in the LV distribution feeders. In this paper, different variations of the APC technique with linear, quadratic, and exponential droops have been analyzed from the point-of-view of energy curtailment for a LV distribution network in North America. Further, a combinatorial approach using various droop-based APC methods in conjunction with adaptive dynamic programming (ADP) as a supplementary control scheme has also been proposed. The proposed approach minimizes energy curtailment in the LV distribution network by adjusting the droop gains. Simulation results depict that ADP in conjunction with exponential droop reduces the energy curtailment to approximately 50% compared to using the standard linear droop.

42 ENGINEERING↗

Synthesis of multiple shaped beam antenna patterns

Results are presented of research into the problem of finding an excitation of a given antenna such that the desired radiation pattern is approximated to within acceptable limits. This is to be done in such a fashion that boundary conditions involving hardware limitations may be inserted into the problem. The intended application is synthesis of multiple shaped beam antennas. Since this is perhaps the most difficult synthesis problem an antenna engineer is likely to encounter, the approach taken was to include as a by-product capability for synthesizing simpler patterns. The synthesis technique has been almost totally computerized. The class of antennas which may be synthesized with the computer program are those which may be represented as planar (continuous or discrete) current distributions. The technique is not limited in this sense and could indeed by extended to include, for example, the synthesis of conformal arrays or current distributions on the surface of reflectors. The antenna types which the program is set up to synthesize are: line source, rectangular aperture, circular aperture, linear array, rectangular array, and arbitrary planar array.

Stutzman, W. L.↗

Sensitivity Analysis of Flutter Response of a Wing Incorporating Finite-Span Corrections

Flutter analysis of a wing is performed in compressible flow using state-space representation of the unsteady aerodynamic behavior. Three different expressions are used to incorporate corrections due to the finite-span effects of the wing in estimating the lift-curve slope. The structural formulation is based on a Rayleigh-Pitz technique with Chebyshev polynomials used for the wing deflections. The aeroelastic equations are solved as an eigen-value problem to determine the flutter speed of the wing. The flutter speeds are found to be higher in these cases, when compared to that obtained without accounting for the finite-span effects. The derivatives of the flutter speed with respect to the shape parameters, namely: aspect ratio, area, taper ratio and sweep angle, are calculated analytically. The shape sensitivity derivatives give a linear approximation to the flutter speed curves over a range of values of the shape parameter which is perturbed. Flutter and sensitivity calculations are performed on a wing using a lifting-surface unsteady aerodynamic theory using modules from a system of programs called FAST.

Issac, Jason Cherian↗

Systems identification using a modified Newton-Raphson method: A FORTRAN program

A FORTRAN program is offered which computes a maximum likelihood estimate of the parameters of any linear, constant coefficient, state space model. For the case considered, the maximum likelihood estimate can be identical to that which minimizes simultaneously the weighted mean square difference between the computed and measured response of a system and the weighted square of the difference between the estimated and a priori parameter values. A modified Newton-Raphson or quasilinearization method is used to perform the minimization which typically requires several iterations. A starting technique is used which insures convergence for any initial values of the unknown parameters. The program and its operation are described in sufficient detail to enable the user to apply the program to his particular problem with a minimum of difficulty.

Taylor, L. W., Jr.↗

Juqbox.jl

The Juqbox.jl package implements functionality for solving the quantum optimal control problem for realizing logical gates in closed quantum systems. The dynamics of the quantum system is modeled by Schroedinger's equation, which takes to form of a linear system of ordinary differential equations (ODE). Juqbox.jl solves this ODE by numerical time stepping and applies a gradient-based optimization technique to determine control pulses for driving an initial state to a final state, according to the desired logical gate transformation. To evaluate the gradient, Juqbox.jl applies the ``first discretize, then optimize'' approach based on a discrete adjoint time stepping technique. The actual optimization is performed by the open source Ipopt libaray. Juqbox.jl is written in the Julia programming language which, among many other features, provides a convenient interface to the Ipopt library.

PETERSSON, NILSA.↗

Cascade Optimization for Aircraft Engines With Regression and Neural Network Analysis - Approximators

The NASA Engine Performance Program (NEPP) can configure and analyze almost any type of gas turbine engine that can be generated through the interconnection of a set of standard physical components. In addition, the code can optimize engine performance by changing adjustable variables under a set of constraints. However, for engine cycle problems at certain operating points, the NEPP code can encounter difficulties: nonconvergence in the currently implemented Powell's optimization algorithm and deficiencies in the Newton-Raphson solver during engine balancing. A project was undertaken to correct these deficiencies. Nonconvergence was avoided through a cascade optimization strategy, and deficiencies associated with engine balancing were eliminated through neural network and linear regression methods. An approximation-interspersed cascade strategy was used to optimize the engine's operation over its flight envelope. Replacement of Powell's algorithm by the cascade strategy improved the optimization segment of the NEPP code. The performance of the linear regression and neural network methods as alternative engine analyzers was found to be satisfactory. This report considers two examples-a supersonic mixed-flow turbofan engine and a subsonic waverotor-topped engine-to illustrate the results, and it discusses insights gained from the improved version of the NEPP code.

Patnaik, Surya N.↗

Development of a moderately sized finite element program for nonlinear structural analysis

AGGIE 1 is a computer program for predicting the linear and nonlinear, static and dynamic structural response of two- and three-dimensional continuum solids. The program is based on isoparametric finite elements and allows for 2-D plane stress, plane strain, and axisymmetric analyses and general 3-D analyses. Large strain kinematics is based on the total Lagrangian formulation. Materially nonlinear models include several elastic-plastic work-hardening models as well as an incompressible Mooney-Rivlin model. Included in this report is a brief description of the theoretical bases of the program, the material models used, the element library and the overall program organization. Instructions for data input preparation are given in detail. Several sample problems are given along with the required program input and program generated solutions.

Haisler, W. E.↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗