Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Mesh”

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 127 records · Page 7

Tangle-Free Mesh Motion for Ablation Simulations

Problems involving mesh motion-which should not be mistakenly associated with moving mesh methods, a class of adaptive mesh redistribution techniques-are of critical importance in numerical simulations of the thermal response of melting and ablative materials. Ablation is the process by which material vaporizes or otherwise erodes due to strong heating. Accurate modeling of such materials is of the utmost importance in design of passive thermal protection systems ("heatshields") for spacecraft, the layer of the vehicle that ensures survival of crew and craft during re-entry. In an explicit mesh motion approach, a complete thermal solve is first performed. Afterwards, the thermal response is used to determine surface recession rates. These values are then used to generate boundary conditions for an a posteriori correction designed to update the location of the mesh nodes. Most often, linear elastic or biharmonic equations are used to model this material response, traditionally in a finite element framework so that complex geometries can be simulated. A simple scheme for moving the boundary nodes involves receding along the surface normals. However, for all but the simplest problem geometries, evolution in time following such a scheme will eventually bring the mesh to intersect and "tangle" with itself, inducing failure. This presentation demonstrates a comprehensive and sophisticated scheme that analyzes the local geometry of each node with help from user-provided clues to eliminate the tangle and enable simulations on a wide-class of difficult problem geometries. The method developed is demonstrated for linear elastic equations but is general enough that it may be adapted to other modeling equations. The presentation will explicate the inner workings of the tangle-free mesh motion algorithm for both two and three-dimensional meshes. It will show abstract examples of the method's success, including a verification problem that demonstrates its accuracy and correctness. The focus of the presentation will be on the algorithm; specifics on how the techniques may be used in spacecraft design will be not discussed.

Droba, Justin↗

Tangle-Free Finite Element Mesh Motion for Ablation Problems

In numerical simulations involving boundaries that evolve in time, the primary challenge is updating the computational mesh to reflect the physical changes in the domain. In particular, the fundamental objective for any such \mesh motion" scheme is to maintain mesh quality and suppress unphysical geometric anamolies and artifacts. External to a physical process of interest, mesh motion is an added component that determines the specifics of how to move the mesh given certain limited information from the main system. This paper develops a set of boundary conditions designed to eliminate tangling and internal collision within the context of PDE-based mesh motion (linear elasticity). These boundary conditions are developed for two- and three-dimensional meshes. The paper presents detailed algorithms for commonly occuring topological scenarios and explains how to apply them appropriately. Notably, the techniques discussed herein make use of none of the specifics of any particular formulation of mesh motion and thus are more broadly applicable. The two-dimensional algorithms are validated by an extensive verification procedure. Finally, many examples of diverse geometries in both two- and three-dimensions are shown to showcase the capabilities of the tangle-free boundary conditions.

Droba, Justin↗

Tetrahedral-Mesh Simulations of Shock-Turbulence Interaction

Despite decades of development of unstructured mesh methods, direct numerical simulations (DNS) of turbulent flows are still predominantly performed on structured or unstructured hexahedral meshes with high-order finite-difference methods, weighted essentially nonoscillatory (WENO) schemes, or hybrid schemes formed by their combinations. Tetrahedral meshes offer easy mesh generation and adaptation around complex geometries and the potential of an orientation-free grid that would benefit the isotropic nature of small-scale dissipation, as well as the solution accuracy of intermediate scales. To advance the state of the art of unstructured-mesh simulation capabilities for shock/turbulence interaction, DNS using pure tetrahedral meshes are carried out with the space-time conservation element, solution element (CESE) method in this research. By its design, the CESE method is constructed based on a non-dissipative scheme and is a genuinely multidimensional numerical framework that is free from the use of an approximate Riemann-solver. The numerical framework also provides the ability to add numerical dissipation (the nondissipative scheme acts as the reference state like that of the reversible state in thermodynamics) when needed (with justification from mathematics/physics). The above-mentioned features along with the CESE method's consistent shock-capturing approach and strong enforcement of flux conservation in spacetime offers a novel method to accurately simulate turbulent flows and their interaction with shocks using tetrahedral meshes. Two canonical problems, namely, isotropic turbulence interaction with a normal shock and a Mach 2.9 turbulent boundary layer flow over a 24deg compression corner are investigated in this study. Computational results show reasonably good agreement with experimental data and results from structured-mesh, high-order simulations available in the literature. Successful validation of these canonical problems demonstrated here paves the way for future high-fidelity supersonic flow simulations involving complex-geometries.

