Search NASA⌕ Search

SEARCH · Search NASA

Results for “vertex”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

A system for routing arbitrary directed graphs on SIMD architectures

There are many problems which can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from connecting vertices. A method is given for parallelizing such problems on an SIMD machine model that is bit-serial and uses only nearest neighbor connections for communication. Each vertex of the graph will be assigned to a processor in the machine. Algorithms are given that will be used to implement movement of data along the arcs of the graph. This architecture and algorithms define a system that is relatively simple to build and can do graph processing. All arcs can be transversed in parallel in time O(T), where T is empirically proportional to the diameter of the interconnection network times the average degree of the graph. Modifying or adding a new arc takes the same time as parallel traversal.

Tomboulian, Sherryl↗
NASA NTRS1987

Computational methods for vortex dominated compressible flows

The principal objectives were to: understand the mechanisms by which Euler equation computations model leading edge vortex flows; understand the vortical and shock wave structures that may exist for different wing shapes, angles of incidence, and Mach numbers; and compare calculations with experiments in order to ascertain the limitations and advantages of Euler equation models. The initial approach utilized the cell centered finite volume Jameson scheme. The final calculation utilized a cell vertex finite volume method on an unstructured grid. Both methods used Runge-Kutta four stage schemes for integrating the equations. The principal findings are briefly summarized.

Murman, Earll M.↗
NASA NTRS1986

A formal definition of data flow graph models

In this paper, a new model for parallel computations and parallel computer systems that is based on data flow principles is presented. Uninterpreted data flow graphs can be used to model computer systems including data driven and parallel processors. A data flow graph is defined to be a bipartite graph with actors and links as the two vertex classes. Actors can be considered similar to transitions in Petri nets, and links similar to places. The nondeterministic nature of uninterpreted data flow graphs necessitates the derivation of liveness conditions.

Kavi, Krishna M.↗
NASA NTRS1987

Theoretical modelling of the fine structures in sunspots

Until a decade ago most solar physicists thought of a sunspot as the upper end of a giant flux tube floating vertically. The existence of umbral dots and penumbral grains has been known for several decades. On the basis of available observations, they seem to be regions of photospheric intensity with upflowing gas motion and magnetic fields much weaker than in the surrounding sunspot surface. It has also been suggested that the differences in the appearances of umbral dots and granular cells are caused by the highly nonlinear nature of the convection problem in the presense of strong magnetic fields. The main ideas are presented here without any equations. It can be shown that a pocket of field free gas surrounded by a vertical magnetic field in the presence of gravity takes up the shape of a tapering column ending at a vertex at the top. Some convection is expected to take place in the trapped field free gas, whereas the magnetic field around it makes those regions stable against convection. Eventually the apex of the tapering column reaches the photospheric surface where the bulging of the magnetic field makes the field no longer able to close on the field free gas and trap it underneath.

Choudhuri, Arnab Rai↗
NASA NTRS1988

Data traffic reduction schemes for sparse Cholesky factorizations

Load distribution schemes are presented which minimize the total data traffic in the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems with local and shared memory. The total data traffic in factoring an n x n sparse, symmetric, positive definite matrix representing an n-vertex regular 2-D grid graph using n (sup alpha), alpha is equal to or less than 1, processors are shown to be O(n(sup 1 + alpha/2)). It is O(n(sup 3/2)), when n (sup alpha), alpha is equal to or greater than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal. The schemes allow efficient use of up to O(n) processors before the total data traffic reaches the maximum value of O(n(sup 3/2)). The partitioning employed within the scheme, allows a better utilization of the data accessed from shared memory than those of previously published methods.

Naik, Vijay K.↗
NASA NTRS1988

An automated computerized vision technique for determination of three-dimensional object geometry

