Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh adaptivity”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

Multi-Objective Adaptive Mesh Refinement Using Reinforcement Learning

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.

97 MATHEMATICS AND COMPUTING↗

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↗

Improvements to the LAURA Mesh Adaptation Algorithm

This paper describes recent improvements to the LAURA code that removes the requirementof unbroken body-normal lines when using the automated mesh adaptation algorithm inLAURA responsible for mesh alignment with shock and adjusting near-wall mesh spacing. Fornon-simple geometry, restricting block topologies such that blocks span the domain from thesurface wall boundaries to domain inflow boundary can be difficult or impossible. Removing thisrequirement enables novel block topologies that simplify the meshing workflow for LAURA users.The new adaptation algorithm implementation in LAURA is described and several examples ofthe adaptation are presented to demonstrate the efficacy of the adaptation algorithm.

LAURA↗

Improvements to the LAURA Mesh Adaptation Algorithm

This paper describes recent improvements to the LAURA code that removes the requirementof unbroken body-normal lines when using the automated mesh adaptation algorithm inLAURA responsible for mesh alignment with shock and adjusting near-wall mesh spacing. Fornon-simple geometry, restricting block topologies such that blocks span the domain from thesurface wall boundaries to domain inflow boundary can be difficult or impossible. Removing thisrequirement enables novel block topologies that simplify the meshing workflow for LAURA users.The new adaptation algorithm implementation in LAURA is described and several examples ofthe adaptation are presented to demonstrate the efficacy of the adaptation algorithm.

LAURA↗

Intrinsic adaptive mesh techniques

An alternating direction adaptive grid movement code was developed and a thesis adaptive angular meshes was directed. The alternating direction code was also established on the NASA Langley computer system and is available for use there. In essence, grid points are moved on an abstract surface above physical space by means of alternating coordinate directions. The abstract surface is formed with the salient solution properties if they can be extracted by a priori physical reasoning; or otherwise, in the absence of such reasoning, by the use of error estimates in some chosen norm. Upon formulation, all important driving properties for adaptive purposes are consolidated into one object - the abstract surface. At a basic level, a uniform distribution of surface points is equivalent to gradient resolution. This arises from a projection back down into physical space. At a higher level, a more accurate view of the abstract surface is obtained when changes in surface direction are also resolved. The appropriate measure for direction changes is normal curvature. It is defined as the rate of change of surface tangent planes as a surface coordinate curve is transversed in uniform increments of arc length.

Eiseman, P. R.↗

Parallel Block Structured Adaptive Mesh Refinement on Graphics Processing Units

Block-structured adaptive mesh refinement is a technique that can be used when solving partial differential equations to reduce the number of zones necessary to achieve the required accuracy in areas of interest. These areas (shock fronts, material interfaces, etc.) are recursively covered with finer mesh patches that are grouped into a hierarchy of refinement levels. Despite the potential for large savings in computational requirements and memory usage without a corresponding reduction in accuracy, AMR adds overhead in managing the mesh hierarchy, adding complex communication and data movement requirements to a simulation. In this paper, we describe the design and implementation of a native GPU-based AMR library, including: the classes used to manage data on a mesh patch, the routines used for transferring data between GPUs on different nodes, and the data-parallel operators developed to coarsen and refine mesh data. We validate the performance and accuracy of our implementation using three test problems and two architectures: an eight-node cluster, and over four thousand nodes of Oak Ridge National Laboratory’s Titan supercomputer. Our GPU-based AMR hydrodynamics code performs up to 4.87× faster than the CPU-based implementation, and has been scaled to over four thousand GPUs using a combination of MPI and CUDA.

97 MATHEMATICS AND COMPUTING↗

Anisotropic Mach Cone Aligned Mesh Adaptation for Low Boom Simulations

An automated off-body Mach cone aligned structured curvilinear grid generation procedure is presented for near-field computational fluid dynamics simulations. This procedure combines output-based indicators and mesh redistribution to perform anisotropic mesh adaptation while maintaining Mach cone alignment. Automation is achieved through a novel direction-based adaptation indicator formulation. The adaptation procedure is demonstrated on the JAXA Wing Body geometry and X-59 C608 demonstrator model from the Second and Third AIAA Sonic Boom Prediction Workshops, respectively. It is demonstrated that anisotropic mesh adaptation may result in a greater than fifty percent reduction in resource usage required to achieve the same level of accuracy as uniform and user constructed Mach cone aligned grids for near-field pressure signatures, ground-level overpressure signatures, and loudness metrics.

CST↗

Anisotropic Mach Cone Aligned Mesh Adaptation for Low Boom Simulations