Venkatachari, Balaji Shankar↗

Robust Metric-Aligned Quad-Dominant Meshing Using L(sub p) Centroidal Voronoi Tessellation

We introduce a meshing algorithm that can be used to both generate and adapt meshes for bounded domains in an anisotropic manner. This is particularly beneficial when anisotropic flow features like shock waves or contact discontinuities are present in the computational domain. The algorithm presented in this paper is based upon meshing under the imposed Riemannian metric tensor, which controls the orientation and size of the mesh elements. In this way there is no need for user intervention to recognize these features. We demonstrate that the method indeed aligns the elements with the underlying metric and produces right-angled simplices that can be recombined into quadrilateral elements. The aim is to eventually incorporate this meshing strategy in the monolithic high-order spectral element solver that is currently being developed at NASA Ames. This paper has two main contributions: First, we demonstrate that we can generate quad-dominant metric-aligned meshes for bounded domains using a generalized form of L(sub p)-Centroidal Voronoi Tessellation (L(sub p)-CVT). Unlike previous works, we do not rely on a background mesh and discretize the bounded domain in a hierarchical way by first discretizing the boundaries and then the volume using the underlying metric. Second, we present an alternative for clipping the Voronoi cells on the boundary, which is common practice in CVT-based meshing algorithms, by reconstructing the Voronoi cells using the defined metric field. In this way we avoid the geometrical complexity of the clipping procedure and we show that we evaluate the energy and its gradient correctly. We show that the reconstruction of the computational domain is consistent with the Lloyds’ algorithm that is used to compute the L(sub p)-CVT.

Centroidal↗

MPAS - Ocean Simulation Quality for Variable-Resolution North American Coastal Meshes

Climate model components utilizing unstructured meshes enable variableresolution, regionally enhanced simulations within global domains. Here we investigate the relationship between mesh quality and simulation statistics using the JIGSAW unstructured meshing library and the Model for Prediction Across ScalesOcean (MPASOcean) with a focus on Gulf Stream dynamics. In the base configuration, the refined region employs 8 km cells that extend 400 km from the coast of North America. This coastal refined region is embedded within a lowresolution global domain, with cell size varying latitudinally between 30 and 60 km. The resolution transition region between the refined region and background mesh is 600 km wide. Three sensitivity tests are conducted: 1) the quality of meshes is intentionally degraded so that horizontal cells are progressively more distorted; 2) the transition region from high to low resolution is steepened; and 3) resolution of the coastal refinement region is varied from 30 km to 8 km. Overall, the ocean simulations are shown to be robust to mesh resolution and quality alterations. Meshes that are substantially degraded still produce realistic currents, with Southern Ocean transports within 0.4% and Gulf Stream transports within 12% of highquality mesh results. The narrowest transition case of 100 km did not produce any spurious effects. Refined regions with high resolution produce eddy kinetic energy and sea surface height variability that are similar to the highresolution reference simulation. These results provide heuristics for the design criteria of variableresolution climate model domains.

Hoch, Kristin E.↗

Anisotropic Goal-Based Mesh Adaptation Metric Clarification and Development

Adaptive unstructured mesh techniques have a limited, but growing impact on production analysis workflows to control discretization error for reliable simulation results. Multiple independent implementations of flow solvers, anisotropic metric construction methods, and anisotropic mesh adaptation mechanics have matured. Goal-based metrics target estimated error in output functions, such as lift and drag, through the guidance of an adjoint solution. A unification of goal-based anisotropic metrics is presented for steady viscous flows, which is an active area of research. These goal-based metrics drive robust and efficient anisotropic mesh adaptation for the calculation of output functions. The super-convergent functional output error behavior of stabilized finite-element methods is exploited without a formal proof, and evidence of super-convergence is shown in numerical experiments. Mesh adapted drag and lift outputs for two simple bodies in compressible viscous flow show convergence of error to less than a single drag count. Asymptotic behavior established for relatively coarse meshes shows the efficiency of this goal-based metric when compared to solution interpolation error control and expert-guided meshing. Anisotropic mesh adaptation techniques are applied to a transport aircraft in a high-lift configuration where variation between approaches decreases with mesh refinement, but asymptotic behavior is not observed with available resources.

goal-based↗

