Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “COMPUTER METHOD”

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 397 records · Page 22

Method of processing an image

A non-transitory computer-readable medium encoded with a computer-readable program, which when executed by a processor, will cause a computer to execute a computational method, the computational method including collecting an image data, wherein the collecting the image data comprises collecting a first plurality of RGB images and a second plurality of hyperspectral images. The method further includes orthorectifying the image data to produce an RGB based orthophoto and a partially rectified hyperspectral orthophoto. The method further includes selecting tie features from each of the RGB based orthophoto and the partially rectified hyperspectral orthophoto. Lastly, the method includes registering the features of the partially rectified hyperspectral orthophoto into the tie features of the RGB based orthophoto.

97 MATHEMATICS AND COMPUTING↗

System, method, and computer program product for bulk synchronous binary program translation and optimization

A system, method, and computer program product are provided for. The method includes the steps of executing a block of translated binary instructions by multiple threads and gathering profiling data during execution of the block of translated binary instructions. The multiple threads are then synchronized at a barrier instruction associated with the block of translated binary instructions and the block of translated binary instructions is replaced with optimized binary instructions, where the optimized binary instructions are produced based on the profiling data.

Diamos, Gregory Frederick↗

Efficient on-the-fly ab initio semiclassical method for computing time-resolved nonadiabatic electronic spectra with surface hopping or Ehrenfest dynamics

We derive a somewhat crude, yet very efficient semiclassical approximation for computing nonadiabatic spectra. The resulting method, which is a generalization of the multiple-surface dephasing representation, includes quantum effects through interference of mixed quantum-classical trajectories and through quantum treatment of the collective electronic degree of freedom. The method requires very little computational effort beyond the fewest-switches surface hopping or Ehrenfest locally mean-field dynamics and is very easy to implement. The proposed approximation is tested by computing the absorption and time-resolved stimulated emission spectra of pyrazine using the four-dimensional three-surface model which allows for comparison with the numerically exact quantum spectra. As expected, the multiple-surface dephasing representation is not suitable for high-resolution linear spectra, yet it seems to capture all the important features of pump-probe spectra. Finally, the method is combined with on-the-fly ab initio evaluation of the electronic structure (i.e., energies, forces, electric-dipole, and nonadiabatic couplings) in order to compute fully dimensional nonadiabatic spectra of pyrazine without approximations inherent to analytical, including vibronic-coupling models. The Appendix provides derivations of perturbative expressions for linear and pump-probe spectra of arbitrary mixed states and for arbitrary laser pulse shapes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An overview of computational simulation methods for composite structures failure and life analysis

Three parallel computational simulation methods are being developed at the LeRC Structural Mechanics Branch (SMB) for composite structures failure and life analysis: progressive fracture CODSTRAN; hierarchical methods for high-temperature composites; and probabilistic evaluation. Results to date demonstrate that these methods are effective in simulating composite structures failure/life/reliability.

Chamis, Christos C.↗

Digital Proxy Simulation of Robotic Hardware

A computer-implemented method, computer program product, and computing system is provided for a digital proxy simulation of robotic hardware. In an implementation, a method may include creating a digital proxy simulation for a robotic hardware wherein the digital simulation and the robotic hardware may share a network interface. a user may be provided with an option to switch between the robotic hardware and the digital proxy simulation. The switch may be executed, upon receiving a user selection, between the robotic hardware and the digital proxy simulation, wherein executing the switch includes transferring input and output signals between the digital proxy simulation and the robotic hardware.

Bacon, James A.↗

Application of computational aerodynamics methods to the design and analysis of transport aircraft

The application and validation of several computational aerodynamic methods in the design and analysis of transport aircraft is established. An assessment is made concerning more recently developed methods that solve three-dimensional transonic flow and boundary layers on wings. Capabilities of subsonic aerodynamic methods are demonstrated by several design and analysis efforts. Among the examples cited are the B747 Space Shuttle Carrier Aircraft analysis, nacelle integration for transport aircraft, and winglet optimization. The accuracy and applicability of a new three-dimensional viscous transonic method is demonstrated by comparison of computed results to experimental data

Da Costa, A. L.↗

Pacing a data transfer operation between compute nodes on a parallel computer