An automated off-body Mach cone aligned structured curvilinear grid generation procedure is presented for near-field computational fluid dynamics simulations. This procedure combines output-based indicators and mesh redistribution to perform anisotropic mesh adaptation while maintaining Mach cone alignment. Automation is achieved through a novel direction-based adaptation indicator formulation. The adaptation procedure is demonstrated on the JAXA Wing Body geometry and X-59 C608 demonstrator model from the Second and Third AIAA Sonic Boom Prediction Workshops, respectively. It is demonstrated that anisotropic mesh adaptation may result in a greater than fifty percent reduction in resource usage required to achieve the same level of accuracy as uniform and user constructed Mach cone aligned grids for near-field pressure signatures, ground-level overpressure signatures, and loudness metrics.

CST↗

Learning Robust Marking Policies for Adaptive Mesh Refinement

Here in this work, we revisit the marking decisions made in the standard adaptive finite element method (AFEM). Experience shows that a naïve marking policy leads to inefficient use of computational resources for adaptive mesh refinement (AMR). Consequently, using AMR in practice often involves ad-hoc or time-consuming offline parameter tuning to set appropriate parameters for the marking subroutine. To address these practical concerns, we recast AMR as a Markov decision process in which refinement parameters can be selected on-the-fly at run time, without the need for pre-tuning by expert users. In this new paradigm, the refinement parameters are also chosen adaptively via a marking policy that can be optimized using methods from reinforcement learning. We use the Poisson equation to demonstrate our techniques on h- and hp-refinement benchmark problems, and our experiments suggest that superior marking policies remain undiscovered for many classical AFEM applications. Furthermore, an unexpected observation from this work is that marking policies trained on one family of PDEs are sometimes robust enough to perform well on problems far outside the training family. For illustration, we show that a simple hp-refinement policy trained on 2D domains with only a single re-entrant corner can be deployed on far more complicated 2D domains, and even 3D domains, without significant performance loss. For reproduction and broader adoption, we accompany this work with an open-source implementation of our methods.

97 MATHEMATICS AND COMPUTING↗

Dynamic mesh adaption for triangular and tetrahedral grids

The following topics are discussed: requirements for dynamic mesh adaption; linked-list data structure; edge-based data structure; adaptive-grid data structure; three types of element subdivision; mesh refinement; mesh coarsening; additional constraints for coarsening; anisotropic error indicator for edges; unstructured-grid Euler solver; inviscid 3-D wing; and mesh quality for solution-adaptive grids. The discussion is presented in viewgraph form.

Rupak Biswas↗

Error estimation and adaptive mesh refinement for parallel analysis of shell structures

The formulation and application of element-level, element-independent error indicators is investigated. This research culminates in the development of an error indicator formulation which is derived based on the projection of element deformation onto the intrinsic element displacement modes. The qualifier 'element-level' means that no information from adjacent elements is used for error estimation. This property is ideally suited for obtaining error values and driving adaptive mesh refinements on parallel computers where access to neighboring elements residing on different processors may incur significant overhead. In addition such estimators are insensitive to the presence of physical interfaces and junctures. An error indicator qualifies as 'element-independent' when only visible quantities such as element stiffness and nodal displacements are used to quantify error. Error evaluation at the element level and element independence for the error indicator are highly desired properties for computing error in production-level finite element codes. Four element-level error indicators have been constructed. Two of the indicators are based on variational formulation of the element stiffness and are element-dependent. Their derivations are retained for developmental purposes. The second two indicators mimic and exceed the first two in performance but require no special formulation of the element stiffness mesh refinement which we demonstrate for two dimensional plane stress problems. The parallelizing of substructures and adaptive mesh refinement is discussed and the final error indicator using two-dimensional plane-stress and three-dimensional shell problems is demonstrated.

Keating, Scott C.↗

A survey of high level frameworks in block-structured adaptive mesh refinement packages

Over the last decade block-structured adaptive mesh refinement (SAMR) has found increasing use in large, publicly available codes and frameworks. SAMR frameworks have evolved along different paths. Some have stayed focused on specific domain areas, others have pursued a more general functionality, providing the building blocks for a larger variety of applications. In this survey paper we examine a representative set of SAMR packages and SAMR-based codes that have been in existence for half a decade or more, have a reasonably sized and active user base outside of their home institutions, and are publicly available. The set consists of a mix of SAMR packages and application codes that cover a broad range of scientific domains. We look at their high-level frameworks, their design trade-offs and their approach to dealing with the advent of radical changes in hardware architecture. Finally, the codes included in this survey are BoxLib, Cactus, Chombo, Enzo, FLASH, and Uintah.

97 MATHEMATICS AND COMPUTING↗

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.↗

Nearfield Anisotropic Mesh Adaptivity for the Third AIAA Sonic Boom Workshop

