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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Control-System Design Program

Control-theory design package, Optimal Regulator Algorithms for Control of Linear Systems (ORACLS), developed to aid in design of controllers and optimal filters for systems modeled by linear, time-invariant differential and difference equations. Optimal linear quadratic regulator theory, Linear-Quadratic-Gaussian (LQG) problem, most widely accepted method of determining optimal control policy. Provides for solution to time-in-variant continuous or discrete LQG problems. Attractive to control-system designer providing rigorous tool for dealing with multi-input and multi-output dynamic systems in continuous and discrete form. CDO version written in FORTRAN IV. VAX version written in FORTRAN 77.

Frisch, Harold P.↗
DOE OSTI2023

Mathematical solutions in internal dose assessment: A comparison of Python-based differential equation solvers in biokinetic modeling

Abstract In biokinetic modeling systems employed for radiation protection, biological retention and excretion have been modeled as a series of discretized compartments representing the organs and tissues of the human body. Fractional retention and excretion in these organ and tissue systems have been mathematically governed by a series of coupled first-order ordinary differential equations (ODEs). The coupled ODE systems comprising the biokinetic models are usually stiff due to the severe difference between rapid and slow transfers between compartments. In this study, the capabilities of solving a complex coupled system of ODEs for biokinetic modeling were evaluated by comparing different Python programming language solvers and solving methods with the motivation of establishing a framework that enables multi-level analysis. The stability of the solvers was analyzed to select the best performers for solving the biokinetic problems. A Python-based linear algebraic method was also explored to examine how the numerical methods deviated from an analytical or semi-analytical method. Results demonstrated that customized implicit methods resulted in an enhanced stable solution for the inhaled 60 Co (Type M) and 131 I (Type F) exposure scenarios for the inhalation pathway of the International Commission on Radiological Protection (ICRP) Publication 130 Human Respiratory Tract Model (HRTM). The customized implementation of the Python-based implicit solvers resulted in approximately consistent solutions with the Python-based matrix exponential method ( expm ). The differences generally observed between the implicit solvers and expm are attributable to numerical precision and the order of numerical approximation of the numerical solvers. This study provides the first analysis of a list of Python ODE solvers and methods by comparing their usage for solving biokinetic models using the ICRP Publication 130 HRTM and provides a framework for the selection of the most appropriate ODE solvers and methods in Python language to implement for modeling the distribution of internal radioactivity.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2022

Performance of an Astrophysical Radiation Hydrodynamics Code under Scalable Vector Extension Optimization

We present results of a performance study of an astrophysical radiation hydrodynamics code, V2D, on the Arm-based A64FX processor developed by Fujitsu. The code solves sparse linear systems, a task for which the A64FX architecture should be well suited. Here, we performed the performance analysis study on Ookami, an Apollo 80 platform utilizing the A64FX processor. We explored several compilers and performance anal-ysis packages and found the code did not perform as expected under scalable vector extension optimization, suggesting that a “deeper dive” into analyzing the code is worthwhile. However, a simple driver program that exercised basic sparse linear algebra routines used by V2D did show significant speedup with the use of the scalable vector extension optimization. We present the initial results from the study which used V2D on a relatively simple test problem that emphasized the repeated solution of sparse linear systems.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1972

Structural model optimization using statistical evaluation

The results of research in applying statistical methods to the problem of structural dynamic system identification are presented. The study is in three parts: a review of previous approaches by other researchers, a development of various linear estimators which might find application, and the design and development of a computer program which uses a Bayesian estimator. The method is tried on two models and is successful where the predicted stiffness matrix is a proper model, e.g., a bending beam is represented by a bending model. Difficulties are encountered when the model concept varies. There is also evidence that nonlinearity must be handled properly to speed the convergence.

Collins, J. D.↗
NASA NTRS1971

The synthesis of optimal controls for linear, time-optimal problems with retarded controls.

Optimization problems involving linear systems with retardations in the controls are studied in a systematic way. Some physical motivation for the problems is discussed. The topics covered are: controllability, existence and uniqueness of the optimal control, sufficient conditions, techniques of synthesis, and dynamic programming. A number of solved examples are presented.

Banks, H. T.↗
NASA NTRS1976

A computerized compensator design algorithm with launch vehicle applications

This short paper presents a computerized algorithm for the design of compensators for large launch vehicles. The algorithm is applicable to the design of compensators for linear, time-invariant, control systems with a plant possessing a single control input and multioutputs. The achievement of frequency response specifications is cast into a strict constraint mathematical programming format. An improved solution algorithm for solving this type of problem is given, along with the mathematical necessities for application to systems of the above type. A computer program, compensator improvement program (CIP), has been developed and applied to a pragmatic space-industry-related example.

Mitchell, J. R.↗
NASA NTRS1987

Numerical solution of turbulent flow past a backward facing step using a nonlinear K-epsilon model

