Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computational topology”

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 19 records

A topology for computer networks with good survivability characteristics and low transmission delays between node computers

Various network topologies are developed which have not appeared in the literature before which result in minimum diameter graphs for computer networks having connectivity four. The topologies presented have good survivability characteristics and result in more topologies being available for computer network designers which achieve the minimum diameter resulting in small transmission delays.

Kelly, G. L.↗

Refinement Of Hexahedral Cells In Euler Flow Computations

Topologically Independent Grid, Euler Refinement (TIGER) computer program solves Euler equations of three-dimensional, unsteady flow of inviscid, compressible fluid by numerical integration on unstructured hexahedral coordinate grid refined where necessary to resolve shocks and other details. Hexahedral cells subdivided, each into eight smaller cells, as needed to refine computational grid in regions of high flow gradients. Grid Interactive Refinement and Flow-Field Examination (GIRAFFE) computer program written in conjunction with TIGER program to display computed flow-field data and to assist researcher in verifying specified boundary conditions and refining grid.

Melton, John E.↗

Dynamics of flexible bodies in tree topology - A computer oriented approach

An approach suited for automatic generation of the equations of motion for large mechanical systems (i.e., large space structures, mechanisms, robots, etc.) is presented. The system topology is restricted to a tree configuration. The tree is defined as an arbitrary set of rigid and flexible bodies connected by hinges characterizing relative translations and rotations of two adjoining bodies. The equations of motion are derived via Kane's method. The resulting equation set is of minimum dimension. Dynamical equations are imbedded in a computer program called TREETOPS. Extensive control simulation capability is built in the TREETOPS program. The simulation is driven by an interactive set-up program resulting in an easy to use analysis tool.

Singh, R. P.↗

Electromagnetics and Fluid Dynamics

Previous efforts focused on developing tools for design of low observables were sustained. The final product was the maturation of a high-order accurate finite-volume based code to solve Maxwell's equations. One of the primary achievements was the development and implementation of efficient filtering techniques which enhance the robustness of high-order and optimized schemes without significant adverse impact on accuracy. This has eliminated the stability barrier which restrains the common use of high-order schemes for conservative wave propagation phenomena on curvilinear meshes. A study was performed of crossing shock interactions under conditions of increasing interaction strength and asymmetry. In the first category, the observed computed topological bifurcations were correlated with the formation of various lines of coalescence and divergence evident in experimental and computed surf-ace oil maps. ne flow structure arising from asymmetric interactions was investigated with particular emphasis on: 1) vorticity dynamics, 2) shock-structure and 3) sidewall vortex loading. Several efforts of the prior year were successfully published in archival journals. The high-order algorithms developed for CEM have been implemented into the FDL3DI CFD code are presently undergoing extensive testing. Preliminary results are highly encouraging.

Gaitonde, Datta↗

Optimal Communication Topology Construction and Sensor Selection for Independent Airspace Surveillance

The paper presents an approach with no estimation feedback to sensors selection and communication network topology computation for independent airspace surveillance with maximum outcome and minimum cost using ground based distributed sensing, computing and communication network infrastructure. The selection criteria includes maximum airspace coverage with minimal resources, minimum communication time and power consumption while guaranteeing the system observability and providing in-time high quality information to both stationary and mobile users. The developed algorithms use multi-objective optimization strategy taking into account trade-offs between conflicting objectives and are implemented using off-the-shelf computational tools. The algorithms are validated in a desktop simulation environment using synthetic sensors data generated for a simulated multi-vehicle flight scenario in the selected regional airspace and parameters of a notional wireless communication network.

Distributed sensing↗

The J3 SCR model applied to resonant converter simulation

The J3 SCR model is a continuous topology computer model for the SCR. Its circuit analog and parameter estimation procedure are uniformly applicable to popular computer-aided design and analysis programs such as SPICE2 and SCEPTRE. The circuit analog is based on the intrinsic three pn junction structure of the SCR. The parameter estimation procedure requires only manufacturer's specification sheet quantities as a data base.

