Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational graph”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Computer vision research at Marshall Space Flight Center

Orbital docking, inspection, and sevicing are operations which have the potential for capability enhancement as well as cost reduction for space operations by the application of computer vision technology. Research at MSFC has been a natural outgrowth of orbital docking simulations for remote manually controlled vehicles such as the Teleoperator Retrieval System and the Orbital Maneuvering Vehicle (OMV). Baseline design of the OMV dictates teleoperator control from a ground station. This necessitates a high data-rate communication network and results in several seconds of time delay. Operational costs and vehicle control difficulties could be alleviated by an autonomous or semi-autonomous control system onboard the OMV which would be based on a computer vision system having capability to recognize video images in real time. A concept under development at MSFC with these attributes is based on syntactic pattern recognition. It uses tree graphs for rapid recognition of binary images of known orbiting target vehicles. This technique and others being investigated at MSFC will be evaluated in realistic conditions by the use of MSFC orbital docking simulators. Computer vision is also being applied at MSFC as part of the supporting development for Work Package One of Space Station Freedom.

Vinz, Frank L.↗
NASA NTRS1984

The ZnSe(110) puzzle - Comparison with GaAs(110)

The surface structure of monocrystalline ZnSe(110) and of 4-5-nm-thick ZnSe(110) layers epitaxially grown on GaAs(110) is investigated by means of elastic LEED and AES; the results are analyzed using the computer programs and R-factor methods of Duke et al. (1981 and 1983), presented in graphs and tables, and compared to those for GaAs(110). Significant differences are attributed to bond-length-conserving outward rotation of Se and inward rotation of Zn in the top layer, with an angle of 4 deg between the actual plane of the cation-anion chain and the truncated bulk surface. The R intensities measured for ZnSe(110) and GaAs(110) are given as Rx = 0.22 and RI = 0.21 and Rx = 0.24 and RI = 0.16, respectively.

Duke, C. B.↗
NASA NTRS1987

Non-linear analysis of symmetric structures with unsymmetric boundary conditions

Two computational techniques are developed analytically to generate global approximation vectors for use in the nonlinear large-deflection analysis of symmetric structures with asymmetric boundary conditions. One method is based on linear combinations of FEM-generated symmetric and antisymmetric vector components, while the other employs a preconditioned-conjugate-gradient technique. The derivation of the procedures is explained in detail, and their effectiveness is evaluated in sample computations for an elliptic toroid and a cylindrical panel; the results are presented in tables and graphs and characterized.

Noor, Ahmed K.↗
NASA NTRS1990

A nonrecursive order N preconditioned conjugate gradient: Range space formulation of MDOF dynamics

While excellent progress has been made in deriving algorithms that are efficient for certain combinations of system topologies and concurrent multiprocessing hardware, several issues must be resolved to incorporate transient simulation in the control design process for large space structures. Specifically, strategies must be developed that are applicable to systems with numerous degrees of freedom. In addition, the algorithms must have a growth potential in that they must also be amenable to implementation on forthcoming parallel system architectures. For mechanical system simulation, this fact implies that algorithms are required that induce parallelism on a fine scale, suitable for the emerging class of highly parallel processors; and transient simulation methods must be automatically load balancing for a wider collection of system topologies and hardware configurations. These problems are addressed by employing a combination range space/preconditioned conjugate gradient formulation of multi-degree-of-freedom dynamics. The method described has several advantages. In a sequential computing environment, the method has the features that: by employing regular ordering of the system connectivity graph, an extremely efficient preconditioner can be derived from the 'range space metric', as opposed to the system coefficient matrix; because of the effectiveness of the preconditioner, preliminary studies indicate that the method can achieve performance rates that depend linearly upon the number of substructures, hence the title 'Order N'; and the method is non-assembling. Furthermore, the approach is promising as a potential parallel processing algorithm in that the method exhibits a fine parallel granularity suitable for a wide collection of combinations of physical system topologies/computer architectures; and the method is easily load balanced among processors, and does not rely upon system topology to induce parallelism.

Kurdila, Andrew J.↗
NASA NTRS1952

Calculation of the lateral-dynamic stability of aircraft

Graphs and formulas are given with the aid of which all the aerodynamic coefficients required for computing the lateral dynamic stability can be determined. A number of numerical examples are given for obtaining the stability derivatives and solving the characteristic-stability equation. Approximate formulas are derived with the aid of which rapid preliminary computations may be made and the stability coefficients corrected for certain modifications of the airplane. A derivation of the lateral-dynamic-stability equations is included.

