Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive meshes”

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 55 records · Page 3

A Framework for Mesh-Geometry Associativity during Mesh Adaptation

A framework has been developed for describing how a computational mesh is associated to the geometry model it discretizes. The target application of this framework is surface mesh adaptation in a CFD flow solver. The framework, called MeshLink, consists of two components. First, a schema has been defined for describing the one-to-many associativity of a surface mesh to the geometry model entities to which it is attached. Second, a high-level library provides a kernel-agnostic wrapper for providing the necessary geometry queries to an application (e.g., mesher, flow solver). Both the schema and library are provided freely and openly. MeshLink’s ability to support solution mesh adaptation on linear and curved meshes for a high-order flow solution is demonstrated on several test cases relevant to the aerospace and automotive industries.

mesh adaptation↗

Tetrahedral and Hexahedral Mesh Adaptation for CFD Problems

This paper presents two unstructured mesh adaptation schemes for problems in computational fluid dynamics. The procedures allow localized grid refinement and coarsening to efficiently capture aerodynamic flow features of interest. The first procedure is for purely tetrahedral grids; unfortunately, repeated anisotropic adaptation may significantly deteriorate the quality of the mesh. Hexahedral elements, on the other hand, can be subdivided anisotropically without mesh quality problems. Furthermore, hexahedral meshes yield more accurate solutions than their tetrahedral counterparts for the same number of edges. Both the tetrahedral and hexahedral mesh adaptation procedures use edge-based data structures that facilitate efficient subdivision by allowing individual edges to be marked for refinement or coarsening. However, for hexahedral adaptation, pyramids, prisms, and tetrahedra are used as buffer elements between refined and unrefined regions to eliminate hanging vertices. Computational results indicate that the hexahedral adaptation procedure is a viable alternative to adaptive tetrahedral schemes.

Biswas, Rupak↗

Adaptive-mesh algorithms for computational fluid dynamics

The basic goal of adaptive-mesh algorithms is to distribute computational resources wisely by increasing the resolution of 'important' regions of the flow and decreasing the resolution of regions that are less important. While this goal is one that is worthwhile, implementing schemes that have this degree of sophistication remains more of an art than a science. In this paper, the basic pieces of adaptive-mesh algorithms are described and some of the possible ways to implement them are discussed and compared. These basic pieces are the data structure to be used, the generation of an initial mesh, the criterion to be used to adapt the mesh to the solution, and the flow-solver algorithm on the resulting mesh. Each of these is discussed, with particular emphasis on methods suitable for the computation of compressible flows.

Powell, Kenneth G.↗

HLPW-4/GMGW-3: Mesh Adaptation for RANS Technology Focus Group Workshop Summary

The AIAA workshop series helps guide the Computational Fluid Dynamics (CFD) community through publicly available test cases and impartial evaluation to establish the state-of-the-art in applied CFD. A summary of the Mesh Adaptation Technical Focus Group submissions for the joint Fourth CFD High Lift Prediction and Third Geometry & Mesh Generation Workshop is provided. The Common Research Model High-Lift variant (CRM-HL) is the target of this investigation. A 2D high-lift airfoil solution verification case was extracted from the 3D CRM-HL. Low variation is shown between 2D solutions with mesh adaptation to control estimated solution interpolation and output errors. As expected, variation for these mesh adaptation techniques is larger for the 3D CRM-HL than the 2D airfoil. More importantly, the 3D mesh adapted results have a lower variation than expert-crafted meshes of equal or larger size. Suspected multiple solutions to Reynolds-averaged Navier-Stokes with the Spalart-Allmaras turbulence model appear to resolve into a common solution with mesh resolution.

HLPW-4↗

Angle-of-Attack Sweep with Mesh Adaptation for High-Lift Configurations

This paper reports an angle-of-attack (alpha) sweep study with mesh adaptation for the high-lift configuration - JAXA Standard Model (JSM) from the 3rd AIAA High-Lift Prediction Workshop. The method of angle-of-attack (alpha) continuation, where the flow-field at a certain angle of attack is initialized from the solution obtained at the previous angle of attack, is applied to adapted unstructured meshes. Since the meshes are continuously adapted, flow-field initialization on a particular mesh for a certain angle is done through linear interpolation of the solution from the previous mesh. Interpolated initial conditions usually prevent massively separated solutions that may otherwise occur with impulsive initial conditions. Alpha continuations are done in both forward (increasing alpha) and reverse (decreasing alpha) directions, resulting in the formation of hysteresis loops. Skin frictions are compared with the wind-tunnel oil flow images and pressure coefficients are compared with the wind-tunnel values, at selected angles of attack. Final paper will include results also for the high-lift version of the Common Research Model (CRM-HL) from the 4th AIAA High-Lift Prediction Workshop. A thorough comparison of the results will also be made with the available wind-tunnel data.

