Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mesh Adaptation”

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 199 records · Page 11

Exploring Discretization Error in Simulation-Based Aerodynamic Databases

This work examines the level of discretization error in simulation-based aerodynamic databases and introduces strategies for error control. Simulations are performed using a parallel, multi-level Euler solver on embedded-boundary Cartesian meshes. Discretization errors in user-selected outputs are estimated using the method of adjoint-weighted residuals and we use adaptive mesh refinement to reduce these errors to specified tolerances. Using this framework, we examine the behavior of discretization error throughout a token database computed for a NACA 0012 airfoil consisting of 120 cases. We compare the cost and accuracy of two approaches for aerodynamic database generation. In the first approach, mesh adaptation is used to compute all cases in the database to a prescribed level of accuracy. The second approach conducts all simulations using the same computational mesh without adaptation. We quantitatively assess the error landscape and computational costs in both databases. This investigation highlights sensitivities of the database under a variety of conditions. The presence of transonic shocks or the stiffness in the governing equations near the incompressible limit are shown to dramatically increase discretization error requiring additional mesh resolution to control. Results show that such pathologies lead to error levels that vary by over factor of 40 when using a fixed mesh throughout the database. Alternatively, controlling this sensitivity through mesh adaptation leads to mesh sizes which span two orders of magnitude. We propose strategies to minimize simulation cost in sensitive regions and discuss the role of error-estimation in database quality.

Aftosmis, Michael J.↗

Application of unstructured grid methods to steady and unsteady aerodynamic problems

The purpose is to describe the development of unstructured grid methods which have several advantages when compared to methods which make use of structured grids. Unstructured grids, for example, easily allow the treatment of complex geometries, allow for general mesh movement for realistic motions and structural deformations of complete aircraft configurations which is important for aeroelastic analysis, and enable adaptive mesh refinement to more accurately resolve the physics of the flow. Steady Euler calculations for a supersonic fighter configuration to demonstrate the complex geometry capability; unsteady Euler calculations for the supersonic fighter undergoing harmonic oscillations in a complete-vehicle bending mode to demonstrate the general mesh movement capability; and vortex-dominated conical-flow calculations for highly-swept delta wings to demonstrate the adaptive mesh refinement capability are discussed. The basic solution algorithm is a multi-stage Runge-Kutta time-stepping scheme with a finite-volume spatial discretization based on an unstructured grid of triangles in 2D or tetrahedra in 3D. The moving mesh capability is a general procedure which models each edge of each triangle (2D) or tetrahedra (3D) with a spring. The resulting static equilibrium equations which result from a summation of forces are then used to move the mesh to allow it to continuously conform to the instantaneous position or shape of the aircraft. The adaptive mesh refinement procedure enriches the unstructured mesh locally to more accurately resolve the vortical flow features. These capabilities are described in detail along with representative results which demonstrate several advantages of unstructured grid methods. The applicability of the unstructured grid methodology to steady and unsteady aerodynamic problems and directions for future work are discussed.

Batina, John T.↗

Solution adaptivity using a triangular mesh

Solution adaptivity is discussed first from a general perspective and then from the specific viewpoint of triangular meshes. The use of a general connectivity triangular mesh is emphasized. The development of monitor surfaces and their geometric properties is discussed. Mesh point movement is addressed, as is the dynamic restructuring of the connectivity pattern among moving modes. Changes in the number of mesh nodes to obtain suitable refinement for a physical simulation is examined, and the use of locally regular structures to offset the data structure limitation of a general connectivity triangular mesh and thus to obtain an enhanced range of application is considered. To illustrate the basic features of the adaptive triangular mesh strategy, an application to the study of plasma equilibrium is briefly considered.

Eiseman, P. R.↗

Parallel Implementation of an Adaptive Scheme for 3D Unstructured Grids on the SP2

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.OX speedup on 64 processors when 10% of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

Oliker, Leonid↗

PruningAMR

PruningAMR is an algorithm that reads in data stored as a neural network and outputs an adaptive mesh with values of the neural network stored at its vertices. Examples of input data include implicit neural representations (INRs) and physics-informed neural networks (PINNs). The output mesh is a grid-based adaptive mesh with larger elements for regions in which the neural network has coarse-scale variation and smaller elements for regions with fine scale variation. The goal of the software is to discretize the neural network to a mesh that faithfully captures the details encoded in the data without resorting a fine scale mesh.

