Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured algorithm”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Diffusion Characteristics of Upwind Schemes on Unstructured Triangulations

The diffusive characteristics of two upwind schemes, multi-dimensional fluctuation splitting and dimensionally-split finite volume, are compared for scalar advection-diffusion problems. Algorithms for the two schemes are developed for node-based data representation on median-dual meshes associated with unstructured triangulations in two spatial dimensions. Four model equations are considered: linear advection, non-linear advection, diffusion, and advection-diffusion. Modular coding is employed to isolate the effects of the two approaches for upwind flux evaluation, allowing for head-to-head accuracy and efficiency comparisons. Both the stability of compressive limiters and the amount of artificial diffusion generated by the schemes is found to be grid-orientation dependent, with the fluctuation splitting scheme producing less artificial diffusion than the dimensionally-split finite volume scheme. Convergence rates are compared for the combined advection-diffusion problem, with a speedup of 2-3 seen for fluctuation splitting versus finite volume when solved on the same mesh. However, accurate solutions to problems with small diffusion coefficients can be achieved on coarser meshes using fluctuation splitting rather than finite volume, so that when comparing convergence rates to reach a given accuracy, fluctuation splitting shows a 20-25 speedup over finite volume.

Wood, William A.↗
NASA NTRS1986

Reduced conservatism in stability robustness bounds by state transformation

This note addresses the issue of 'conservatism' in the time domain stability robustness bounds obtained by the Liapunov approach. A state transformation is employed to improve the upper bounds on the linear time-varying perturbation of an asymptotically stable linear time-invariant system for robust stability. This improvement is due to the variance of the conservatism of the Liapunov approach with respect to the basis of the vector space in which the Liapunov function is constructed. Improved bounds are obtained, using a transformation, on elemental and vector norms of perturbations (i.e., structured perturbations) as well as on a matrix norm of perturbations (i.e., unstructured perturbations). For the case of a diagonal transformation, an algorithm is proposed to find the 'optimal' transformation. Several examples are presented to illustrate the proposed analysis.

Yedavalli, R. K.↗
NASA NTRS1992

Finite-element solution scheme for compressible viscous flow

Adaptivity offers the possibility of using FEM for problems that are otherwise intractable. The solution algorithm is combined with an adaptive approach in which the unstructured portion of the grid is adaptively regenerated as the solution proceeds; the structured portion of the mesh is modified accordingly, to ensure both compatibility along the interface between the implicit and explicit element groups and increased resolution of the viscous layer. The approach offers significant computational savings in 3D simulations.

Hassan, O.↗
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

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 NTRS2005

Vision guided landing of an an autonomous helicopter in hazardous terrain

Future robotic space missions will employ a precision soft-landing capability that will enable exploration of previously inaccessible sites that have strong scientific significance. To enable this capability, a fully autonomous onboard system that identifies and avoids hazardous features such as steep slopes and large rocks is required. Such a system will also provide greater functionality in unstructured terrain to unmanned aerial vehicles. This paper describes an algorithm for landing hazard avoidance based on images from a single moving camera. The core of the algorithm is an efficient application of structure from motion to generate a dense elevation map of the landing area. Hazards are then detected in this map and a safe landing site is selected. The algorithm has been implemented on an autonomous helicopter testbed and demonstrated four times resulting in the first autonomous landing of an unmanned helicopter in unknown and hazardous terrain.

Mars Landing↗
NASA NTRS2009

Aerodynamic Interference Due to MSL Reaction Control System

An investigation of effectiveness of the reaction control system (RCS) of Mars Science Laboratory (MSL) entry capsule during atmospheric flight has been conducted. The reason for the investigation is that MSL is designed to fly a lifting actively guided entry with hypersonic bank maneuvers, therefore an understanding of RCS effectiveness is required. In the course of the study several jet configurations were evaluated using Langley Aerothermal Upwind Relaxation Algorithm (LAURA) code, Data Parallel Line Relaxation (DPLR) code, Fully Unstructured 3D (FUN3D) code and an Overset Grid Flowsolver (OVERFLOW) code. Computations indicated that some of the proposed configurations might induce aero-RCS interactions, sufficient to impede and even overwhelm the intended control torques. It was found that the maximum potential for aero-RCS interference exists around peak dynamic pressure along the trajectory. Present analysis largely relies on computational methods. Ground testing, flight data and computational analyses are required to fully understand the problem. At the time of this writing some experimental work spanning range of Mach number 2.5 through 4.5 has been completed and used to establish preliminary levels of confidence for computations. As a result of the present work a final RCS configuration has been designed such as to minimize aero-interference effects and it is a design baseline for MSL entry capsule.

Dyakonov, Artem A.↗
NASA NTRS2012

Improved Finite-Volume Method for Radiative Hydrodynamics