Prelude to Simulation Diagnostics in MOOSE: Diagnosing Meshes

As finite element simulations increase in complexity, so does the need for high quality meshes. Without proper diagnostics, issues pertaining to poor mesh quality or improper mesh construction may go undetected, causing simulations to fail unexpectedly. This paper details the new mesh diagnostic system available in MOOSE, which provides users with the tools to inspect mesh quality for both externally and internally generated meshes. This system can detect issues arising from element volume size, non-conformal elements, intersecting edges, missing sidesets, as well as other common mesh issues. As meshes increase in size and complexity, such issues become more difficult to diagnose through visual inspection alone.

99 - GENERAL AND MISCELLANEOUS↗

High-Order Mesh Morphing for Boundary and Interface Fitting to Implicit Geometries

Here, we propose a method that morphs high-order meshes such that their boundaries and interfaces coincide/align with implicitly defined geometries. Our focus is particularly on the case when the target surface is prescribed as the zero isocontour of a smooth discrete function. Common examples of this scenario include using level set functions to represent material interfaces in multimaterial configurations, and evolving geometries in shape and topology optimization. The proposed method formulates the mesh optimization problem as a variational minimization of the sum of a chosen mesh-quality metric using the Target-Matrix Optimization Paradigm (TMOP) and a penalty term that weakly forces the selected faces of the mesh to align with the target surface. The distinct features of the method are use of a source mesh to represent the level set function with sufficient accuracy, and adaptive strategies for setting the penalization weight and selecting the faces of the mesh to be fit to the target isocontour of the level set field. We demonstrate that the proposed method is robust for generating boundary- and interface-fitted meshes for curvilinear domains using different element types in 2D and 3D.

97 MATHEMATICS AND COMPUTING↗

Coupling LaGrit unstructured mesh generation and model setup with TOUGH2 flow and transport: A case study

Furthermore, there are many applications in science and engineering modeling where an accurate representation of a complex model geometry in the form of a mesh is important. In applications of flow and transport in subsurface porous media, this is manifest in models that must capture complex geologic stratigraphy, structure (faults, folds, erosion, deposition) and infrastructure (tunnels, boreholes, excavations). Model setup, defined as the activities of geometry definition, mesh generation (creation, optimization, modification, refine, de-refine, smooth), assigning material properties, initial conditions and boundary conditions requires specialized software tools to automate and streamline the process. In addition, some model setup tools will provide more utility if they are designed to interface with and meet the needs of a particular flow and transport software suite. A control volume discretization that uses a two point flux approximation is for example most accurate when the underlying control volumes are 2D or 3D Voronoi tessellations. In this paper we will present the coupling of LaGriT, a mesh generation and model setup software suite and TOUGH2 to model subsurface flow problems and we show an example of how LaGriT can be used as a model setup tool for the generation of a Voronoi mesh for the simulation program TOUGH2. To generate the MESH file for TOUGH2 from the LaGriT output a standalone module Lagrit2Tough2 was developed, which is presented here and will be included in a future release of LaGriT. Here in this paper an alternative method to generate a Voronoi mesh for TOUGH2 with LaGriT is presented and thanks to the modular and command based structure of LaGriT this method is well suited to generating a mesh for complex models.

58 GEOSCIENCES↗

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗

Intersection-distribution-based remapping between arbitrary meshes for staggered multi-material arbitrary Lagrangian-Eulerian hydrodynamics

In this paper, we present a new intersection-distribution-based remapping method between arbitrary polygonal meshes for indirect staggered multi-material arbitrary Lagrangian-Eulerian hydrodynamics. All cell-centered material quantities are conservatively remapped using intersections between the Lagrangian (old, source) mesh and the rezoned (new, target) mesh. The new nodal masses are obtained by conservative distribution of all material masses in each new cell to the cell's corners and then collecting those corner masses at new nodes. This distribution is done using a local constrained optimization approach for each cell in the new mesh. In order to remap nodal momentum we first define cell-centered momentum for each cell in the old mesh, conservatively remap this to the new mesh and then conservatively distribute the new zonal momentum to each cell's bounding nodes, again using local constrained optimization. Our method also conserves total energy by applying a new nodal kinetic energy correction that relies on a process similar to that used for remapping nodal mass and momentum. Cell-centered kinetic energy is computed, conservatively remapped and then distributed to nodes. The discrepancy between this conservatively remapped and actual nodal kinetic energy is then conservatively distributed to the internal energies of the materials in the cells surrounding each node. Unlike conventional cell-based corrections of this type, this new nodal kinetic energy correction has not been observed to drive material internal energy negative in any of our testing. Unlike flux based remapping, our new intersection-distribution method can be applied to remapping between source and target meshes that are arbitrarily different, which provides superior flexibility in the rezoning strategy. Our method is accurate, essentially conservative and essentially bounds preserving.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A method for generating moving, orthogonal, area preserving polygonal meshes