Avant, R. L.↗

The world problem: on the computability of the topology of 4-manifolds

Topological classification of the 4-manifolds bridges computation theory and physics. A proof of the undecidability of the homeomorphy problem for 4-manifolds is outlined here in a clarifying way. It is shown that an arbitrary Turing machine with an arbitrary input can be encoded into the topology of a 4-manifold, such that the 4-manifold is homeomorphic to a certain other 4-manifold if and only if the corresponding Turing machine halts on the associated input. Physical implications are briefly discussed.

vanMeter, J. R.↗

Topological analysis of computed three-dimensional viscous flow fields

Computed solutions of the time-dependent, Reynolds-averaged Navier-Stokes equations for three dimensional flows having thin shear layers are analyzed using topological concepts. Specific examples include the transonic flow over a body of revolution with conical afterbody at moderate angles of incidence to the free stream. Experimental flow-visualization techniques are simulated graphically to visualize the computed flow. Scalar and vector fluid dynamics properties such as pressure, shear stress, and vorticity on the body surface are presented as topological maps, and their relationship to one another in terms of orientation and singular points is discussed. The extrapolation from these surface topologies toward the understanding of external flow-field behavior is and demonstrated.

Deiwert, G. S.↗

Topological analysis of computed three-dimensional viscous flow fields

Computed solutions of the time-dependent, Reynolds-averaged Navier-Stokes equations for three-dimensional flows having thin shear layers are analyzed, using topological concepts. Specific examples include the transonic flow over a body of revolution with conical afterbody at moderate angles of incidence to the free stream. Experimental flow-visualization techniques are simulated graphically to visualize the computed flow. Scalar and vector fluid dynamic properties, such as pressure, shear stress, and vorticity on the body surface, are presented as topological maps, and their relationship to one another in terms of orientation and singular points is discussed. The extrapolation from these surface topologies toward the understanding of external flow-field behavior is discussed and demonstrated.

Deiwert, G. S.↗

Architecture and data processing alternatives for the TSE computer. Volume 2: Extraction of topological information from an image by the Tse computer

A simple programmable Tse processor organization and arithmetic operations necessary for extraction of the desired topological information are described. Hardware additions to this organization are discussed along with trade-offs peculiar to the tse computing concept. An improved organization is presented along with the complementary software for the various arithmetic operations. The performance of the two organizations is compared in terms of speed, power, and cost. Software routines developed to extract the desired information from an image are included.

Jones, J. R.↗

A computational study of the topology of vortex breakdown

A fully three-dimensional numerical simulation of vortex breakdown using the unsteady, incompressible Navier-Stokes equations has been performed. Solutions to four distinct types of breakdown are identified and compared with experimental results. The computed solutions include weak helical, double helix, spiral, and bubble-type breakdowns. The topological structure of the various breakdowns as well as their interrelationship are studied. The data reveal that the asymmetric modes of breakdown may be subject to additional breakdowns as the vortex core evolves in the streamwise direction. The solutions also show that the freestream axial velocity distribution has a significant effect on the position and type of vortex breakdown.

Spall, Robert E.↗

A topological approach to computer-aided sensitivity analysis

Sensitivities of any arbitrary system are calculated using general purpose digital computer with available software packages for transfer function analysis. Sensitivity shows how element variation within system affects system performance. Signal flow graph illustrates topological system behavior and relationship among parameters in system.

Chan, S. P.↗

Optimal Network-Topology Design

Candidate network designs tested for acceptability and cost. Optimal Network Topology Design computer program developed as part of study on topology design and analysis of performance of Space Station Information System (SSIS) network. Uses efficient algorithm to generate candidate network designs consisting of subsets of set of all network components, in increasing order of total costs and checks each design to see whether it forms acceptable network. Technique gives true cost-optimal network and particularly useful when network has many constraints and not too many components. Program written in PASCAL.

Li, Victor O. K.↗