STABILITY, LATERAL - DYNAMIC↗
NASA NTRS1973

Computer user's manual for a generalized curve fit and plotting program

A FORTRAN coded program has been developed for generating plotted output graphs on 8-1/2 by 11-inch paper. The program is designed to be used by engineers, scientists, and non-programming personnel on any IBM 1130 system that includes a 1627 plotter. The program has been written to provide a fast and efficient method of displaying plotted data without having to generate any additions. Various output options are available to the program user for displaying data in four different types of formatted plots. These options include discrete linear, continuous, and histogram graphical outputs. The manual contains information about the use and operation of this program. A mathematical description of the least squares goodness of fit test is presented. A program listing is also included.

Schlagheck, R. A.↗
NASA NTRS2013

Science Opportunity Analyzer (SOA) Version 8

SOA allows scientists to plan spacecraft observations. It facilitates the identification of geometrically interesting times in a spacecraft s orbit that a user can use to plan observations or instrument-driven spacecraft maneuvers. These observations can then be visualized multiple ways in both two- and three-dimensional views. When observations have been optimized within a spacecraft's flight rules, the resulting plans can be output for use by other JPL uplink tools. Now in its eighth major version, SOA improves on these capabilities in a modern and integrated fashion. SOA consists of five major functions: Opportunity Search, Visualization, Observation Design, Constraint Checking, and Data Output. Opportunity Search is a GUI-driven interface to existing search engines that can be used to identify times when a spacecraft is in a specific geometrical relationship with other bodies in the solar system. This function can be used for advanced mission planning as well as for making last-minute adjustments to mission sequences in response to trajectory modifications. Visualization is a key aspect of SOA. The user can view observation opportunities in either a 3D representation or as a 2D map projection. Observation Design allows the user to orient the spacecraft and visualize the projection of the instrument field of view for that orientation using the same views as Opportunity Search. Constraint Checking is provided to validate various geometrical and physical aspects of an observation design. The user has the ability to easily create custom rules or to use official project-generated flight rules. This capability may also allow scientists to easily assess the cost to science if flight rule changes occur. Data Output allows the user to compute ancillary data related to an observation or to a given position of the spacecraft along its trajectory. The data can be saved as a tab-delimited text file or viewed as a graph. SOA combines science planning functionality unique to both JPL and the sponsoring spacecraft. SOA is able to ingest JPL SPICE Kernels that are used to drive the tool and its computations. A Percy search engine is then included that identifies interesting time periods for the user to build observations. When observations are then built, flight-like orientation algorithms replicate spacecraft dynamics to closely simulate the flight spacecraft s dynamics. SOA v8 represents large steps forward from SOA v7 in terms of quality, reliability, maintainability, efficiency, and user experience. A tailored agile development environment has been built around SOA that provides automated unit testing, continuous build and integration, a consolidated Web-based code and documentation storage environment, modern Java enhancements, and a focus on usability

Witoff, Robert J.↗
NASA NTRS2003

Automated Modeling and Simulation Using the Bond Graph Method for the Aerospace Industry

Bond graph modeling was originally developed in the late 1950s by the late Prof. Henry M. Paynter of M.I.T. Prof. Paynter acted well before his time as the main advantage of his creation, other than the modeling insight that it provides and the ability of effectively dealing with Mechatronics, came into fruition only with the recent advent of modern computer technology and the tools derived as a result of it, including symbolic manipulation, MATLAB, and SIMULINK and the Computer Aided Modeling Program (CAMPG). Thus, only recently have these tools been available allowing one to fully utilize the advantages that the bond graph method has to offer. The purpose of this paper is to help fill the knowledge void concerning its use of bond graphs in the aerospace industry. The paper first presents simple examples to serve as a tutorial on bond graphs for those not familiar with the technique. The reader is given the basic understanding needed to appreciate the applications that follow. After that, several aerospace applications are developed such as modeling of an arresting system for aircraft carrier landings, suspension models used for landing gears and multibody dynamics. The paper presents also an update on NASA's progress in modeling the International Space Station (ISS) using bond graph techniques, and an advanced actuation system utilizing shape memory alloys. The later covers the Mechatronics advantages of the bond graph method, applications that simultaneously involves mechanical, hydraulic, thermal, and electrical subsystem modeling.