It is very important to determine three dimensional geometry of objects quickly in various military, space, construction, and industrial applications. An automatic scheme to obtain three dimensional geometry of objects by employing only one camera is presented. At present, this technique is applicable to a limited category of objects, satisfying the following constraints: they are flat-surfaces, and all the vertex points have to be recognized as corner points of the two dimensional image. The scheme consists of corner detection, data communication, camera calibration techniques and point searching and matching, edge cancelation, and creation procedures. An L shaped model is chosen as a test object. Experimental results demonstrated the reconstruction of this object geometry within 5 mm discrepancy. This scheme is quite convenient, efficient to use and can be applied to a wide range of problems in the real world.

Chiang, Pen-Tai↗
NASA NTRS1987

Radio emissions from Uranus

The hardware of the Planetary Radio Astronomy Experiment aboard Voyager 2 and the results of the measurements of radio emissions from Uranus are described. Strong 40-kHz to 850-kHz radio emissions were detected after closest approach on the day-side of Uranus. The time variations of these emissions were periodic, with a period of 17.24 h closely matching that of Uranus's rotation and evidently being controlled by the strength and shape of its magnetic field. The instrument also recorded possible Uranian electrostatic discharges, vertex early arcs occurring in sequences of more than a dozen events with approximately 10-min period, and very intense isolated bursts lasting tens of minutes.

Warwick, J. W.↗
NASA NTRS1989

An embedded mesh procedure for leading-edge vortex flows

A cell-vertex scheme is outlined for solving the flow about a delta wing with M (sub infinity) is greater than 1. Embedded regions of mesh refinement allow solutions to be obtained which have much higher resolution than those achieved to date. Effects of mesh refinement and artificial viscosity on the solutions are studied, to determine at what point leading-edge vortex solutions are grid-converged. A macroscale and a microscale for the size of the vortex are defined, and it is shown that the macroscale (which includes the wing surface properties) is converged on a moderately refined grid, while the microscale is very sensitive to grid spacing. The level of numerical diffusion in the core of the vortex is found to be substantial. Comparisons with the experiment are made for two cases which have transonic cross-flow velocities.

Powell, Kenneth G.↗
NASA NTRS1989

An adaptive embedded mesh procedure for leading-edge vortex flows

A procedure for solving the conical Euler equations on an adaptively refined mesh is presented, along with a method for determining which cells to refine. The solution procedure is a central-difference cell-vertex scheme. The adaptation procedure is made up of a parameter on which the refinement decision is based, and a method for choosing a threshold value of the parameter. The refinement parameter is a measure of mesh-convergence, constructed by comparison of locally coarse- and fine-grid solutions. The threshold for the refinement parameter is based on the curvature of the curve relating the number of cells flagged for refinement to the value of the refinement threshold. Results for three test cases are presented. The test problem is that of a delta wing at angle of attack in a supersonic free-stream. The resulting vortices and shocks are captured efficiently by the adaptive code.

Powell, Kenneth G.↗
NASA NTRS1989

The design and application of upwind schemes on unstructured meshes

Solution and mesh generation algorithms for solving the Euler equations on unstructured meshes consisting of triangle and quadrilateral control volumes are presented. Cell-centered and mesh-vertex upwind finite-volume schemes are developed which utilize multi-dimensional monotone linear reconstruction procedures. These algorithms differ from existing algorithms (even on structured meshes). Numerical results in two dimensions are presented.

Barth, Timothy J.↗
NASA NTRS1989

Communication requirements of sparse Cholesky factorization with nested dissection ordering

Load distribution schemes for minimizing the communication requirements of the Cholesky factorization of dense and sparse, symmetric, positive definite matrices on multiprocessor systems are presented. The total data traffic in factoring an n x n sparse symmetric positive definite matrix representing an n-vertex regular two-dimensional grid graph using n exp alpha, alpha not greater than 1, processors are shown to be O(n exp 1 + alpha/2). It is O(n), when n exp alpha, alpha not smaller than 1, processors are used. Under the conditions of uniform load distribution, these results are shown to be asymptotically optimal.

Naik, Vijay K.↗
NASA NTRS1988

Coherent phasing of segmented mirrors

