Search NASA⌕ Search

SEARCH · Search NASA

Results for “meshing”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

An open-source hybrid unstructured mesh - CAD fusion multiphysics analysis workflow in SALAMANDER

Plasma facing components in fusion devices will endure extreme neutron and heat fluxes. To facilitate their design using simulation tools, the open-source Fusion Module, Fusion ENergy Integrated multiphys-X (FENIX) framework is being developed to model these components with a high-fidelity multi-physics multi-dimensional approach. It can iteratively resolve couplings between all the physics at play, from neutron radiation, to thermomechanics, to near-wall plasma dynamics. This framework is based on the Multiphysics Object Oriented Simulation Environment (MOOSE), which is developed by a collaboration of US National Laboratories since 2008, for advanced nuclear, geomechanics simulations and other applications. FENIX couples numerous simulation tools, including OpenMC, the Tritium Migration Analysis Program v8, the NekRS CFD software, and most MOOSE modules. For the coupling of radiation transport and other physics, FENIX supports a hybrid workflow between Computer Assisted Design (CAD) and unstructured mesh geometries. The CAD can be generated from skinning the unstructured mesh, to enable a coarse geometry for efficient particle transport, but still resolving the local material compositions and temperature gradients. Neutron transport is performed using DAGMC on the CAD, and Cardinal, integrated in FENIX, maps tallied quantities, such as the heat deposition or the tritium generation rates, from a tally volumetric mesh to the other physics’ unstructured mesh. This coupling was exercised on a simplified tokamak geometry, coupling neutron transport with the heat conduction equation, and on a monoblock divertor problem, coupling additionally with tritium migration. Mesh convergence studies highlight the importance of the mapping conservativeness. Coupling with thermo-mechanics is further enabled by the generalization of the approach to moving meshes. The presentation will include these coupled analysis as well as an update on status of the FENIX framework.

70 - PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2017

Dynamic mesh adaptation for front evolution using discontinuous Galerkin based weighted condition number relaxation

A new mesh smoothing method designed to cluster cells near a dynamically evolving interface is presented. The method is based on weighted condition number mesh relaxation with the weight function computed from a level set representation of the interface. The weight function is expressed as a Taylor series based discontinuous Galerkin projection, which makes the computation of the derivatives of the weight function needed during the condition number optimization process a trivial matter. For cases when a level set is not available, a fast method for generating a low-order level set from discrete cell-centered fields, such as a volume fraction or index function, is provided. Results show that the low-order level set works equally well as the actual level set for mesh smoothing. Meshes generated for a number of interface geometries are presented, including cases with multiple level sets. Lastly, dynamic cases with moving interfaces show the new method is capable of maintaining a desired resolution near the interface with an acceptable number of relaxation iterations per time step, which demonstrates the method's potential to be used as a mesh relaxer for arbitrary Lagrangian Eulerian (ALE) methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Magnetic mesh generation and field line reconstruction for scrape-off layer and divertor modeling in stellarators

The design of divertor targets and baffles for optimal heat and particle exhaust from magnetically confined fusion plasmas requires a combination of fast, low-fidelity models (such as EMC3-Lite (Feng 2022 Plasma Phys. Control. Fusion 64 125012)) for scoping studies and high-fidelity ones (such as EMC3-EIRENE (Feng et al 2014 Contrib. Plasma Phys. 54 426–31)) for verification. Both of those approaches benefit from a magnetic flux tube mesh for fast interpolation and mapping of field line segments (Feng et al 2005 Phys. Plasmas 12 052505). A new automated mesh generator for unstructured quadrilateral flux tubes with adaptive refinement is presented and integrated into FLARE (Frerichs 2024 Nucl. Fusion 64 106034). For HSX with an extended first wall, it is found that several layers of flux tubes can span the entire half field period before splitting is required. This is an advantage over the traditional setup of the EMC3-EIRENE mesh where careful construction of several sub- domains is required already for the much tighter present first wall. In particular, there is no longer the need to manually construct a suitable outer boundary for the mesh. The divide and conquer paradigm with unstructured mesh layout offers a powerful alternative for fast head load approximation that is suitable for integration into optimization workflows. Further examples for W7-X and CTH demonstrate the versatile application range.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Nonconforming Mesh Refinement for High-Order Finite Elements

