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.

SourceResearch connectionFrom yearThrough year

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

At least 55 records · Page 3

All sources NASA NTRS DOE OSTI

NASA NTRS1996

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗

DOE OSTI2021

Gravitation and Mesh Adaption

The Gravitation and Mesh Adaptation (GaMA) toolbox consists of a set of Matlab classes for modeling the environment around asteroids and comets. A variety of gravitational models and supporting algorithms from are consolidated alongside a custom meshing utility tailored for the application. This allows the user to work within a single streamlined environment to import and manipulate surface definitions, probe the dynamical environment, integrate trajectories, and post-process results. For other applications, modified surface meshes can be exported. Gravity Models: 1) Werner's analytic polyhedron model 2) Mascon model 3) Gottlieb's spherical harmonic model 4) Approximate polyhedron models 5) Curvilinear surface models 6) Custom composite models Meshing Features: 1) Array-based half-edge data structure 2) Supports curvilinear surface definitions up to degree 4 3) Ray-tracing 4) Coarsening 5) Feature-based refinement 6) Projection 7) Smoothing 8) Mesh quality validity tests 9) Mesh repair Additional Features: 1) Solar radiation pressure model 2) Distant 3rd body model 3) Collision detection 4) Trajectory integration and post-processing 5) Visualization of surface fields

Pearl, Jason↗

DOE OSTI2020

Variable-fidelity multipoint aerodynamic shape optimization with output-based adapted meshes

This work presents a method to control the discretization error in multipoint aerodynamic shape optimization using output-based adapted meshes. The meshes are adapted via adjoint-based error estimates, taking into account both the objective and constraint output errors. A multi-fidelity optimization framework is then developed by taking advantage of the variable fidelity offered by adaptive meshes. The objective functional and its sensitivity at each design point (operating condition) are first evaluated on the same initial coarse mesh, which is then subsequently adapted for each design point individually as the shape optimization proceeds. The effort to set up the optimization is minimal since the initial mesh can be fairly coarse and easy to generate. As the shape approaches the optimal design, the mesh at each design point becomes finer, in regions necessary for that particular operating condition. The multi-fidelity framework is tightly coupled with the objective error estimation to ensure the optimization accuracy at each fidelity. Computational savings arise from a reduction of the mesh size when the design is far from optimal and avoiding an exhaustive search on low-fidelity meshes. The proposed method is demonstrated on multipoint drag minimization problems of a transonic airfoil with lift and area constraints. Improved accuracy and efficiency are shown compared to traditional fixed-fidelity optimization with a fixed computational mesh.

42 ENGINEERING↗

NASA NTRS1989

Zonal multigrid solution of compressible flow problems on unstructured and adaptive meshes

The simultaneous use of adaptive meshing techniques with a multigrid strategy for solving the 2-D Euler equations in the context of unstructured meshes is studied. To obtain optimal efficiency, methods capable of computing locally improved solutions without recourse to global recalculations are pursued. A method for locally refining an existing unstructured mesh, without regenerating a new global mesh is employed, and the domain is automatically partitioned into refined and unrefined regions. Two multigrid strategies are developed. In the first, time-stepping is performed on a global fine mesh covering the entire domain, and convergence acceleration is achieved through the use of zonal coarse grid accelerator meshes, which lie under the adaptively refined regions of the global fine mesh. Both schemes are shown to produce similar convergence rates to each other, and also with respect to a previously developed global multigrid algorithm, which performs time-stepping throughout the entire domain, on each mesh level. However, the present schemes exhibit higher computational efficiency due to the smaller number of operations on each level.

Mavriplis, Dimitri J.↗

DOE OSTI2018

The adaptive mesh method based on HOC difference scheme for convection diffusion equations with boundary layers

In this paper, an adaptive mesh method is proposed to generate orthogonal nonuniform mesh for 2D rectangular computational domain. The algorithm adopts the dimension split idea which redistribute the mesh on each direction sequently. This approach efficiently decreases the difficultly of algorithm and enables the adapted mesh to be orthogonal. The adaptive mesh method can redistribute the mesh based on the solution without specifying the location of the boundary layer or the grid distribution function to generate the nonuniform mesh in advance. To verify the effectiveness and robustness of the algorithm, the presented method combined with the HOC difference scheme on nonuniform grid is used to solve the 1D and 2D convection diffusion problems with boundary layers. Besides, the multigrid method is used to accelerate the iterative convergence speed. The numerical solutions of adaptive mesh is more flexible than uniform or nonuniform grids methods if the location of the boundary layers is unknown in advance.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

Exploring Unstructured Mesh Adaptation for Hybrid Reynolds-Averaged Navier–Stokes/Large Eddy Simulation

