Interactive Program Debugging and Optimization for Directive-Based, Efficient GPU Computing
Explore the source record for details and available documents.
SEARCH · Engineering Papers
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.
Explore the source record for details and available documents.
Not provided.
An optimal atmospheric flight branched trajectory-shaping capability is presented based on the Davidon-Fletcher-Powell variable metric parameter optimization technique. Gradient information is generated using finite difference methods. A typical atmospheric flight branched optimization problem is analyzed which requires the determination of 31 parameters. This parameter set includes the three-dimensional description of vehicle attitude control angles for three branches of flight: first-stage ascent, second-stage ascent, and first-stage flyback. The important inflight inequality contraints required to maintain the integrity of the vehicles are considered. Some of the numerical methods employed are discussed, along with several new auxiliary techniques developed to improve the compatibility of the numerical gradient and iterator.
The goal of reduction of space system costs is pursued in the areas of standardization of subsystem test requirements as well as overall subsystem test program resource requirements. A number of standard components are being developed by NASA. The rationale for the various environmental tests applicable to future missions and launch vehicles is discussed. The need for and approach to developing standard component specifications is presented. In addition, a method for reduction of test expenditures utilizing indexes of mission effect and hardware history as indicators of test requirements is proposed.
Two possible ways to minimize the effects of deconditioning in space are; To achieve a very high level of conditioning immediately prior to flight, and to provide a regimen in the capsule which will maintain a moderate degree of fitness. It was determined that running and riding a bicycle ergometer at comparable heart rates produced similar gains in physical fitness variables. It was found that subjects who exercised at a 180 heart rate made greater gains in physical fitness than did those exercising at a 140 or 160 heart rate. When the length of the workout was varied, subjects exercising sixty minutes per day made greater gains than those exercising twenty or forty minutes per day. Subjects who discontinued training slowly deconditioned, but a moderate level of fitness could be maintained by exercising at a pulse rate of 160 beats per minute for twenty minute periods three times a week. Subjects who overtrained twice daily to near exhaustion increased in fitness.
The input, output and subroutines, including listings, for the SUNSPOT code are described. SUNSPOT can calculate time optimal planetocentric trajectories including orbit-to-orbit transfer and orbit to a subescape point. Trajectories about the the four inner planets can be calculated, and shadowing, oblateness, and solar motion may be included. A penalty function may be included to prevent trajectories which intersect the planet's surface.
FAST project-management software tool designed to optimize sequence of assembly of Space Station Freedom. Assesses effects of detailed changes upon system and produces output metrics identifying preferred assembly sequences. Incorporates Space-Shuttle integration, Space-Station hardware, on-orbit operations, and governing programmatic considerations as either precedence relations or numerical data. Written in C language.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
The paper describes a computer programming system designed to be used for methodology research as well as applications in structural optimization. The flexibility necessary for such diverse utilizations is achieved by combining, in a modular manner, a state-of-the-art optimization program, a production level structural analysis program, and user supplied and problem dependent interface programs. Standard utility capabilities existing in modern computer operating systems are used to integrate these programs. This approach results in flexibility of the optimization procedure organization and versatility in the formulation of contraints and design variables. Features shown in numerical examples include: (1) variability of structural layout and overall shape geometry, (2) static strength and stiffness constraints, (3) local buckling failure, and (4) vibration constraints. The paper concludes with a review of the further development trends of this programing system.
Six blendstocks identified by the Co-Optimization of Fuels & Engines Program were used to prepare fuel blends using a fixed blendstock for oxygenate blending and a target RON of 97. The blendstocks included ethanol, n-propanol, isopropanol, isobutanol, diisobutylene, and a bioreformate surrogate. The blends were analyzed and used to establish interaction factors for a non-linear molar blending model that was used to predict RON and MON of volumetric blends of the blendstocks up to 35 vol%. Projections of efficiency increase, volumetric fuel economy increase, and tailpipe CO2 emissions decrease were produced using two different estimation techniques to evaluate the potential benefits of the blendstocks. Ethanol was projected to provide the greatest benefits in efficiency and tailpipe CO2 emissions, but at intermediate levels of volumetric fuel economy increase over a smaller range of blends than other blendstocks. A bioreformate surrogate blendstock was projected to provide the greatest increase in volumetric fuel economy and the lowest increase in efficiency. Tailpipe CO2 emissions for blends of the bioreformate surrogate were higher at all blend levels compared to the baseline E10 fuel.
This report summarizes the work performed under the project project Next-Generation Algorithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for infrastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years of Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasible region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality constraints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.
In this presentation, I would like to review historical perspective on the program architecture used to build design optimization capabilities based on mathematical programming and other numerical search techniques. It is rather straightforward to classify the program architecture in three categories as shown above. However, the relative importance of each of the three approaches has not been static, instead dynamically changing as the capabilities of available computational resource increases. For example, we considered that the direct coupling architecture would never be used for practical problems, but availability of such computer systems as multi-processor. In this presentation, I would like to review the roles of three architecture from historical as well as current and future perspective. There may also be some possibility for emergence of hybrid architecture. I hope to provide some seeds for active discussion where we are heading to in the very dynamic environment for high speed computing and communication.
The increasing integration of renewable energy and rising electricity demand highlight the importance of battery energy storage systems for peak shaving and demand response. Unlike prior approaches that overlook operational impacts on degradation, this study proposes a Bayesian Optimization–Mixed Integer Linear Programming framework for optimal battery energy storage system sizing. In this framework, Mixed Integer Linear Programming determines short-term scheduling while a calibrated electrochemical model iteratively evaluates degradation. The central hypothesis is that the framework can efficiently identify optimal sizes that yield realistic and economically robust outcomes. The method is tested across three scenarios: peak shaving, peak shaving with energy-reduction demand response, and peak shaving with power-reduction demand response. Results show that the framework converge to the optimum within 20 iterations out of 150 possible sizes. Under baseline conditions, the framework consistently selects the smallest feasible system, minimizing unnecessary degradation costs from oversized storage. Sensitivity analyses reveal that larger systems are favored as demand rates or incentives increase. Comparisons of demand response programs indicate that power-reduction demand response offers greater economic benefits than energy-reduction demand response, although demand savings from peak shaving remain the dominant contributor to overall performance. This study demonstrates that the proposed framework balances computational tractability with degradation fidelity, identifies critical economic thresholds for investment, and offers a practical, flexible tool to guide industrial stakeholders in cost-effective battery energy storage system deployment.
Differential dynamic programming algorithm for discrete time orbit transfer optimization
Low-thrust trajectories about planetary bodies characteristically span a high count of orbital revolutions. Directing the thrust vector over many revolutions presents a challenging optimization problem for any conventional strategy. This paper demonstrates the tractability of low-thrust trajectory optimization about planetary bodies by applying a Sundman transformation to change the independent variable of the spacecraft equations of motion to the eccentric anomaly and performing the optimization with differential dynamic programming. Fuel-optimal geocentric transfers are shown in excess of 1000 revolutions while subject to Earths J2 perturbation and lunar gravity.