In this study, we propose a general algorithm for nonconforming adaptive mesh refinement (AMR) of unstructured meshes in high-order finite element codes. Our focus is on $h$-refinement with a fixed polynomial order. The algorithm handles triangular, quadrilateral, hexahedral, and prismatic meshes of arbitrarily high-order curvature, for any order finite element space in the de Rham sequence. We present a flexible data structure for meshes with hanging nodes and a general procedure to construct the conforming interpolation operator, both in serial and in parallel. The algorithm and data structure allow anisotropic refinement of tensor product elements in two and three dimensions and support unlimited refinement ratios of adjacent elements. We report numerical experiments verifying the correctness of the algorithms and perform a parallel scaling study to show that we can adapt meshes containing billions of elements and run efficiently on 393,000 parallel tasks. Finally, we illustrate the integration of dynamic AMR into a high-order Lagrangian hydrodynamics solver.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Overset meshing coupled with hybridizable discontinuous Galerkin finite elements

We introduce the use of hybridizable discontinuous Galerkin (HDG) finite element methods on overlapping (overset) meshes. Overset mesh methods are advantageous for solving problems on complex geometrical domains. We also combine geometric flexibility of overset methods with the advantages of HDG methods: arbitrarily high-order accuracy, reduced size of the global discrete problem, and the ability to solve elliptic, parabolic, and/or hyperbolic problems with a unified form of discretization. This approach to developing the ‘overset HDG’ method is to couple the global solution from one mesh to the local solution on the overset mesh. We present numerical examples for steady convection–diffusion and static elasticity problems. The examples demonstrate optimal order convergence in all primal fields for an arbitrary amount of overlap of the underlying meshes.

42 ENGINEERING↗
DOE OSTI2019

Circumventing mesh bias by r- and h-adaptive techniques for variational eigenfracture

This work introduces and compares mesh r- and h-adaptivity for the eigenfracture model originally proposed in Schmidt et al. (Multiscale Model Simul 7:1237–1266, 2009), Pandolfi and Ortiz (J Numer Methods Eng 92:694–714, 2012), with the goal of suppressing potential mesh bias due to the element deletion. In the r-adaptive approach, we compute the configurational force at each incremental step and move nodes near the crack tip parallel to the normalized configurational forces field such that the crack propagation direction can be captured more accurately within each incremental step. In the h-adapative approach, we introduce mesh refinement via a quad-tree algorithm to introduce more degrees of freedom within the nonlocal ϵ-neighborhood such that a more refined crack path can be reproduced with a higher mesh resolution. Our numerical examples indicate that the r-adaptive approach is able to replicate curved cracks and complex geometrical features, whereas the h-adaptive approach is advantageous in simulating sub-scale fracture when the nonlocal regions are smaller than the un-refined coarse mesh.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

eBits: Compact stream of mesh refinements for remote visualization

Here, we focus on applications where a remote client needs to visualize or process a complex, manifold triangle mesh, M , but only in a relatively small, user controlled, Region of Interest (RoI) at a time. The client first downloads a coarse base mesh , pre-computed on the server via a series of simplification passes on M , one per Level of Detail (LoD), each pass identifying an independent set of triangles, collapsing them, and, for each collapse, storing, in a Vertex Expansion Record (VER), the information needed to reverse the collapse. On each client initiated RoI modification request, the server pushes to the client a selected subset of these VERs, which, when decoded and applied to refine the mesh locally, ensure that the portion in the RoI is always at full resolution. The eBits approach proposed here offers state of the art compression ratios (using less than 2.5 bits per new full resolution RoI triangle when the RoI has more than 2000 vertices to transmit the connectivity for the selective refinements) and fine-grain control (allowing the user to adjust the RoI by small increments). The effectiveness of eBits results from several novel ideas and novel variations of previous solutions. We represent the VERs using persistent labels so that they can be applied in different orders within a given LoD. The server maintains a shadow copy of the client’s mesh. To avoid sending IDs identifying which vertices should be expanded, we either transmit, for each new vertex, a compact encoding of its death tag –the LoD at which it will be expanded if it lies in the Rol–or transmit vertex masks for the RoI and its neighboring vertices. We also propose a three-step simplification that reduces the overall transmission cost by increasing both the simplification effectiveness and the regularity of the valences in the resulting meshes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Variable resolution Poisson-disk sampling for meshing discrete fracture networks

Here, we present the near-Maximal Algorithm for Poisson-disk Sampling (nMAPS) to generate point distributions for variable resolution Delaunay triangular and tetrahedral meshes in two and three-dimensions, respectively. nMAPS consists of two principal stages. In the first stage, an initial point distribution is produced using a cell-based rejection algorithm. In the second stage, holes in the sample are detected using an efficient background grid and filled in to obtain a near-maximal covering. Extensive testing shows that nMAPS generates a variable resolution mesh in linear run time with the number of accepted points. We demonstrate nMAPS capabilities by meshing three-dimensional discrete fracture networks (DFN) and the surrounding volume. The discretized boundaries of the fractures, which are represented as planar polygons, are used as the seed of 2D-nMAPS to produce a conforming Delaunay triangulation. The combined mesh of the DFN is used as the seed for 3D-nMAPS, which produces conforming Delaunay tetrahedra surrounding the network. Under a set of conditions that naturally arise in maximal Poisson-disk samples and are satisfied by nMAPS, the two-dimensional Delaunay triangulations are guaranteed to only have well-behaved triangular faces. While nMAPS does not provide triangulation quality bounds in more than two dimensions, we found that low-quality tetrahedra in 3D are infrequent, can be readily detected and removed, and a high-quality balanced mesh is produced.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A configurational force for adaptive re-meshing of gradient-enhanced poromechanics problems with history-dependent variables

