Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “unstructured”

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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
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 NTRS1993

A hybrid finite element-boundary integral for the analysis of cavity-backed antennas of arbitrary shape

This is the final report on this project which was concerned with the analysis of cavity-backed antennas and more specifically spiral antennas. The project was a continuation of a previous analysis, which employed rectangular brick elements, and was, thus, restricted to planar rectangular patch antennas. A total of five reports were submitted under this project and we expect that at least four journal papers will result from the research described in these reports. The abstracts of the four previous reports are included. The first of the reports (028918-1-T) is over 75 pages and describes the general formulation using tetrahedral elements and the computer program. Report 028918-2-T was written after the completion of the computer program and reviews the capability of the analysis and associated software for planar circular rectangular patches and for a rectangular planar spiral. Measurements were also done at the University of Michigan and at Mission Research Corp. for the purpose of validating the software. We are pleased to acknowledge a partial support from Mission Research Corp. in carrying out the work described in this report. The third report (028918-3-T) describes the formulation and partial validation (using 2D data) for patch antennas on a circular platform. The 3D validation and development of the formulation for patch antennas on circular platforms is still in progress. The fourth report (028918-4-T) is basically an invited journal paper which will appear in the 'J. Electromagnetic Waves and Applications' in early 1994. It describes the application of the finite element method in electromagnetics and is primarily based on our work here at U-M. This final report describes the culmination of our efforts in characterizing complex cavity-backed antennas on planar platforms. The report describes for the first time the analysis of non-planar spirals and non-rectangular slot antennas as well as traditional planar patch antennas. The comparisons between measurements and calculations are truly impressive. Another unique aspect of this work is the incorporation of the FFT as part of the BiCG solver by overlaying a structured triangular mesh over the unstructured mesh. The implementation of this BiCG-FFT solution algorithm is important in minimizing the CPU and storage requirements. This final report will be submitted for publication in a refereed journal.

Gong, Jian↗
NASA NTRS1992

Images constructed from computed flow fields

A method for constructing interferograms, schlieren, and shadowgraphs from ideal- and real-gas, two- and three-dimensional computed flow fields is described. The computational grids can be structured or unstructured, and multiple grids are an option. The constructed images are compared to experimental images for several types of flow, including a ramp, a blunt-body, a nozzle, and a reacting flow. The constructed images simulate the features observed in the experimental images. They are sensitive to errors in the flow-field solutions and can be used to identify solution errors. In addition, techniques for obtaining phase shifts from experimental finite-fringe interferograms and for removing experimentally induced phase-shift errors are discussed. Both the constructed images and calculated phase shifts can be used for validation of computational fluid dynamics (CFD) codes.

Yates, Leslie A.↗
NASA NTRS1993

Looking for O(N) Navier-Stokes solutions on non-structured meshes

Multigrid methods are good candidates for the resolution of the system arising in Numerical Fluid Dynamics. However, the question is to know if those algorithms which are efficient for the Poissan equation on structured meshes will still apply well to the Euler and Navier-Stokes equations on unstructured meshes. The study of elliptic problems leads us to define the conditions where a Full Multigrid strategy has O(N) complexity. The aim of this paper is to build a comparison between the elliptic theory and practical CFD problems. First, as an introduction, we will recall some basic definitions and theorems applied to a model problem. The goal of this section is to point out the different properties that we need to produce an FMG algorithm with O(N) complexity. Then, we will show how we can apply this theory to the fluid dynamics equations such as Euler and Navier-Stokes equations. At last, we present some results which are 2nd-order accurate and some explanations about the behavior of the FMG process.

Morano, Eric↗
NASA NTRS1993

An advancing-front Delaunay-triangulation algorithm designed for robustness

The following topics, which are associated with computational fluid dynamics, are discussed: unstructured mesh generation; the advancing front methodology; failures of the advancing front methodology; Delaunay triangulation; the Tanamua-Merriam algorithm; Yet Another Grid Generator (YAGG); and advancing front-Delaunay triangulation. The discussion is presented in viewgraph form.

D J Mavriplis↗
NASA NTRS1993

Dynamic mesh adaption for triangular and tetrahedral grids

The following topics are discussed: requirements for dynamic mesh adaption; linked-list data structure; edge-based data structure; adaptive-grid data structure; three types of element subdivision; mesh refinement; mesh coarsening; additional constraints for coarsening; anisotropic error indicator for edges; unstructured-grid Euler solver; inviscid 3-D wing; and mesh quality for solution-adaptive grids. The discussion is presented in viewgraph form.

Rupak Biswas↗
NASA NTRS1993

Experience with parametric binary dissection

