Search NASA⌕ Search

SEARCH · Search NASA

Results for “Unstructured Mesh”

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 397 records · Page 22

Unstructured and adaptive mesh generation for high Reynolds number viscous flows

A method for generating and adaptively refining a highly stretched unstructured mesh suitable for the computation of high-Reynolds-number viscous flows about arbitrary two-dimensional geometries was developed. The method is based on the Delaunay triangulation of a predetermined set of points and employs a local mapping in order to achieve the high stretching rates required in the boundary-layer and wake regions. The initial mesh-point distribution is determined in a geometry-adaptive manner which clusters points in regions of high curvature and sharp corners. Adaptive mesh refinement is achieved by adding new points in regions of large flow gradients, and locally retriangulating; thus, obviating the need for global mesh regeneration. Initial and adapted meshes about complex multi-element airfoil geometries are shown and compressible flow solutions are computed on these meshes.

Mavriplis, Dimitri J.↗

Unstructured and adaptive mesh generation for high Reynolds number viscous flows

A method for generating and adaptively refining a highly stretched unstructured mesh suitable for the computation of high-Reynolds-number viscous flows about arbitrary two-dimensional geometries was developed. The method is based on the Delaunay triangulation of a predetermined set of points and employs a local mapping in order to achieve the high stretching rates required in the boundary-layer and wake regions. The initial mesh-point distribution is determined in a geometry-adaptive manner which clusters points in regions of high curvature and sharp corners. Adaptive mesh refinement is achieved by adding new points in regions of large flow gradients, and locally retriangulating; thus, obviating the need for global mesh regeneration. Initial and adapted meshes about complex multi-element airfoil geometries are shown and compressible flow solutions are computed on these meshes.

Mavriplis, D. J.↗

Tetrahedral and Hexahedral Mesh Adaptation for CFD Problems

This paper presents two unstructured mesh adaptation schemes for problems in computational fluid dynamics. The procedures allow localized grid refinement and coarsening to efficiently capture aerodynamic flow features of interest. The first procedure is for purely tetrahedral grids; unfortunately, repeated anisotropic adaptation may significantly deteriorate the quality of the mesh. Hexahedral elements, on the other hand, can be subdivided anisotropically without mesh quality problems. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Both the tetrahedral and hexahedral mesh adaptation procedures use edge-based data structures that facilitate efficient subdivision by allowing individual edges to be marked for refinement or coarsening. However, for hexahedral adaptation, pyramids, prisms, and tetrahedra are used as buffer elements between refined and unrefined regions to eliminate hanging vertices. Computational results indicate that the hexahedral adaptation procedure is a viable alternative to adaptive tetrahedral schemes.

Biswas, Rupak↗

An Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes

A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning strategy. Its main advantage over the more conventional node-based partitioning strategy is its modular programming approach to the development of parallel applications. The partitioner first partitions element centroids using a recursive inertial bisection algorithm. Elements and nodes then migrate according to the partitioned centroids, using a data request communication template for unpredictable incoming messages. Our scalable implementation is contrasted to a non-scalable implementation which is a straightforward parallelization of a sequential partitioner.

concurrent partitioner finite element meshes distr↗

Advances in hexagon mesh-based flow direction modeling

Watershed delineation and flow direction representation are the foundations of streamflow routing in spatially distributed hydrologic modeling. A recent study showed that hexagon-based watershed discretization has several advantages compared to the traditional Cartesian (latitude–longitude) discretization, such as uniform connectivity and compatibility with other Earth system model components based on unstructured mesh systems (e.g., oceanic models). Despite these advantages, hexagon-based discretization has not been widely adopted by the current generation of hydrologic models. One major reason is that there is no existing model that can delineate hexagon-based watersheds while maintaining accurate representations of flow direction across various spatial resolutions. In this study, we explored approaches such as spatial resampling and hybrid breaching-filling stream burning techniques to improve watershed delineation and flow direction representation using a newly developed hexagonal mesh watershed delineation model (HexWatershed). We applied these improvements to the Columbia River basin and performed 16 simulations with different configurations. The results show that (1) spatial resampling modulates flow direction around headwaters and provides an opportunity to extract subgrid information; and (2) stream burning corrects the flow directions in mountainous areas with complex terrain features.

58 GEOSCIENCES↗

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↗

A subzone reconstruction algorithm for efficient staggered compatible remapping

