Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “mesh data structures”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2018

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

NASA HECC Geometry and Performance Review Part 1: Validation of a Computational Model for the Vaneless Diffuser Configuration with As-Manufactured Impeller Geometry

An investigation of the NASA High Efficiency Centrifugal Compressor (HECC) vaneless diffuser configuration was performed. This multipart investigation focused on validating the computational model against experimental data. The validated model was then used to explore the effects of observed geometric differences between the as-manufactured and design-intent impellers. Lastly, the validated model was used for comparison against an experimental tip clearance study. Details regarding each of the parts are detailed below: A multipart investigation of the NASA High Efficiency Centrifugal Compressor (HECC) vaneless diffuser configuration was performed. Part I of the investigation focused on describing the HECC vaneless computational model and its validation against the experimental data published in GT2023-103128. To generate the model, a verification of the manufactured impeller was performed and was confirmed to match the impeller CAD. Section data from the impeller CAD, referred to as As-Manufactured, were used in the model. Steady RANS simulations using a multiblock structured mesh were used to conduct a mesh convergence study. The resultant mesh was then used for simulations at both design-speed and off-design speed conditions. The simulations compared well to data in both 1D and 2D terms. Based on the observed results the model was deemed validated and was used in the latter two parts of the multipart investigation.

centrifugal compressor↗
NASA NTRS2006

Accuracy Quantification of the Loci-CHEM Code for Chamber Wall Heat Transfer in a GO2/GH2 Single Element Model Problem

All solutions with Loci-CHEM achieved demonstrated steady state and mesh convergence. Preconditioning had no effect on solution accuracy and typically yields a 3-5times solution speed-up. The SST turbulence model has superior performance, relative to the data in the head end region, for the rise rate and peak heat flux. It was slightly worse than the others in the downstream region where all over-predicted the data by 30-100%.There was systematic mesh refinement in the unstructured volume and structured boundary layer areas produced only minor solution differences. Mesh convergence was achieved. Overall, Loci-CHEM satisfactorily predicts heat flux rise rate and peak heat flux and significantly over predicts the downstream heat flux.

West, Jeff↗
NASA NTRS2010

Multiscale Simulations of Magnetic Island Coalescence

We describe a new interactive parallel Adaptive Mesh Refinement (AMR) framework written in the Python programming language. This new framework, PyAMR, hides the details of parallel AMR data structures and algorithms (e.g., domain decomposition, grid partition, and inter-process communication), allowing the user to focus on the development of algorithms for advancing the solution of a systems of partial differential equations on a single uniform mesh. We demonstrate the use of PyAMR by simulating the pairwise coalescence of magnetic islands using the resistive Hall MHD equations. Techniques for coupling different physics models on different levels of the AMR grid hierarchy are discussed.

Dorelli, John C.↗
NASA NTRS1995

Adaptively Refined Euler and Navier-Stokes Solutions with a Cartesian-Cell Based Scheme

A Cartesian-cell based scheme with adaptive mesh refinement for solving the Euler and Navier-Stokes equations in two dimensions has been developed and tested. Grids about geometrically complicated bodies were 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 were created using polygon-clipping algorithms. The grid was stored in a binary-tree data structure which provided a natural means of obtaining cell-to-cell connectivity and of carrying out solution-adaptive mesh refinement. The Euler and Navier-Stokes equations were solved on the resulting grids using an upwind, finite-volume formulation. The inviscid fluxes were found in an upwinded manner using a linear reconstruction of the cell primitives, providing the input states to an approximate Riemann solver. The viscous fluxes were formed using a Green-Gauss type of reconstruction upon a co-volume surrounding the cell interface. Data at the vertices of this co-volume were found in a linearly K-exact manner, which ensured linear K-exactness of the gradients. Adaptively-refined solutions for the inviscid flow about a four-element airfoil (test case 3) were compared to theory. Laminar, adaptively-refined solutions were compared to accepted computational, experimental and theoretical results.

Coirier, William J.↗
DOE OSTI2013

SHARP Assembly-Scale Multiphysics Demonstration Simulations