The problem of turbulent flow past a backward facing step is important in many technological applications and has been used as a standard test case to evaluate the performance of turbulence models in the prediction of separated flows. It is well known that the commonly used kappa-epsilon (and K-l) models of turbulence yield inaccurate predictions for the reattachment points in this problem. By an analysis of the mean vorticity transport equation, it will be argued that the intrinsically inaccurate prediction of normal Reynolds stress differences by the Kappa-epsilon and K-l models is a major contributor to this problem. Computations using a new nonlinear kappa-epsilon model (which alleviates this deficiency) are made with the TEACH program. Comparisons are made between the improved results predicted by this nonlinear kappa-epsilon model and those obtained from the linear kappa-epsilon model as well as from second-order closure models.

Speziale, C. G.↗
NASA NTRS1988

Numerical solution of turbulent flow past a backward facing step using a nonlinear K-epsilon model

The problem of turbulent flow past a backward facing step is important in many technological applications and has been used as a standard test case to evaluate the performance of turbulence models in the prediction of separated flows. It is well known that the commonly used kappa-epsilon (and K-l) models of turbulence yield inaccurate predictions for the reattachment points in this problem. By an analysis of the mean vorticity transport equation, it will be argued that the intrinsically inaccurate prediction of normal Reynolds stress differences by the kappa-epsilon and K-l models is a major contributor to this problem. Computations using a new nonlinear Kappa-epsilon model (which alleviates this deficiency) are made with the TEACH program. Comparisons are made between the improved results predicted by this nonlinear kappa-epsilon model and those obtained from the linear kappa-epsilon model as well as from second-order closure models.

Speziale, C. G.↗
NASA NTRS1993

Extending substructure based iterative solvers to multiple load and repeated analyses

Direct solvers currently dominate commercial finite element structural software, but do not scale well in the fine granularity regime targeted by emerging parallel processors. Substructure based iterative solvers--often called also domain decomposition algorithms--lend themselves better to parallel processing, but must overcome several obstacles before earning their place in general purpose structural analysis programs. One such obstacle is the solution of systems with many or repeated right hand sides. Such systems arise, for example, in multiple load static analyses and in implicit linear dynamics computations. Direct solvers are well-suited for these problems because after the system matrix has been factored, the multiple or repeated solutions can be obtained through relatively inexpensive forward and backward substitutions. On the other hand, iterative solvers in general are ill-suited for these problems because they often must restart from scratch for every different right hand side. In this paper, we present a methodology for extending the range of applications of domain decomposition methods to problems with multiple or repeated right hand sides. Basically, we formulate the overall problem as a series of minimization problems over K-orthogonal and supplementary subspaces, and tailor the preconditioned conjugate gradient algorithm to solve them efficiently. The resulting solution method is scalable, whereas direct factorization schemes and forward and backward substitution algorithms are not. We illustrate the proposed methodology with the solution of static and dynamic structural problems, and highlight its potential to outperform forward and backward substitutions on parallel computers. As an example, we show that for a linear structural dynamics problem with 11640 degrees of freedom, every time-step beyond time-step 15 is solved in a single iteration and consumes 1.0 second on a 32 processor iPSC-860 system; for the same problem and the same parallel processor, a pair of forward/backward substitutions at each step consumes 15.0 seconds.

Farhat, Charbel↗
DOE OSTI2021

Measurement placement in electric power transmission and distribution grids: Review of concepts, methods, and research needs

Sensing and measurement systems are quintessential to the safe and reliable operation of electric power grids. Their strategic placement is of ultimate importance because it is not economically viable to install measurement systems on every node and branch of a power grid, though they need to be monitored. An overwhelming number of strategies have been developed to meet oftentimes multiple conflicting objectives. The prime challenge in formulating the problem lies in developing a heuristic or an optimisation model that, though mathematically tractable and constrained in cost, leads to trustworthy technical solutions. Further, large-scale, long-term deployments pose additional challenges because the boundary conditions change as technologies evolve. For instance, the advent of new technologies in sensing and measurement, as well as in communications and networking, might impact the cost and performance of available solutions and shift initially set conditions. Also, the placement strategies developed for transmission grids might not be suitable for distribution grids, and vice versa, because of unique characteristics; therefore, the strategies need to be flexible, to a certain extent, because no two power grids are alike. Despite the extensive literature on the present topic, the focus of published works tends to be on a specific subject, such as the optimal placement of measurements to ensure observability in transmission grids. There is a dearth of work providing a comprehensive picture for developing optimal placement strategies. Because of the ongoing efforts on the modernisation of electric power grids, there is a need to consolidate the status quo while exposing its limitations to inform policymakers, industry stakeholders, and researchers on the research-and-development needs to push the boundaries for innovation. Accordingly, this paper first reviews the state-of-the-art considering both transmission and distribution grids. Then, it consolidates the key factors to be considered in the problem formulation. Finally, it provides a set of perspectives on the measurement placement problem, and it concludes with future research directions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

Numerical integration of shell equations using the field method.