A new method for generating locally orthogonal polygonal meshes from a set of generator points is presented in which polygon areas are a constraint. The area constraint property is particularly useful for particle methods where moving polygons track a discrete portion of material. Because Voronoi polygon meshes have some very attractive mathematical and numerical properties for numerical computation, a generalization of Voronoi polygon meshes was formulated that enforces a polygon area constraint. Area constrained moving polygonal meshes allow one to develop hybrid particle-mesh numerical methods that display some of the most attractive features of each approach. It is shown that this mesh construction method can continuously reconnect a moving, unstructured polygonal mesh in a pseudo-Lagrangian fashion without change in cell area/volume, and the method's ability to simulate various physical scenarios is shown. Overall, the advantages are identified for incompressible fluid flow calculations, with demonstration cases that include material discontinuities of all three phases of matter and large density jumps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Implementation of a Mesh refinement algorithm into the quasi-static PIC code QuickPIC

Plasma-based acceleration (PBA) has emerged as a promising candidate for the accelerator technology used to build a future linear collider and/or an advanced light source. In PBA, a trailing or witness particle beam is accelerated in the plasma wave wakefield (WF) created by a laser or particle beam driver. The WF is often nonlinear and involves the crossing of plasma particle trajectories in real space and thus particle-in-cell methods are used. The distance over which the drive beam evolves is several orders of magnitude larger than the wake wavelength. This large disparity in length scales is amenable to the quasi-static approach. Three-dimensional (3D), quasi-static (QS), particle-in-cell (PIC) codes, e.g., QuickPIC, have been shown to provide high fidelity simulation capability with 2-4 orders of magnitude speedup over 3D fully explicit PIC codes. In PBA, the witness beam needs to be matched to the focusing forces of the WF to reduce the emittance growth. In some linear collider designs, the matched spot size of the witness beam can be 2 to 3 orders of magnitude smaller than the spot size (and wavelength) of the wakefield. Such an additional disparity in length scales is ideal for mesh refinement where the WF within the witness beam is described on a finer mesh than the rest of the WF. A mesh refinement scheme is described that has been implemented into the 3D QS PIC code, QuickPIC. Very fine (high) resolution is used in a small spatial region that includes the witness beam and progressively coarser resolutions in the rest of the simulation domain. A fast multigrid Poisson solver has been implemented for the field solve on the refined meshes and a Fast Fourier Transform (FFT) based Poisson solver is used for the coarse mesh. The code has been parallelized with both MPI and OpenMP, and the parallel scalability has also been improved by using pipelining. A preliminary adaptive mesh refinement technique is described to optimize the computational time for simulations with an evolving witness beam size. Several test problems are used to verify that the mesh refinement algorithm provides accurate results. Additionally, the results are benchmarked against highly resolved simulations exhibiting near-azimuthal symmetry, performed using QPAD—a novel hybrid QS PIC code that uses a PIC description in the coordinates (r, ct – z) and a gridless description in the azimuthal angle, Φ.

Linear collider↗

Investigation of oxygen evolution reaction with Ni foam and stainless-steel mesh electrodes in alkaline seawater electrolysis

We report alkaline seawater electrolysis is a promising method for hydrogen production; however, little progress has been made in investigating the substrates for oxygen evolution reaction (OER) electrocatalysts. Ni foam and stainless-steel mesh (SS mesh) were investigated systematically for OER in alkaline seawater electrolysis in this work. The overpotentials and Tafel slopes with SS meshes are smaller than Ni foams, and it also exhibits excellent stability. Interestingly, the performance of the SS mesh even outperforms various non-noble metal electrocatalysts and is comparable to commercial RuO2 and IrO2. The corrosion conditions of Ni foam and SS mesh electrodes were studied and revealed. Furthermore, the electrochemically active surface area (ECSA) of Ni foam is 12 times higher than SS mesh in the same geometric area, indicating the electrochemical activity of SS mesh is much superior to Ni foam. This work expands on promising substrates for alkaline seawater electrolysis, with cost and performance advantages.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Mesh objective stochastic simulations of quasibrittle fracture