Here, we introduce a mesh-adaption framework that employs a multi-physical configurational force and Lie algebra to capture multiphysical responses of fluid-infiltrating geological materials while maintaining the efficiency of the computational models. To resolve sharp gradients of both displacement and pore pressure, we introduce an energy-estimate-free re-meshing criterion by extending the configurational force theory to consider the energy dissipation due to the fluid diffusion and the gradient-dependent plastic flow. To establish new equilibria after remeshing, the local tensorial history-dependent variables at the integration points are first decomposed into spectral forms. Then, the principal values and directions are projected onto smooth fields interpolated by the basis function of the finite element space via the Lie-algebra mapping. Our numerical results indicate that this Lie algebra operator in general leads to a new trial state closer to the equilibrium than the ones obtained from the tensor component mapping approach. A new configurational force for dissipative fluid-infiltrating porous materials that exhibit gradient-dependent plastic flow is introduced such that the remeshing may accommodate the need to resolve the sharp pressure gradient as well as the strain localization. The predicted responses are found to be not influenced by the mesh size due to the micromorphic regularization, while the adaptive meshing enables us to capture the width of deformation bands without the necessity of employing fine mesh everywhere in the domain.

42 ENGINEERING↗
DOE OSTI2025

Stable low diffusion flux splitting schemes on unstructured meshes

Shock instabilities are shown to manifest in modern low-diffusion flux-vector splitting (FVS) schemes when used on unstructured meshes, or situations where shocks do not align with the mesh lines. These instabilities occur irrespective of the Mach number of the shock. Three types of dissipative mechanisms that suppress these instabilities are presented. These mechanisms are carefully designed in order to affect only problematic regions of the flux-splittings. The AUSM + and LDFSS schemes are stabilized using the proposed modifications. It is shown that the added dissipation improves the shock behavior of AUSM and LDFSS on unstructured meshes. It is also shown that the AUSM + -up scheme is prone to the “carbuncle” instability, a specific type of shock instability, when used on unstructured meshes. The modifications proposed in this work do not lead to carbuncle instabilities for the problems considered here. Furthermore, the modified schemes are shown to satisfy certain properties that are crucial for accurate shear layer computations, such as stationary contact preservation. Using benchmark problems, it is demonstrated that despite the diffusion added for stabilization, these schemes are not overly diffusive. Furthermore, due to these advantages, the modified FVS schemes presented here are promising candidates for high-speed compressible flow computations on unstructured meshes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Volumetric analysis and mesh generation of real and artificial microstructural geometries

Producing a viable finite element mesh of realistic microstructural structural geometry is a critical step in analyzing the thermo-mechanical behavior of complex multi-material composites. Advancements in imaging technology such as micro computed tomography have allowed modelers to access high resolution mesoscale geometries for direct numerical simulation. However, converting from voxel based 3D images to usable finite element meshes has been challenging. A robust method including algorithms and software scripts for generating finite element meshes from 3D imaged microstructures is presented in this paper. It includes a routine for inserting cohesive elements around material interfaces to enable modeling of interface properties including delamination and damage. The algorithms and procedures presented in this method leverage currently available software packages for processing surface based geometry into volume based meshes. In addition to converting real geometry from physical imaging systems, algorithms for producing numerically generated and statistically equivalent microstructural geometry are also included. These artificial microstructures can be a valuable resource for modelers when physical specimens do not exist or are limited in quantity: Method establishes a workflow from voxel data to viable finite element mesh including interface information, and Includes a method for synthetic geometry generation based on metrics from real microstructures.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Adaptive and Unstructured Mesh Cleaving

We propose a new strategy for boundary conforming meshing that decouples the problem of building tetrahedra of proper size and shape from the problem of conforming to complex, nonmanifold boundaries. This approach is motivated by the observation that while several methods exist for adaptive tetrahedral meshing, they typically have difficulty at geometric boundaries. The proposed strategy avoids this conflict by extracting the boundary conforming constraint into a secondary step. We first build a background mesh having a desired set of tetrahedral properties, and then use a generalized stenciling method to divide, or “cleave”, these elements to get a set of conforming tetrahedra, while limiting the impacts cleaving has on element quality. In developing this new framework, we make several technical contributions including a new method for building graded tetrahedral meshes as well as a generalization of the isosurface stuffing and lattice cleaving algorithms to unstructured background meshes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Facilitating Staging-based Unstructured Mesh Processing to Support Hybrid In-Situ Workflows

