Search NASA⌕ Search

SEARCH · Search NASA

Results for “arbitrary meshes”

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 109 records · Page 6

A coupled ALE-AMR method for shock hydrodynamics

We present a numerical method combining adaptive mesh refinement (AMR) with arbitrary Lagrangian-Eulerian (ALE) mesh motion for the simulation of shock hydrodynamics on unstructured grids. The primary goal of the coupled method is to use AMR to reduce numerical error in ALE simulations at reduced computational expense relative to uniform fine mesh calculations, in the same manner that AMR has been used in Eulerian simulations. We also identify deficiencies with ALE methods that AMR is able to mitigate, and discuss the unique coupling challenges. The coupled method is demonstrated using three-dimensional unstructured meshes of up to O(10 7 ) tetrahedral cells. Convergence of ALE-AMR solutions towards both uniform fine mesh ALE results and analytic solutions is demonstrated. Speed-ups of 5-10× for a given level of error are observed relative to uniform fine mesh calculations.

42 ENGINEERING↗

iharm3D: Vectorized General Relativistic Magnetohydrodynamics

iharm3D is an open-source C code for simulating black hole accretion systems in arbitrary stationary spacetimes using ideal general-relativistic magnetohydrodynamics (GRMHD). It is an implementation of the HARM (“High Accuracy Relativistic Magnetohydrodynamics”) algorithm outlined in Gammie et al. (2003) with updates as outlined in McKinney & Gammie (2004) and Noble et al. (2006). The code is most directly derived from Ryan et al. (2015) but with radiative transfer portions removed. HARM is a conservative finite-volume scheme for solving the equations of ideal GRMHD, a hyperbolic system of partial differential equations, on a logically Cartesian mesh in arbitrary coordinates.

79 ASTRONOMY AND ASTROPHYSICS↗

Stress field and interaction forces between dislocations and precipitate distributions

A computational method is developed for calculation of the stress field and interaction forces between dislocations and precipitates of arbitrary shape and distribution. The internal stress generated by precipitates due to coherency strain is implemented within the discrete dislocation dynamics (DDD) framework. The s-version finite element method (s-FEM), which models a precipitate of arbitrary shape using a local mesh is used to calculate coherency stress fields. The method facilitates meshing precipitate volumes of arbitrary geometry, and multiple local meshes can be superimposed at various positions of the global mesh. Accuracy and convergence conditions of the method are established. For a single precipiate, the method is shown to be 3.5 times faster than a standard FEM calculation for the same accuracy, and the gain in speed increases with the number of precipitates. The CRSS of spherical precipitates is found to be higher than disk-shaped precipitates of the same volume fraction.

42 ENGINEERING↗

Extended virtual element method for the Laplace problem with singularities and discontinuities

In this paper, we propose the extended virtual element method (X-VEM) to treat singularities and crack discontinuities that arise in the Laplace problem. The virtual element method (VEM) is a stabilized Galerkin formulation on arbitrary polytopal meshes, wherein the basis functions are implicit (virtual)—they are not known explicitly nor do they need to be computed within the problem domain. In this work, suitable projection operators are used to decompose the bilinear form on each element into two parts: a consistent term that reproduces the first-order polynomial space and a correction term that ensures stability. A similar approach is pursued in the X-VEM with a few notable extensions. To capture singularities and discontinuities in the discrete space, we augment the standard virtual element space with an additional contribution that consists of the product of virtual nodal basis (partition-of-unity) functions with enrichment functions. For discontinuities, basis functions are discontinuous across the crack and for singularities a weakly singular enrichment function that satisfies the Laplace equation is chosen. For the Laplace problem with a singularity, we devise an extended projector that maps functions that lie in the extended virtual element space onto linear polynomials and the enrichment function, whereas for the discontinuous problem, the consistent element stiffness matrix has a block-structure that is readily computed. An adaptive homogeneous numerical integration method is used to accurately and efficiently (no element-partitioning is required) compute integrals with integrands that are weakly singular. Once the element projection matrix is computed, the same steps as in the standard VEM are followed to compute the element stabilization matrix. Numerical experiments are performed on quadrilateral and polygonal (convex and nonconvex elements) meshes for the problem of an $\textit{L}$-shaped domain with a corner singularity and the problem of a cracked membrane under mode III loading, and results are presented that affirm the sound accuracy and demonstrate the optimal rates of convergence in the $\textit{L}^2$ norm and energy of the proposed method.

