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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1988

Finite element solution of the Euler equations in two and three dimensions

The paper presents a finite element procedure for solving the equations of compressible flow over bodies of arbitrary geometry. The numerical solution algorithm employed is an explicit two-step version of a second order Taylor-Galerkin scheme. The discretization of the computational domain into unstructured meshes of triangles in two dimensions and tetrahedra in three dimensions is performed by an automatic mesh generator. In the approach, the mesh generator is coupled to the finite element solver to produce an adaptive remeshing procedure.

Peiro, J.↗
NASA NTRS1990

Unstructured mesh methods for CFD

Mesh generation methods for Computational Fluid Dynamics (CFD) are outlined. Geometric modeling is discussed. An advancing front method is described. Flow past a two engine Falcon aeroplane is studied. An algorithm and associated data structure called the alternating digital tree, which efficiently solves the geometric searching problem is described. The computation of an initial approximation to the steady state solution of a given poblem is described. Mesh generation for transient flows is described.

Peraire, J.↗
NASA NTRS1993

3D Euler flow solutions using unstructured Cartesian and prismatic grids

A hyperbolic prismatic grid generation technique is combined with a background Cartesian grid for the study of inviscid three-dimensional flows. The mathematics of the hyperbolic prismatic grid generation algorithm are described, and some simple inviscid demonstration cases are presented. By combining the simplicity of the Cartesian background grid with the geometric flexibility and computational efficiencies inherent to prismatic grids, this approach shows promise for improving computational aerodynamic simulations.

Melton, John E.↗
NASA NTRS1992

Two-dimensional unstructured triangular grid generation

The capability of generating 2-D unstructured triangular meshes about arbitrary geometries is demonstrated. This work uses a distribution of boundary points and triangulates the computational domain using a Delaunay triangulation algorithm. Typically, initial cells are added based on cell aspect ratios or cell areas. A resulting mesh can then be used along with the connectivity of the cells to solve either a Euler or Navier-Stokes flow problem.

Jorgenson, Philip C. E.↗
NASA NTRS1998

Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes

Unstructured multigrid techniques for relieving the stiffness associated with high-Reynolds number viscous flow simulations on extremely stretched grids are investigated. One approach consists of employing a semi-coarsening or directional-coarsening technique, based on the directions of strong coupling within the mesh, in order to construct more optimal coarse grid levels. An alternate approach is developed which employs directional implicit smoothing with regular fully coarsened multigrid levels. The directional implicit smoothing is obtained by constructing implicit lines in the unstructured mesh based on the directions of strong coupling. Both approaches yield large increases in convergence rates over the traditional explicit full-coarsening multigrid algorithm. However, maximum benefits are achieved by combining the two approaches in a coupled manner into a single algorithm. An order of magnitude increase in convergence rate over the traditional explicit full-coarsening algorithm is demonstrated, and convergence rates for high-Reynolds number viscous flows which are independent of the grid aspect ratio are obtained. Further acceleration is provided by incorporating low-Mach-number preconditioning techniques, and a Newton-GMRES strategy which employs the multigrid scheme as a preconditioner. The compounding effects of these various techniques on speed of convergence is documented through several example test cases.

Movriplis, Dimitri J.↗
NASA NTRS2014

Aeroelastic Modeling of a Nozzle Startup Transient

Lateral nozzle forces are known to cause severe structural damage to any new rocket engine in development during test. While three-dimensional, transient, turbulent, chemically reacting computational fluid dynamics methodology has been demonstrated to capture major side load physics with rigid nozzles, hot-fire tests often show nozzle structure deformation during major side load events, leading to structural damages if structural strengthening measures were not taken. The modeling picture is incomplete without the capability to address the two-way responses between the structure and fluid. The objective of this study is to develop a tightly coupled aeroelastic modeling algorithm by implementing the necessary structural dynamics component into an anchored computational fluid dynamics methodology. The computational fluid dynamics component is based on an unstructured-grid, pressure-based computational fluid dynamics formulation, while the computational structural dynamics component is developed under the framework of modal analysis. Transient aeroelastic nozzle startup analyses at sea level were performed, and the computed transient nozzle fluid-structure interaction physics presented,

