Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cartesian 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 235 records · Page 13

Gyrokinetic Particle Simulation of Turbulent Transport in Burning Plasmas

In this project, we have developed techniques for visualizing large-scale time-varying multivariate particle and field data produced by the GPS_TTBP team. Our basic approach to particle data visualization is to provide the user with an intuitive interactive interface for exploring the data. We have designed a multivariate filtering interface for scientists to effortlessly isolate those particles of interest for revealing structures in densely packed particles as well as the temporal behaviors of selected particles. With such a visualization system, scientists on the GPS-TTBP project can validate known relationships and temporal trends, and possibly gain new insights in their simulations. We have tested the system using over several millions of particles on a single PC. We will also need to address the scalability of the system to handle billions of particles using a cluster of PCs. To visualize the field data, we choose to use direct volume rendering. Because the data provided by PPPL is on a curvilinear mesh, several processing steps have to be taken. The mesh is curvilinear in nature, following the shape of a deformed torus. Additionally, in order to properly interpolate between the given slices we cannot use simple linear interpolation in Cartesian space but instead have to interpolate along the magnetic field lines given to us by the scientists. With these limitations, building a system that can provide an accurate visualization of the dataset is quite a challenge to overcome. In the end we use a combination of deformation methods such as deformation textures in order to fit a normal torus into their deformed torus, allowing us to store the data in toroidal coordinates in order to take advantage of modern GPUs to perform the interpolation along the field lines for us. The resulting new rendering capability produces visualizations at a quality and detail level previously not available to the scientists at the PPPL. In summary, in this project we have successfully created new capabilities for the scientists to visualize their 3D data at higher accuracy and quality, enhancing their ability to evaluate the simulations and understand the modeled phenomena.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

RIACS

Topics considered include: high-performance computing; cognitive and perceptual prostheses (computational aids designed to leverage human abilities); autonomous systems. Also included: development of a 3D unstructured grid code based on a finite volume formulation and applied to the Navier-stokes equations; Cartesian grid methods for complex geometry; multigrid methods for solving elliptic problems on unstructured grids; algebraic non-overlapping domain decomposition methods for compressible fluid flow problems on unstructured meshes; numerical methods for the compressible navier-stokes equations with application to aerodynamic flows; research in aerodynamic shape optimization; S-HARP: a parallel dynamic spectral partitioner; numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains; application of high-order shock capturing schemes to direct simulation of turbulence; multicast technology; network testbeds; supercomputer consolidation project.

Oliger, Joseph↗

Metamesh, Version 1.0

Metamesh is a general-purpose C++ language library for creating data structures that represent meshes. An important difference between Metamesh and other "mesh" libraries is that Metamesh does not provide a specific mesh format, in the usual sense, or tools or a GUI by which users build specific meshes. Rather, it provides a mechanism by which mesh formats themselves can be built, based on their constituent parts and the relationships between them.Consider that a mesh in up to three space dimensions can, in principle, contain nodes (0d entities, or points), edges (1d entities), faces (2d entities), and cells (3d, or volumetric, entities). A node might be defined in terms of (x), (x,y), or (x,y,z) in Cartesian coordinates; or perhaps something else, in a different coordinate system. An edge is typically defined from two nodes; say, "edge E goes from node A=(ax,ay) to node B=(bx,by)." Faces can reasonably be defined in terms of nodes or edges, and cells in terms of nodes, edges, or faces. Note also that someone might wish to support general faces or cells, or only specific variants - say, triangular faces and tetrahedral cells, or quadrilateral faces and hexahedral cells. Or, perhaps, both triangular and quadrilateral faces (but no others), with prisms for each cell. Consider also that a mesh can have the same or a lesser dimension than that of its enclosing space. In 3d, for example, one could have a full 3d mesh, a 2d "sheet" mesh with no cells, a 1d "parametrized curve" with neither faces nor cells, or even a 1d "point cloud." And, in addition to defining a mesh scheme, a user might wish to place additional data onto one or more mesh entities. Imagine, for example, a velocity at each node, a flux across each edge or face, and a mass or average density per cell. Metamesh supports all of this, through the use of C++ class and function templates, and template metaprogramming techniques. Programmers begin with constructs that Metamesh provides (or, users can define their own), and assemble them in particular ways in order to create particular mesh formats. Metamesh then provides functionality automatically to meshes that are constructed in this manner. Finally, Metamesh provides very general functions for spinning, extruding, visualizing, and performing input/output of whatever meshes a user builds with it.

Staley, Martin↗

Transient Multiphysics Simulations with Pin Power Reconstruction in the Griffin Reactor Physics Code