Methods, systems, and products are disclosed for pacing a data transfer between compute nodes on a parallel computer that include: transferring, by an origin compute node, a chunk of an application message to a target compute node; sending, by the origin compute node, a pacing request to a target direct memory access (`DMA`) engine on the target compute node using a remote get DMA operation; determining, by the origin compute node, whether a pacing response to the pacing request has been received from the target DMA engine; and transferring, by the origin compute node, a next chunk of the application message if the pacing response to the pacing request has been received from the target DMA engine.

97 MATHEMATICS AND COMPUTING↗

An inverse method for computation of structural stiffness distributions of aeroelastically optimized wings

An inverse method has been developed to compute the structural stiffness properties of wings given a specified wing loading and aeroelastic twist distribution. The method directly solves for the bending and torsional stiffness distribution of the wing using a modal representation of these properties. An aeroelastic design problem involving the use of a computational aerodynamics method to optimize the aeroelastic twist distribution of a tighter wing operating at maneuver flight conditions is used to demonstrate the application of the method. This exercise verifies the ability of the inverse scheme to accurately compute the structural stiffness distribution required to generate a specific aeroelastic twist under a specified aeroelastic load.

Schuster, David M.↗

System, method, and computer program product for transporting an unmanned vehicle

A method, system, and computer program product is provided for transporting an unmanned vehicle to a destination location. The method includes determining a ground vehicle from a plurality of ground vehicles based on a location of the ground vehicle, the destination location, and a location of the unmanned vehicle, controlling the unmanned vehicle to the location of the ground vehicle, controlling at least one attachment mechanism to attach the unmanned vehicle to the ground vehicle, in response to the ground vehicle traveling to a second location, controlling the at least one attachment mechanism to detach the unmanned vehicle from the ground vehicle, and controlling the unmanned vehicle to the destination location.

Samaras, Constantinos↗

Energy Finite Element Analysis for Computing the High Frequency Vibration of the Aluminum Testbed Cylinder and Correlating the Results to Test Data

The Energy Finite Element Analysis (EFEA) is a finite element based computational method for high frequency vibration and acoustic analysis. The EFEA solves with finite elements governing differential equations for energy variables. These equations are developed from wave equations. Recently, an EFEA method for computing high frequency vibration of structures either in vacuum or in contact with a dense fluid has been presented. The presence of fluid loading has been considered through added mass and radiation damping. The EFEA developments were validated by comparing EFEA results to solutions obtained by very dense conventional finite element models and solutions from classical techniques such as statistical energy analysis (SEA) and the modal decomposition method for bodies of revolution. EFEA results have also been compared favorably with test data for the vibration and the radiated noise generated by a large scale submersible vehicle. The primary variable in EFEA is defined as the time averaged over a period and space averaged over a wavelength energy density. A joint matrix computed from the power transmission coefficients is utilized for coupling the energy density variables across any discontinuities, such as change of plate thickness, plate/stiffener junctions etc. When considering the high frequency vibration of a periodically stiffened plate or cylinder, the flexural wavelength is smaller than the interval length between two periodic stiffeners, therefore the stiffener stiffness can not be smeared by computing an equivalent rigidity for the plate or cylinder. The periodic stiffeners must be regarded as coupling components between periodic units. In this paper, Periodic Structure (PS) theory is utilized for computing the coupling joint matrix and for accounting for the periodicity characteristics.

Vlahopoulos, Nickolas↗

Effects of nonlinear aerodynamics and static aeroelasticity on mission performance calculations for a fighter aircraft

During conceptual design studies of advanced aircraft, the usual practice is to use linear theory to calculate the aerodynamic characteristics of candidate rigid (nonflexible) geometric external shapes. Recent developments and improvements in computational methods, especially computational fluid dynamics (CFD), provide significantly improved capability to generate detailed analysis data for the use of all disciplines involved in the evaluation of a proposed aircraft design. A multidisciplinary application of such analysis methods to calculate the effects of nonlinear aerodynamics and static aeroelasticity on the mission performance of a fighter aircraft concept is described. The aircraft configuration selected for study was defined in a previous study using linear aerodynamics and rigid geometry. The results from the previous study are used as a basis of comparison for the data generated herein. Aerodynamic characteristics are calculated using two different nonlinear theories, potential flow and rotational (Euler) flow. The aerodynamic calculations are performed in an iterative procedure with an equivalent plate structural analysis method to obtain lift and drag data for a flexible (nonrigid) aircraft. These static aeroelastic data are then used in calculating the combat and mission performance characteristics of the aircraft.