42 ENGINEERING↗

Vertical-Axis Wind Turbine Mesh Generator

VAWTGen is a mesh generator for creating a finite element beam mesh of arbitrary vertical-axis wind turbines (VAWT). The software accepts input files specifying tower and blade structural and aerodynamic descriptions and constructs a VAWT using a minimal set of inputs. VAWTs with an arbitrary number of blades can be constructed with or without a central tower. Strut connections between the tower and blades can be specified in an arbitrary manner. The software also facilitates specifying arbitrary joints between structural components and concentrated structural tenns (mass and stiffness). The output files which describe the VAWT configuration are intended to be used with the Offshore Wind ENergy Simulation (OWENS) Toolkit software for structural dynamics analysis of VAWTs. Furthermore, VAWTGen is useful for visualizing output from the OWENS analysis software.

Owens, BrianC.↗

Mimetic Theory for Cell-Centered Lagrangian Finite Volume Formulation on General Unstructured Grids

A finite volume cell-centered Lagrangian scheme for solving large deformation problems is constructed based on the hypo-elastic model and using the mimetic theory. Rigorous analysis in the context of gas and solid dynamics, and arbitrary polygonal meshes, is presented to demonstrate the ability of cell-centered schemes in mimicking the continuum properties and principles at the discrete level. A new mimetic formulation based gradient evaluation technique and physics-based, frame independent and symmetry preserving slope limiters are proposed. Furthermore, a physically consistent dissipation model is employed which is both robust and inexpensive to implement. The cell-centered scheme along with these additional new features are applied to solve solids undergoing elasto-plastic deformation.

42 ENGINEERING↗

Numerical experiments with the extended virtual element method for the Laplace problem with strong discontinuities

The virtual element method (VEM) is a stabilized Galerkin formulation on arbitrary polytopal meshes. In the VEM, the basis functions are implicit (virtual) — they are not known nor do they need to be computed within the problem domain. Suitable projection operators are used to decompose the bilinear form at the element-level into two parts: a consistent term that reproduces a given polynomial space and a correction term that ensures stability. In this study, we consider a low-order extended virtual element method (X-VEM) that is in the spirit of the extended finite element method for crack problems. Herein, we focus on the two-dimensional Laplace crack problem. In the X-VEM, we enrich the standard virtual element space with additional discontinuous functions through the framework of partition-of-unity. The nodal basis functions in the VEM are chosen as the partition-of-unity functions, and we study means to stabilize the standard and enriched sub-matrices that constitute the element stiffness matrix. Numerical experiments are performed on the problem of a cracked membrane under mode III loading to affirm the accuracy, and to establish the optimal convergence in energy of the method.

97 MATHEMATICS AND COMPUTING↗

A three-dimensional space marching algorithm for the solution of the Euler equations on unstructured grids

A three-dimensional space marching algorithm using an unstructured discretization is proposed. The governing equations and the spatial discretization of the domain and the interpolation from one arbitrary unstructured mesh to another are discussed, and the grid generation technique is described. Solutions for several different geometries are presented, and the results are compared with existing numerical techniques and experimental results.

Mcgrory, W. D.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, J. R.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composits data structure by allocating one processor per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum cost way to evaluate an expression, for several different data parallel architectures. The algorithm applies to any architecture in which the metric describing the cost of moving an array has a property called robustness. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes.

Gilbert, John R.↗

Optimal expression evaluation for data parallel architectures

A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. An efficient algorithm is given to find the minimum-cost way to evaluate an expression, for several different data parallel architectures. This algorithm applies to any architecture in which the metric describing the cost of moving an array is robust. This encompasses most of the common data parallel communication architectures, including meshes of arbitrary dimension and hypercubes. Remarks are made on several variations of the problem, some of which are solved and some of which remain open.