Wang, Ten-See↗
NASA NTRS1992

Mapping unstructured grid computations to massively parallel computers

Investigated here is this mapping problem: assign the tasks of a parallel program to the processors of a parallel computer such that the execution time is minimized. First, a taxonomy of objective functions and heuristics used to solve the mapping problem is presented. Next, we develop a highly parallel heuristic mapping algorithm, called Cyclic Pairwise Exchange (CPE), and discuss its place in the taxonomy. CPE uses local pairwise exchanges of processor assignments to iteratively improve an initial mapping. A variety of initial mapping schemes are tested and recursive spectral bipartitioning (RSB) followed by CPE is shown to result in the best mappings. For the test cases studied here, problems arising in computational fluid dynamics and structural mechanics on unstructured triangular and tetrahedral meshes, RSB and CPE outperform methods based on simulated annealing. Much less time is required to do the mapping and the results obtained are better. Compared with random and naive mappings, RSB and CPE reduce the communication time two fold for the test problems used. Finally, we use CPE in two applications on a CM-2. The first application is a data parallel mesh-vertex upwind finite volume scheme for solving the Euler equations on 2-D triangular unstructured meshes. CPE is used to map grid points to processors. The performance of this code is compared with a similar code on a Cray-YMP and an Intel iPSC/860. The second application is parallel sparse matrix-vector multiplication used in the iterative solution of large sparse linear systems of equations. We map rows of the matrix to processors and use an inner-product based matrix-vector multiplication. We demonstrate that this method is an order of magnitude faster than methods based on scan operations for our test cases.

Hammond, Steven Warren↗
NASA NTRS2000

High Performance Fortran for Aerospace Applications

This paper focuses on the use of High Performance Fortran (HPF) for important classes of algorithms employed in aerospace applications. HPF is a set of Fortran extensions designed to provide users with a high-level interface for programming data parallel scientific applications, while delegating to the compiler/runtime system the task of generating explicitly parallel message-passing programs. We begin by providing a short overview of the HPF language. This is followed by a detailed discussion of the efficient use of HPF for applications involving multiple structured grids such as multiblock and adaptive mesh refinement (AMR) codes as well as unstructured grid codes. We focus on the data structures and computational structures used in these codes and on the high-level strategies that can be expressed in HPF to optimally exploit the parallelism in these algorithms.

Mehrotra, Piyush↗
NASA NTRS1987

Multi-limbed locomotion systems for space construction and maintenance

A well developed technology of coordination of multi-limbed locomotory systems is now available. Results from a NASA sponsored study of several years ago are presented. This was a simulation study of a three-limbed locomotion/manipulation system. Each limb had six degrees of freedom and could be used either as a locomotory grasping hand-holds, or as a manipulator. The focus of the study was kinematic coordination algorithms. The presentation will also include very recent results from the Adaptive Suspension Vehicle Project. The Adaptive Suspension Vehicle (ASV) is a legged locomotion system designed for terrestrial use which is capable of operating in completely unstructured terrain in either a teleoperated or operator-on-board mode. Future development may include autonomous operation. The ASV features a very advanced coordination and control system which could readily be adapted to operation in space. An inertial package with a vertical gyro, and rate gyros and accelerometers on three orthogonal axes provides body position information at high bandwidth. This is compared to the operator's commands, injected via a joystick to provide a commanded force system on the vehicle's body. This system is, in turn, decomposed by a coordination algorithm into force commands to those legs which are in contact with the ground.

Waldron, K. J.↗
NASA NTRS2002

Higher Order Time Integration Schemes for the Unsteady Navier-Stokes Equations on Unstructured Meshes