Granda, Jose J.↗
NASA NTRSDate not supplied

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Recently, the problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temporal planning is an attractive approach for part of this compilation task, specifically, the routing of circuits that implement the Quantum Alternating Operator Ansatz (QAOA) applied to theMaxCut problem on a quantum processor architecture. In this paper, we extend the earlier work to route circuits that implement QAOAfor Graph Coloring problems. QAOA for coloring requires execution of more, and more complex, operations on the chip, which makes routing a more challenging problem. We evaluate the approach on state-of-the-art hardware architectures from leading quantum computing companies. Additionally, we investigate applying the planning approach to qubit initialization as well as routing. Our empirical evaluation shows that temporal planning compares well to reasonable analytic upper bounds [20], and that solving qubit initialization with a classical planner generally helps temporal planners in finding shorter-makespan compilations for QAOA for Graph Coloring.These advances suggest that temporal planning can be an effective approach for more complex quantum computing algorithms and architectures.

Minh Do↗
NASA NTRS1972

Computer generation of symbolic network functions - A new theory and implementation.

A new method is presented for obtaining network functions in which some, none, or all of the network elements are represented by symbolic parameters (i.e., symbolic network functions). Unlike the topological tree enumeration or signal flow graph methods generally used to derive symbolic network functions, the proposed procedure employs fast, efficient, numerical-type algorithms to determine the contribution of those network branches that are not represented by symbolic parameters. A computer program called NAPPE (for Network Analysis Program using Parameter Extractions) and incorporating all of the concepts discussed has been written. Several examples illustrating the usefulness and efficiency of NAPPE are presented.

Alderson, G. E.↗
NASA NTRS1974

Study of multilayered insulation pipe penetration. Thermal acoustic oscillation

Tests were conducted to determine the net heat leak to a source of liquid nitrogen caused by a metal penetration through the blanket of multilayer insulation. The conditions under which the tests were conducted are described. A graph of the theoretical and experimental temperature distribution is developed for comparison. The variables involved in the computer program to process the data are defined. A study was conducted to develop analytical methods for predicting the effect and magnitudes of thermoacoustic oscillations on the penetration heat leak to cryogens. The oscillations develop as a result of large thermal gradients imposed on a compressible fluid. The predominant amplitudes and frequencies of the thermal acoustic oscillations were investigated.

Lovin, J. K.↗
NASA NTRS1985

Inclusion of exact exchange in the noniterative partial-differential-equation method of electron-molecule scattering - Application to e-N2

The noniterative partial-differential-equation (PDE) approach to electron-molecule scattering of Onda and Temkin (1983) is modified to account for the effects of exchange explicitly. The exchange equation is reduced to a set of inhomogeneous equations containing no integral terms and solved noniteratively in a difference form; a method for propagating the solution to large values of r is described; the changes in the polarization potential of the original PDE method required by the inclusion of exact static exchange are indicated; and the results of computations for e-N2 scattering in the fixed-nuclei approximation are presented in tables and graphs and compared with previous calculations and experimental data. Better agreement is obtained using the modified PDE method.

Weatherford, C. A.↗
NASA NTRS2018

Modeling Principles Using the Relation Between Lagrange Multipliers and Bond Graphs

Final document is attached. Modeling dynamic systems by bond graphs has become state of the art technology since hundreds of researchers around the world have incorporated the technology in many fields of engineering and science. The legacy of its invertor Prof. Henry Paynter at MIT in 1959 is now a fundamental and practical technique to understand reality by building computer models. This paper addresses a particular aspect of this technology when modeling of mechanical systems require relaxation of constraints by means of Lagrange principles. Lagrange's equations are a useful means of describing and solving systems with kinematic constraints. Lagrange multipliers are variables used in equations to find the extremes of multivariate functions. Here we explore the relation of Lagrange multipliers to solve modeling difficulties of a space vehicle with equations with dependent derivatives. Lagrange multipliers were used in conjunction with bond graphs to simulate a system where joints of kinematic linkages produce dependent derivatives. NASA's Morpheus Project lunar lander was used as a case study. The Morpheus Project is a terrestrial test vehicle designed to fly the terminal descent trajectory of a lunar lander to advance the Autonomous Landing Hazard Avoidance Technology (ALHAT). An objective of this study is to apply the modeling approach herein to capture the dynamic movement of the lander as the propellant is sloshed and consumed. This paper expands further the analysis presented by (Granda, J J. Nguyen, L, Carlson, T, Sahragard-Monfared, G., Fornalski, E., Brocker 2016). Using an automated approach bond graph models of state space equations were generated using the Computer Aided Modeling Program (CAMPG). Integral causality models and derivative causality models were considered in order to find the simpler solution for the mathematical dependencies produced in modeling this vehicle.

Granda, Jose J.↗
NASA NTRS1993