The technical issues associated with a coherently phased segmented mirror can be divided into two types. The first involves the issues of manufacturing the surface quality of the mirror segments themselves (coherent phasing of individual segments). The second involves assembly issues of initializing in 1 G and retaining in 0 G an aggregate segmented mirror (coherent phasing between individual segments). Using a rectangular coordinate system at the vertex of a mirror segment, the rigid body motions are the six translational and rotational degrees of freedom. A first cut primary mirror wavefront error budget is presented. For a minimum operational wavelength of 30 micrometers, the derived values from the budget are: segment surface quality (0.45 micrometers RMS), radius mismatch (50 PPM), segment piston error (1.3 micrometers, segment tip/tilt error (0.6 microrad). Either active or passive segmented mirrors can be addressed, but if the surface quality of the off-axis segment and the radius matching requirements can be passively met, then only segment alignment need be sensed and controlled during operation in orbit. For the active mirror case, dimensional stability of the mirror material during operation is a key factor in establishing the degree of active figure control required.

Jones, Peter A.↗
NASA NTRS1988

Convergence speeding up in the calculation of the viscous flow about an airfoil

A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.

Radespiel, R.↗
NASA NTRS1988

Overview and extensions of a system for routing directed graphs on SIMD architectures

Many problems can be described in terms of directed graphs that contain a large number of vertices where simple computations occur using data from adjacent vertices. A method is given for parallelizing such problems on an SIMD machine model that uses only nearest neighbor connections for communication, and has no facility for local indirect addressing. Each vertex of the graph will be assigned to a processor in the machine. Rules for a labeling are introduced that support the use of a simple algorithm for movement of data along the edges of the graph. Additional algorithms are defined for addition and deletion of edges. Modifying or adding a new edge takes the same time as parallel traversal. This combination of architecture and algorithms defines a system that is relatively simple to build and can do fast graph processing. All edges can be traversed in parallel in time O(T), where T is empirically proportional to the average path length in the embedding times the average degree of the graph. Additionally, researchers present an extension to the above method which allows for enhanced performance by allowing some broadcasting capabilities.

Tomboulian, Sherryl↗
NASA NTRS1990

Simulation and analysis of a delta planform with multiple jets in ground effect

The three-dimensional, thin-layer Navier-Stokes equations on a body-conforming, overset, multiple-grid topology are solved in the present numerical simulations of the flow around a 60-deg delta-planform wing equipped with two thrust-reverser jets in ground-effect conditions. Such experimentally flow-visualized features as jet-deformation and ground vertex-formation are captured by these simulations; the loss of wing-borne lift due to the 'suck-down' phenomenon, which arises as the delta planform flies at low speeds in close proximity to the ground, is also well simulated.

Chawla, K.↗
NASA NTRS1990

New arcs associated with the smooth high-frequency radiation from Uranus

New vertex-early kilometric arcs have been found to be associated with the dominant smooth high-frequency radio emission from Uranus. These arc features had vertices at about 300 kHz and bandwidths of about 200 kHz. Based on the fact that they exhibited a different temporal occurrence, spectral character, source location, and beaming pattern compared to the more dominant smooth component, it is concluded that they are a separate and independent radio component, different from those previously identified for this planet.

Farrell, W. M.↗
NASA NTRS1989

Interval polynomial positivity

It is shown that a univariate interval polynomial is globally positive if and only if two extreme polynomials are globally positive. It is shown that the global positivity property of a bivariate interval polynomial is completely determined by four extreme bivariate polynomials. The cardinality of the determining set for k-variate interval polynomials is 2k. One of many possible generalizations, where vertex implication for global positivity holds, is made by considering the parameter space to be the set dual of a boxed domain.

Bose, N. K.↗
NASA NTRS1989

Boundary implications for frequency response of interval FIR filters

It is shown that vertex implication results in parameter space apply to interval trigonometric polynomials, which characterize the frequency response of a finite impulse response (FIR) digital filter. A weak result and a strong result are given, and the conclusions are illustrated by examples.

Bose, N. K.↗