Gilbert, John R.↗

A Piecewise Bi-Linear Discontinuous Finite Element Spatial Discretization of the Sn Transport Equation

We present a new spatial discretization of the discrete-ordinates transport equation in two-dimensional Cartesian (X-Y) geometry for arbitrary polygonal meshes. The discretization is a discontinuous finite element method (DFEM) that utilizes piecewise bi-linear (PWBL) basis functions, which are formally introduced in this paper. We also present a series of numerical results on quadrilateral and polygonal grids and compare these results to a variety of other spatial discretizations that have been shown to be successful on these grid types. Finally, we note that the properties of the PWBL basis functions are such that the leading-order piecewise bi-linear discontinuous finite element (PWBLD) solution will satisfy a reasonably accurate diffusion discretization in the thick diffusion limit, making the PWBLD method a viable candidate for many different classes of transport problems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries

Highlights: •An algorithm for partitioning computational meshes is proposed. •The Morton order space-filling curve is modified to achieve improved locality. •A spatial locality metric is defined to compare results with existing approaches. •Results indicate improved performance of the algorithm in complex geometries. -- Abstract: A space-filling curve (SFC) is a proximity preserving linear mapping of any multi-dimensional space and is widely used as a clustering tool. Equi-sized partitioning of an SFC ignores the loss in clustering quality that occurs due to inaccuracies in the mapping. Often, this results in poor locality within partitions, especially for the conceptually simple, Morton order curves. We present a heuristic that improves partition locality in arbitrary geometries by slicing a Morton order curve at points where spatial locality is sacrificed. In addition, we develop algorithms that evenly distribute points to the extent possible while maintaining spatial locality. A metric is defined to estimate relative inter-partition contact as an indicator of communication in parallel computing architectures. Domain partitioning tests have been conducted on geometries relevant to turbulent reactive flow simulations. The results obtained highlight the performance of our method as an unsupervised and computationally inexpensive domain partitioning tool.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Drag Coefficient Analysis of Arbitrary Fragment Geometry with Emphasis on Meshing Sensitivity Studies.

This report characterizes Mach number effects in the hypersonic range from Mach 3 to Mach 7 for an arbitrary, computationally generated fragment. Force and moment coefficients in the x, y, z direction were successfully obtained and resulting trends were compared with theoretical expectations. Three orientations were tested in the form of unit vectors: [1,0,0], [0,1,0], and [0,0,1]; these represent the i, j, k principle axes. The final results ultimately showcased a trend very similar to that shown in previous literature — drag coefficients for a given orientation decreased with increasing Mach number by a very small amount in the hypersonic range. It was therefore concluded that the aerodynamic quantities used to obtain the fragment trajectory at low hypersonic Mach numbers (such as Mach 3) can be used to characterize the aerodynamic qualities at higher hypersonic Mach numbers (Mach 5, 7) with a reasonably small margin. A sensitivity study was also conducted which ultimately defined drag effects as a result of changing grid spacing and normal extrusion parameters for the unstructured tetrahedral mesh used in the simulation. Further work can be done in the form of experimental validation, specifically with regards to wind tunnels and ballistic range testing. Error can be reduced by testing more mesh variabilities and capturing a larger amount of fragment orientations. The results for force and moment characteristics dependent on meshing parameters and high Mach numbers are satisfactory and consistent with expected trends.

42 ENGINEERING↗

Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes

The accuracy of the least-squares technique for gradient reconstruction on unstructured meshes is examined. While least-squares techniques produce accurate results on arbitrary isotropic unstructured meshes, serious difficulties exist for highly stretched meshes in the presence of surface curvature. In these situations, gradients are typically under-estimated by up to an order of magnitude. For vertex-based discretizations on triangular and quadrilateral meshes, and cell-centered discretizations on quadrilateral meshes, accuracy can be recovered using an inverse distance weighting in the least-squares construction. For cell-centered discretizations on triangles, both the unweighted and weighted least-squares constructions fail to provide suitable gradient estimates for highly stretched curved meshes. Good overall flow solution accuracy can be retained in spite of poor gradient estimates, due to the presence of flow alignment in exactly the same regions where the poor gradient accuracy is observed. However, the use of entropy fixes has the potential for generating large but subtle discretization errors.