The efficiency gains obtained using higher-order implicit Runge-Kutta schemes as compared with the second-order accurate backward difference schemes for the unsteady Navier-Stokes equations are investigated. Three different algorithms for solving the nonlinear system of equations arising at each timestep are presented. The first algorithm (NMG) is a pseudo-time-stepping scheme which employs a non-linear full approximation storage (FAS) agglomeration multigrid method to accelerate convergence. The other two algorithms are based on Inexact Newton's methods. The linear system arising at each Newton step is solved using iterative/Krylov techniques and left preconditioning is used to accelerate convergence of the linear solvers. One of the methods (LMG) uses Richardson's iterative scheme for solving the linear system at each Newton step while the other (PGMRES) uses the Generalized Minimal Residual method. Results demonstrating the relative superiority of these Newton's methods based schemes are presented. Efficiency gains as high as 10 are obtained by combining the higher-order time integration schemes with the more efficient nonlinear solvers.

Jothiprasad, Giridhar↗
NASA NTRS1994

Comments regarding two upwind methods for solving two-dimensional external flows using unstructured grids

Steady flow over the leading portion of a multicomponent airfoil section is studied using computational fluid dynamics (CFD) employing an unstructured grid. To simplify the problem, only the inviscid terms are retained from the Reynolds-averaged Navier-Stokes equations - leaving the Euler equations. The algorithm is derived using the finite-volume approach, incorporating explicit time-marching of the unsteady Euler equations to a time-asymptotic, steady-state solution. The inviscid fluxes are obtained through either of two approximate Riemann solvers: Roe's flux difference splitting or van Leer's flux vector splitting. Results are presented which contrast the solutions given by the two flux functions as a function of Mach number and grid resolution. Additional information is presented concerning code verification techniques, flow recirculation regions, convergence histories, and computational resources.

Kleb, W. L.↗
NASA NTRS2002

Application of Quaternions for Mesh Deformation

A new three-dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.

Samareh, Jamshid A.↗
NASA NTRS2002

Application of Quaternions for Mesh

A new three dimensional mesh deformation algorithm, based on quaternion algebra, is introduced. A brief overview of quaternion algebra is provided, along with some preliminary results for two-dimensional structured and unstructured viscous mesh deformation.

Samareh, Jamshid A.↗
NASA NTRS2013

Summary of Data from the Fifth AIAA CFD Drag Prediction Workshop

Results from the Fifth AIAA CFD Drag Prediction Workshop (DPW-V) are presented. As with past workshops, numerical calculations are performed using industry-relevant geometry, methodology, and test cases. This workshop focused on force/moment predictions for the NASA Common Research Model wing-body configuration, including a grid refinement study and an optional buffet study. The grid refinement study used a common grid sequence derived from a multiblock topology structured grid. Six levels of refinement were created resulting in grids ranging from 0.64x10(exp 6) to 138x10(exp 6) hexahedra - a much larger range than is typically seen. The grids were then transformed into structured overset and hexahedral, prismatic, tetrahedral, and hybrid unstructured formats all using the same basic cloud of points. This unique collection of grids was designed to isolate the effects of grid type and solution algorithm by using identical point distributions. This study showed reduced scatter and standard deviation from previous workshops. The second test case studied buffet onset at M=0.85 using the Medium grid (5.1x106 nodes) from the above described sequence. The prescribed alpha sweep used finely spaced intervals through the zone where wing separation was expected to begin. Some solutions exhibited a large side of body separation bubble that was not observed in the wind tunnel results. An optional third case used three sets of geometry, grids, and conditions from the Turbulence Model Resource website prepared by the Turbulence Model Benchmarking Working Group. These simple cases were intended to help identify potential differences in turbulence model implementation. Although a few outliers and issues affecting consistency were identified, the majority of participants produced consistent results.

Levy, David W.↗
NASA NTRS2000