Parametric Binary Dissection (PBD) is a new algorithm that can be used for partitioning graphs embedded in 2- or 3-dimensional space. It partitions explicitly on the basis of nodes + (lambda)x(edges cut), where lambda is the ratio of time to communicate over an edge to the time to compute at a node. The new algorithm is faster than the original binary dissection algorithm and attempts to obtain better partitions than the older algorithm, which only takes nodes into account. The performance of parametric dissection with plain binary dissection on 3 large unstructured 3-d meshes obtained from computational fluid dynamics and on 2 random graphs were compared. It was showm that the new algorithm can usually yield partitions that are substantially superior, but that its performance is heavily dependent on the input data.

Bokhari, Shahid H.↗
NASA NTRS1993

A multilevel adaptive projection method for unsteady incompressible flow

There are two main requirements for practical simulation of unsteady flow at high Reynolds number: the algorithm must accurately propagate discontinuous flow fields without excessive artificial viscosity, and it must have some adaptive capability to concentrate computational effort where it is most needed. We satisfy the first of these requirements with a second-order Godunov method similar to those used for high-speed flows with shocks, and the second with a grid-based refinement scheme which avoids some of the drawbacks associated with unstructured meshes. These two features of our algorithm place certain constraints on the projection method used to enforce incompressibility. Velocities are cell-based, leading to a Laplacian stencil for the projection which decouples adjacent grid points. We discuss features of the multigrid and multilevel iteration schemes required for solution of the resulting decoupled problem. Variable-density flows require use of a modified projection operator--we have found a multigrid method for this modified projection that successfully handles density jumps of thousands to one. Numerical results are shown for the 2D adaptive and 3D variable-density algorithms.

Howell, Louis H.↗
NASA NTRS1993

Techniques and resources for storm-scale numerical weather prediction

The topics discussed include the following: multiscale application of the 5th-generation PSU/NCAR mesoscale model, the coupling of nonhydrostatic atmospheric and hydrostatic ocean models for air-sea interaction studies; a numerical simulation of cloud formation over complex topography; adaptive grid simulations of convection; an unstructured grid, nonhydrostatic meso/cloud scale model; efficient mesoscale modeling for multiple scales using variable resolution; initialization of cloud-scale models with Doppler radar data; and making effective use of future computing architectures, networks, and visualization software.

Droegemeier, Kelvin↗
NASA NTRS1993

Evaluation of computer-aided instruction techniques for the crew interface coordination position

The Crew Interface Coordinator (CIC) is responsible for real-time voice and procedural communication between the payload crew on the orbiter and the payload operations team on the ground. This function is dedicated to science activities and operations, and may also include some responsibilities for crew training. CIC training at Marshall Space Flight Center (MSFC) consists of mission-independent training, mission simulations, and line-organization training. As identified by Schneider, the program provides very good generic training; however position-specific training may be obtained in a very unstructured way. A computer-based training system, identified as Mac CIC, is currently under development to address this issue. Mac CIC is intended to provide an intermediate level of training in order to prepare the CIC for the more intensive mission simulations. Although originally intended as an intelligent tutoring system, Mac CIC currently exists as a hypertext-based application. The objectives of this research is to evaluate the current system and to provide both recommendations and a detailed plan for Mac CIC's evolution into an intelligent tutoring system.

Moynihan, Gary P.↗
NASA NTRS1993

Parametric uncertainty modeling for application to robust control

Viewgraphs and a paper on parametric uncertainty modeling for application to robust control are included. Advanced robust control system analysis and design is based on the availability of an uncertainty description which separates the uncertain system elements from the nominal system. Although this modeling structure is relatively straightforward to obtain for multiple unstructured uncertainties modeled throughout the system, it is difficult to formulate for many problems involving real parameter variations. Furthermore, it is difficult to ensure that the uncertainty model is formulated such that the dimension of the resulting model is minimal. A procedure for obtaining an uncertainty model for real uncertain parameter problems in which the uncertain parameters can be represented in a multilinear form is presented. Furthermore, the procedure is formulated such that the resulting uncertainty model is minimal (or near minimal) relative to a given state space realization of the system. The approach is demonstrated for a multivariable third-order example problem having four uncertain parameters.

Belcastro, Christine M.↗
NASA NTRS1994

Agglomeration multigrid for the three-dimensional Euler equations

A multigrid procedure that makes use of coarse grids generated by the agglomeration of control volumes is advocated as a practical approach for solving the three dimensional Euler equations on unstructured grids about complex configurations. It is shown that the agglomeration procedure can be tailored to achieve certain coarse grid properties such as the sizes of the coarse grids and aspect ratios of the coarse grid cells. The agglomeration is done as a preprocessing step and runs in linear time. The implications for multigrid of using arbitrary polyhedral coarse grids are discussed. The agglomeration multigrid technique compares very favorably with existing multigrid procedures both in terms of convergence rates and elapsed times. The main advantage of the present approach is the ease with which coarse grids of any desired degree of coarseness may be generated in three dimensions, without being constrained by considerations of geometry. Inviscid flows over a variety of complex configurations are computed using the agglomeration multigrid strategy.