Giles, Gary L.↗

Alternative methods for computing sound radiation from vibrating surfaces

The merits of various numerical and experimental methods for computing sound fields radiated from vibrating structures are examined. The finite difference method, the finite element method, direct boundary element method, indirect boundary element near-field acoustic holography, two-microphone methods, and spatial transformation of sound fields are considered. The proper utilization of the methods is discussed.

Bernhard, R. J.↗

System, method, and computer program product for scheduling tasks associated with continuation thread blocks

A system, method, and computer program product for scheduling tasks associated with continuation thread blocks. The method includes the steps of generating a first task metadata data structure in a memory, generating a second task metadata data structure in the memory, executing a first task corresponding to the first task metadata data structure in a processor, generating state information representing a continuation task related to the first task and storing the state information in the second task metadata data structure, executing the continuation task in the processor after the one or more child tasks have finished execution, and indicating that the first task has logically finished execution once the continuation task has finished execution. The second task metadata data structure is related to the first task metadata data structure, and at least one instruction in the first task causes one or more child tasks to be executed by the processor.

Ricketts, Scott↗

Chaining direct memory access data transfer operations for compute nodes in a parallel computer

Methods, systems, and products are disclosed for chaining DMA data transfer operations for compute nodes in a parallel computer that include: receiving, by an origin DMA engine on an origin node in an origin injection FIFO buffer for the origin DMA engine, a RGET data descriptor specifying a DMA transfer operation data descriptor on the origin node and a second RGET data descriptor on the origin node, the second RGET data descriptor specifying a target RGET data descriptor on the target node, the target RGET data descriptor specifying an additional DMA transfer operation data descriptor on the origin node; creating, by the origin DMA engine, an RGET packet in dependence upon the RGET data descriptor, the RGET packet containing the DMA transfer operation data descriptor and the second RGET data descriptor; and transferring, by the origin DMA engine to a target DMA engine on the target node, the RGET packet.

Archer, Charles J↗

Link failure detection in a parallel computer

Methods, apparatus, and products are disclosed for link failure detection in a parallel computer including compute nodes connected in a rectangular mesh network, each pair of adjacent compute nodes in the rectangular mesh network connected together using a pair of links, that includes: assigning each compute node to either a first group or a second group such that adjacent compute nodes in the rectangular mesh network are assigned to different groups; sending, by each of the compute nodes assigned to the first group, a first test message to each adjacent compute node assigned to the second group; determining, by each of the compute nodes assigned to the second group, whether the first test message was received from each adjacent compute node assigned to the first group; and notifying a user, by each of the compute nodes assigned to the second group, whether the first test message was received.

Archer, Charles J↗

Broadcasting a message in a parallel computer

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer. The parallel computer includes a plurality of compute nodes connected together using a data communications network. The data communications network optimized for point to point data communications and is characterized by at least two dimensions. The compute nodes are organized into at least one operational group of compute nodes for collective parallel operations of the parallel computer. One compute node of the operational group assigned to be a logical root. Broadcasting a message in a parallel computer includes: establishing a Hamiltonian path along all of the compute nodes in at least one plane of the data communications network and in the operational group; and broadcasting, by the logical root to the remaining compute nodes, the logical root's message along the established Hamiltonian path.

97 MATHEMATICS AND COMPUTING↗

Broadcasting a message in a parallel computer

Methods, systems, and products are disclosed for broadcasting a message in a parallel computer that includes: transmitting, by the logical root to all of the nodes directly connected to the logical root, a message; and for each node except the logical root: receiving the message; if that node is the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received; if that node received the message from a parent node and if that node is not a leaf node, then transmitting the message to all of the child nodes; and if that node received the message from a child node and if that node is not the physical root, then transmitting the message to all of the child nodes except the child node from which the message was received and transmitting the message to the parent node.

97 MATHEMATICS AND COMPUTING↗