Mesh adaptation methods for the Reynolds-averaged Navier–Stokes (RANS) equations are rapidly maturing and beginning to impact the design of aerospace vehicles. RANS turbulence modeling improvements have slowed and may stagnate. Wall-modeled large eddy simulation (LES) and hybrid RANS/LES (HRLES) may provide an improved modeling capability but require specialized expertise to construct appropriate meshes and are considered be too ex-pensive for routine practical use. The realization of the CFD Vision 2030 Study includes improving geometry linkage, mesh generation/adaptation, and turbulence modeling/resolving methods for automated management of errors and uncertainties of physics-based, predictive modeling that can set the stage for ensuring a vehicle is in compliance with a regulation or specification (i.e., certification or qualification by analysis). An exploration of mesh adaptation for HRLES is performed to document synergies and challenges between mesh adaptation and HRLES. Vortex breakdown over a delta wing is examined to show the improvement of HRLES over RANS turbulence modeling approaches. A high lift configuration is shown to demonstrate complex geometry capability. Research and development opportunities are identified to advocate for continuing investments that may allow HRLES to enter routine practical use as a tool for aerospace vehicle analysis and design.

Michael A Park↗

DOE OSTI2024

Scalable Implicit Solvers with Dynamic Mesh Adaptation for a Relativistic Drift-Kinetic Fokker–Planck–Boltzmann Model

In this work we consider a relativistic drift-kinetic model for runaway electrons along with a Fokker–Planck operator for small-angle Coulomb collisions, a radiation damping operator, and a secondary knock-on (Boltzmann) collision source. Here, we develop a new scalable fully implicit solver utilizing finite volume and conservative finite difference schemes and dynamic mesh adaptivity. A new data management framework in the PETSc library based on the p4est library is developed to enable simulations with dynamic adaptive mesh refinement (AMR), distributed memory parallelization, and dynamic load balancing of computational work. This framework and the runaway electron solver building on the framework are able to dynamically capture both bulk Maxwellian at the low-energy region and a runaway tail at the high-energy region. To effectively capture features via the AMR algorithm, a new AMR indicator prediction strategy is proposed that is performed alongside the implicit time evolution of the solution. This strategy is complemented by the introduction of computationally cheap feature-based AMR indicators that are analyzed theoretically. Numerical results quantify the advantages of the prediction strategy in better capturing features compared with nonpredictive strategies; and we demonstrate trade-offs regarding computational costs. The robustness with respect to model parameters, algorithmic scalability, and parallel scalability are demonstrated through several benchmark problems including manufactured solutions and solutions of different physics models. We focus on demonstrating the advantages of using implicit time stepping and AMR for runaway electron simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRSDate not supplied

Multiscale Mesh Adaptation for Transonic Aeroelastic Flutter Problems

This work applies multiscale mesh adaptation with refine to reduce spatial discretization error of aeroelastic computational fluid dynamics (CFD) simulations. Benchmark flutter models, such as the pitch and plunge NACA64A-010 airfoil and the benchmark supercritical wing, are studied with both a linearized frequency-domain solver and time-marching CFD coupled to a modal structural solver in FUN3D. The undeformed NASA Common Research Model (CRM), an aeroelastic jig shape variant of the CRM, is also studied with the linearized frequency-domain approach. For these cases, the adaptation process converges to comparable flutter predictions to hand-generated meshes but with smaller node counts. However the additional disciplines of the linearized frequency-domain analysis, the mesh deformation, and the unsteady finite-volume solver create robustness challenges that need to be addressed before it can be applied as a fully automated process for complex transonic aeroelastic problems. In particular, negative volumes are observed to be an issue for FUN3D’s linear elasticity mesh deformation solver when moving the adapted meshes.

Aeroelasticity↗

DOE OSTI2015

Advances in Patch-Based Adaptive Mesh Refinement Scalability

Patch-based structured adaptive mesh refinement (SAMR) is widely used for high-resolution simu- lations. Combined with modern supercomputers, it could provide simulations of unprecedented size and resolution. A persistent challenge for this com- bination has been managing dynamically adaptive meshes on more and more MPI tasks. The dis- tributed mesh management scheme in SAMRAI has made some progress SAMR scalability, but early al- gorithms still had trouble scaling past the regime of 105 MPI tasks. This work provides two critical SAMR regridding algorithms, which are integrated into that scheme to ensure efficiency of the whole. The clustering algorithm is an extension of the tile- clustering approach, making it more flexible and efficient in both clustering and parallelism. The partitioner is a new algorithm designed to prevent the network congestion experienced by its prede- cessor. We evaluated performance using weak- and strong-scaling benchmarks designed to be difficult for dynamic adaptivity. Results show good scaling on up to 1.5M cores and 2M MPI tasks. Detailed timing diagnostics suggest scaling would continue well past that.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