Continuum finite element (FE) modeling of damage and failure of quasibrittle structures suffers from the spurious mesh sensitivity due to strain localization. Here this issue has been addressed for deterministic analysis through the development of localization limiters. Here this study proposes a mechanism-based model to mitigate the mesh sensitivity in stochastic FE simulations of quasibrittle fracture. The interest is placed on the analysis of large-size structures, where the mesh size is conveniently chosen to be larger than the width of the fracture process zone as well as the correlation length of the random fields of constitutive properties. The present model is formulated within the framework of continuum damage mechanics. Two localization parameters are introduced to describe the evolution of the damage pattern of each finite element. These parameters are used to guide the energy regularization of the constitutive law, as well as to formulate the mesh-dependent probability distributions of constitutive properties. Depending on the prevailing damage pattern, different energy regularization schemes and mesh dependence of the probability distribution functions are used in the constitutive law. The model is applied to simulate the stochastic failure behavior of quasibrittle structures of different geometries featuring different failure processes including damage initiation, localization, and propagation. It is shown that using fixed probability distribution functions of constitutive properties could lead to strong mesh dependence of the prediction of the mean and variance of the structural load capacity. The probability distribution functions of constitutive properties must be linked to the damage pattern, which may evolve during the failure process. Such a mechanism-based modeling of the probability distributions of constitutive properties is essential for mitigating the spurious mesh sensitivity in stochastic FE analysis of quasibrittle fracture.

42 ENGINEERING↗

The Influence of Adaptive Mesh Refinement on the Prediction of Vortex Interactions about a Generic Missile Airframe

The complex interaction of forebody and wing vortices significantly impacts missile aerodynamics. The formation of these vortices involves smooth regions of the geometry or geometric discontinuities like leading edges, trailing edges, tips, and corners. Regions of supersonic flow and complex shock topologies interact with boundary layers and vortices. Smooth-body separation and 3D viscous effects strain current Reynolds-averaged Navier-Stokes (RANS) techniques. The quantification and control of discretization error is critical to obtaining reliable simulation results and often turbulence model assessments are made in the presence of unquantified (and potentially large) discretization errors. Two mesh adaptation schemes are applied to steady RANS simulations. Multiscale unstructured mesh adaptation is applied to control interpolation error estimates of the Mach field, which resolves boundary layers, vortices, and shocks. A dual-mesh approach with overset communication is applied between an expert-crafted near-body unstructured mesh and an adaptive off-body Cartesian mesh refined with Q-criterion scaled by the strain tensor magnitude. A generic missile configuration is examined in a supersonic flow field to show the interaction of mesh adaptation and turbulence model. Turbulence model modifications for rotational correction and a quadratic constitutive relationship show a strong influence on adaptive mesh refinement and predicted rolling moment.

slender body aerodynamics↗

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↗

An Approach to Quad Meshing Based On Cross Valued Maps and the Ginzburg-Landau Theory

A generalization of vector fields, referred to as N-direction fields or cross fields when N=4, has been recently introduced and studied for geometry processing, with applications in quadrilateral (quad) meshing, texture mapping, and parameterization. We make the observation that cross field design for two-dimensional quad meshing is related to the well-known Ginzburg-Landau problem from mathematical physics. This identification yields a variety of theoretical tools for efficiently computing boundary-aligned quad meshes, with provable guarantees on the resulting mesh, for example, the number of mesh defects and bounds on the defect locations. The procedure for generating the quad mesh is to (i) find a complex-valued "representation" field that minimizes the Dirichlet energy subject to a boundary constraint, (ii) convert the representation field into a boundary-aligned, smooth cross field, (iii) use separatrices of the cross field to partition the domain into four sided regions, and (iv) mesh each of these four-sided regions using standard techniques. Under certain assumptions on the geometry of the domain, we prove that this procedure can be used to produce a cross field whose separatrices partition the domain into four sided regions. To solve the energy minimization problem for the representation field, we use an extension of the Merriman-Bence-Osher (MBO) threshold dynamics method, originally conceived as an algorithm to simulate motion by mean curvature, to minimize the Ginzburg-Landau energy for the optimal representation field. Lastly, we demonstrate the method on a variety of test domains.

Computational Geometry↗