Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Unstructured grids”

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 883 records · Page 49

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.↗

Kinematic domain decomposition to simulate flows past moving objects

A new method is developed to solve the unsteady Navier-Stokes equations on a composite grid which consists of subdomain grids moving with respect to each other. These subdomains are structured grids with different topologies. However, their interfaces are unstructured in the sense that they may or may not arbitrarily overlap with each other. This method captures the boundary-motion-induced flow component. The method is demonstrated for a transonic flow past an airfoil which experiences a combined motion of pitching and plunging.

Baysal, Oktay↗

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

High-Order Methods↗

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

Direct Numerical Simulations↗

Improvements to the Unstructured Mesh Generator MESH3D

The AIRPLANE process starts with an aircraft geometry stored in a CAD system. The surface is modeled with a mesh of triangles and then the flow solver produces pressures at surface points which may be integrated to find forces and moments. The biggest advantage is that the grid generation bottleneck of the CFD process is eliminated when an unstructured tetrahedral mesh is used. MESH3D is the key to turning around the first analysis of a CAD geometry in days instead of weeks. The flow solver part of AIRPLANE has proven to be robust and accurate over a decade of use at NASA. It has been extensively validated with experimental data and compares well with other Euler flow solvers. AIRPLANE has been applied to all the HSR geometries treated at Ames over the course of the HSR program in order to verify the accuracy of other flow solvers. The unstructured approach makes handling complete and complex geometries very simple because only the surface of the aircraft needs to be discretized, i.e. covered with triangles. The volume mesh is created automatically by MESH3D. AIRPLANE runs well on multiple platforms. Vectorization on the Cray Y-MP is reasonable for a code that uses indirect addressing. Massively parallel computers such as the IBM SP2, SGI Origin 2000, and the Cray T3E have been used with an MPI version of the flow solver and the code scales very well on these systems. AIRPLANE can run on a desktop computer as well. AIRPLANE has a future. The unstructured technologies developed as part of the HSR program are now targeting high Reynolds number viscous flow simulation. The pacing item in this effort is Navier-Stokes mesh generation.

Thomas, Scott D.↗

Unstructured Mesh Methods for the Simulation of Hypersonic Flows

This report describes the research work undertaken at the Massachusetts Institute of Technology. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of hypersonic viscous flows about re-entry vehicles. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use, of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the, code which incorporates real gas effects, has been produced. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. In figures I and 2, we show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although these initial results were encouraging, it became apparent that in order to develop a fully functional capability for viscous flows, several advances in gridding, solution accuracy, robustness and efficiency were required. As part of this research we have developed: 1) automatic meshing techniques and the corresponding computer codes have been delivered to NASA and implemented into the GridEx system, 2) a finite element algorithm for the solution of the viscous compressible flow equations which can solve flows all the way down to the incompressible limit and that can use higher order (quadratic) approximations leading to highly accurate answers, and 3) and iterative algebraic multigrid solution techniques.

Peraire, Jaime↗

Development of an Unstructured Mesh Code for Flows About Complete Vehicles

This report describes the research work undertaken at the Massachusetts Institute of Technology, under NASA Research Grant NAG4-157. The aim of this research is to identify effective algorithms and methodologies for the efficient and routine solution of flow simulations about complete vehicle configurations. For over ten years we have received support from NASA to develop unstructured mesh methods for Computational Fluid Dynamics. As a result of this effort a methodology based on the use of unstructured adapted meshes of tetrahedra and finite volume flow solvers has been developed. A number of gridding algorithms, flow solvers, and adaptive strategies have been proposed. The most successful algorithms developed from the basis of the unstructured mesh system FELISA. The FELISA system has been extensively for the analysis of transonic and hypersonic flows about complete vehicle configurations. The system is highly automatic and allows for the routine aerodynamic analysis of complex configurations starting from CAD data. The code has been parallelized and utilizes efficient solution algorithms. For hypersonic flows, a version of the code which incorporates real gas effects, has been produced. The FELISA system is also a component of the STARS aeroservoelastic system developed at NASA Dryden. One of the latest developments before the start of this grant was to extend the system to include viscous effects. This required the development of viscous generators, capable of generating the anisotropic grids required to represent boundary layers, and viscous flow solvers. We show some sample hypersonic viscous computations using the developed viscous generators and solvers. Although this initial results were encouraging it became apparent that in order to develop a fully functional capability for viscous flows, several advances in solution accuracy, robustness and efficiency were required. In this grant we set out to investigate some novel methodologies that could lead to the required improvements. In particular we focused on two fronts: (1) finite element methods and (2) iterative algebraic multigrid solution techniques.