This work introduces the pin power reconstruction capability available in the Griffin reactor physics code. This capability is implemented in an unstructured mesh framework, and the methods introduced are applied to the 2D SIMBA reactor core, which has assemblies and pins arranged in a hexagonal lattice. Since this reactor has a non-Cartesian geometry and also operates in the thermal spectrum, a general approach to pin power reconstruction is adopted, where SPH-based equivalence is leveraged to preserve assembly-wise reaction rates, while computing full-core form functions to preserve pin-wise fission production rates within the fuel pins of the reactor core. In a 2D microreactor benchmark problem, this pin power reconstruction approach was shown to reproduce pin powers compared to the Serpent2 Monte Carlo code for fixed temperature conditions and control drum rotation angles, yielding a core-wide RMS error level of 0.6\% and a maximum absolute pin error of 2.3\%. In addition, a tabulated library of multigroup cross sections, SPH factors, and form functions was generated to demonstrate the applicability of pin power reconstruction to a thermal feedback problem. Finally, a control drum transient was successfully simulated, showcasing the application of pin power reconstruction in a transient multiphysics feedback problem.

97 - MATHEMATICS AND COMPUTING↗

Addition of tabulated equation of state and neutrino leakage support to illinoisgrmhd

Here we have added support for realistic, microphysical, finite-temperature equations of state (EOS) and neutrino physics via a leakage scheme to illinoisgrmhd, an open-source GRMHD code for dynamical spacetimes in the einstein toolkit. These new features are provided by two new, nrpy+-based codes: nrpyeos, which performs highly efficient EOS table lookups and interpolations, and nrpyleakage, which implements a new, adaptive mesh refinement (AMR)-capable neutrino leakage scheme in the einstein toolkit. We have performed a series of strenuous validation tests that demonstrate the robustness of these new codes, particularly on the Cartesian AMR grids provided by carpet. Furthermore, we show results from fully dynamical GRMHD simulations of single unmagnetized neutron stars, and magnetized binary neutron star mergers. This new version of illinoisgrmhd, as well as nrpyeos and nrpyleakage, is pedagogically documented in jupyter notebooks and fully open source. The codes will be proposed for inclusion in an upcoming version of the einstein toolkit.

79 ASTRONOMY AND ASTROPHYSICS↗

SEISMIC SIMULATIONS USING PARALLEL COMPUTING AND THREE-DIMENSIONAL EARTH MODELS TO IMPROVE NUCLEAR EXPLOSION PHENOMENOLOGY AND MONITORING

The development of accurate numerical methods to simulate wave propagation in three-dimensional (3D) earth models and advances in computational power offer exciting possibilities for modeling the motions excited by underground nuclear explosions. This presentation will describe recent work to use new numerical techniques and parallel computing to model earthquakes and underground explosions to improve understanding of the wave excitation at the source and path-propagation effects. Firstly, we are using the spectral element method (SEM, SPECFEM3D code of Komatitsch and Tromp, 2002) to model earthquakes and explosions at regional distances using available 3D models. SPECFEM3D simulates anelastic wave propagation in fully 3D earth models in spherical geometry with the ability to account for free surface topography, anisotropy, ellipticity, rotation and gravity. Results show in many cases that 3D models are able to reproduce features of the observed seismograms that arise from path-propagation effects (e.g. enhanced surface wave dispersion, refraction, amplitude variations from focusing and defocusing, tangential component energy from isotropic sources). We are currently investigating the ability of different 3D models to predict path-specific seismograms as a function of frequency. A number of models developed using a variety of methodologies are available for testing. These include the WENA/Unified model of Eurasia (e.g. Pasyanos et al 2004), the global CUB 2.0 model (Shapiro and Ritzwoller, 2002), the partitioned waveform model for the Mediterranean (van der Lee et al., 2007) and stochastic models of the Yellow Sea Korean Peninsula region (Pasyanos et al., 2006). Secondly, we are extending our Cartesian anelastic finite difference code (WPP of Nilsson et al., 2007) to model the effects of free-surface topography. WPP models anelastic wave propagation in fully 3D earth models using mesh refinement to increase computational speed and improve memory efficiency. Thirdly, we are modeling non-linear near-source shock wave propagation with GEODYN, an Eulerian Godunov finite-difference code (Antoun et al., 2001). This code accounts for shock wave propagation and a variety of effects including cavity formation, rock fracture and plastic deformation. We are exploring the coupling of GEODYN to WPP to propagate motions from the near-source (non-linear) region to the (linear anelastic) region where seismic observations are made at local, regional and teleseismic distances. This effort has just begun and we show preliminary results in this paper (with more to follow in our poster). These simulation tools are supported by massively parallel computers operated by Livermore Computing.

58 GEOSCIENCES↗