The 'field method' for the numerical solution of even-order linear boundary-value problems in ordinary differential equations is formulated. This method converts the boundary-value problem into two successive initial-value problems, which may be solved by standard forward integration techniques. The method has been implemented in a computer program to calculate the static response of ring-stiffened branched shells of revolution to asymmetric loads. For such problems the field method eliminates the well-known numerical problem of 'long subintervals' and also executes operations significantly faster than other numerical integration methods.

Cohen, G. A.↗
NASA NTRS1982

The role of modern control theory in the design of controls for aircraft turbine engines

The development, applications, and current research in modern control theory (MCT) are reviewed, noting the importance for fuel-efficient operation of turbines with variable inlet guide vanes, compressor stators, and exhaust nozzle area. The evolution of multivariable propulsion control design is examined, noting a basis in a matrix formulation of the differential equations defining the process, leading to state space formulations. Reports and papers which appeared from 1970-1982 which dealt with problems in MCT applications to turbine engine control design are outlined, including works on linear quadratic regulator methods, frequency domain methods, identification, estimation, and model reduction, detection, isolation, and accommodation, and state space control, adaptive control, and optimization approaches. Finally, NASA programs in frequency domain design, sensor failure detection, computer-aided control design, and plant modeling are explored

Zeller, J.↗
NASA NTRS1986

Experiments in software reliability - Life-critical applications

The paper discusses four reliability data gathering experiments which were conducted using a small sample of programs for two problems having ultrareliability requirements, n-version programming for fault detection, and repetitive run modeling for failure and fault rate estimation. The experimental results agree with those of Nagel and Skrivan in that the program error rates suggest an approximate log-linear pattern and the individual faults occurred with significantly different error rates. Additional analysis of the experimental data raises new questions concerning the phenomenon of interacting faults. This phenomenon may provide one explanation for software reliability decay. The fourth experiment underscored the difficulty in distinguishing between observations of deficiencies in the design of the algorithm and observations of software faults for real-time process control software. These experiments are a part of a program of serial experiments being pursued by the System Validation Methods of NASA-Langley Research Center to find a means of credibly performing reliability evaluations of flight control software.

Dunham, J. R.↗
NASA NTRS1987

Constrained optimization techniques for active control of aeroelastic response

Active control of aeroelastic response is a complex problem in which the designer usually tries to satisfy many design criteria which are often conflicting in nature. To further complicate the design problem, the state space equations describing this type of control problem are usually of high order, involving a large number of states to represent the flexible structure and unsteady aerodynamics. Control laws based on the standard Linear - Quadratic - Gaussian method are of the same high order as the aeroelastic plant and may be difficult to implement in the flight computer. To overcome this disadvantage a new approach was developed for designing low-order optimized robust control laws. In this approach, a nonlinear programming algorithm is used to search for the values of control law design variables that minimize a performance index while satisfying several inequality constraints that describe the design criteria on the stability robustness and responses. The method is applied to a gust load alleviation problem and a stability robustness improvement problem of a drone aircraft.

Mukhopadhyay, Vivekananda↗
DOE OSTI2021

Sequence of polyhedral relaxations for nonlinear univariate functions

Here, given a nonlinear, univariate, bounded, and differentiable function f(x), this article develops a sequence of Mixed Integer Linear Programming (MILP) and Linear Programming (LP) relaxations that converge to the graph of f(x) and its convex hull, respectively. Theoretical convergence of the sequence of relaxations to the graph of the function and its convex hull is established. For nonlinear non-convex optimization problems, the relaxations presented in this article can be used to construct tight MILP and LP relaxations. These MILP and the LP relaxations can also be used with MILP-based and spatial branch-and-bound based global optimization algorithms, respectively.

42 ENGINEERING↗
DOE OSTI2021

Improved Air-Conditioning Demand Response of Connected Communities over Individually Optimized Buildings

Connected communities potentially offer much greater demand response capabilities over singular building energy management systems (BEMS) through an increase of connectivity. The potential increase in benefits from this next step in connectivity is still under investigation, especially when applied to existing buildings. This work utilizes EnergyPlus simulation results on eight different commercial prototype buildings to estimate the potential savings on peak demand and energy costs using a mixed-integer linear programming model. This model is used in two cases: a fully connected community and eight separate buildings with BEMS. The connected community is optimized using all zones as variables, while the individual buildings are optimized separately and then aggregated. These optimization problems are run for a range of individual zone flexibility values. The results indicate that a connected community offered 60.0% and 24.8% more peak demand savings for low and high flexibility scenarios, relative to individually optimized buildings. Energy cost optimization results show only marginally better savings of 2.9% and 6.1% for low and high flexibility, respectively.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1976

Addition of higher order plate and shell elements into NASTRAN computer program

Two higher order plate elements, the linear strain triangular membrane element and the quintic bending element, along with a shallow shell element, suitable for inclusion into the NASTRAN (NASA Structural Analysis) program are described. Additions to the NASTRAN Theoretical Manual, Users' Manual, Programmers' Manual and the NASTRAN Demonstration Problem Manual, for inclusion of these elements into the NASTRAN program are also presented.

Narayanaswami, R.↗