FORTRAN program for computing coordinates of circular arc single and tandem turbomachinery blade sections on a plane
FORTRAN program for computing coordinates of circular arc single and tandem turbomachinery blade sections on plane
Crouse, J. E.↗
SEARCH · Search NASA
Results for “coordinate computing”
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.
The problem of organization of a coastal coordinating computer center
The fundamental principles of the operation of a coastal coordinating and computing center under conditions of automation are presented. Special attention is devoted to the work of Coastal Computer Center of the Arctic and Antarctic Scientific Research Institute. This center generalizes from data collected in expeditions and also from observations made at polar stations.
Dyubkin, I. A.↗
FORTRAN program for computing coordinates of circular-arc, single and tandem, turbine and compressor, blade sections on a plane
Coordinates for circular arc blade section of aircraft high speed compressor gas turbines were computed using FORTRAN 4 program. Aerodynamic configurations studied include single segment airfoils, airfoils with slots, and mutiple segment tandem arranged airfoil.
Mcnally, W. D.↗
Computer coordination of limb motion for a three-legged walking robot
Coordination of the limb motion of a vehicle which could perform assembly and maintenance operations on large structures in space is described. Manipulator kinematics and walking robots are described. The basic control scheme of the robot is described. The control of the individual arms are described. Arm velocities are generally described in Cartesian coordinates. Cartesian velocities are converted to joint velocities using the Jacobian matrix. The calculation of a trajectory for an arm given a sequence of points through which it is to pass is described. The free gait algorithm which controls the lifting and placing of legs for the robot is described. The generation of commanded velocities for the robot, and the implementation of those velocities by the algorithm are discussed. Suggestions for further work in the area of robot legged locomotion are presented.
Klein, C. A.↗
Computer coordination of limb motion for locomotion of a multiple-armed robot for space assembly
Consideration is given to a possible robotic system for the construction of large space structures, which may be described as a multiple general purpose arm manipulator vehicle that can walk over the structure under construction to a given site for further work. A description is presented of the locomotion of such a vehicle, modeling its arms in terms of a currently available industrial manipulator. It is noted that for whatever maximum speed of operation is chosen, rapid changes in robot velocity create situations in which already-selected handholds are no longer practical. A step is added to the 'free gait' walking algorithm in order to solve this problem.
Klein, C. A.↗
Computational Spectroscopy of the Cr–Cr Bond in Coordination Complexes
In this work, we report the accurate computational vibrational analysis of the Cr–Cr bond in dichromium complexes using second-order multireference complete active space methods (CASPT2), allowing direct comparison with experimental spectroscopic data both to facilitate interpreting the low-energy region of the spectra and to provide insights into the nature of the bonds themselves. Recent technological development by the authors has realized such computation for the first time. Accurate simulation of the vibrational structure of these compounds has been hampered by their notorious multiconfigurational electronic structure that yields bond distances that do not correlate with bond order. Some measured Cr–Cr vibrational stretching modes, ν(Cr 2 ), have suggested weaker bonding, even for so-called ultrashort Cr–Cr bonds, while others are in line with the bond distance. Here, we optimize geometries and compute ν(Cr 2 ) with CASPT2 for three well-characterized complexes, Cr 2 (O 2 CCH 3 ) 4 (H 2 O) 2 , Cr 2 (mhp) 4 , and Cr 2 (dmp) 4 . We obtain CASPT2 harmonic ν(Cr 2 ) modes in good agreement with experiment at 282 cm –1 for Cr 2 (mhp) 4 and 353 cm –1 for Cr 2 (dmp) 4 , compute 50 Cr and 54 Cr isotope shifts, and demonstrate that the use of the so-called IPEA shift leads to improved Cr–Cr distances. Additionally, normal mode sampling was used to estimate anharmonicity along ν(Cr 2 ), leading to an anharmonic mode of 272 cm –1 for Cr 2 (mhp) 4 and 333 cm –1 for Cr 2 (dmp) 4 .
36 MATERIALS SCIENCE↗
International geomagnetic reference field 1965.0 in dipole coordinates
Computer program transforming spherical harmonic coefficients into arbitrarily tilted coordinate systems, tabulating coefficients of International Geomagnetic Reference Field 1965 in dipole coordinate system
Mead, G. D.↗
The international geomagnetic reference field 1965.0 in dipole coordinates
Computer program for transforming spherical harmonic coefficients to geomagnetic dipole coordinates
Mead, G. D.↗
Neural-Network Computer Transforms Coordinates
Numerical simulation demonstrated ability of conceptual neural-network computer to generalize what it has "learned" from few examples. Ability to generalize achieved with even simple neural network (relatively few neurons) and after exposure of network to only few "training" examples. Ability to obtain fairly accurate mappings after only few training examples used to provide solutions to otherwise intractable mapping problems.
Josin, Gary M.↗
Computing Surface Coordinates Of Face-Milled Spiral-Bevel Gear Teeth
Surface coordinates of face-milled spiral-bevel gear teeth computed by method involving numerical solution of governing equations. Needed to generate mathematical models of tooth surfaces for use in finite-element analyses of stresses, strains, and vibrations in meshing spiral-bevel gears.
Handschuh, Robert F.↗
Numerical solutions of 3-dimensional Navier-Stokes equations for closed bluff-bodies
The Navier-Stokes equations are solved numerically. These equations are unsteady, compressible, viscous, and three-dimensional without neglecting any terms. The time dependency of the governing equations allows the solution to progress naturally for an arbitrary initial guess to an asymptotic steady state, if one exists. The equations are transformed from physical coordinates to the computational coordinates, allowing the solution of the governing equations in a rectangular parallelepiped domain. The equations are solved by the MacCormack time-split technique which is vectorized and programmed to run on the CDc VPS 32 computer. The codes are written in 32-bit (half word) FORTRAN, which provides an approximate factor of two decreasing in computational time and doubles the memory size compared to the 54-bit word size.
Abolhassani, J. S.↗
Numerical solutions of Navier-Stokes equations for a Butler wing
The flow field is simulated on the surface of a given delta wing (Butler wing) at zero incident in a uniform stream. The simulation is done by integrating a set of flow field equations. This set of equations governs the unsteady, viscous, compressible, heat conducting flow of an ideal gas. The equations are written in curvilinear coordinates so that the wing surface is represented accurately. These equations are solved by the finite difference method, and results obtained for high-speed freestream conditions are compared with theoretical and experimental results. In this study, the Navier-Stokes equations are solved numerically. These equations are unsteady, compressible, viscous, and three-dimensional without neglecting any terms. The time dependency of the governing equations allows the solution to progress naturally for an arbitrary initial initial guess to an asymptotic steady state, if one exists. The equations are transformed from physical coordinates to the computational coordinates, allowing the solution of the governing equations in a rectangular parallel-piped domain. The equations are solved by the MacCormack time-split technique which is vectorized and programmed to run on the CDC VPS 32 computer.
Abolhassani, J. S.↗
Situational Awareness from a Low-Cost Camera System
A method gathers scene information from a low-cost camera system. Existing surveillance systems using sufficient cameras for continuous coverage of a large field necessarily generate enormous amounts of raw data. Digitizing and channeling that data to a central computer and processing it in real time is difficult when using low-cost, commercially available components. A newly developed system is located on a combined power and data wire to form a string-of-lights camera system. Each camera is accessible through this network interface using standard TCP/IP networking protocols. The cameras more closely resemble cell-phone cameras than traditional security camera systems. Processing capabilities are built directly onto the camera backplane, which helps maintain a low cost. The low power requirements of each camera allow the creation of a single imaging system comprising over 100 cameras. Each camera has built-in processing capabilities to detect events and cooperatively share this information with neighboring cameras. The location of the event is reported to the host computer in Cartesian coordinates computed from data correlation across multiple cameras. In this way, events in the field of view can present low-bandwidth information to the host rather than high-bandwidth bitmap data constantly being generated by the cameras. This approach offers greater flexibility than conventional systems, without compromising performance through using many small, low-cost cameras with overlapping fields of view. This means significant increased viewing without ignoring surveillance areas, which can occur when pan, tilt, and zoom cameras look away. Additionally, due to the sharing of a single cable for power and data, the installation costs are lower. The technology is targeted toward 3D scene extraction and automatic target tracking for military and commercial applications. Security systems and environmental/ vehicular monitoring systems are also potential applications.
Freudinger, Lawrence C.↗
Bipolar coordinates for computation of transition duct flows
Numerical simulation techniques for flows in jet-engine transition ducts with changing cross sections are developed and demonstrated. The boundary-conforming grids required are generated using bipolar coordinates, and the singularities arising at the no-slip boundaries are treated as described by de Vahl Davis (1979) and Tsai and Levy (1987). Grids for several typical configurations are employed in computations with the three-dimensional laminar/turbulent viscous-flow solver of Levy et al. (1983), and the results are presented graphically. The scheme used to deal with singularities is shown to be robust, suggesting that the bipolar grids may be applicable to Navier-Stokes computations.
Madabhushi, R. K.↗
Two-boundary grid generation for the solution of the three dimensional compressible Navier-Stokes equations
A grid generation technique called the two boundary technique is developed and applied for the solution of the three dimensional Navier-Stokes equations. The Navier-Stokes equations are transformed from a cartesian coordinate system to a computational coordinate system, and the grid generation technique provides the Jacobian matrix describing the transformation. The two boundary technique is based on algebraically defining two distinct boundaries of a flow domain and the distribution of the grid is achieved by applying functions to the uniform computational grid which redistribute the computational independent variables and consequently concentrate or disperse the grid points in the physical domain. The Navier-Stokes equations are solved using a MacCormack time-split technique. Grids and supersonic laminar flow solutions are obtained for a family of three dimensional corners and two spike-nosed bodies.
Smith, R. E.↗
Three-dimensional grids as solutions of elliptic systems
An elliptic grid generation scheme is described which produces a curvilinear, boundary-fitted grid for highly swept wings with sharp leading edges. The three-dimensional integration domain is segmented in successive crossflow sections wherein the physical coordinates are transformed to computational coordinates by solving an elliptic set of two quasi-linear differential equations. Grid points are clustered in the vicinity of the wing surface, especially in the neighborhood of the leading edges. The formulation of the source terms in the equations governing the transformation contains adjustable parameters which are determined from limiting forms of the elliptic equations along the boundaries. The source terms are assigned to each grid point by interpolation of these parameters into the interior domain. The formulation does not depend on the boundary shape or on the distribution of the grid points along the boundaries. For the first time, the discretized governing equations have been solved using a fast AF1 iteration scheme.
Hartwich, P.-M.↗
Numerical solution of viscous reacting blunt body flows of a multicomponent mixture.
Hypersonic flow of a chemically nonequilibrium multicomponent mixture past an axisymmetric blunt body is considered on the basis of the exact Navier-Stokes and chemical rate equations. The flowfield, characterized by a sharp shock and a boundary layer, is solved numerically in the region between the shock and the body. The governing equations are first formulated in generalized orthogonal coordinates, and then recast in computational coordinates in which both the shock and the body are two straight lines and one coordinate is stretched to allow higher space resolution near the body. The thermodynamic and transport properties are obtained from the most rigorous theories and reliable data for each component and for the mixture itself. A time-marching second-order finite-difference method is used to solve the equations.
Li, C. P.↗
Computation of two-phase shear-layer flow using an Eulerian-Lagrangian analysis
A combined Eulerian-Lagrangian analysis which combines a linearized block implicit Navier-Stokes analysis for the continuous phase with a Lagrangian analysis for the discrete phase has been utilized to simulate a two-phase shear-layer flow in a two-dimensional channel flow configuration. The motion of the particles is tracked in computational coordinate space, resulting in improved computational efficiency, and interphase coupling terms for the Eulerian analysis are computed from the instantaneous distribution of the particles rather than the trajectory information. The use of the implicit Navier-Stokes analysis for the continuous phase has made it possible to efficiently use a highly stretched mesh. A low Reynolds number form of the k-epsilon turbulence model was used with near-wall resolution, thus eliminating the need to use the 'wall-function' approach. The streamwise velocity profiles for the continuous and the discrete phases have been compared with experimental data for two test cases.
Sabnis, Jayant S.↗