An Adaptive Mesh Algorithm: Mesh Structure and Generation

The purpose of Adaptive Mesh Refinement is to minimize spatial errors over the computational space not to minimize the number of computational elements. The additional result of the technique is that it may reduce the number of computational elements needed to retain a given level of spatial accuracy. Adaptive mesh refinement is a computational technique used to dynamically select, over a region of space, a set of computational elements designed to minimize spatial error in the computational model of a physical process. The fundamental idea is to increase the mesh resolution in regions where the physical variables are represented by a broad spectrum of modes in k-space, hence increasing the effective global spectral coverage of those physical variables. In addition, the selection of the spatially distributed elements is done dynamically by cyclically adjusting the mesh to follow the spectral evolution of the system. Over the years three types of AMR schemes have evolved; block, patch and locally refined AMR. In block and patch AMR logical blocks of various grid sizes are overlaid to span the physical space of interest, whereas in locally refined AMR no logical blocks are employed but locally nested mesh levels are used to span the physical space. The distinction between block and patch AMR is that in block AMR the original blocks refine and coarsen entirely in time, whereas in patch AMR the patches change location and zone size with time. The type of AMR described herein is a locally refi ned AMR. In the algorithm described, at any point in physical space only one zone exists at whatever level of mesh that is appropriate for that physical location. The dynamic creation of a locally refi ned computational mesh is made practical by a judicious selection of mesh rules. With these rules the mesh is evolved via a mesh potential designed to concentrate the nest mesh in regions where the physics is modally dense, and coarsen zones in regions where the physics is modally sparse.

97 MATHEMATICS AND COMPUTING↗

NASA NTRSDate not supplied

Verification of Anisotropic Mesh Adaptation for Complex Aerospace Applications

The stabilized finite element solver, FUN3D-SFE, along with the grid mechanics package refine are verified for aerospace applications of laminar and turbulent flow simulations. The current verification exercise represents an extension of previous research using FUN3D-SFEwith adjoint-based mesh adaptation to generate highly anisotropic adapted meshes for inviscid problems. Adaptations are performed using a solution-based approach that controls the Lpnorm of Mach number interpolation error and an adjoint-based approach that controls the error in some output functional. Adaptive results are shown for laminar subsonic flow over a delta wing, laminar subsonic flow over ONERA M6 wing, inviscid supersonic flow over a sonic boom test case, and a turbulent flow over a high lift configuration (JAXA Standard Model). Mesh convergence results are also compared with results from FUN3D-FV (Finite Volume) whenever available. For all test cases considered, FUN3D-SFE gives significantly better accurate results than FUN3D-FV on coarse meshes.

Aravind Balan↗

NASA NTRSDate not supplied

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↗

NASA NTRS1997

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↗

NASA NTRS1993

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

NASA NTRSDate not supplied

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↗

NASA NTRSDate not supplied

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↗

DOE OSTI2018

Adaptive Mesh Refinement in the Fastlane

Adaptive Mesh Refinement (AMR) allows us to dramatically reduce memory usage by dynamically distributing resources to areas of physical significance.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Adaptive mesh refinement for steady flows in Nek5000

Adaptive mesh refinement is performed in the framework of the spectral element method augmented by approaches to error estimation and control. The h-refinement technique is used for adapting the mesh, where selected grid elements are split by a quadtree (2D) or octree (3D) structure. Continuity between parent-child elements is enforced by high-order interpolation of the solution across the common faces. Parallel mesh partitioning and grid management respectively, are taken care of by the external libraries ParMETIS and p4est. Two methods are considered for estimating and controlling the error of the solution. The first error estimate is local and based on the spectral properties of the solution on each element. This method gives a local measure of the L-2-norm of the solution over the entire computational domain. The second error estimate uses the dual-weighted residuals method - it is based on and takes into account both the local properties of the solution and the global dependence of the error in the solution via an adjoint problem. The objective of this second approach is to optimize the computation of a given functional of physical interest. The simulations are performed by using the code Nek5000 and three steady-state test cases are studied: a two-dimensional lid-driven cavity at Re = 7, 500, a two-dimensional flow past a cylinder at Re = 40, and a three-dimensional lid-driven cavity at Re = 2,000 with a moving lid tilted by an angle of 30 degrees. Finally, the efficiency of both error estimators is compared in terms of refinement patterns and accuracy on the functional of interest. In the case of the adjoint error estimators, the trend on the error of the functional is shown to be correctly represented up to a multiplicative constant.

42 ENGINEERING↗