Staggered-grid Lagrangian hydrodynamics algorithms frequently make use of subzonal discretization of state variables for the purposes of improved numerical accuracy, generality to unstructured meshes, and exact conservation of mass, momentum, and energy. For Arbitrary Lagrangian–Eulerian (ALE) methods using a geometric overlay, it is difficult to remap subzonal variables in an accurate and efficient manner due to the number of subzone–subzone intersections that must be computed. This becomes prohibitive in the case of 3D, unstructured, polyhedral meshes. A new procedure is outlined in this paper to avoid direct subzonal remapping. The new algorithm reconstructs the spatial profile of a subzonal variable using remapped zonal and nodal representations of the data. The reconstruction procedure is cast as an under-constrained optimization problem. Enforcing conservation at each zone and node on the remapped mesh provides the set of equality constraints; the objective function corresponds to a quadratic variation per subzone between the values to be reconstructed and a set of target reference values. Numerical results for various pure-remapping and hydrodynamics tests are provided. Ideas for extending the algorithm to staggered-grid radiation-hydrodynamics are discussed as well as ideas for generalizing the algorithm to include inequality constraints.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Array-based Hierarchical Mesh Generation in Parallel

In this paper, we describe an array-based hierarchical mesh generation capability through uniform refinement of unstructured meshes for efficient solution of PDE's using finite element methods and multigrid solvers. A multi-degree, multi-dimensional and multi-level framework is designed to generate the nested hierarchies from an initial mesh that can be used for a number of purposes such as multi-level methods to generating large meshes. The capability is developed under the parallel mesh framework “Mesh Oriented dAtaBase” a.k.a MOAB. We describe the underlying data structures and algorithms to generate such hierarchies and present numerical results for computational efficiency and mesh quality. In conclusion, we also present results to demonstrate the applicability of the developed capability to a multigrid finite-element solver.

97 MATHEMATICS AND COMPUTING↗

Community Project for Accelerator Science and Simulation-3

The focus of the Rensselaer efforts for COMPASS-3 was the development of parallel mesh adaptation procedures for high-order unstructured meshes where elements must be curved to properly approximate the domain geometry. The procedures developed were integrated into the ACE3P accelerator modeling code. Areas of development included: High order curved mesh representations that can provide the orders of geometric approximation needed. A curved mesh adaptation procedure that can match an adaptively defined anisotropic mesh metric field. In-memory integration of these procedures with the Omega3P code to provide an effective parallel adaptive simulation work flow. Improved dynamic load balancing tools that account for the degrees of freedom associated with the various order mesh entities (vertices, edges, faces and regions).

42 ENGINEERING↗

Discrete Data Transfer Technique for Fluid-Structure Interaction

This paper presents a general three-dimensional algorithm for data transfer between dissimilar meshes. The algorithm is suitable for applications of fluid-structure interaction and other high-fidelity multidisciplinary analysis and optimization. Because the algorithm is independent of the mesh topology, we can treat structured and unstructured meshes in the same manner. The algorithm is fast and accurate for transfer of scalar or vector fields between dissimilar surface meshes. The algorithm is also applicable for the integration of a scalar field (e.g., coefficients of pressure) on one mesh and injection of the resulting vectors (e.g., force vectors) onto another mesh. The author has implemented the algorithm in a C++ computer code. This paper contains a complete formulation of the algorithm with a few selected results.

Samareh, Jamshid A.↗

A smoothed two- and three-dimensional interface reconstruction method

The Patterned Interface Reconstruction algorithm reduces the discontinuity between material interfaces in neighboring computational elements. This smoothing improves the accuracy of the reconstruction for smooth bodies. The method can be used in two- and three-dimensional Cartesian and unstructured meshes. Planar interfaces will be returned for planar volume fraction distributions. Finally, the algorithm is second-order accurate for smooth volume fraction distributions.

97 MATHEMATICS AND COMPUTING↗

A Pebble Tracking Transport Algorithm for Pebble Bed Reactor Analysis

Pebble bed reactor (PBR) designs pose unique challenges to modeling and simulation. The challenges originate from the multiple levels of heterogeneity partly due to random packing in and flow through the core of fuel pebbles. This paper proposes a novel pebble tracking transport (PTT) algorithm to address some of the challenges facing PBR analysis. Each individual pebble is tracked and modeled on an unstructured mesh of which the nodes are aligned with the pebble centroids. The neutron transport equation is solved on this pebble tracking mesh with pre-assembled elemental matrices. These elemental matrices are independent of the cross sections and the streaming directions, thus can be assembled before the calculation without introducing too much memory overhead especially when combined with spatial domain decomposition. Numerical results show that these matrices can be assembled efficiently. PTT is implemented in Rattlesnake, the INL MOOSE-based multigroup radiation transport application. Both the angular and spatial convergence are investigated and the results indicate that low order angular and spatial resolution is typically sufficient for analysis. A complete work flow for PBR analysis with PTT including, pebble packing, meshing, cross section generation, solution of the transport equation, postprocessing, etc. is demonstrated with a simplified reactor with 41,048 pebbles.

97 MATHEMATICS AND COMPUTING↗

A face-upwinded spectral element method