Mesh Adaptation↗

Enabling Metric-Based Mesh Adaptation for Advanced Compressible Flow Simulations Using US3D

This work presents a metric-based mesh adaptation capability added to the flow solver US3D that is used to improve the accuracy of atmospheric entry simulations. Flow past an entry vehicle in free-flight is usually unsteady and characterized by anisotropic flow features like a strong bow shock and small-scale isotropic flow features like turbulent eddies in the wake. The results presented in this paper demonstrate that we are currently able to iteratively apply metric-based mesh adaptation to improve the solution accuracy by simultaneously targeting isotropic and anisotropic flow features. A simplified workflow of running CFD simulations for entry vehicles is presented where we start off with a coarse initial mesh to compute a first approximation of the flow. This coarse mesh is then iteratively refined using the newly developed metric to improve the resolution of the CFD computation. Furthermore, we demonstrate that we are able to adapt large mesh sizes in a timely fashion which allows us to start thinking about applying this adaptive framework to unsteady atmospheric entry CFD simulations.

Mesh adaptation↗

$χ$-$MeRA$: Computationally efficient adaptive mesh refinement of Monte Carlo mesh based tallies

Here, the reactor physics community is always focused on reducing the computational time and memory required for simulations. $χ$-$MeRA$, which stands for flux-based-($χ$)-Mesh tally Refinement Adaptively, was built to reduce the computational time and memory required to solve the neutronics side of a multiphysics problem when compared to traditional methods for mesh based tallies in Monte Carlo (MC) simulations. $χ$-$MeRA$ couples a MC code with an adaptive mesh refinement (AMR) algorithm to take advantage of the accuracy of a MC code and the efficiency of an AMR algorithm. Also developed within $χ$-$MeRA$ was a set of metrics to assess the effects of the refinement on various parameters in the simulation space. For a plutonium sphere, $χ$-$MeRA$ shows a reduction in memory usage and computation time when compared to a fully refined mesh by a factor of 14.7 and 6.7, respectively. When compared to an unstructured mesh, improvement of 1.3 and 4.8 was achieved for memory usage and computation time. The development of $χ$-$MeRA$ helps solve the neutronics side of a multiphysics problem in a faster, more computationally efficient manner than traditional methods, and the final mesh created contains accurate results that can be passed onto the next physics code.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Near-Body Mesh Adaption for Transitional Flows Using OVERFLOW

Accurate modeling of boundary-layer transition is an important aspect of developing greener air transport technologies. In that regard, transition models based on auxiliary transport equations offer a robust approach that is easily integrated into the Reynolds-averaged Navier-Stokes (RANS) solvers. Recent workshops under NATO and AIAA have identified the verification of transport-equations-based transition modeling as a critical aspect of reducing the scatter between the predictions of different CFD codes. Follow-on work has highlighted the need for highly dense grids to achieve an asymptotic convergence of transition related flow metrics. The present work examines the role of automatic near-body mesh adaptation capability in the NASA OVERFLOW CFD solver to enable verification studies in an efficient manner, and for establishing best practices for designing grids for the RANS-based transition models. A sensor function relevant to the Langtry-Menter \gamma-Re_{\theta t}\ transition model has been identified and used for error-based mesh adaptation for canonical configurations comprising a flat plate, and the S809 and NLR-7301 airfoils. The efficacy of the mesh adaptation approach is assessed for flow conditions involving multiple transition scenarios such as natural transition, separation-induced transition, and shock-induced transition. The results from this exploratory study indicate that the meshes adapted using the proposed sensor provide solutions that approach the references solutions obtained with uniformly refined hand-crafted meshes, in terms of the chosen metrics, and yield modest yet significant savings in grid count. We also highlight areas for improvement in the grid adaptation methodology within OVERFLOW.

CFD↗

Near-Body Mesh Adaption for Transitional Flows Using OVERFLOW