Fully coupled simulations of hydrodynamics and radiative transfer are essential to a number of fields ranging from astrophysics to engineering applications. Of particular interest in this work are hypersonic atmospheric entries and associated experimental apparatus, e.g., shock tubes and high enthalpy testing facilities. The radiative transfer calculations must supply to the CFD a heating term in the energy equation in the form of the divergence of the radiative heat flux and the radiative heat fluxes to bounding surfaces. It is most efficient to solve the radiative transfer equation on the same grid as the CFD solution, and this work presents an algorithm with improved accuracy for such simulations on structured and unstructured grids compared to more conventional approaches. Results will be shown for shock radiation during hypersonic reentry. Issues of parallelization within a radiation sweep will also be discussed.

Wray, Alan↗
NASA NTRS1974

Parallel tridiagonal equation solvers

Three parallel algorithms were compared for the direct solution of tridiagonal linear systems of equations. The algorithms are suitable for computers such as ILLIAC 4 and CDC STAR. For array computers similar to ILLIAC 4, cyclic odd-even reduction has the least operation count for highly structured sets of equations, and recursive doubling has the least count for relatively unstructured sets of equations. Since the difference in operation counts for these two algorithms is not substantial, their relative running times may be more related to overhead operations, which are not measured in this paper. The third algorithm, based on Buneman's Poisson solver, has more arithmetic operations than the others, and appears to be the least favorable. For pipeline computers similar to CDC STAR, cyclic odd-even reduction appears to be the most preferable algorithm for all cases.

Stone, H. S.↗
NASA NTRS1991

Parallel Methods on Large-Scale Structural Analysis and Physics Applications; Symposium, Hampton, VA, Feb. 5, 6, 1991, Selected Papers

Recent advances in parallel methods and algorithms integrated into large-scale codes are presented. Consideration is given to problem decomposition (substructuring), efficient matrix solution algorithms for shared memory architectures, dynamic and transient analysis algorithms for shared memory architectures, and algorithms for distributed and massively parallel architectures. Particular attention is given to partitioning of unstructured problems for parallel processing, parallel-vector computation for linear-structural analysis and nonlinear unconstraint optimization problems, a parallel-vector equation solver for unsymmetric matrices on supercomputers, parallel nonlinear finite element dynamic response, multigrid algorithms for solving structural mechanics problems on supercomputers, structural analysis on massively parallel computers, explicit finite element methods with contact-impact on SIMD computers, and the impact of mapping and sparsity on parallelized finite element method modules.

Storaasli, Olaf O.↗
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 NTRS1996

Segmentation of Unstructured Datasets

Datasets generated by computer simulations and experiments in Computational Fluid Dynamics tend to be extremely large and complex. It is difficult to visualize these datasets using standard techniques like Volume Rendering and Ray Casting. Object Segmentation provides a technique to extract and quantify regions of interest within these massive datasets. This thesis explores basic algorithms to extract coherent amorphous regions from two-dimensional and three-dimensional scalar unstructured grids. The techniques are applied to datasets from Computational Fluid Dynamics and from Finite Element Analysis.

Bhat, Smitha↗
NASA NTRS1993

Application of a two-equation turbulence model for high speed compressible flows using unstructured grids

Application of a two-equation compressible turbulence model for practical hypersonic flows 18 presented. The solution algorithm is based on solving all of the governing equations simultaneously. Application of the solution procedure to several test cases for compressible flows show good agreement with theoretical predictions and/or other computational results. The solution procedure is employed to investigate the effects of turbulence in Type III and Type IV shock-shock interactions in hypersonic flows in association with adaptive unstructured grids. Computational results for these cases are compared with available experimental data.

Vemaganti, Gururaja R.↗
NASA NTRS1987

Finite element methods for compressible flows

The problems of mesh generation and developing effective algorithms for the solution of the equations of compressible flow on unstructured meshes are discussed. Adaptive mesh refinement methods can be implemented in a straightforward manner. Possible adaptive strategies are examined. A finite element method adapted to problems involving high speed compressible flow is described. The adaptive mesh regeneration procedure appears to offer the possibility of large computational savings in three dimensional flow computation.

Morgan, K.↗
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 NTRS1998

On Convergence Acceleration Techniques for Unstructured Meshes

A discussion of convergence acceleration techniques as they relate to computational fluid dynamics problems on unstructured meshes is given. Rather than providing a detailed description of particular methods, the various different building blocks of current solution techniques are discussed and examples of solution strategies using one or several of these ideas are given. Issues relating to unstructured grid CFD problems are given additional consideration, including suitability of algorithms to current hardware trends, memory and cpu tradeoffs, treatment of non-linearities, and the development of efficient strategies for handling anisotropy-induced stiffness. The outlook for future potential improvements is also discussed.

Mavriplis, Dimitri J.↗