Peraire, Jaime↗

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.↗

First coupled GENE–XGC microturbulence simulations

Covering the core and the edge region of a tokamak, respectively, the two gyrokinetic turbulence codes Gyrokinetic Electromagnetic Numerical Experiment (GENE) and X-point Gyrokinetic Code (XGC) have been successfully coupled by exchanging three-dimensional charge density data needed to solve the gyrokinetic Poisson equation over the entire spatial domain. Certain challenges for the coupling procedure arise from the fact that the two codes employ completely different numerical methods. This includes, in particular, the necessity to introduce mapping procedures for the transfer of data between the unstructured triangular mesh of XGC and the logically rectangular grid (in a combination of real and Fourier space) used by GENE. Constraints on the coupling scheme are also imposed by the use of different time integrators. First, coupled simulations are presented. We have considered collisionless ion temperature gradient turbulence, in both circular and fully shaped plasmas. Coupled simulations successfully reproduce both GENE and XGC reference results, confirming the validity of the code coupling approach toward a whole device model. Here, many lessons learned in the present context, in particular, the need for a coupling procedure as flexible as possible, should be valuable to our and other efforts to couple different kinds of codes in pursuit of a more comprehensive description of complex real-world systems and will drive our further developments of a whole device model for fusion plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A User's Guide to CGNS

The CFD General Notation System (CGNS) was developed to be a self-descriptive, machine-independent standard for storing CFD aerodynamic data. This guide aids users in the implementation of CGNS. It is intended as a tutorial on the usage of the CGNS mid-level library routines for reading and writing grid and flow solution datasets for both structured and unstructured methodologies.

Rumsey, Christopher L.↗

Comparison of Node-Centered and Cell-Centered Unstructured Finite-Volume Discretizations: Inviscid Fluxes

Cell-centered and node-centered approaches have been compared for unstructured finite-volume discretization of inviscid fluxes. The grids range from regular grids to irregular grids, including mixed-element grids and grids with random perturbations of nodes. Accuracy, complexity, and convergence rates of defect-correction iterations are studied for eight nominally second-order accurate schemes: two node-centered schemes with weighted and unweighted least-squares (LSQ) methods for gradient reconstruction and six cell-centered schemes two node-averaging with and without clipping and four schemes that employ different stencils for LSQ gradient reconstruction. The cell-centered nearest-neighbor (CC-NN) scheme has the lowest complexity; a version of the scheme that involves smart augmentation of the LSQ stencil (CC-SA) has only marginal complexity increase. All other schemes have larger complexity; complexity of node-centered (NC) schemes are somewhat lower than complexity of cell-centered node-averaging (CC-NA) and full-augmentation (CC-FA) schemes. On highly anisotropic grids typical of those encountered in grid adaptation, discretization errors of five of the six cell-centered schemes converge with second order on all tested grids; the CC-NA scheme with clipping degrades solution accuracy to first order. The NC schemes converge with second order on regular and/or triangular grids and with first order on perturbed quadrilaterals and mixed-element grids. All schemes may produce large relative errors in gradient reconstruction on grids with perturbed nodes. Defect-correction iterations for schemes employing weighted least-square gradient reconstruction diverge on perturbed stretched grids. Overall, the CC-NN and CC-SA schemes offer the best options of the lowest complexity and secondorder discretization errors. On anisotropic grids over a curved body typical of turbulent flow simulations, the discretization errors converge with second order and are small for the CC-NN, CC-SA, and CC-FA schemes on all grids and for NC schemes on triangular grids; the discretization errors of the CC-NA scheme without clipping do not converge on irregular grids. Accurate gradient reconstruction can be achieved by introducing a local approximate mapping; without approximate mapping, only the NC scheme with weighted LSQ method provides accurate gradients. Defect correction iterations for the CC-NA scheme without clipping diverge; for the NC scheme with weighted LSQ method, the iterations either diverge or converge very slowly. The best option in curved geometries is the CC-SA scheme that offers low complexity, second-order discretization errors, and fast convergence.

Diskin, Boris↗

Overset meshes for incompressible flows: On preserving accuracy of underlying discretizations