Accurate modeling of boundary-layer transition is an important aspect of developing greener air transport technologies. In that regard, transition models based on auxiliary transport equations offer a robust approach that is easily integrated into the Reynolds-averaged Navier-Stokes (RANS) solvers. Recent workshops under NATO and AIAA have identified the verification of transport-equations-based transition modeling as a critical aspect of reducing the scatter between the predictions of different CFD codes. Follow-on work has highlighted the need for highly dense grids to achieve an asymptotic convergence of transition related flow metrics. The present work examines the role of automatic near-body mesh adaptation capability in the NASA OVERFLOW CFD solver to enable verification studies in an efficient manner, and for establishing best practices for designing grids for the RANS-based transition models. A sensor function relevant to the Langtry-Menter \gamma-Re_{\theta t}\ transition model has been identified and used for error-based mesh adaptation for canonical configurations comprising a flat plate, and the S809 and NLR-7301 airfoils. The efficacy of the mesh adaptation approach is assessed for flow conditions involving multiple transition scenarios such as natural transition, separation-induced transition, and shock-induced transition. The results from this exploratory study indicate that the meshes adapted using the proposed sensor provide solutions that approach the references solutions obtained with uniformly refined hand-crafted meshes, in terms of the chosen metrics, and yield modest yet significant savings in grid count. We also highlight areas for improvement in the grid adaptation methodology within OVERFLOW.

CFD↗

A parallel adaptive mesh refinement algorithm

Over recent years, Adaptive Mesh Refinement (AMR) algorithms which dynamically match the local resolution of the computational grid to the numerical solution being sought have emerged as powerful tools for solving problems that contain disparate length and time scales. In particular, several workers have demonstrated the effectiveness of employing an adaptive, block-structured hierarchical grid system for simulations of complex shock wave phenomena. Unfortunately, from the parallel algorithm developer's viewpoint, this class of scheme is quite involved; these schemes cannot be distilled down to a small kernel upon which various parallelizing strategies may be tested. However, because of their block-structured nature such schemes are inherently parallel, so all is not lost. In this paper we describe the method by which Quirk's AMR algorithm has been parallelized. This method is built upon just a few simple message passing routines and so it may be implemented across a broad class of MIMD machines. Moreover, the method of parallelization is such that the original serial code is left virtually intact, and so we are left with just a single product to support. The importance of this fact should not be underestimated given the size and complexity of the original algorithm.

Quirk, James 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.↗

The Alamo multiphysics solver for phase field simulations with strong-form mechanics and block structured adaptive mesh refinement

Alamo is a high-performance scientific code that uses block-structured adaptive mesh refinement to solve such problems as: the ignition and burn of solid rocket propellant, plasticity, damage and fracture in materials undergoing loading, and the interaction of compressible flow with eroding solid materials. Alamo is powered by AMReX, and provides a set of unique methods, models, and algorithms that enable it to solve solid-mechanics problems (coupled to other physical behavior such as fluid flow or thermal diffusion) using the power of block-structured adaptive mesh refinement.

36 MATERIALS SCIENCE↗

PARAMESH: A Parallel Adaptive Mesh Refinement Community Toolkit

In this paper, we describe a community toolkit which is designed to provide parallel support with adaptive mesh capability for a large and important class of computational models, those using structured, logically cartesian meshes. The package of Fortran 90 subroutines, called PARAMESH, is designed to provide an application developer with an easy route to extend an existing serial code which uses a logically cartesian structured mesh into a parallel code with adaptive mesh refinement. Alternatively, in its simplest use, and with minimal effort, it can operate as a domain decomposition tool for users who want to parallelize their serial codes, but who do not wish to use adaptivity. The package can provide them with an incremental evolutionary path for their code, converting it first to uniformly refined parallel code, and then later if they so desire, adding adaptivity.

MacNeice, Peter↗

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↗

Parallel Tetrahedral Mesh Adaptation with Dynamic Load Balancing

The ability to dynamically adapt an unstructured grid is a powerful tool for efficiently solving computational problems with evolving physical features. In this paper, we report on our experience parallelizing an edge-based adaptation scheme, called 3D_TAG. using message passing. Results show excellent speedup when a realistic helicopter rotor mesh is randomly refined. However. performance deteriorates when the mesh is refined using a solution-based error indicator since mesh adaptation for practical problems occurs in a localized region., creating a severe load imbalance. To address this problem, we have developed PLUM, a global dynamic load balancing framework for adaptive numerical computations. Even though PLUM primarily balances processor workloads for the solution phase, it reduces the load imbalance problem within mesh adaptation by repartitioning the mesh after targeting edges for refinement but before the actual subdivision. This dramatically improves the performance of parallel 3D_TAG since refinement occurs in a more load balanced fashion. We also present optimal and heuristic algorithms that, when applied to the default mapping of a parallel repartitioner, significantly reduce the data redistribution overhead. Finally, portability is examined by comparing performance on three state-of-the-art parallel machines.

Oliker, Leonid↗