Parallel Uniform Mesh Refinement Geometry Association Scalability.
Abstract not provided.
Carnes, Brian↗
SEARCH · Search NASA
Results for “uniform mesh refinement”
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.
Parallel, Gradient-Based Anisotropic Mesh Adaptation for Re-entry Vehicle Configurations
Two gradient-based adaptation methodologies have been implemented into the Fun3d refine GridEx infrastructure. A spring-analogy adaptation which provides for nodal movement to cluster mesh nodes in the vicinity of strong shocks has been extended for general use within Fun3d, and is demonstrated for a 70 sphere cone at Mach 2. A more general feature-based adaptation metric has been developed for use with the adaptation mechanics available in Fun3d, and is applicable to any unstructured, tetrahedral, flow solver. The basic functionality of general adaptation is explored through a case of flow over the forebody of a 70 sphere cone at Mach 6. A practical application of Mach 10 flow over an Apollo capsule, computed with the Felisa flow solver, is given to compare the adaptive mesh refinement with uniform mesh refinement. The examples of the paper demonstrate that the gradient-based adaptation capability as implemented can give an improvement in solution quality.
Bibb, Karen L.↗
Comparison Study of Conventional and Adaptive Mesh Refinement in Organic Material Decomposition Models
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.
36 MATERIALS SCIENCE↗
Array-based, parallel hierarchical mesh refinement algorithms for unstructured meshes
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.
97 MATHEMATICS AND COMPUTING↗
Using Adaptive Mesh Refinement to Study Grid Resolution Effects for Shock/Boundary-Layer Interactions
Adaptive Mesh Refinement (AMR) promises a much more computationally efficient meansto obtain a discrete approximation to a continuous boundary value problem of a specifiedaccuracy than classic isotropic grid refinement. The AMR capability of OVERFLOW is utilizedto provide estimates of the exact analytical solutions to problems of interest to turbulencemodeling. Predictions of surface pressure and skin friction, essentially the state of stress at thesurface, shows little difference with grids believed to be "grid resolved." Velocity profiles, on theother hand, show marked differences in flows with shocks. The AMR method, as implementedin OVERFLOW2.2k, appears to provide the ability to produce arbitrarily accurate solutionsat a predictable cost much smaller than classic uniform mesh refinement.
Adaptive Mesh Refinement↗
Error Estimation and h-Adaptivity for Optimal Finite Element Analysis
The objective of adaptive meshing and automatic error control in finite element analysis is to eliminate the need for the application engineer from re-meshing and re-running design simulations to verify numerical accuracy. The user should only need to enter the component geometry and a coarse finite element mesh. The software will then autonomously and adaptively refine this mesh where needed, reducing the error in the fields to a user prescribed value. The ideal end result of the simulation is a measurable quantity (e.g. scattered field, input impedance), calculated to a prescribed error, in less time and less machine memory than if the user applied typical uniform mesh refinement by hand. It would also allow for the simulation of larger objects since an optimal mesh is created.
Cwik, Tom↗
Using Adaptive Mesh Refinement to Study Grid Resolution Effects for Shock-Boundary Layer Interactions
Adaptive Mesh Refinement (AMR) promises a much more computationally efficient means to obtain a discrete approximation to a continuous boundary value problem of a specified accuracy than classic isotropic grid refinement. The AMR capability of OVERFLOW (a computational fluid dynamics (CFD) code) is utilized to provide estimates of the exact analytical solutions to problems of interest to turbulence modeling. Predictions of surface pressure and skin friction, essentially the state of stress at the surface, shows little difference with grids believed to be "grid resolved." Velocity profiles, on the other hand, show marked differences in flows with shocks. The AMR method, as implemented in OVERFLOW 2.2k, appears to provide the ability to produce arbitrarily accurate solutions at a predictable cost much smaller than classic uniform mesh refinement.
Turbulence Modeling↗
Domain decomposition methods in computational fluid dynamics
The divide-and-conquer paradigm of iterative domain decomposition, or substructuring, has become a practical tool in computational fluid dynamic applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. These features are illustrated on the classic model problem of flow over a backstep using Newton's method as the nonlinear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately, and they can be combined synergistically. Sample performance results are included from an Intel iPSC/860 hypercube implementation.
Gropp, William D.↗
Domain decomposition methods in computational fluid dynamics
The divide-and-conquer paradigm of iterative domain decomposition, or substructuring, has become a practical tool in computational fluid dynamic applications because of its flexibility in accommodating adaptive refinement through locally uniform (or quasi-uniform) grids, its ability to exploit multiple discretizations of the operator equations, and the modular pathway it provides towards parallelism. These features are illustrated on the classic model problem of flow over a backstep using Newton's method as the nonlinear iteration. Multiple discretizations (second-order in the operator and first-order in the preconditioner) and locally uniform mesh refinement pay dividends separately, and they can be combined synergistically. Sample performance results are included from an Intel iPSC/860 hypercube implementation.
Gropp, William D.↗
Percept User Manual.
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.
97 MATHEMATICS AND COMPUTING↗
Percept User Manual
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.
42 ENGINEERING↗
ATDM AD projects to ECP Report (Q3 FY2020)
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.
97 MATHEMATICS AND COMPUTING↗
An accuracy assessment of Cartesian-mesh approaches for the Euler equations
A critical assessment of the accuracy of Cartesian-mesh approaches for solving the Euler equations is made. An exact solution of the Euler equations (Ringleb's flow) is used not only to infer the order of error of the Cartesian mesh approaches, but also to compare the magnitude of the error directly to that obtained with a structured mesh approach. The effect of cell merging is investigated as well as the use of two different K-exact reconstruction procedures. The solution methodology of the schemes is explained and tabulated results are presented to compare the solution accuracies. Adaptive and uniform mesh refinement is evaluated for Ringleb's flow and the supersonic flow through an axisymmetric inlet.
Coirier, William J.↗
Failure of Anisotropic Unstructured Mesh Adaption Based on Multidimensional Residual Minimization
An automated anisotropic unstructured mesh adaptation strategy is proposed, implemented, and assessed for the discretization of viscous flows. The adaption criteria is based upon the minimization of the residual fluctuations of a multidimensional upwind viscous flow solver. For scalar advection, this adaption strategy has been shown to use fewer grid points than gradient based adaption, naturally aligning mesh edges with discontinuities and characteristic lines. The adaption utilizes a compact stencil and is local in scope, with four fundamental operations: point insertion, point deletion, edge swapping, and nodal displacement. Evaluation of the solution-adaptive strategy is performed for a two-dimensional blunt body laminar wind tunnel case at Mach 10. The results demonstrate that the strategy suffers from a lack of robustness, particularly with regard to alignment of the bow shock in the vicinity of the stagnation streamline. In general, constraining the adaption to such a degree as to maintain robustness results in negligible improvement to the solution. Because the present method fails to consistently or significantly improve the flow solution, it is rejected in favor of simple uniform mesh refinement.
Wood, William A.↗
Adaptive Mesh Refinement for Microelectronic Device Design
Finite element and finite volume methods are used in a variety of design simulations when it is necessary to compute fields throughout regions that contain varying materials or geometry. Convergence of the simulation can be assessed by uniformly increasing the mesh density until an observable quantity stabilizes. Depending on the electrical size of the problem, uniform refinement of the mesh may be computationally infeasible due to memory limitations. Similarly, depending on the geometric complexity of the object being modeled, uniform refinement can be inefficient since regions that do not need refinement add to the computational expense. In either case, convergence to the correct (measured) solution is not guaranteed. Adaptive mesh refinement methods attempt to selectively refine the region of the mesh that is estimated to contain proportionally higher solution errors. The refinement may be obtained by decreasing the element size (h-refinement), by increasing the order of the element (p-refinement) or by a combination of the two (h-p refinement). A successful adaptive strategy refines the mesh to produce an accurate solution measured against the correct fields without undue computational expense. This is accomplished by the use of a) reliable a posteriori error estimates, b) hierarchal elements, and c) automatic adaptive mesh generation. Adaptive methods are also useful when problems with multi-scale field variations are encountered. These occur in active electronic devices that have thin doped layers and also when mixed physics is used in the calculation. The mesh needs to be fine at and near the thin layer to capture rapid field or charge variations, but can coarsen away from these layers where field variations smoothen and charge densities are uniform. This poster will present an adaptive mesh refinement package that runs on parallel computers and is applied to specific microelectronic device simulations. Passive sensors that operate in the infrared portion of the spectrum as well as active device simulations that model charge transport and Maxwell's equations will be presented.
Cwik, Tom↗
An accuracy assessment of Cartesian-mesh approaches for the Euler equations
A critical assessment of the accuracy of Cartesian-mesh approaches for steady, transonic solutions of the Euler equations of gas dynamics is made. An exact solution of the Euler equations (Ringleb's flow) is used not only to infer the order of the truncation error of the Cartesian-mesh approaches, but also to compare the magnitude of the discrete error directly to that obtained with a structured mesh approach. Uniformly and adaptively refined solutions using a Cartesian-mesh approach are obtained and compared to each other and to uniformly refined structured mesh results. The effect of cell merging is investigated as well as the use of two different K-exact reconstruction procedures. The solution methodology of the schemes is explained and tabulated results are presented to compare the solution accuracies.
Coirier, William J.↗
Conservative velocity mappings for discontinuous Galerkin kinetics
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.
Discontinuous Galerkin↗
$κ$monty: a Monte Carlo Compton scattering code including non-thermal electrons
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.
79 ASTRONOMY AND ASTROPHYSICS↗