This study on overset meshes for incompressible-flow simulations is motivated by accurate prediction of wind farm aerodynamics involving large motions and deformations of components with complex geometry. Specifically, using first-order hyperbolic and elliptic equation proxies for the incompressible Navier-Stokes (NS) equations, we investigate the influence of information exchange between overset meshes on numerical performance where the underlying discretization is second-order accurate. The first aspect of information exchange surrounds interpolation of solution where we examine Lagrange and point-cloud-based interpolation for creating constraint equations between overset meshes. To maintain overall second-order accuracy, higher-order interpolation is required for elliptic problems, but linear interpolation is sufficient for hyperbolic problems in first-order form. Higher-order point-cloud-based interpolation provides a pathway to maintaining accuracy in unstructured meshes, but at higher complexity. The second aspect of information exchange focuses on comparing the approaches of overset single system (OSS) and overset Additive Schwarz (OAS) for coupling the linear systems of the overlapping meshes. While the former involves a single linear system, in the latter the discrete linear systems are solved separately, and solving the global system is accomplished through outer iterations and sequential information exchange in a Jacobi fashion. For the test cases studied, accuracy for hyperbolic problems is maintained by performing two outer iterations, whereas many outer iterations are required for elliptic systems. The order-of-accuracy studies explored here are critical for verifying the overset-mesh coupling algorithms used in engineering simulations. Accuracy of these simulations themselves is, however, quantified using engineering quantities of interest such as drag, power, etc. Consequently, we conclude with numerical experiments using NS equations for incompressible flows where we show that linear interpolation and few outer iterations are sufficient for achieving asymptotic convergence of engineering quantities of interest.

97 MATHEMATICS AND COMPUTING↗

Unstructured multigrid methods

The use of the multigrid procedure with a sequence of unnested coarser grids is discussed. Validity of the procedure is assessed by considering the solution of a single linear elliptic equation. It is demonstrated how a scheme with the optimum order of operations can be constructed. Application to the solution of the Euler equations is considered.

Loehner, R.↗

Study of Laminar-Turbulent Transition Modeled by Amplification Factor Transport Within the LAVA Solver

The Amplification Factor Transport (AFT) transition model proposed by Coder and Maughmer is implemented in the unstructured and curvilinear Reynolds-Averaged Navier-Stokes (RANS) solvers of the Launch Ascent and Vehicle Aerodynamics (LAVA) platform. It is coupled to the Spalart-Allmaras (SA) turbulence model through a modified intermittency variable. As part of the model verification and validation phase, laminar-turbulent transition is studied over 2D flat plates, wind turbine and general aviation airfoils, as well as a 3D inclined prolate spheroid and the JAXA Standard Model (JSM). This work will analyze the sensitivity of the results to grid refinement, grid paradigm, flow conditions and numerical schemes. The numerical efficiency of the unstructured and curvilinear solvers will be compared and convergence acceleration techniques will be explored to address a broad range of aerodynamics applications.

Denison, M. F.↗

Strategies Toward Automation of Overset Structured Surface Grid Generation

An outline of a strategy for automation of overset structured surface grid generation on complex geometries is described. The starting point of the process consists of an unstructured surface triangulation representation of the geometry derived from a native CAD, STEP, or IGES definition, and a set of discretized surface curves that captures all geometric features of interest. The procedure for surface grid generation is decomposed into an algebraic meshing step, a hyperbolic meshing step, and a gap-filling step. This paper will focus primarily on the high-level plan with details on the algebraic step. The algorithmic procedure for the algebraic step involves analyzing the topology of the network of surface curves, distributing grid points appropriately on these curves, identifying domains bounded by four curves that can be meshed algebraically, concatenating the resulting grids into fewer patches, and extending appropriate boundaries of the concatenated grids to provide proper overlap. Results are presented for grids created on various aerospace vehicle components.

overset↗

Multigrid solution of the Euler equations on unstructured and adaptive meshes

A multigrid algorithm has been developed for solving the steady-state Euler equations in two dimensions on unstructured triangular meshes. The method assumes the various coarse and fine grids of the multigrid sequence to be independent of one another, thus decoupling the grid generation procedure from the multigrid algorithm. The transfer of variables between the various meshes employs a tree-search algorithm which rapidly identifies regions of overlap between coarse and fine grid cells. Finer meshes are obtained either by regenerating new globally refined meshes, or by adaptively refining the previous coarser mesh. For both cases, the observed convergence rates are comparable to those obtained with structured multigrid Euler solvers. The adaptively generated meshes are shown to produce solutions of higher accuracy with fewer mesh points.

Mavriplis, Dimitri↗

An unstructured multigrid method for elliptic problems

A multigrid algorithm for implementation on unstructured meshes is proposed. The algorithm uses a sequence of unnested grids and requires the development of efficient inter-grid interpolation procedures. It is demonstrated how elliptic problems can be solved in this fashion by using Jacobi smoothers.

Lohner, R.↗