Zvonek, JenniferE [Lawrence Livermore National Lab↗

Parallel implementation of an adaptive scheme for 3D unstructured grids on the SP2

Dynamic mesh adaption on unstructured grids is a powerful tool for computing unsteady flows that require local grid modifications to efficiently resolve solution features. For this work, we consider an edge-based adaption scheme that has shown good single-processor performance on the C90. We report on our experience parallelizing this code for the SP2. Results show a 47.0X speedup on 64 processors when 10 percent of the mesh is randomly refined. Performance deteriorates to 7.7X when the same number of edges are refined in a highly-localized region. This is because almost all the mesh adaption is confined to a single processor. However, this problem can be remedied by repartitioning the mesh immediately after targeting edges for refinement but before the actual adaption takes place. With this change, the speedup improves dramatically to 43.6X.

Strawn, Roger C.↗

Auto-adaptive finite element meshes

Accurate capturing of discontinuities within compressible flow computations is achieved by coupling a suitable solver with an automatic adaptive mesh algorithm for unstructured triangular meshes. The mesh adaptation procedures developed rely on non-hierarchical dynamical local refinement/derefinement techniques, which hence enable structural optimization as well as geometrical optimization. The methods described are applied for a number of the ICASE test cases are particularly interesting for unsteady flow simulations.

Richter, Roland↗

A New Approach to Parallel Dynamic Partitioning for Adaptive Unstructured Meshes

Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory results, e.g., excessive data migration among processors. Furthermore, special attention should be paid to their amenability to parallelization. In this paper, a novel parallel method for the dynamic partitioning of adaptive unstructured meshes is described. It is based on a linear representation of the mesh using self-avoiding walks.

Heber, Gerd↗

Unstructured mesh algorithms for aerodynamic calculations

The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined.

Mavriplis, D. J.↗

Unstructured mesh algorithms for aerodynamic calculations

The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined.

Mavriplis, D. J.↗

Finite element analysis of high speed compressible flows using mesh refinement/movement procedures

An adaptive mesh refinement procedure for analyzing high-speed inviscid and viscous compressible flows is described. The adaptation procedure which uses both quadrilateral and triangular elements is implemented with an explicit finite element formulation. Elements in regions of strong and weak gradients are refined or coarsened based on inviscid and viscous indicators. Nodal locations are also adaptively moved to better resolve flow features. The effectiveness of the finite element procedure is demonstrated by modeling flows with complex shock structure and viscous-inviscid interactions. Numerical results are compared with experimental data.

Ramakrishnan, R.↗

High-Order Mesh r-Adaptivity with Tangential Relaxation and Guaranteed Mesh Validity

High-order meshes are crucial for achieving optimal convergence rates in curvilinear domains, preserving symmetry, and aligning with key flow features in moving mesh simulations [1], but their quality is challenging to control. In prior work, we have developed techniques based on Target-Matrix Optimization Paradigm (TMOP) to adapt a given high-order mesh to the geometry and solution of the partial differential equation (PDE) [2, 3]. Here, we extend this framework to address two key gaps in the literature for highorder mesh 𝑟-adaptivity. First, we introduce tangential relaxation on curved surfaces using solely the discrete mesh representation, eliminating the need for access to underlying geometry (e.g., CAD model). Second, we ensure a continuously positive Jacobian determinant throughout the domain. This determinant positivity is essential for using the high-order mesh resulting from 𝑟-adaptivity with arbitrary quadrature schemes in simulations. The proposed approach is demonstrated to be robust using a variety of numerical experiments.

Mathematics and Computing↗

A hierarchical structure for automatic meshing and adaptive FEM analysis

A new algorithm for generating automatically, from solid models of mechanical parts, finite element meshes that are organized as spatially addressable quaternary trees (for 2-D work) or octal trees (for 3-D work) is discussed. Because such meshes are inherently hierarchical as well as spatially addressable, they permit efficient substructuring techniques to be used for both global analysis and incremental remeshing and reanalysis. The global and incremental techniques are summarized and some results from an experimental closed loop 2-D system in which meshing, analysis, error evaluation, and remeshing and reanalysis are done automatically and adaptively are presented. The implementation of 3-D work is briefly discussed.

Kela, Ajay↗

Simulation of a Mach 2 Jet in a Supersonic Retropropulsion Configuration

High-fidelity simulations of nozzle flows relevant to supersonic retropropulsion environments have been conducted using CRoCCo-AMR, a validated flow solver with curvilinear adaptive mesh refinement. The computational approach for simulating retropropulsion utilizing generalized curvilinear adaptive mesh refinement are discussed in detail. Initial results are presented for a single nozzle condition with comparison to available experimental data. Strong agreement is demonstrated in key regions of the flowfield. Mean and statistical analyses are performed to characterize unsteady, turbulence quantities present in the canonical retropropulsion environment. The findings herein suggest the presence of a dominant low-frequency mode that appears across the flowfield originating from the primary vortex cores where the freestream and retropropulsion jet interact.

retropropulsion↗

AMReX and pyAMReX: Looking beyond the exascale computing project

AMReX is a software framework for the development of block-structured mesh applications with adaptive mesh refinement (AMR). AMReX was initially developed and supported by the AMReX Co-Design Center as part of the U.S. DOE Exascale Computing Project (ECP), and is continuing to grow post-ECP. In addition to adding new functionality and performance improvements to the core AMReX framework, we have also developed a Python binding, pyAMReX, that provides a bridge between AMReX-based application codes and the data science ecosystem. pyAMReX provides zero-copy application GPU data access for AI/ML, in situ analysis and application coupling, and enables rapid, massively parallel prototyping. In this paper we review the overall functionality of AMReX and pyAMReX, focusing on new developments, new functionality, and optimizations of key operations. We also summarize capabilities of ECP projects that used AMReX and provide an overview of new, non-ECP applications.

Myers, Andrew↗

FRANC2D: A two-dimensional crack propagation simulator. Version 2.7: User's guide

FRANC 2D (FRacture ANalysis Code, 2 Dimensions) is a menu driven, interactive finite element computer code that performs fracture mechanics analyses of 2-D structures. The code has an automatic mesh generator for triangular and quadrilateral elements. FRANC2D calculates the stress intensity factor using linear elastic fracture mechanics and evaluates crack extension using several methods that may be selected by the user. The code features a mesh refinement and adaptive mesh generation capability that is automatically developed according to the predicted crack extension direction and length. The code also has unique features that permit the analysis of layered structure with load transfer through simulated mechanical fasteners or bonded joints. The code was written for UNIX workstations with X-windows graphics and may be executed on the following computers: DEC DecStation 3000 and 5000 series, IBM RS/6000 series, Hewlitt-Packard 9000/700 series, SUN Sparc stations, and most Silicon Graphics models.

Wawrzynek, Paul↗

CFD Modeling & Validation of Single Bubble Growth During Cavitation in Zero Gravity

Cryogenic Fluid Management (CFM) in zero gravity represents a vital area of research as NASA pursues future long-duration space missions. Success of these missions relies heavily on the ability to store and transfer the cryogenic liquid fuels efficiently and safely. In the Zero Boil-Off Tank (ZBOT-1) Experiment in 2018, unexpected and intense phase change occurred at the screened Liquid Acquisition Device (LAD) during tank pressure control that was later attributed to cavitation. The cavitation ultimately resulted in pump failure. Since cryogen cavitation during storage and transfer of propellants in microgravity has been a source of serious concern for the aerospace community, a series of drop tower experiments with liquid methane were also performed at the University of Bremen to carefully study cavitation from a single bubble nucleus in an engineered micron-sized wall cavity. As the test cell is depressurized during the 10-second drop, cavitation causes bubble growth from the nucleus. Here, in a collaboration between the Case Western Reserve University and University of Bremen, we present a two-phase Computational Fluid Dynamics (CFD) model of bubble growth from a single wall cavity during depressurization in microgravity. Both 2D axisymmetric and 3D parametric simulation case studies are performed to show the evolution of the bubble growth. The model uses a Volume of Fluid (VOF) approach with and without adaptive mesh refinement and adaptive time stepping to capture the growth dynamics using an explicit formulation with algebraic reconstruction of the interface. CFD results show good agreement with corresponding experiment. Based on the velocity, temperature, and volume fraction fields generated by the validation case studies, detailed discussion and analysis of fluid flow and heat transfer during bubble growth process are presented to delineate the intricacies of the cavitation process. Strengths and shortcomings of the present numerical approach in capturing this phenomenon are also highlighted.

Two Phase Flow↗

Finite element methods of analysis for 3D inviscid compressible flows

The applicants have developed a finite element based approach for the solution of three-dimensional compressible flows. The procedure enables flow solutions to be obtained on tetrahedral discretizations of computational domains of complex form. A further development was the incorporation of a solution adaptive mesh strategy in which the adaptivity is achieved by complete remeshing of the solution domain. During the previous year, the applicants were working with the Advanced Aerodynamics Concepts Branch at NASA Ames Research Center with an implementation of the basic meshing and solution procedure. The objective of the work to be performed over this twelve month period was the transfer of the adaptive mesh technology and also the undertaking of basic research into alternative flow algorithms for the Euler equations on unstructured meshes.

Peraire, Jaime↗