In-situ and in-transit processing alleviate the gap between the computing and I/O capabilities by scheduling data analytics close to the data source. Hybrid in-situ processing splits data analytics into two stages: the data processing that runs in-situ aims to extract regions of interest, which are then transferred to staging services for further in-transit analytics. To facilitate this type of hybrid in-situ processing, the data staging service needs to support complex intermediate data representations generated/consumed by the in-situ tasks. Unstructured (or irregular) mesh is one such derived data representation that is typically used and bridges simulation data and analytics. However, how staging services efficiently support unstructured mesh transfer and processing remains to be explored. This paper investigates design options for transferring and processing unstructured mesh data using staging services. Using polygonal mesh data as an example, we show that hybrid in-situ workflows with staging-based unstructured mesh processing can effectively support hybrid in-situ workflows, and can significantly decrease data movement overheads.

data-driven↗
DOE OSTI2021

FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking

In this work, we present the Feature Tracking Kit (FTK), a framework that simplifies, scales, and delivers various feature-tracking algorithms for scientific data. The key of FTK is our simplicial spacetime meshing scheme that generalizes both regular and unstructured spatial meshes to spacetime while tessellating spacetime mesh elements into simplices. The benefits of using simplicial spacetime meshes include (1) reducing ambiguity cases for feature extraction and tracking, (2) simplifying the handling of degeneracies using symbolic perturbations, and (3) enabling scalable and parallel processing. The use of simplicial spacetime meshing simplifies and improves the implementation of several feature-tracking algorithms for critical points, quantum vortices, and isosurfaces. As a software framework, FTK provides end users with VTK/ParaView filters, Python bindings, a command line interface, and programming interfaces for feature-tracking applications. We demonstrate use cases as well as scalability studies through both synthetic data and scientific applications including tokamak, fluid dynamics, and superconductivity simulations. We also conduct end-to-end performance studies on the Summit supercomputer. FTK is open sourced under the MIT license: https://github.com/hguo/ftk.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

In-memory integration of existing software components for parallel adaptive unstructured mesh workflows

Unstructured mesh methods, like finite elements and finite volumes, support the effective analysis of complex physical behaviors modeled by partial differential equations over general threedimensional domains. The most reliable and efficient methods apply adaptive procedures with a-posteriori error estimators that indicate where and how the mesh is to be modified. Although adaptive meshes can have two to three orders of magnitude fewer elements than a more uniform mesh for the same level of accuracy, there are many complex simulations where the meshes required are so large that they can only be solved on massively parallel systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Extrusion of Complex Surface Meshes Utilizing Face Offsetting and Mean Curvature Smoothing

Grids for three-dimensional Computational Fluid Dynamics problems frequently require a prismatic layer of cells, typically extruded in the off-body direction from a two-dimensional surface mesh to properly resolve boundary layers. When the surface geometry is complex, the extrusion process can fail, resulting in the physical boundary layer being thicker than the prismatic layer, leading to under-resolved boundary layers. To address the shortcomings of existing grid generation tools, a new tool has been developed as part of the Mesh Tools suite, that is capable of extruding complex surface meshes. The new tool uses a face offsetting method to preserve surface curvature and a mean curvature smoothing algorithm to prevent the cells from self-intersecting in concave regions. Testing of the new tool found that not only were complex surface meshes able to be extruded to the desired thickness, but extrusion of simple surface meshes was also improved, due to the face offsetting method.

mesh extrusion↗
NASA NTRS2014

Wireless Mesh Networks for Small Satellites Subsystems

Wireless mesh networks are a network topology where all the nodes of a system are able to communicate with every other node in the network. This enables an adaptable network that is scalable and has the capability to self-repair and self-configure. The Modular Rapidly Manufactured Small Sat (MRMSS) Project is a small satellite project where we are developing a modular CubeSat architecture. One of the goals of the project is to develop a system that is quick and simple to integrate with a minimal amount of wiring involved. Wireless mesh networks are well suited for this configuration because of the self- configuring and self-repairing aspects of the network. This enables a satellite developer to add subsystem nodes to the network without the need for much hardware re-design. This paper will detail the background of wireless mesh networks, the advantages and limitations of using wireless mesh networks for space applications, and the technical progress of the wireless mesh network development of the MRMSS project.

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