Here we present a new high-order accurate discretisation on unstructured meshes of quadrilateral elements. Our Face Upwinded Spectral Element (FUSE) method uses the same node distribution as a high-order continuous Galerkin (CG) method, but with a particular choice of node locations within each element and an upwinded stencil on the face nodes. This results in a number of benefits, including fewer degrees of freedom and straight-forward integration with CG. We present the derivation of the scheme and the analysis of its properties, in particular showing stability using von Neumann analysis. We show numerical evidence for its accuracy and efficiency on multiple classes of problems including convection-dominated flows, Poisson's equation, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

A Study on Particle Trajectory Error in Finite-Element Particle-in-Cell Algorithms

Particle-in-cell (PIC) algorithms are widely used for the simulation of kinetic plasmas. PIC algorithms account for the interaction between charged particles in a plasma and the electromagnetic field in ambient space, including self-field interactions. The objective of this article is to study the error in charged particle trajectories present in finite-element (FE)-based PIC algorithms on unstructured meshes. We study how the trajectory error behaves according to the FE mesh resolution and the matrix solver employed in the FE algorithm. The study is performed by considering a trajectory established by a parabolic electric potential and an axial magnetic force acting on the charged particle. Under a proper choice combination of electric and magnetic field parameters, the 2-D particle trajectories comprise closed orbits. Numerical errors cause small perturbations on the trajectories, with cumulative effects. As a result, the resulting orbital trajectories exhibit distortions including spurious apsidal precession. These distortions provide a clear imprint of the numerical error. Here, we also study the numerical error in a quantitative fashion by computing the distance norm between the trajectories obtained by the exact fields and numerical fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

High-fidelity pool boiling simulations on multiple nucleation sites using interface capturing method

Boiling has proved to be one of the most efficient means for heat transfer and is a very important phenomenon during severe accident scenarios in light water reactors. High-fidelity pool boiling simulations can provide a numerical database for improving mechanistic boiling models by allowing for specific evaluation of interactions among bubbles. Previously published pool boiling simulations investigated two nucleation sites in which bubble growth at one site suppressed nucleation at the other site. Based on previous study results, more complicated interface-capturing simulations on pool boiling were conducted using PHASTA code with locally refined unstructured mesh. First, different boundary conditions (BCs) were assessed to support robustness and reproducibility of the boiling model. Then, a scale study was conducted at a larger domain with nine nucleation sites where either nine or four nucleation sites are activated. Involving more nucleation sites increased the complexity of bubble interactions from surrounding sites. Finally, bubble departure behavior influenced by wall heat flux was investigated. In this work, when heat flux was increased, the order of bubble departure changed, but diagonal bubbles always departed after one another. The departure time interval between the first and second bubble reduced as heat flux increased. The corresponding frequency was almost linearly proportional to the heat flux. In addition, bubble departure behavior was found to be greatly influenced by the nucleation site pattern. Multiple nucleation sites resulted in superimposed inhibitive effects from surrounding sites to each bubble, which extensively delayed the departure. This new observation was not discussed in previously published works. The work presented here provides new insight on the fundamental understanding of boiling phenomena, contributes to the development of a 3D multiphase computational fluid dynamics (M-CFD) model, and provides a more comprehensive database for data-driven pool boiling studies.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Athena-I CUBIT Journal Files

The Monte Carlo N-Particle (MCNP)1 transport code version 6 (also known as MCNP6) has the capability for tracking particles on unstructured mesh (UM) geometry models embedded into con structive solid geometry (CSG) cells. This feature has been developed for performing calculations of complex geometry models because manually creating CSG models is a time-consuming and error prone process as the complexities of geometries increase. The UM capability was originally designed to work with UM models created with the Abaqus software and ASCII input files that it generates. The MCNP code version 6.0 and later can process UM models formatted as Abaqus input files. Starting with version 6.3, MCNP can also process HDF5 mesh input files. External codes must be used to generate Abaqus input files for MCNP UM calculations. CUBIT, the Sandia National Laboratory automated mesh generation toolkit, can generate a UM model formatted as an Abaqus input file. However, the Abaqus input files exported from CUBIT cannot be used for MCNP simulations because it lacks the proper syntax. A Python script was developed to convert an Abaqus file created by CUBIT to an Abaqus file format that MCNP can process. Creating UM models for complex geometries is not an easy task. The process of creating UM models in CUBIT for MCNP simulations is detailed in. CUBIT provides several user interface options including a graphical user interface (GUI) and a command line interface. A GUI provides an easy way to use CUBIT without learning the CUBIT command syntax. When using CUBIT with either interface option, command lines are written into an ASCII file known as a journal file; this journal file can be edited and archived so that it can be played back in CUBIT to automatically generate a UM model. This report describes the CUBIT journal files of the UM models developed for Athena-I. The Athena platform, an energy-tuning assembly, was developed to spectrally shape the National Ignition Facility (NIF) deuterium-tritium fusion neutron source to a thermonuclear (fusion) plus prompt fission neutron spectrum with capability to act as a short-pulse neutron source. MCNP6 was used for the Athena experiment design analysis.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