Parallel Uniform Mesh Refinement Geometry Association Scalability.
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
This study compares conventional mesh refinement techniques, specifically Uniform Mesh Refinement (UMR), with a new Adaptive Mesh Refinement (AMR) method, applied to Organic Material Decomposition (OMD) models. The proposed benefit of AMR is that only areas that require refinement, based on minimizing a specific field gradient, are refined thus decreasing model wall time compared to conventional UMR methods. This work specifically focuses on comparing UMR and AMR methods on decomposing (both No-Flow and Porous-Flow material models) Polymeric Methylene Diisocyanate (PMDI) polyurethane foam. Throughout the work, the geometry increased in complexity to assess the refinement methods performance at varying levels geometric intricacy. While AMR has been shown to work well in a variety of applications, the UMR approach proved to be computationally faster, for many of the geometries and foam decomposition models, than AMR. However, it was observed that at higher levels of refinement, greater than 3 UMR, AMR begins to be computationally better. Additionally, the settings used to perform AMR greatly impact its performance, and lessons learned, in terms of OMD models, are shared. Due to physics involved in material decomposition, specifically the evolution of state variables, these problems don’t fully benefit from the advantages of AMR.
In this paper, we describe an array-based hierarchical mesh refinement 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 coarse mesh that can be used for a variety of purposes such as in multigrid solvers/preconditioners, to do solution convergence and verification studies and to improve overall parallel efficiency by decreasing I/O bandwidth requirements (by loading smaller meshes and in memory refinement). We also describe a high-order boundary reconstruction capability that can be used to project the new points after refinement using high-order approximations instead of linear projection in order to minimize and provide more control on geometrical errors introduced by curved boundaries.The capability is developed under the parallel unstructured mesh framework "Mesh Oriented dAtaBase" (MOAB Tautges et al. (2004)). We describe the underlying data structures and algorithms to generate such hierarchies in parallel and present numerical results for computational efficiency and effect on mesh quality. Furthermore, we also present results to demonstrate the applicability of the developed capability to study convergence properties of different point projection schemes for various mesh hierarchies and to a multigrid finite-element solver for elliptic problems.
This document is the main user guide for the Sierra/Percept capabilities including the mesh_adapt and mesh_transfer tools. Basic capabilities for uniform mesh refinement (UMR) and mesh transfers are discussed. Examples are used to provide illustration. Future versions of this manual will include more advanced features such as geometry and mesh smoothing. Additionally, all the options for the mesh_adapt code will be described in detail. Capabilities for local adaptivity in the context of offline adaptivity will also be included. This page intentionally left blank.
This document is the main user guide for the Sierra/Percept capabilities including the mesh_adapt and mesh_transfer tools. Basic capabilities for uniform mesh refinement (UMR) and mesh transfers are discussed. Examples are used to provide illustration. Future versions of this manual will include more advanced features such as geometry and mesh smoothing. Additionally, all the options for the mesh_adapt code will be described in detail. Capabilities for local adaptivity in the context of offline adaptivity will also be included.
The SPARC team has completed much of the workflow development needed for the coupled and uncoupled analyses needed to support our flight test validation work. The SPARC team has continued to make progress on development activities to support unsteady, full reentry vehicle aero analysis, which have focused on turbulence modeling, uniform mesh refinement, in-situ visualization (with the Paraview/Catalyst team), and performance analysis. The SPARC team is making solid progress towards our Q4 goal of demonstrating an improved Wall Modeled Large Eddy Simulation (WMLES) capability for standard geometries using high-order finite difference, discontinuous Galerkin, and low-dissipation finite volume methods. The SPARC team has met the minimum completion criteria for parts of the L1, including documenting performance and scaling of SPARC on Trinity, Sierra and Astra, and performing runs for the flight test validation case.
In this work, medium scale (30 cm diameter) methanol pool fires were simulated using the latest fire modeling suite implemented in Sierra/Fuego, a low Mach number multiphysics reacting flow code. The sensitivity of model outputs to various model parameters was studied with the objective of providing model validation. This work also assesses model performance relative to other recently published large eddy simulations (LES) of the same validation case. Two pool surface boundary conditions were simulated. The first was a prescribed fuel mass flux and the second used an algorithm to predict mass flux based on a mass and energy balance at the fuel surface. Gray gas radiation model parameters (absorption coefficients and gas radiation sources) were varied to assess radiant heat losses to the surroundings and pool surface. The radiation model was calibrated by comparing the simulated radiant fraction of the plume to experimental data. The effects of mesh resolution were also quantified starting with a grid resolution representative of engineering type fire calculations and then uniformly refining that mesh in the plume region. Simulation data were compared to experimental data collected at the University of Waterloo and the National Institute of Standards and Technology (NIST). Validation data included plume temperature, radial and axial velocities, velocity temperature turbulent correlations, velocity velocity turbulent correlations, radiant and convective heat fluxes to the pool surface, and plume radiant fraction. Additional analyses were performed in the pool boundary layer to assess simulated flame anchoring and the effect on convective heat fluxes. This work assesses the capability of the latest Fuego physics and chemistry model suite and provides additional insight into pool fire modeling for nonluminous, non-sooting flames.
Continuum computational kinetic plasma models evolve the distribution function of a plasma species f s on a phase-space grid over time. In many problems of interest the distribution function has limited extent in velocity space; hence, using a uniform, highly refined mesh would be costly and slow. Nonuniform velocity grids can reduce the computational cost by placing more degrees of freedom where f s is appreciable and fewer where it is not. In this work we introduce a first-of-its kind discontinuous Galerkin approach to nonuniform velocity-space discretization using mapped velocity coordinates. This new method is presented in the context of a gyrokinetic model used to study magnetized plasmas. We create discretizations of collisionless and collisional terms using mappings in a way that exactly conserves particles and energy. Numerical tests of such properties are presented, and we show that this new discretization can reproduce earlier gyrokinetic simulations using grids with up to 6–60 times fewer cells and 22X-60X speed-ups depending on dimensionality, geometry and plasma parameters.
Low-luminosity active galactic nuclei are strong sources of X-ray emission produced by Compton scattering originating from the accretion flows surrounding their supermassive black holes. The shape and energy of the resulting spectrum depend on the shape of the underlying electron distribution function (DF). In this work, we present an extended version of the GRMONTY code, called ΚMONTY. The GRMONTY code previously only included a thermal Maxwell–Jütner electron DF. We extend the GRMONTY code with non-thermal electron DFs, namely the κ and power-law DFs, implement Cartesian Kerr–Schild coordinates, accelerate the code with MPI, and couple the code to the non-uniform adaptive mesh refinement grid data from the general relativistic magnetohydrodynamics code BHAC. For the Compton scattering process, we derive two sampling kernels for both DFs. Finally, we present a series of code tests to verify the accuracy of our schemes. The implementation of non-thermal DFs opens the possibility of studying the effect of non-thermal emission on previously developed black hole accretion models.
Here, this paper presents for the first time an adaptive immersed approach for level-set topology optimization using higher-order truncated hierarchical B-spline discretizations for design and state variable fields. Boundaries and interfaces are represented implicitly by the iso-contour of one or multiple level-set functions. An immersed finite element method, the eXtended IsoGeometric Analysis, is used to predict the physical response. The proposed optimization framework affords different adaptively refined higher-order B-spline discretizations for individual design and state variable fields. The increased continuity of higher-order B-spline discretizations together with local refinement enables direct control over the accuracy of the representation of each field while simultaneously reducing computational cost compared to uniformly refined discretizations. A flexible mesh adaptation strategy enables local refinement based on geometric measures or physics-based error indicators. These adaptive discretization and analysis approaches are integrated into gradient-based optimization schemes, evaluating the design sensitivities using the adjoint method. Numerical studies illustrate the features of the proposed framework with static, linear elastic, multi-material, two- and three-dimensional problems. The examples provide insight into the effect of refining the design variable field on the optimization result and the convergence rate of the optimization process. Using coarse higher-order B-spline discretizations for level-set fields promotes the development of smooth designs and suppresses the emergence of small features. Moreover, adaptive mesh refinement for state variable fields results in a reduction of overall computational cost. Higher-order B-spline discretizations are especially interesting when evaluating gradients of state variable fields due to their higher inter-element continuity.
The ZND theory, named after Zeldovich, von Neumann, and Doering, provides a simple model for one-dimensional ideal steady-state detonation. It assumes that the detonation wave front starts with a shock that is a discontinuous jump and is followed by a finite-length reaction zone. Reactive burn (also called reactive flow) models are based on ZND theory, as they model the shock initiation and detonation process with a finite reaction rate. The ZND wave propagation test is essentially the only available test case where an analytic solution exists for verification of reactive burn models in numerical codes. However, there are extensions and variants of the ZND test that have been devised for verification of multidimensional flows. The objective of this work is to provide verification of the reactive burn models currently implemented in the Lagrangian hydrocode FLAG and investigate the influence of mesh resolution, artificial viscosity models, and the Arbitrary Lagrangian-Eulerian (ALE) Euler relaxer on the simulation results. The burn models of interest are the Wescott-Stewart-Davis (WSD) model, the Scaled Uniform Reactive Flow (SURF) model (specifically with the SURFplus model extension), and the Arrhenius shock temperature state dependent WSD (AWSD) model. Previously, Ralph Menikoff has used ZND tests for verification of the SURF and SURFplus models in the Eulerian hydrocode xRAGE. The ZND tests here are somewhat different than the approach by Menikoff. In particular, we use a piston-driven ZND detonation wave (via a prescribed constant velocity boundary condition) in a Lagrangian framework whereas Menikoff had a ZND wave followed by a invariant rarefaction wave. The xRAGE simulations were carried out on uniform grids and adaptive mesh refinement (AMR) grids. Although AMR was recently implemented in FLAG and now fully functional for 2D simulations, it will not be evaluated with ZND tests at this time. Some work has been done previously for validating the reactive burn models in FLAG. For example, the validation studies of SURF with shock-to-detonation (SDT) tests, cylinder tests, and gap-stick tests. Further validation of the AWSD, WSD, and SURF models is described in for SDT, multi-shock, cylinder, and corner-turning tests. Recently, a large parameter study with approximately twenty SDT tests was performed to validate the AWSD, WSD, SURF, and SURFplus models while also investigating mesh resolution and artificial viscosity settings. To the best of our knowledge, the current work represents the first documented verification of these burn models in FLAG. The reader should note that many of the tables and figures in this report use units of cm/g/µs, which are the default units for FLAG. However, some lengths and velocities are expressed in µm and mm/µs, respectively, which are typical units for detonation analyses.
Finite element methods approximate the solution to a partial differential equation (PDE) on a mesh consisting of many elements. In general, using more, smaller elements results in a lower error in the approximation. However, it is often possible to lower the error substantially by only refining, or decreasing the size of, the few elements in the mesh that have the highest error. Adaptive mesh refinement (AMR) is a process that selectively refines regions of a mesh with high error to achieve a desired accuracy in as few degrees of freedom (DOFs) as possible. AMR is favorable compared to uniform refinement, which refines all elements of the mesh equally, because it can often achieve the same accuracy without wasting extra computation time on refinement of elements that already have low error. However, it is difficult to know which elements to refine. In this report we explore ways to choose which elements to refine such that we minimize both the resulting error and the cumulative DOFs used in computation. In particular, we introduce a Pareto-front learning algorithm that trains a policy to give the optimal refinement actions to minimize the cumulative DOFs used to achieve a given target error. Such a policy is useful because it can be deployed on many different problem types where different accuracy levels are desired. Furthermore, training a single policy for a range of target errors allows us to use transfer learning to reduce the required training time.
Finite element simulation of the laser powder bed fusion process is made challenging by the inherently multiscale nature of the process. When using the typical global time stepping techniques, slowly-evolving regions of the domain receive the same numerical treatment as the regions with the highest temperature rates. The current work details the implementation and evaluation of an implicit multirate method which is able to advance different regions of the domain with distinct time steps, depending on their current solution rate. Previous work indicates that this representation of the temporal scales of the problem can lead to significant reductions in wall clock run time, and it is shown herein that multirate time integration, when used with a uniform process-scale mesh, can result in speedups of approximately 19, 42, and 87 times, for domains with edge lengths of approximately 1 mm, 2 mm, and 5 mm, respectively. When used in conjunction with $\ h$-refinement (limited to two levels of refinement), the resulting speedups (taken relative to the uniform mesh) are around 28, 85, and 665 times. The method is demonstrated to converge as indicated by the literature, and its use with an AM-Bench domain is demonstrated.
This article investigates the efficiency, robustness, and scalability of approximate ideal restriction (AIR) algebraic multigrid as a preconditioner in the all-at-once solution of a space-time hybridizable discontinuous Galerkin discretization of advection-dominated flows. The motivation for this study is that the time-dependent advection-diffusion equation can be seen as a “steady” advection-diffusion problem in $(d+1)$-dimensions and AIR has been shown to be a robust solver for steady advection-dominated problems. Numerical examples demonstrate the effectiveness of AIR as a preconditioner for advection-diffusion problems on fixed and time-dependent domains, using both slab-by-slab and all-at-once space-time discretizations, and in the context of uniform and space-time adaptive mesh refinement. A closer look at the geometric coarsening structure that arises in AIR also explains why AIR can provide robust, scalable, space-time convergence on advective and hyperbolic problems, while most multilevel parallel-in-time schemes struggle with such problems.
Abstract Flooding is one of the most impactful weather‐related natural hazards. Numerical models that solve the two dimensional (2D) shallow water equations (SWE) represent the first‐principles approach to simulate all types of spatial flooding, such as pluvial, fluvial, and coastal flooding, and their compound dynamics. High spatial resolution (e.g., () m) is needed in 2D SWE simulations to capture flood dynamics accurately, resulting in formidable computational challenges. Thus, relatively coarser spatial resolutions are used for large‐scale simulations of flooding, which introduce uncertainties in the results. It is unclear how the uncertainty associated with the model resolution compares to the uncertainties in precipitation data sets and assumptions regarding boundary conditions when channelized flows interact with other water bodies. In this study, we compare these three sources of uncertainties in 2D SWE simulations for the 2017 Houston flooding event. Our results show that precipitation uncertainty and mesh resolution have more significant impacts on the simulated streamflow and inundation dynamics than the choice of the downstream boundary condition at the watershed outlet. We point out the viability to confine the uncertainty of coarsening mesh resolution by using the variable resolution mesh (VRM) which refines critical topographic features with far fewer grid cells. Specifically, in simulations with VRM, the simulated inundation depths over the refined region are comparable to that use the finest uniform mesh. This study contributes to understanding the challenges and pathways for applying 2D SWE models to improve the realism of flood simulations over large scales.
This study analyzes the summertime precipitation bias over the Central United States and its relationship to the simulated large-scale environment and the convection scheme in the Energy Exascale Earth System Model Atmosphere Model version 1. This relationship is mainly examined in a set of short-term hindcasts initialized with realistic large-scale conditions for the summer of 2011. Besides the uniform 1° model resolution, we adopt Regionally Refined Meshes to increase the model resolution to 0.25°over the contiguous United States. Additional five-year Atmospheric Model Intercomparison Project simulations are conducted to confirm that the results from the hindcasts are consistent with the climate runs. We find that the summertime dry precipitation bias over the Great Plains and the wet bias over the Rockies cannot be reduced simultaneously by changing resolution or tuning parameters. As for the diurnal cycle, Energy Exascale Earth System Model Atmosphere Model version 1 captures the general diurnal variation of the large-scale moisture transport and the large-scale upward motion over the Central United States. However, the diurnal cycle of precipitation over the Great Plains is out of phase with the diurnal variation of the large-scale environment because the convective precipitation dominates the total precipitation and its diurnal cycle, and it does not directly respond to the local moisture convergence and the large-scale upward motion. These results reemphasize the importance of improving the coupling of the convection to the large-scale environment in reducing the summer precipitation bias over the Central United States in climate models with the resolution of ~0.25°.
Analytics-driven data layout optimizations and compression (NCSU): We have developed solutions that address challenges related to scientific data indexing, compression, and storage layout problems. Moreover, in addition to focusing on mainstream uniform mesh data, we have also addressed Adaptive Mesh Refinement (AMR) data.
Frameworks that facilitate runtime data sharing across multiple applications are of great importance for scientific data analytics. Although existing frameworks work well over uniform mesh data, they can not effectively handle adaptive mesh refinement (AMR) data. Among the challenges to construct an AMR-capable framework include: (1) designing an architecture that facilitates online AMR data management; (2) achieving a load-balanced AMR data distribution for the data staging space at runtime; and (3) building an effective online index to support the unique spatial data retrieval requirements for AMR data. Towards addressing these challenges to support runtime AMR data sharing across scientific applications, we present the AMRZone framework. Experiments over real-world AMR datasets demonstrate AMRZone's effectiveness at achieving a balanced workload distribution, reading/writing large-scale datasets with thousands of parallel processes, and satisfying queries with spatial constraints. Moreover, AMRZone's performance and scalability are even comparable with existing state-of-the-art work when tested over uniform mesh data with up to 16384 cores; in the best case, our framework achieves a 46% performance improvement.