Comment on 'Optimal control via mathematical programming'
Explore the source record for details and available documents.
Wood, L. J.↗
SEARCH · Engineering Papers
Results for “mathematical programming”
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.
Nonoscillatory solution of the steady-state inviscid Burgers' equation by mathematical programming
In order to obtain the physically relevant discontinuous numerical solution, the steady-state inviscid Burgers' equation is singularly perturbed through the addition of a small amount of viscosity. A 'cell-centered' finite-difference scheme is proposed which employs two points for the inviscid part and four points for the viscous one. While difficulties are experienced in the capture of interior layers centered at node points, computational results for interior layers centered between node points, and for boundary layers, exhibit accurate nonoscillatory solutions whose discontinuities are captured in one cell on both coarse and fine grids.
Lavery, John E.↗
Calculation of shocked one-dimensional flows on abruptly changing grids by mathematical programming
Cell-centered finite differences on cells of an arbitrarily spaced grid are presently used to discretize the steady-state inviscid and nearly inviscid Burgers' equations for steady-state shocked flow in a quasi-one-dimensional nozzle. The everdetermined system of nonlinear algebraic equations thus obtained is solved by a procedure which minimizes a weighted sum of the residuals' absolute values. Numerical solutions for both viscous and inviscid problems are accurate and nonoscillatory, on grids whose abrupt mesh lengths refinements are as great as a factor of 10,000.
Lavery, John E.↗
Solution of steady-state, two-dimensional conservation laws by mathematical programming
A truly two-dimensional algorithm is created for solving the steady-state two-dimensional conservation-law problem. An overdetermined system of algebraic equations is obtained through discretization by finite-volume formulas. These equations are perturbed nonsingularly and are solved by an efficient geometrically oriented l(1) procedure. The basic algorithm and the theory for the linear case f(u) = u are presented, and computational results for the nonlinear case f(u) = sq u are also analyzed. It is noted that the l(1) procedure captures boundary shocks as well as oblige and zigzag interior shocks in bands that are one cell wide, and the solution values are accurate up to the edge of the shock.
Lavery, John E.↗
Mathematical computer programs - Compilation
Mathematical programs and programming techniques for digital computer operations
DIGITAL COMPUTER↗
Short description of mathematical support programs for space experiments in the Interkosmos program
A synopsis of programs of mathematical support designed at the Institute for Cosmic Research of the USSR Academy of Sciences for cosmic experiments being conducted in the Interkosmos Program is presented. A short description of the appropriate algorithm is given.
Elyasberg, P. Y.↗
SURE reliability analysis: Program and mathematics
The SURE program is a new reliability analysis tool for ultrareliable computer system architectures. The computational methods on which the program is based provide an efficient means for computing accurate upper and lower bounds for the death state probabilities of a large class of semi-Markov models. Once a semi-Markov model is described using a simple input language, the SURE program automatically computes the upper and lower bounds on the probability of system failure. A parameter of the model can be specified as a variable over a range of values directing the SURE program to perform a sensitivity analysis automatically. This feature, along with the speed of the program, makes it especially useful as a design tool.
Butler, Ricky W.↗
The Fault Tree Compiler (FTC): Program and mathematics
The Fault Tree Compiler Program is a new reliability tool used to predict the top-event probability for a fault tree. Five different gate types are allowed in the fault tree: AND, OR, EXCLUSIVE OR, INVERT, AND m OF n gates. The high-level input language is easy to understand and use when describing the system tree. In addition, the use of the hierarchical fault tree capability can simplify the tree description and decrease program execution time. The current solution technique provides an answer precisely (within the limits of double precision floating point arithmetic) within a user specified number of digits accuracy. The user may vary one failure rate or failure probability over a range of values and plot the results for sensitivity analyses. The solution technique is implemented in FORTRAN; the remaining program code is implemented in Pascal. The program is written to run on a Digital Equipment Corporation (DEC) VAX computer with the VMS operation system.
Butler, Ricky W.↗
Approximation concepts for efficient structural synthesis
It is shown that efficient structural synthesis capabilities can be created by using approximation concepts to mesh finite element structural analysis methods with nonlinear mathematical programming techniques. The history of the application of mathematical programming techniques to structural design optimization problems is reviewed. Several rather general approximation concepts are described along with the technical foundations of the ACCESS 1 computer program, which implements several approximation concepts. A substantial collection of structural design problems involving truss and idealized wing structures is presented. It is concluded that since the basic ideas employed in creating the ACCESS 1 program are rather general, its successful development supports the contention that the introduction of approximation concepts will lead to the emergence of a new generation of practical and efficient, large scale, structural synthesis capabilities in which finite element analysis methods and mathematical programming algorithms will play a central role.
Schmit, L. A., Jr.↗
A new structural analysis/synthesis capability - ACCESS
The creation of an efficient automated capability for minimum weight design of structures is reported. The ACCESS 1 computer program combines finite element analysis techniques and mathematical programming algorithms using an innovative collection of approximation concepts. Design variable linking, constraint deletion techniques and approximate analysis methods are used to generate a sequence of small explicit mathematical programming problems which retain the essential features of the design problem. Organization of the finite element analysis is carefully matched to the design optimization task. The efficiency of the ACCESS 1 program is demonstrated by giving results for several example problems.
Schmit, L. A.↗
Minority Engineering Program Pipeline: A Proposal to Increase Minority Student Enrollment and Retention in Engineering
The Cleveland State University Minority Engineering Program Pipeline consist of programs which foster engineering career awareness, academic enrichment, and professional development for historically underrepresented minority studies. The programs involved are the Access to Careers in Engineering (ACE) Program for high school pre-engineering students: the LINK Program for undergraduate students pursuing degree which include engineering; and the PEP (Pre-calculus Enrichment Program) and EPIC (Enrichment Program in Calculus) mathematics programs for undergraduate academic enrichment. The pipeline is such that high school graduates from the ACE Program who enroll at Cleveland State University in pursuit of engineering degrees are admitted to the LINK Program for undergraduate level support. LINK Program students are among the minority participants who receive mathematics enrichment through the PEP and EPIC Programs for successful completion of their engineering required math courses. THese programs are interdependent and share the goal of preparing minority students for engineering careers by enabling them to achieve academically and obtain college degree and career related experience.
Charity, Pamela C.↗
A description of a system of programs for mathematically processing on unified series (YeS) computers photographic images of the Earth taken from spacecraft
A description of a batch of programs for the YeS-1040 computer combined into an automated system for processing photo (and video) images of the Earth's surface, taken from spacecraft, is presented. Individual programs with the detailed discussion of the algorithmic and programmatic facilities needed by the user are presented. The basic principles for assembling the system, and the control programs are included. The exchange format within whose framework the cataloging of any programs recommended for the system of processing will be activated in the future is displayed.
Zolotukhin, V. G.↗
New computer system simplifies programming of mathematical equations
Automatic Mathematical Translator /AMSTRAN/ permits scientists or engineers to enter mathematical equations in their natural mathematical format and to obtain an immediate graphical display of the solution. This automatic-programming, on-line, multiterminal computer system allows experienced programmers to solve nonroutine problems.
Reinfelds, J.↗
A comparison of two types of structural optimization procedures for satisfying flutter requirements
A comparison is made of results obtained from mathematical programming and optimality criteria procedures for the minimum-mass design of typical aircraft wing structures to satisfy prescribed flutter requirements. The mathematical programming method is based on an interior penalty function approach. A rigorous optimality criterion and an intuitive optimality criterion based on uniform strain energy density are considered. An intuitive resizing procedure is used for both optimality criterion solutions. All results are calculated using the same computer program, changing only the optimization procedure. Both high- and low-aspect-ratio wings are examined. Finite elements are used for structural modeling, and the generalized coordinates for the flutter solution are based on the natural vibration modes of the structure.
Haftka, R. T.↗
Scenario Complexity for Unmanned Aircraft System Traffic
This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time applications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.
UTM↗
Scenario Complexity for Unmanned Aircraft System Traffic
This work introduces an approach to estimate the complexity of a low-altitude air traffic scenario involving multiple UASs using mathematical programming. Given a set of multi-point UAS flight trajectories, vehicle dynamics, and a conflict resolution algorithm, an abstract model is developed such that it can be solved quickly using a mathematical programming optimization software without running high-fidelity simulations that can be computationally expensive and may not suit real-time apA quick and accurate assessment of complexity for a given traffic scenario can help plan and schedule flights to alleviate traffic bottleneck and mitigate operation risks, especially for unmanned aerial system traffic management where high traffic density or complexity is expected. This work introduces a traffic scenario complexity metric that was constructed based on the number of potential conflicts weighted by the conflict resolution cost associated. The cost associated with a conflict is calculated based on the corresponding conflict resolution maneuvers. To obtain the conflict resolution maneuvers, a MILP-based optimization was formulated with the vehicle model and conflict management parameters incorporated. To evaluate the complexity metrics, an approach of using measurements from high-fidelity simulations was proposed. The scenario complexity measurements for 920 random-generated scenarios were obtained through high-fidelity simulations and treated as the ground truth. Two statistics methods: Pearson and Alternative Conditional Expectations were applied for analysis. The results showed that the number of flights has low correlation with the scenario complexity according to the correlation coefficients calculated by both methods. The Alternative Conditional Expectations method shows that the proposed scenario complexity metric has better correlation with the ground truth than the number of potential conflicts.plications. In the abstract model, each vehicle is represented by a time-varied vector associated with position, speed, and heading information. The total extra distance that aircraft need to divert from their original routes to avoid collisions is computed and used to setup a quadratic programming formula. The metrics including the number of conflicts and extra distances travelled by all vehicles are then utilized to estimate the complexity of a given UAS flight scenario. Results and verification against high-fidelity simulations will be provided in the final draft.
traffic complexity↗
Weight minimization of structures for fixed flutter speed via an optimality criterion
A rigorous optimality criterion is derived and a hybrid weight-reduction algorithm developed for the weight minimization of lifting surfaces with a constraint on flutter speed. The weight-reduction algorithm incorporates a simple recursion formula derived from the optimality criterion. Monotonic weight reduction is accomplished by dynamically adjusting a parameter in the recursion formula so as to achieve a predetermined weight decrease. The algorithm thus combines the simplicity of optimality-criterion methods with the convergence characteristics of mathematical-programming methods. The imposition of the flutter constraint is simplified by forcing to zero the imaginary part of the flutter eigenvalue, with the airspeed fixed. Four examples are discussed. The results suggest that significant improvements in efficiency are possible, in comparison with techniques based purely on mathematical programming.
Segenreich, S. A.↗
Modified Fully Utilized Design (MFUD) Method for Stress and Displacement Constraints
The traditional fully stressed method performs satisfactorily for stress-limited structural design. When this method is extended to include displacement limitations in addition to stress constraints, it is known as the fully utilized design (FUD). Typically, the FUD produces an overdesign, which is the primary limitation of this otherwise elegant method. We have modified FUD in an attempt to alleviate the limitation. This new method, called the modified fully utilized design (MFUD) method, has been tested successfully on a number of designs that were subjected to multiple loads and had both stress and displacement constraints. The solutions obtained with MFUD compare favorably with the optimum results that can be generated by using nonlinear mathematical programming techniques. The MFUD method appears to have alleviated the overdesign condition and offers the simplicity of a direct, fully stressed type of design method that is distinctly different from optimization and optimality criteria formulations. The MFUD method is being developed for practicing engineers who favor traditional design methods rather than methods based on advanced calculus and nonlinear mathematical programming techniques. The Integrated Force Method (IFM) was found to be the appropriate analysis tool in the development of the MFUD method. In this paper, the MFUD method and its optimality are presented along with a number of illustrative examples.
Patnaik, Surya↗