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 181 records · Page 10

Agglomeration-based geometric multigrid solvers for compact discontinuous Galerkin discretizations on unstructured meshes

Here, we present a geometric multigrid solver for the Compact Discontinuous Galerkin method through building a hierarchy of coarser meshes using a simple agglomeration method which handles arbitrary element shapes and dimensions. The method is easily extendable to other discontinuous Galerkin discretizations, including the Local DG method and the Interior Penalty method. We demonstrate excellent solver performance for Poisson's equation, provided a flux formulation is used for the operator coarsening and a suitable switch function chosen for the numerical fluxes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The MCNP6 Book On Unstructured Mesh Geometry: User's Guide for MCNP 6.2.1

Los Alamos National Laboratory’s (LANL) Monte Carlo N-Particle R (MCNP R ) transport code has a more general geometry capability than has been available in most combinatorial geometry codes [1]. In addition to the capability of combining several predefined geometric bodies, as in a combinatorial scheme, MCNP6 [2] gives the user the added flexibility of defining geometric regions from all the first and second degree surfaces of analytical geometry and elliptical tori and then combining them with Boolean operators. This decades-old constructive solid geometry (CSG) capability has been well-tested and verified. However, it has long been recognized that as the model complexity increases, this process of describing the geometry is difficult, tedious, time-consuming, and error prone[3, 4, 5]. Consequently, innovators have taken on the task of developing a better way to construct geometries, not only in MCNP6, but other particle transport codes as well

97 MATHEMATICS AND COMPUTING↗

GPU Acceleration of Volume Fraction and Centroid Computation from General Shapes on Unstructured Mesh

One important requirement for coupling multi-physics models is a means to remap fields between meshes in an accurate and conservative manner. Since the remapping algorithm is embarrassingly parallel, this motivates the use of Graphical Processing Units (GPU) for such routine. However, since our remapping code, portage, is fairly complex, we explore the use of GPUs through a simpler problem of generating material’s volume fraction and centroid inside each cell of the mesh. We use the same programming structure that is used in portage, namely, on-node parallelism via NVIDIA’s thrust library. Using a similar programming structure enables us to draw lessons from this study that can be applied to the more complex problem. We have found that while the speed-up is pronounced (10-100 times), significant effort is required to re-factor the code so that thrust can be used with a CUDA backend. Moreover, thrust takes away the fine grain control that vanilla CUDA programming gives us.

97 MATHEMATICS AND COMPUTING↗