Implicit Approaches for Moving Boundaries in a 3-D Cartesian Method

This work considers numerical simulation of three-dimensional flows with time-evolving boundaries. Such problems pose a variety of challenges for numerical schemes, and have received a substantial amount of attention in the recent literature. Since such simulations are unsteady, time-accurate solution of the governing equations is required. In special cases, the body motion can be treated by a uniform rigid motion of the computational domain. For the more general situation of relative-body motion, however, this simplification is unavailable and the simulations require a mechanism for ensuring that the mesh evolves with the moving boundaries. This involves a "remeshing" of the computational domain (either localized or global) at each physical timestep, and places a premium on both the speed and robustness of the remeshing algorithms. This work presents a method which includes unsteady flow simulation, rigid domain motion, and relative body motion using a time-evolving Cartesian grid system in three dimensions.

Murman, Scott M.↗

MPAS-Ocean Model User's Guide Version 6.0

The Model for Prediction Across Scales-Ocean (MPAS-Ocean) is an unstructured-mesh ocean model capable of using enhanced horizontal resolution in selected regions of the ocean domain. Model domains may be spherical with bottom topography to simulate the earth’s oceans, or on Cartesian domains for idealized experiments.

54 ENVIRONMENTAL SCIENCES↗

Inviscid transonic wing design using inverse methods in curvilinear coordinates

An inverse wing design method has been developed around an existing transonic wing analysis code. The original analysis code, TAWFIVE, has as its core the numerical potential flow solver, FLO30, developed by Jameson and Caughey. Features of the analysis code include a finite-volume formulation; wing and fuselage fitted, curvilinear grid mesh; and a viscous boundary layer correction that also accounts for viscous wake thickness and curvature. The development of the inverse methods as an extension of previous methods existing for design in Cartesian coordinates is presented. Results are shown for inviscid wing design cases in super-critical flow regimes. The test cases selected also demonstrate the versatility of the design method in designing an entire wing or discontinuous sections of a wing.

Gally, Thomas A.↗

Development of direct-inverse 3-D methods for applied transonic aerodynamic wing design and analysis

An inverse wing design method was developed around an existing transonic wing analysis code. The original analysis code, TAWFIVE, has as its core the numerical potential flow solver, FLO30, developed by Jameson and Caughey. Features of the analysis code include a finite-volume formulation; wing and fuselage fitted, curvilinear grid mesh; and a viscous boundary layer correction that also accounts for viscous wake thickness and curvature. The development of the inverse methods as an extension of previous methods existing for design in Cartesian coordinates is presented. Results are shown for inviscid wing design cases in super-critical flow regimes. The test cases selected also demonstrate the versatility of the design method in designing an entire wing or discontinuous sections of a wing.

Carlson, Leland A.↗

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: a gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations

A Cartesian, cell-based approach for adaptively-refined solutions of the Euler and Navier-Stokes equations in two dimensions is developed and tested. Grids about geometrically complicated bodies are generated automatically, by recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, N-sided 'cut' cells are created using polygon-clipping algorithms. The grid is stored in a binary-tree data structure which provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite-volume formulation. The convective terms are upwinded: A gradient-limited, linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The more robust of a series of viscous flux functions is used to provide the viscous fluxes at the cell interfaces. Adaptively-refined solutions of the Navier-Stokes equations using the Cartesian, cell-based approach are obtained and compared to theory, experiment and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

Emerging CFD technologies and aerospace vehicle design

With the recent focus on the needs of design and applications CFD, research groups have begun to address the traditional bottlenecks of grid generation and surface modeling. Now, a host of emerging technologies promise to shortcut or dramatically simplify the simulation process. This paper discusses the current status of these emerging technologies. It will argue that some tools are already available which can have positive impact on portions of the design cycle. However, in most cases, these tools need to be integrated into specific engineering systems and process cycles to be used effectively. The rapidly maturing status of unstructured and Cartesian approaches for inviscid simulations makes suggests the possibility of highly automated Euler-boundary layer simulations with application to loads estimation and even preliminary design. Similarly, technology is available to link block structured mesh generation algorithms with topology libraries to avoid tedious re-meshing of topologically similar configurations. Work in algorithmic based auto-blocking suggests that domain decomposition and point placement operations in multi-block mesh generation may be properly posed as problems in Computational Geometry, and following this approach may lead to robust algorithmic processes for automatic mesh generation.

Aftosmis, Michael J.↗

An Adaptive Semi-Implicit Scheme for Simulations of Unsteady Viscous Compressible Flows