Mixed Element Type Unstructured Grid Generation for Viscous Flow Applications

A procedure is presented for efficient generation of high-quality unstructured grids suitable for CFD simulation of high Reynolds number viscous flow fields. Layers of anisotropic elements are generated by advancing along prescribed normals from solid boundaries. The points are generated such that either pentahedral or tetrahedral elements with an implied connectivity can be be directly recovered. As points are generated they are temporarily attached to a volume triangulation of the boundary points. This triangulation allows efficient local search algorithms to be used when checking merging layers, The existing advancing-front/local-reconnection procedure is used to generate isotropic elements outside of the anisotropic region. Results are presented for a variety of applications. The results demonstrate that high-quality anisotropic unstructured grids can be efficiently and consistently generated for complex configurations.

Marcum, David L.↗
NASA NTRS1991

Distributed memory compiler methods for irregular problems: Data copy reuse and runtime partitioning

Outlined here are two methods which we believe will play an important role in any distributed memory compiler able to handle sparse and unstructured problems. We describe how to link runtime partitioners to distributed memory compilers. In our scheme, programmers can implicitly specify how data and loop iterations are to be distributed between processors. This insulates users from having to deal explicitly with potentially complex algorithms that carry out work and data partitioning. We also describe a viable mechanism for tracking and reusing copies of off-processor data. In many programs, several loops access the same off-processor memory locations. As long as it can be verified that the values assigned to off-processor memory locations remain unmodified, we show that we can effectively reuse stored off-processor data. We present experimental data from a 3-D unstructured Euler solver run on iPSC/860 to demonstrate the usefulness of our methods.

Das, Raja↗
NASA NTRS1997

Aerodynamic Shape Sensitivity Analysis and Design Optimization of Complex Configurations Using Unstructured Grids

A three-dimensional unstructured grid approach to aerodynamic shape sensitivity analysis and design optimization has been developed and is extended to model geometrically complex configurations. The advantage of unstructured grids (when compared with a structured-grid approach) is their inherent ability to discretize irregularly shaped domains with greater efficiency and less effort. Hence, this approach is ideally suited for geometrically complex configurations of practical interest. In this work the nonlinear Euler equations are solved using an upwind, cell-centered, finite-volume scheme. The discrete, linearized systems which result from this scheme are solved iteratively by a preconditioned conjugate-gradient-like algorithm known as GMRES for the two-dimensional geometry and a Gauss-Seidel algorithm for the three-dimensional; similar procedures are used to solve the accompanying linear aerodynamic sensitivity equations in incremental iterative form. As shown, this particular form of the sensitivity equation makes large-scale gradient-based aerodynamic optimization possible by taking advantage of memory efficient methods to construct exact Jacobian matrix-vector products. Simple parameterization techniques are utilized for demonstrative purposes. Once the surface has been deformed, the unstructured grid is adapted by considering the mesh as a system of interconnected springs. Grid sensitivities are obtained by differentiating the surface parameterization and the grid adaptation algorithms with ADIFOR (which is an advanced automatic-differentiation software tool). To demonstrate the ability of this procedure to analyze and design complex configurations of practical interest, the sensitivity analysis and shape optimization has been performed for a two-dimensional high-lift multielement airfoil and for a three-dimensional Boeing 747-200 aircraft.

Taylor, Arthur C., III↗
NASA NTRS1989

Embedded adaptation for time dependent real fluid/gas flows

An embedded adaptation algorithm is used to illustrate applications and requirements for Navier-Stokes and nonequilibrium unsteady two-dimensional flow fields. Both grid refinement and equation modification are included for unstructured distributions of quadrilateral cells. Multiple refinement parameters for distinct physical phenomena serve to monitor the evolving nonuniform field and to recognize flow features in isolated and overlapping subdomains. Examples from subsonic, hypersonic, internal, and external fields show substantial advantages for the adaptive approach.

Baron, Judson R.↗