Venkatakrishnan, V.↗
NASA NTRS1993

Multidisciplinary aeroelastic analysis of a generic hypersonic vehicle

This paper presents details of a flutter and stability analysis of aerospace structures such as hypersonic vehicles. Both structural and aerodynamic domains are discretized by the common finite element technique. A vibration analysis is first performed by the STARS code employing a block Lanczos solution scheme. This is followed by the generation of a linear aerodynamic grid for subsequent linear flutter analysis within subsonic and supersonic regimes of the flight envelope; the doublet lattice and constant pressure techniques are employed to generate the unsteady aerodynamic forces. Flutter analysis is then performed for several representative flight points. The nonlinear flutter solution is effected by first implementing a CFD solution of the entire vehicle. Thus, a 3-D unstructured grid for the entire flow domain is generated by a moving front technique. A finite element Euler solution is then implemented employing a quasi-implicit as well as an explicit solution scheme. A novel multidisciplinary analysis is next effected that employs modal and aerodynamic data to yield aerodynamic damping characteristics. Such analyses are performed for a number of flight points to yield a large set of pertinent data that define flight flutter characteristics of the vehicle. This paper outlines the finite-element-based integrated analysis procedures in detail, which is followed by the results of numerical analyses of flight flutter simulation.

Gupta, K. K.↗
NASA NTRS1994

Autonomous mobile robot teams

This paper describes autonomous mobile robot teams performing tasks in unstructured environments. The behavior and the intelligence of the group is distributed, and the system does not include a central command base or leader. The novel concept of the Tropism-Based Cognitive Architecture is introduced, which is used by the robots in order to produce behavior transforming their sensory information to proper action. The results of a number of simulation experiments are presented. These experiments include worlds where the robot teams must locate, decompose, and gather objects, and defend themselves against hostile predators, while navigating around stationary and mobile obstacles.

Agah, Arvin↗
NASA NTRS1994

Extending HPF for advanced data parallel applications

The stated goal of High Performance Fortran (HPF) was to 'address the problems of writing data parallel programs where the distribution of data affects performance'. After examining the current version of the language we are led to the conclusion that HPF has not fully achieved this goal. While the basic distribution functions offered by the language - regular block, cyclic, and block cyclic distributions - can support regular numerical algorithms, advanced applications such as particle-in-cell codes or unstructured mesh solvers cannot be expressed adequately. We believe that this is a major weakness of HPF, significantly reducing its chances of becoming accepted in the numeric community. The paper discusses the data distribution and alignment issues in detail, points out some flaws in the basic language, and outlines possible future paths of development. Furthermore, we briefly deal with the issue of task parallelism and its integration with the data parallel paradigm of HPF.

Chapman, Barbara↗
NASA NTRS1992

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗
NASA NTRS1994

Agglomeration multigrid for viscous turbulent flows

Agglomeration multigrid, which has been demonstrated as an efficient and automatic technique for the solution of the Euler equations on unstructured meshes, is extended to viscous turbulent flows. For diffusion terms, coarse grid discretizations are not possible, and more accurate grid transfer operators are required as well. A Galerkin coarse grid operator construction and an implicit prolongation operator are proposed. Their suitability is evaluated by examining their effect on the solution of Laplace's equation. The resulting strategy is employed to solve the Reynolds-averaged Navier-Stokes equations for aerodynamic flows. Convergence rates comparable to those obtained by a previously developed non-nested mesh multigrid approach are demonstrated, and suggestions for further improvements are given.

Mavriplis, D. J.↗
NASA NTRS1994

The MITy micro-rover: Sensing, control, and operation

The sensory, control, and operation systems of the 'MITy' Mars micro-rover are discussed. It is shown that the customized sun tracker and laser rangefinder provide internal, autonomous dead reckoning and hazard detection in unstructured environments. The micro-rover consists of three articulated platforms with sensing, processing and payload subsystems connected by a dual spring suspension system. A reactive obstacle avoidance routine makes intelligent use of robot-centered laser information to maneuver through cluttered environments. The hazard sensors include a rangefinder, inclinometers, proximity sensors and collision sensors. A 486/66 laptop computer runs the graphical user interface and programming environment. A graphical window displays robot telemetry in real time and a small TV/VCR is used for real time supervisory control. Guidance, navigation, and control routines work in conjunction with the mapping and obstacle avoidance functions to provide heading and speed commands that maneuver the robot around obstacles and towards the target.

Malafeew, Eric↗