The Third AIAA Sonic Boom Workshop provides a unique opportunity to verify nearfield Computational Fluid Dynamics (CFD) tools. The workshop gathered nearfield CFD pressures from families of Mach-aligned, manually-tailored meshes on the C608 Low Boom Flight Test Demonstrator and the shock-plume interaction wind tunnel model. Here two classical adaptive strategies, multiscale and goal-oriented, are compared to the results obtained on tailored grids. The multiscale strategy is implemented independently in two separate toolsets. Details of the adapted mesh density are shown that resolve the complex interaction of boundary layers, shocks, expansions, and vortical structures. Mesh convergence of nearfield pressure signatures and their integral is shown. These detailed comparisons between adapted and manually-tailored meshes and independent implementations of mesh adaptation demonstrate the readiness of these methods for controlling the discretization error of nearfield sonic boom predication.

Julien Vanharen↗

Thickness-based adaptive mesh refinement methods for multi-phase flow simulations with thin regions

In numerical simulations of multi-scale, multi-phase flows, grid refinement is required to resolve regions with small scales. A notable example is liquid-jet atomization and subsequent droplet dynamics. It is essential to characterize the detailed flow physics with variable length scales with high fidelity, in order to elucidate the underlying mechanisms. In this paper, two thickness-based mesh refinement schemes are developed based on distance- and topology-oriented criteria for thin regions with confining wall/plane of symmetry and in any situation, respectively. Both techniques are implemented in a general framework with a volume-of-fluid formulation and an adaptive-mesh-refinement capability. The distance-oriented technique compares against a critical value, the ratio of an interfacial cell size to the distance between the mass center of the cell and a reference plane. The topology-oriented technique is developed from digital topology theories to handle more general conditions. The requirement for interfacial mesh refinement can be detected swiftly, without the need of thickness information, equation solving, variable averaging or mesh repairing. The mesh refinement level increases smoothly on demand in thin regions. The schemes have been verified and validated against several benchmark cases to demonstrate their effectiveness and robustness. These include the dynamics of colliding droplets, droplet motions in a microchannel, and atomization of liquid impinging jets. Overall, the thickness-based refinement technique provides highly adaptive meshes for problems with thin regions in an efficient and fully automatic manner.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

FUN3D Mesh Adaptation Simulations of 4th AIAA High-Lift Prediction Workshop Case 1a

This paper describes in detail the FUN3D Mesh adaptation simulation results for Case 1a of the 4th AIAA High-Lift Prediction Workshop (HLPW-4). The Stabilized Finite Element library with FUN3D is used along with the Negative Spalart-Allmaras One-Equation Model to simulate fully turbulent free-air flow around the High Lift version of the Common Research Model at three flap settings. Meshes are adapted using multi-scale and goal-oriented metrics. The results are presented and the discussion focuses on the predicted differences between the three flap settings. Coefficients of lift, drag, and pitching moment are predicted within 7% of values measured in the QinetiQ 5m Wind Tunnel at each flap setting. Predicted surface pressures and skin friction distributions show inconsistent discrepancies with measurements across the flap settings. Consequently, flap increments for these figures of merit are not well predicted. These predictions are consistent with submissions to the HLPW-4 from other RANS-SA methods. Visualizations of Liutex vortex cores colored by angular velocity are presented as possible new quantitative and qualitative perspective for solution evaluation.

High-Lift Prediction Workshop↗

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

GR-Athena++: Puncture Evolutions on Vertex-centered Oct-tree Adaptive Mesh Refinement

Numerical relativity is central to the investigation of astrophysical sources in the dynamical and strong-field gravity regime, such as binary black hole and neutron star coalescences. Current challenges set by gravitational-wave and multimessenger astronomy call for highly performant and scalable codes on modern massively parallel architectures. We present GR-Athena++, a general-relativistic, high-order, vertex-centered solver that extends the oct-tree, adaptive mesh refinement capabilities of the astrophysical (radiation) magnetohydrodynamics code Athena++. To simulate dynamical spacetimes, GR-Athena++ uses the Z4c evolution scheme of numerical relativity coupled to the moving puncture gauge. We demonstrate stable and accurate binary black hole merger evolutions via extensive convergence testing, cross-code validation, and verification against state-of-the-art effective-one-body waveforms. GR-Athena++ leverages the task-based parallelism paradigm of Athena++ to achieve excellent scalability. We measure strong-scaling efficiencies above 95% for up to ~1.2 × 10 4 CPUs and excellent weak scaling is shown up to ~10 5 CPUs in a production binary black hole setup with adaptive mesh refinement. GR-Athena++ thus allows for the robust simulation of compact binary coalescences and offers a viable path toward numerical relativity at exascale.

79 ASTRONOMY AND ASTROPHYSICS↗