The NEAMS Reactor Product Line effort aims to develop an integrated multiphysics simulation capability for the design and analysis of future generations of nuclear power plants. The Reactor Product Line code suite’s multi-resolution hierarchy is being designed to ultimately span the full range of length and time scales present in relevant reactor design and safety analyses, as well as scale from desktop to petaflop computing platforms. In this report, we describe our efforts to integrate thermal/hydraulics, neutronics, and structural mechanics modeling codes to perform coupled analysis of a representative fast sodium-cooled reactor fuel assembly. Over the past five years, the Reactor Product Line effort has developed high-fidelity single-physics codes for neutron transport modeling, in the PROTEUS code, and Large Eddy Simulation-based thermal/fluid modeling in the Nek5000 code. Both these codes have been exercised on over 100,000 processors of the IBM Blue Gene/P. The Diablo code has been used to perform structural mechanics and thermo-mechanical modeling. MOAB, the Reactor Geometry Generator (RGG), and MeshKit have been developed to generate and manipulate mesh and mesh-based data, in both serial and parallel environments. These tools together form a strong basis on which to build a multi-physics modeling capability. The goal of developing such a tool is to perform multi-physics neutronics, thermal/fluid, and structural mechanics modeling of the components inside a reactor core. While the focus of this report is on modeling a fast sodium-cooled reactor, it is also the goal that this simulation tool be useful for most reactor types. Here we report on the integration of PROTEUS and Nek5000 into the NEAMS framework. Both codes have been modified to read and write data from and to the MOAB library, in both serial and parallel environments. We focused on broad support for as many original physics code options as possible, rather than focusing only on near-term needs. Both codes were demonstrated through this interface on a relatively simple, seven-pin hexagonal fuel assembly. To support coupled analysis, the new multi-physics driver library COUPE was developed; this library provides flexible support for both loose and tight coupling, and can interface flexibly with codes in multiple programming languages. To couple results between the separate meshes used in each physics, the driver, PROTEUS, and Nek5000 all interface with the MBCoupler solution transfer tool provided with MOAB. Together, these tools form the basis of a new, coupled neutronics and thermal/fluid modeling code, that works in both serial and parallel. In a related effort, a driver in the Diablo code was used to access Nek5000-computed results written to a MOAB database, as well as the temperature data used to drive structural mechanics computations.

Tautges, Timothy J.↗
DOE OSTI2019

Camellia: A Rapid Development Framework for Finite Element Solvers

We report the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan guarantees the optimality of the finite element solution in a user-controllable energy norm, and provides several features supporting adaptive schemes. The approach provides stability automatically; there is no need for carefully derived numerical fluxes (as in DG schemes) or for mesh-dependent stabilization terms (as in stabilized methods). In this paper, we focus on features of Camellia that facilitate implementation of new DPG formulations; chief among these is a rich set of features in support of symbolic manipulation, which allow, e.g., bilinear formulations in the code to appear much as they would on paper. Many of these features are general in the sense that they can also be used in the implementation of other finite element formulations. In fact, because DPG’s requirements are essentially a superset of those of other finite element methods, Camellia provides built-in support for most common methods. We believe, however, that the combination of an essentially “hands-free” finite element methodology as found in DPG with the rapid development features of Camellia are particularly winsome, so we focus on use cases in this class. In addition to the symbolic manipulation features mentioned above, Camellia offers support for one-irregular adaptive meshes in 1D, 2D, 3D, and space-time. It provides a geometric multigrid preconditioner particularly suited for DPG problems, and supports distributed parallel execution using MPI. For its load balancing and distributed data structures, Camellia relies on packages from the Trilinos project, which simplifies interfacing with other computational science packages. Camellia also allows loading of standard mesh formats through an interface with the MOAB package. Camellia includes support for static condensation to eliminate element-interior degrees of freedom locally, usually resulting in substantial reduction of the cost of the global problem. Finally, we include a discussion of the variational formulations built into Camellia, with references to those formulations in the literature, as well as an MPI performance study.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Data, figures, animations, and scripts associated with the manuscript "Integrated Effects of Site Hydrology and Vegetation on Exchange Fluxes and Carbon Cycling at the Coastal Terrestrial Aquatic Interface"