Parametric binary dissection

Binary dissection is widely used to partition non-uniform domains over parallel computers. This algorithm does not consider the perimeter, surface area, or aspect ratio of the regions being generated and can yield decompositions that have poor communication to computation ratio. Parametric Binary Dissection (PBD) is a new algorithm in which each cut is chosen to minimize load + lambda x(shape). In a 2 (or 3) dimensional problem, load is the amount of computation to be performed in a subregion and shape could refer to the perimeter (respectively surface) of that subregion. Shape is a measure of communication overhead and the parameter permits us to trade off load imbalance against communication overhead. When A is zero, the algorithm reduces to plain binary dissection. This algorithm can be used to partition graphs embedded in 2 or 3-d. Load is the number of nodes in a subregion, shape the number of edges that leave that subregion, and lambda the ratio of time to communicate over an edge to the time to compute at a node. An algorithm is presented that finds the depth d parametric dissection of an embedded graph with n vertices and e edges in O(max(n log n, de)) time, which is an improvement over the O(dn log n) time of plain binary dissection. Parallel versions of this algorithm are also presented; the best of these requires O((n/p) log(sup 3)p) time on a p processor hypercube, assuming graphs of bounded degree. How PBD is applied to 3-d unstructured meshes and yields partitions that are better than those obtained by plain dissection is described. Its application to the color image quantization problem is also discussed, in which samples in a high-resolution color space are mapped onto a lower resolution space in a way that minimizes the color error.

Bokhari, Shahid H.↗
NASA NTRS1989

Solving sparse triangular linear systems on parallel computers

This paper describes and compares three parallel algorithms for solving sparse triangular systems of equations. These methods involve some preprocessing overhead and are primarily of interest in solving many systems with the same coefficient matrix. The first approach is to use a fixed blocksize and form the inverse of the diagonal blocks. The second approach is to use a variable blocksize and reorder the unknowns so that the diagonal blocks are diagonal matrices. The latter technique is called level scheduling because of how it is represented in the adjacency graph, and both row-wise and jagged diagonal storage for the off-diagonal blocks are considered. These techniques are analyzed for general parallel computers and experiments are presented for the eight-processor Alliant FX/8.

Anderson, Edward↗
NASA NTRS1986

Elimination sequence optimization for SPAR

SPAR is a large-scale computer program for finite element structural analysis. The program allows user specification of the order in which the joints of a structure are to be eliminated since this order can have significant influence over solution performance, in terms of both storage requirements and computer time. An efficient elimination sequence can improve performance by over 50% for some problems. Obtaining such sequences, however, requires the expertise of an experienced user and can take hours of tedious effort to affect. Thus, an automatic elimination sequence optimizer would enhance productivity by reducing the analysts' problem definition time and by lowering computer costs. Two possible methods for automating the elimination sequence specifications were examined. Several algorithms based on the graph theory representations of sparse matrices were studied with mixed results. Significant improvement in the program performance was achieved, but sequencing by an experienced user still yields substantially better results. The initial results provide encouraging evidence that the potential benefits of such an automatic sequencer would be well worth the effort.

Hogan, Harry A.↗
NASA NTRS1987

RE-1000 free-piston Stirling engine hydraulic output system description

The NASA Lewis Research Center was involved in free-piston Stirling engine research since 1976. Most of the work performed in-house was related to characterization of the RE-1000 engine. The data collected from the RE-1000 tests were intended to provide a data base for the validation of Stirling cycle simulations. The RE-1000 was originally build with a dashpot load system which did not convert the output of the engine into useful power, but was merely used as a load for the engine to work against during testing. As part of the interagency program between NASA Lewis and the Oak Ridge National Laboratory, (ORNL), the RE-1000 was converted into a configuration that produces useable hydraulic power. A goal of the hydraulic output conversion effort was to retain the same thermodynamic cycle that existed with the dashpot loaded engine. It was required that the design must provide a hermetic seal between the hydraulic fluid and the working gas of the engine. The design was completed and the hardware was fabricated. The RE-1000 was modified in 1985 to the hydraulic output configuration. The early part of the RE-1000 hydraulic output program consisted of modifying hardware and software to allow the engine to run at steady-state conditions. A complete description of the engine is presented in sufficient detail so that the device can be simulated on a computer. Tables are presented showing the masses of the oscillating components and key dimensions needed for modeling purposes. Graphs are used to indicate the spring rate of the diaphragms used to separate the helium of the working and bounce space from the hydraulic fluid.

Schreiber, Jeffrey G.↗