Mavriplis, Dimitri J.↗

Enhancements to the SHARP Build System and NEK5000 Coupling

The SHARP project for the Department of Energy's Nuclear Energy Advanced Modeling and Simulation (NEAMS) program provides a multiphysics framework for coupled simulations of advanced nuclear reactor designs. It provides an overall coupling environment that utilizes custom interfaces to couple existing physics codes through a common spatial decomposition and unique solution transfer component. As of this writing, SHARP couples neutronics, thermal hydraulics, and structural mechanics using PROTEUS, Nek5000, and Diablo respectively. This report details two primary SHARP improvements regarding the Nek5000 and Diablo individual physics codes: (1) an improved Nek5000 coupling interface that lets SHARP achieve a vast increase in overall solution accuracy by manipulating the structure of the internal Nek5000 spatial mesh, and (2) the capability to seamlessly couple structural mechanics calculations into the framework through improvements to the SHARP build system. The Nek5000 coupling interface now uses a barycentric Lagrange interpolation method that takes the vertex-based power and density computed from the PROTEUS neutronics solver and maps it to the user-specified, general-order Nek5000 spectral element mesh. Before this work, SHARP handled this vertex-based solution transfer in an averaging-based manner. SHARP users can now achieve higher levels of accuracy by specifying any arbitrary Nek5000 spectral mesh order. This improvement takes the average percentage error between the PROTEUS power solution and the Nek5000 interpolated result down drastically from over 23 % to just above 2 %, and maintains the correct power profile. We have integrated Diablo into the SHARP build system to facilitate the future coupling of structural mechanics calculations into SHARP. Previously, simulations involving Diablo were done in an iterative manner, requiring a large amount manual work, and left only as a task for advanced users. This report will detail a new Diablo build system that was implemented using GNU Autotools, mirroring much of the current SHARP build system, and easing the use of structural mechanics calculations for end-users of the SHARP multiphysics framework. It lets users easily build and use Diablo as a stand-alone simulation, as well as fully couple with the other SHARP physics modules. The top-level SHARP build system was modified to allow Diablo to hook in directly. New dependency handlers were implemented to let SHARP users easily build the framework with these new simulation capabilities. The remainder of this report will describe this work in full, with a detailed discussion of the overall design philosophy of SHARP, the new solution interpolation method introduced, and the Diablo integration work. We will conclude with a discussion of possible future SHARP improvements that will serve to increase solution accuracy and framework capability.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

EMPHASIS/Nevada UTDEM user guide. Version 2.0.

The Unstructured Time-Domain ElectroMagnetics (UTDEM) portion of the EMPHASIS suite solves Maxwell's equations using finite-element techniques on unstructured meshes. This document provides user-specific information to facilitate the use of the code for applications of interest. UTDEM is a general-purpose code for solving Maxwell's equations on arbitrary, unstructured tetrahedral meshes. The geometries and the meshes thereof are limited only by the patience of the user in meshing and by the available computing resources for the solution. UTDEM solves Maxwell's equations using finite-element method (FEM) techniques on tetrahedral elements using vector, edge-conforming basis functions. EMPHASIS/Nevada Unstructured Time-Domain ElectroMagnetic Particle-In-Cell (UTDEM PIC) is a superset of the capabilities found in UTDEM. It adds the capability to simulate systems in which the effects of free charge are important and need to be treated in a self-consistent manner. This is done by integrating the equations of motion for macroparticles (a macroparticle is an object that represents a large number of real physical particles, all with the same position and momentum) being accelerated by the electromagnetic forces upon the particle (Lorentz force). The motion of these particles results in a current, which is a source for the fields in Maxwell's equations.

99 GENERAL AND MISCELLANEOUS↗