This package contains the data, figures, animations, and scripts used in "Integrated Effects of Site Hydrology and Vegetation on Exchange Fluxes and Carbon Cycling at the Coastal Terrestrial Aquatic Interface" (Li et al., 2023). This study examines the interactions between soil, vegetation and hydrologic conditions in coastal areas, with a focus on the Chesapeake Bay region. The researchers used a mechanistic model called ATS-PFLOTRAN to explore how these interactions affect exchange process in different regions and the carbon/nitrogen cycle across the terrestrial-aquatic interface (TAI). Simulation scenarios isolate the effects of control factors and reaction constants derived from laboratory experiments. The results show a carbon cycle "hot zone" in coastal wetlands and in the transition zone between wetlands and uplands. Transpiration enhances fluxes between the surface and subsurface domains and increases dissolved oxygen in TAI. The decomposition of leaf-derived organic carbon provides an additional source of carbon for aerobic respiration and denitrification in the TAI. Microbial activity plays a key role in controlling redox conditions and their variability. This modeling study improves the understanding of complex TAI interactions and facilitates the representation of coastal ecosystems in larger-scale Earth system models.Several files can be found from this data package.1. Readme,md: This file describe the Title, Target Journal, Target submission date, Co-author, Science Questions, Hypotheses, Key words, Key message, Model and Data, Repo Structure. The user can read this file first and then go to details.2. mesh.zip: This file contains the mesh file for simulation cases. 3. Figure.zip: This file contains figures used in the manuscript . 4. animation.zip: This file contains animations used in the manuscript . 5. Data.zip: This file contains all required input data, such as concentration and flow boundaries. Also, it contains the DEM and processes results on area fraction. 6. Simulation_setup_and_results.zip: This file contains setup of cases used in the manuscript . The result files are too large, if you need that data, please contact to the Author. 7. notebooks.zip: This file contains the Jupyter notebooks for performing sensitivity analysis and other pre-process and post-process analyses.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1995

A unified multigrid solver for the Navier-Stokes equations on mixed element meshes

A unified multigrid solution technique is presented for solving the Euler and Reynolds-averaged Navier-Stokes equations on unstructured meshes using mixed elements consisting of triangles and quadrilaterals in two dimensions, and of hexahedra, pyramids, prisms, and tetrahedra in three dimensions. While the use of mixed elements is by no means a novel idea, the contribution of the paper lies in the formulation of a complete solution technique which can handle structured grids, block structured grids, and unstructured grids of tetrahedra or mixed elements without any modification. This is achieved by discretizing the full Navier-Stokes equations on tetrahedral elements, and the thin layer version of these equations on other types of elements, while using a single edge-based data-structure to construct the discretization over all element types. An agglomeration multigrid algorithm, which naturally handles meshes of any types of elements, is employed to accelerate convergence. An automatic algorithm which reduces the complexity of a given triangular or tetrahedral mesh by merging candidate triangular or tetrahedral elements into quadrilateral or prismatic elements is also described. The gains in computational efficiency afforded by the use of non-simplicial meshes over fully tetrahedral meshes are demonstrated through several examples.

Mavriplis, D. J.↗
NASA NTRS1991

A 3-D upwind Euler solver for unstructured meshes

A three-dimensional finite-volume upwind Euler solver is developed for unstructured meshes. The finite-volume scheme solves for solution variables at vertices of the mesh and satisfies the integral conservation law on nonoverlapping polyhedral control volumes surrounding vertices of the mesh. The schene achieves improved solution accuracy by assuming a piecewise linear variation of the solution in each control volume. This improved spatial accuracy hinges heavily upon the calculation of the solution gradient in each control volume given pointwise values of the solution at vertices of the mesh. Several algorithms are discussed for obtaining these gradients. Details concerning implementation procedures and data structures are discussed. Sample calculations for inviscid Euler flow about isolated aircraft wings at subsonic and transonic speeds are compared with established Euler solvers as well as experiment.

Barth, Timothy J.↗
NASA NTRS1992

AMR on the CM-2

We describe the development of a structured adaptive mesh algorithm (AMR) for the Connection Machine-2 (CM-2). We develop a data layout scheme that preserves locality even for communication between fine and coarse grids. On 8K of a 32K machine we achieve performance slightly less than 1 CPU of the Cray Y-MP. We apply our algorithm to an inviscid compressible flow problem.

Berger, Marsha J.↗
NASA NTRS1992

A 3D finite element multigrid solver for the Euler equations

A low storage, computationally efficient algorithm for the solution of the compressible Euler equations on unstructured tetrahedral meshes is developed. The algorithm takes the form of a centered scheme with the explicit addition of a high accuracy artificial viscosity and the solution is advanced to steady state by means of a multistage timestepping method. The side-based data structure which is employed enables a clear connection to be established between the proposed algorithm and upwind cell vertex schemes for unstructured meshes. The computational efficiency of the procedure is improved by incorporating an unstructured multigrid acceleration procedure. A number of flows of practical interest are analyzed to demonstrate the numerical performance of the proposed approach.

Peraire, J.↗
NASA NTRS2005

Parallel Adaptive Mesh Refinement Library