A numerical scheme for simulation of unsteady, viscous, compressible flows is considered. The scheme employs an explicit discretization of the inviscid terms of the Navier-Stokes equations and an implicit discretization of the viscous terms. The discretization is second order accurate in both space and time. Under appropriate assumptions, the implicit system of equations can be decoupled into two linear systems of reduced rank. These are solved efficiently using a Gauss-Seidel method with multigrid convergence acceleration. When coupled with a solution-adaptive mesh refinement technique, the hybrid explicit-implicit scheme provides an effective methodology for accurate simulations of unsteady viscous flows. The methodology is demonstrated for both body-fitted structured grids and for rectangular (Cartesian) grids.

Steinthorsson, Erlendur↗

Solution-Adaptive Cartesian Cell Approach for Viscous and Inviscid Flows

A Cartesian cell-based approach for adaptively refined solutions of the Euler and Navier-Stokes equations in two dimensions is presented. Grids about geometrically complicated bodies are generated automatically, by the recursive subdivision of a single Cartesian cell encompassing the entire flow domain. Where the resulting cells intersect bodies, polygonal cut cells are created using modified polygon-clipping algorithms. The grid is stored in a binary tree data structure that provides a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations are solved on the resulting grids using a finite volume formulation. The convective terms are upwinded: A linear reconstruction of the primitive variables is performed, providing input states to an approximate Riemann solver for computing the fluxes between neighboring cells. The results of a study comparing the accuracy and positivity of two classes of cell-centered, viscous gradient reconstruction procedures is briefly summarized. Adaptively refined solutions of the Navier-Stokes equations are shown using the more robust of these gradient reconstruction procedures, where the results computed by the Cartesian approach are compared to theory, experiment, and other accepted computational results for a series of low and moderate Reynolds number flows.

Coirier, William J.↗

Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics

Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally,Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.

TTT↗

Evaluation of Voronoi Meshes for Large Eddy Simulations of High Lift Aerodynamics

Numerical sensitivity to 3 different Voronoi seeding methods is investigated for Large Eddy Simulations (LES). A second order accurate, non-dissipative finite volume discretization is used to systematically investigate the effects of different polyhedral Voronoi mesh types using a sequence of three canonical problems with increasing complexity. First, inviscid isentropic vortex propagation is studied to demonstrate the substantial reduction of errors for rhombic dodecahedron and truncated octahedral cell types over Cartesian hexagonal cells of identical spacing. Furthermore, the reduction of errors induced at cell-size transitions (grid-coarsening interfaces) due to Lloyd smoothing iterations is quantified. It is shown that by utilizing an appropriate viscous flux discretization, a constant coefficient subgrid scale model is sufficient for non-linear stability at the 2:1 cell-size transitions on polyhedral grids, although some further error reduction does occur when smoothing is utilized. Next, forced homogeneous isotropic turbulence at an asymptotically large Reynolds number is studied to demonstrate the non-dissipative character of the inviscid flux discretization, and the non-linear robustness and accuracy offered by the viscous flux discretization using a subgrid scale model for all three Voronoi grid types. Finally, Wall-Modeled Large Eddy Simulations (WMLES) are performed to study the high-lift aerodynamics on the McDonnell Douglas 30P30N multi-element airfoil at two distinct grid levels and for two distinct Voronoi cell types. The formulation is shown to predict the aerodynamic loading with high accuracy at all angles of attack when sufficient resolution is reached, and the hexagonal prism grid topology, while computationally more expensive, has higher effective resolution compared to the Cartesian grid topology with the same spacing.

TTT↗

Scale-Resolving Simulations of a Supersonic Retro-Propulsion Concept For Mars Entry, Descent, and Landing

Supersonic retro-propulsion (SRP) is a deceleration technology that could enable largerpayloads and potentially humans to be brought from space to the surface of Mars safely.Accurate and reliable CFD predictions are needed to help design future Mars entry, descent,and landing (EDL) vehicles due to the cost and limitations of wind tunnel tests. TypicalCFD approaches struggle at points along the Mars EDL trajectory with high enough altitude(low enough ambient pressure) that the SRP motor plumes are over-expanded. This workdemonstrates how high-order scale-resolving simulations on Cartesian AMR grids can provideaccurate and reliable time-averaged aerodynamic loads on the vehicle for this challengingflow regime. Greater than second order convergence in the time-averaged integrated axialforce𝐶𝐴is obtained across the three finest mesh resolutions simulated, and the estimateduncertainty is smaller than the unsteady standard deviation – demonstrating the accuracy andreliability of the method. Although costly, this approach can yield higher confidence in𝐶𝐴thanpreviously obtained in a reasonable turnaround time and is within reach for a few points in thetrajectory (i.e. Mach 2.4, 2.52, and 2.78). Further computational performance and numericalmethods improvements are needed to reduce the cost enough to bring this method into the EDLengineering design cycle.

S&M↗