Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured Grid”

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 847 records · Page 47

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

Assessment of UMUSCL Scheme for DNS of Turbulent Flows

Direct Numerical Simulations (DNS) are performed using the FUN3D code ( https://fun3d.larc.nasa.gov) for three validation cases: (1) flow through a plane channel, (2) flow through a channel with a constriction, and (3) flow over a flat plate. FUN3D is a node-centered finite-volume code developed at the NASA Langley Research Center that solves the three-dimensional compressible Navier-Stokes equations on unstructured computational grids. The simulations are performed employing the 2nd-order unstructured monotonic upstream scheme for conservation laws (UMUSCL). The results are compared with available experimental and numerical data. The effect of the UMUSCL reconstruction parameter (κ) is assessed, and the results indicate that κ = 0.9 yields satisfactory results in terms of accuracy and robustness compared to available data. Further analyses of the results, along with additional test cases and grids will be presented in the final manuscript.

Direct Numerical Simulation↗

Grid generation for the solution of partial differential equations

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given.

Eiseman, Peter R.↗

Grid generation for the solution of partial differential equations

A general survey of grid generators is presented with a concern for understanding why grids are necessary, how they are applied, and how they are generated. After an examination of the need for meshes, the overall applications setting is established with a categorization of the various connectivity patterns. This is split between structured grids and unstructured meshes. Altogether, the categorization establishes the foundation upon which grid generation techniques are developed. The two primary categories are algebraic techniques and partial differential equation techniques. These are each split into basic parts, and accordingly are individually examined in some detail. In the process, the interrelations between the various parts are accented. From the established background in the primary techniques, consideration is shifted to the topic of interactive grid generation and then to adaptive meshes. The setting for adaptivity is established with a suitable means to monitor severe solution behavior. Adaptive grids are considered first and are followed by adaptive triangular meshes. Then the consideration shifts to the temporal coupling between grid generators and PDE-solvers. To conclude, a reflection upon the discussion, herein, is given.

Eiseman, Peter R.↗

The spectral element method (SEM) on variable-resolution grids: evaluating grid sensitivity and resolution-aware numerical viscosity

We evaluate the performance of the Community Atmosphere Model's (CAM) spectral element method on variable-resolution grids using the shallow-water equations in spherical geometry. We configure the method as it is used in CAM, with dissipation of grid scale variance, implemented using hyperviscosity. Hyperviscosity is highly scale selective and grid independent, but does require a resolution-dependent coefficient. For the spectral element method with variable-resolution grids and highly distorted elements, we obtain the best results if we introduce a tensor-based hyperviscosity with tensor coefficients tied to the eigenvalues of the local element metric tensor. The tensor hyperviscosity is constructed so that, for regions of uniform resolution, it matches the traditional constant-coefficient hyperviscosity. With the tensor hyperviscosity, the large-scale solution is almost completely unaffected by the presence of grid refinement. This later point is important for climate applications in which long term climatological averages can be imprinted by stationary inhomogeneities in the truncation error. We also evaluate the robustness of the approach with respect to grid quality by considering unstructured conforming quadrilateral grids generated with a well-known grid-generating toolkit and grids generated by SQuadGen, a new open source alternative which produces lower valence nodes.

Guba, O.↗

Extending an Economical Third-Order Inviscid Nodal-Gradient Cell-Centered Finite-Volume Method to Mixed-Element Grids

In this paper, we extend an economical third-order nodal-gradient cell-centered finite-volume method, originally developed for tetrahedral grids, to mixed-element grids. It is shown that the efficient quadratic interpolation formula essential to eliminating second derivatives from a third-order accurate discretization can be easily extended to an arbitrary cell type. For the surface flux integration, we consider a split-face approach, where a quadrilateral face is split into two triangles, and the third-order method for tetrahedra is directly applied. Also, we derive a second-derivative-free, high-order, volume quadrature formula for an arbitrary cell. Numerical results are presented for accuracy verification and applications with three-dimensional nontetrahedral grids.

Computational Fluid Dynamics↗

MPAS-Albany Land Ice (MALI): a variable-resolution ice sheet model for Earth system modeling using Voronoi grids

Abstract. We introduce MPAS-Albany Land Ice (MALI) v6.0, a new variable-resolution land ice model that uses unstructured Voronoi grids on a plane or sphere. MALI is built using the Model for Prediction Across Scales (MPAS) framework for developing variable-resolution Earth system model components and the Albany multi-physics code base for the solution of coupled systems of partial differential equations, which itself makes use of Trilinos solver libraries. MALI includes a three-dimensional first-order momentum balance solver (Blatter–Pattyn) by linking to the Albany-LI ice sheet velocity solver and an explicit shallow ice velocity solver. The evolution of ice geometry and tracers is handled through an explicit first-order horizontal advection scheme with vertical remapping. The evolution of ice temperature is treated using operator splitting of vertical diffusion and horizontal advection and can be configured to use either a temperature or enthalpy formulation. MALI includes a mass-conserving subglacial hydrology model that supports distributed and/or channelized drainage and can optionally be coupled to ice dynamics. Options for calving include eigencalving , which assumes that the calving rate is proportional to extensional strain rates. MALI is evaluated against commonly used exact solutions and community benchmark experiments and shows the expected accuracy. Results for the MISMIP3d benchmark experiments with MALI's Blatter–Pattyn solver fall between published results from Stokes and L1L2 models as expected. We use the model to simulate a semi-realistic Antarctic ice sheet problem following the initMIP protocol and using 2 km resolution in marine ice sheet regions. MALI is the glacier component of the Energy Exascale Earth System Model (E3SM) version 1, and we describe current and planned coupling to other E3SM components.

54 ENVIRONMENTAL SCIENCES↗

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

Research in Parallel Algorithms and Software for Computational Aerosciences

Phase I is complete for the development of a Computational Fluid Dynamics parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.

Domel, Neal D.↗

DSMC Grid Methodologies for Computing Low-Density, Hypersonic Flows About Reusable Launch Vehicles

Two different grid methodologies are studied for application to DSMC simulations about reusable launch vehicles. One method uses an unstructured, tetrahedral grid while the other uses a structured, variable-resolution Cartesian grid. The relative merits of each method are discussed in terms of accuracy, computational efficiency, and overall ease of use. Both methods are applied to the computation of a low-density, hypersonic flow about a winged single-stage-to-orbit reusable launch vehicle concept at conditions corresponding to an altitude of 120 km. Both methods are shown to give comparable results for both surface and flowfield quantities as well as for the overall aerodynamic behavior. For the conditions simulated, the flowfield about the vehicle is very rarefied but the DSMC simulations show significant departure from free-molecular predictions for the surface friction and heat transfer as well as certain aerodynamic quantities.

Wilmoth, Richard G.↗

The Overgrid Interface for Computational Simulations on Overset Grids

Computational simulations using overset grids typically involve multiple steps and a variety of software modules. A graphical interface called OVERGRID has been specially designed for such purposes. Data required and created by the different steps include geometry, grids, domain connectivity information and flow solver input parameters. The interface provides a unified environment for the visualization, processing, generation and diagnosis of such data. General modules are available for the manipulation of structured grids and unstructured surface triangulations. Modules more specific for the overset approach include surface curve generators, hyperbolic and algebraic surface grid generators, a hyperbolic volume grid generator, Cartesian box grid generators, and domain connectivity: pre-processing tools. An interface provides automatic selection and viewing of flow solver boundary conditions, and various other flow solver inputs. For problems involving multiple components in relative motion, a module is available to build the component/grid relationships and to prescribe and animate the dynamics of the different components.

Chan, William M.↗

Aerostructural Level Set Topology Optimization for a Common Research Model Wing

The purpose of this work is to use level set topology optimization to improve the design of a representative wing box structure for the NASA common research model. The objective is to minimize the total compliance of the structure under aerodynamic and body force loading, where the aerodynamic loading is coupled to the structural deformation. A taxi bump case was also considered, where only body force loads were applied. The trim condition that aerodynamic lift must balance the total weight of the aircraft is enforced by allowing the root angle of attack to change. The level set optimization method is implemented on an unstructured three-dimensional grid, so that the method can optimize a wing box with arbitrary geometry. Fast matching and upwind schemes are developed for an unstructured grid, which make the level set method robust and efficient. The adjoint method is used to obtain the coupled shape sensitivities required to perform aerostructural optimization of the wing box structure.

Dunning, Peter D.↗

Comparison of Two Approaches to Constructing Second- and Third-Order Nodal-Gradient Cell-Centered Finite-Volume Methods for Mixed-Element Grids

In this paper, we introduce a third-order nodal-gradient cell-centered finite volume scheme applicable to mixed-element grids based on a single numerical flux per face. Previously, we considered a split-quadrilateral-face approach, where we split each quadrilateral face of a non-tetrahedral cell into two triangles and then apply second- and third-order schemes designed for tetrahedral grids. This approach is relatively simple to implement but expensive because it requires two numerical flux evaluations per quadrilateral face. In this study, we consider another approach, where the surface flux quadrature is performed with a single numerical flux per face with flux corrections. It requires a 3×3 correction matrix to be stored at each face but is more economical than the split-quadrilateral-face approach. The two approaches are compared for three-dimensional flows on irregular hexahedral grids, and their relative merits are discussed.

Third-order scheme↗

Interferograms, Schlieren, and Shadowgraphs Constructed from Real- and Ideal-Gas, Two- and Three-Dimensional Computed Flowfields

The construction of interferograms, schlieren, and shadowgraphs from computed flowfield solutions permits one-to-one comparisons of computed and experimental results. A method for constructing these images from both ideal- and real-gas, two- and three-dimensional computed flowfields is described. The computational grids can be structured or unstructured, and multiple grids are an option. Constructed images are shown for several types of computed flows including nozzle, wake, and reacting flows; comparisons to experimental images are also shown. In addition, the sensitivity of these images to errors in the flowfield solution is demonstrated, and the constructed images can be used to identify problem areas in the computations.

Yates, Leslie A.↗

Images constructed from computed flowfields

A method for constructing interferograms, schlieren, and shadowgraphs from ideal- and real-gas, two- and three-dimensional computed flowfileds 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 flowfield 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.↗

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

Interferograms, schlieren, and shadowgraphs constructed from real- and ideal-gas, two- and three-dimensional computed flowfields

The construction of interferograms, schlieren, and shadowgraphs from computed flowfield solutions permits one-to-one comparisons of computed and experimental results. A method of constructing these images from both ideal- and real-gas, two and three-dimensional computed flowfields is described. The computational grids can be structured or unstructured, and multiple grids are an option. Constructed images are shown for several types of computed flows including nozzle, wake, and reacting flows; comparisons to experimental images are also shown. In addition, th sensitivity of these images to errors in the flowfield solution is demonstrated, and the constructed images can be used to identify problem areas in the computations.

Yates, Leslie A.↗

Galerkin finite difference Laplacian operators on isolated unstructured triangular meshes by linear combinations

The Galerkin weighted residual technique using linear triangular weight functions is employed to develop finite difference formulae in Cartesian coordinates for the Laplacian operator on isolated unstructured triangular grids. The weighted residual coefficients associated with the weak formulation of the Laplacian operator along with linear combinations of the residual equations are used to develop the algorithm. The algorithm was tested for a wide variety of unstructured meshes and found to give satisfactory results.

Baumeister, Kenneth J.↗