Parallel Adaptive Mesh Refinement Library (PARAMESH) is a package of Fortran 90 subroutines designed to provide a computer programmer with an easy route to extension of (1) a previously written serial code that uses a logically Cartesian structured mesh into (2) a parallel code with adaptive mesh refinement (AMR). Alternatively, in its simplest use, and with minimal effort, PARAMESH can operate as a domain-decomposition tool for users who want to parallelize their serial codes but who do not wish to utilize adaptivity. The package builds a hierarchy of sub-grids to cover the computational domain of a given application program, with spatial resolution varying to satisfy the demands of the application. The sub-grid blocks form the nodes of a tree data structure (a quad-tree in two or an oct-tree in three dimensions). Each grid block has a logically Cartesian mesh. The package supports one-, two- and three-dimensional models.

Mac-Neice, Peter↗
DOE OSTI2022

Planar 2D wireframe DNA origami

Two-dimensional (2D) DNA origami is widely used for applications ranging from excitonics to single-molecule biophysics. Conventional, single-layer 2D DNA origami exhibits flexibility and curvature in solution; however, that may limit its suitability as a 2D structural template. In contrast, 2D wireframe DNA origami rendered with six-helix bundle edges offers local control over duplex orientations with enhanced in-plane rigidity. Here, we investigate the 3D structure of these assemblies using cryo–electron microscopy (cryo-EM). 3D reconstructions reveal a high degree of planarity and homogeneity in solution for polygonal objects with and without internal mesh, enabling 10-Å resolution for a triangle. Coarse-grained simulations were in agreement with cryo-EM data, offering molecular structural insight into this class of 2D DNA origami. Our results suggest that these assemblies may be valuable for 2D material applications and geometries that require high structural fidelity together with local control over duplex orientations, rather than parallel duplex assembly.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Axom

Axom is an open-source library of "building block" software components that provide core infrastructure capabilities for HPC applications. Such capabilities include: input file parsing and verification for various file formats, format specification for material shape input to multi-material simulations and tools for placing those shapes on meshes, parallel distributed coordination of diagnostic messages, geometric primitives, spatial queries and spatial search acceleration data structures, in memory key-value data store for managing simulation data and parallel file I/O. Axom components are used widely across LLNL Advanced Simulation and Computing program applications. It is also part of the LLNL institutionally-supported RADIUSS project, which promotes and funds its adoption by projects across LLNL.

Zagaris, George↗
DOE OSTI2017

FleCSPH notes

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developers from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Predicting Ice Sheet and Climate Evolution on Extreme Scales (PISCEES) Final Report

Predicting Ice Sheet and Climate Evolution at Extreme Scales (PISCEES) PISCEES is a SciDAC Earth System Modeling project with the following goals: To develop and apply robust, accurate, and scalable dynamical cores for ice sheet modeling on structured and unstructured meshes with adaptive refinements To evaluate ice sheet models using new tools and data sets for verification and validation (V&V) and uncertainty quantification (UQ) To integrate these models and tools into DOE's Accelerated Climate Model for Energy (ACME) using improved estimates of ice sheet initial conditions, we will simulate decade-to-century-scale evolution of the Greenland and Antarctic ice sheets, running PISCEES ice sheet models both in standalone mode and coupled to ACME. We aim to provide useful, credible predictions, including uncertainty ranges, of future ice-sheet mass loss and resulting changes in climate and sea level. PISCEES is jointly funded by the Office of Biological and Environmental Research (BER) and the Office of Advanced Scientific Computing Research (ASCR) of the DOE Office of Science. Participating institutions: Los Alamos National Laboratory (LANL) Lawrence Berkeley National Laboratory (LBNL) Oak Ridge National Laboratory (ORNL) Sandia National Laboratories (SNL) Florida State University (FSU) Massachusetts Institute of Technology (MIT) University of South Carolina (USC) University of Texas at Austin (UT) National Center for Atmospheric Research (NCAR) (https://www.scidac.gov/PISCEES/).

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1992

Efficient computation of inviscid flow fields around complex configurations using a multiblock multigrid method

The applicability of a multigrid technique to block-structured, body-fitted meshes is examined focusing on three different strategies. In the first strategy data are exchanged between blocks in each stage of a five-stage Runge-Kutta time-stepping scheme which keeps a possible time lag between blocks to a minimum, but requires a large amount of I/O operations and storage. The second strategy is based on performing a complete Runge-Kutta cycle within a block before switching to the next. In the third strategy both a complete Runge-Kutta cycle and the residual evaluation for the restriction operator are done within a block, allowing a minimum of I/O and storage. The inviscid flow around a wing-body/engine-pylon configuration was computed on a mesh consisting of 11 computational blocks. It was found that both the first and the second strategies delivered converged results, but the third failed due to larger time lag between blocks.

Rossow, C.-C.↗