Search NASA⌕ Search

SEARCH · Search NASA

Results for “curved meshes”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Local element operations for curved simplex meshes

Summary Mesh optimization procedures are generally a combination of node smoothing and discrete operations which affect a small number of elements to improve the quality of the overall mesh. These procedures are useful as a post‐processing step in mesh generation procedures and in applications such as fluid simulations with severely deforming domains. In order to perform high‐order mesh optimization, these ingredients must also be extended to high‐order (curved) meshes. In this work, we present a method to perform local element operations on curved meshes. The mesh operations discussed in this work are edge/face swaps, edge collapses, and edge splitting (more generally refinement) for triangular and tetrahedral meshes. These local operations are performed by first identifying the patch of elements which contain the edge/face being acted on, performing the operation as a “straight‐sided one" by placing the high‐order nodes via an isoparametric mapping from the master element, and smoothing the high‐order nodes on the elements in the patch by minimizing a Jacobian‐based high‐order mesh distortion measure. Since the initial “straight‐sided guess” from the placement of the nodes via the isoparametric mapping frequently results in invalid elements, the distortion measure must be regularized which allows for mesh untangling for the optimization to succeed. We present several examples in 2D and 3D to demonstrate these local operations and how they can be combined with a high‐order node smoothing procedure to maintain mesh quality when faced with severe deformations.

Shi, A.↗
DOE OSTI2023

A family of independent Variable Eddington Factor methods with efficient preconditioned iterative solvers

We present a family of discretizations for the Variable Eddington Factor (VEF) equations that have high-order accuracy on curved meshes and efficient preconditioned iterative solvers. The VEF discretizations are combined with the Discontinuous Galerkin transport discretization from to form effective high-order, linear transport methods. The VEF discretizations are derived by extending the unified analysis of Discontinuous Galerkin methods for elliptic problems presented by Arnold et al. to the VEF equations. This framework is used to define analogs of the interior penalty, second method of Bassi and Rebay, minimal dissipation local Discontinuous Galerkin, and continuous finite element methods. The analysis of subspace correction preconditioners, which use a continuous operator to iteratively precondition the discontinuous discretization, is extended to the case of the non-symmetric VEF system. Numerical results demonstrate that the VEF discretizations have arbitrary-order accuracy on curved meshes, preserve the thick diffusion limit, and are effective on a proxy problem from thermal radiative transfer in both outer transport iterations and inner preconditioned linear solver iterations. We demonstrate that the VEF solution converges to the S N transport solution as the mesh is refined on both problems with smooth and non-smooth behavior in angle. Parallel performance studies show that the interior penalty VEF discretization's linear solve weak scales out to 1024 processors and strong scales well on a single node. Particular attention is paid to the parallel performance of the VEF algorithm when used in combination with a parallel block Jacobi transport sweep.

97 MATHEMATICS AND COMPUTING↗
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↗
DOE OSTI2025

A method for bounding high-order finite element functions: Applications to mesh validity and bounds-preserving limiters

We introduce a novel method for bounding high-order multi-dimensional polynomials in finite element approximations. The method involves precomputing optimal piecewise-linear bounding boxes for polynomial basis functions, which can then be used to locally bound any combination of these basis functions. This approach can be applied to any element/basis type at any approximation order, can provide local (i.e., subcell) extremum bounds to a desired level of accuracy, and can be evaluated efficiently on-the-fly in simulations. Furthermore, we show that this approach generally yields more accurate bounds in comparison to traditional methods based on convex hull properties (e.g., Bernstein polynomials). Furthermore, the efficacy of this technique is shown in applications such as mesh validity checks and optimization for high-order curved meshes, where positivity of the element Jacobian determinant can be ensured throughout the entire element, and continuously bounds-preserving limiters for hyperbolic systems, which can enforce maximum principle bounds across the entire solution polynomial.

Bounding box↗
NASA NTRS2003

Revisiting the Least-squares Procedure for Gradient Reconstruction on Unstructured Meshes

The accuracy of the least-squares technique for gradient reconstruction on unstructured meshes is examined. While least-squares techniques produce accurate results on arbitrary isotropic unstructured meshes, serious difficulties exist for highly stretched meshes in the presence of surface curvature. In these situations, gradients are typically under-estimated by up to an order of magnitude. For vertex-based discretizations on triangular and quadrilateral meshes, and cell-centered discretizations on quadrilateral meshes, accuracy can be recovered using an inverse distance weighting in the least-squares construction. For cell-centered discretizations on triangles, both the unweighted and weighted least-squares constructions fail to provide suitable gradient estimates for highly stretched curved meshes. Good overall flow solution accuracy can be retained in spite of poor gradient estimates, due to the presence of flow alignment in exactly the same regions where the poor gradient accuracy is observed. However, the use of entropy fixes has the potential for generating large but subtle discretization errors.

Mavriplis, Dimitri J.↗
DOE OSTI2022

HLPW-4/GMGW-3: High Order Discretization Technology Focus Group Workshop Summary

This paper summarizes the High-Order Technical Focus Group (HO-TFG) submissions for the joint 4th AIAA High Lift Prediction and 3rd Geometry and Mesh Generation Workshop. The goal of the workshop was to assess the state-of-the-art in mesh generation and computational fluid dynamics software. The Common Research Model High-Lift (CRM-HL) variant served as the primary focus of the workshop, and a 2D airfoil section from the CRM-HL was used as a verification test case. The HO-TFG was tasked with generating high-order curved meshes for both geometries, and computing high-order solutions using both Reynolds Averaged Navier-Stokes and scale resolving formulations. While limited by computational resources, the final results demonstrate the potential of higher-order methods to increase solution accuracy with a lower degree of freedom count relative to second-order discretizations.

Galbraith, Marshall C.↗
DOE OSTI2023

HLPW-4/GMGW-3: High-Order Discretization Technology Focus Group Workshop Summary

This paper summarizes the High-Order Technical Focus Group (HO-TFG) submissions for the joint 4th AIAA High Lift Prediction (HLPW-4) and 3rd Geometry and Mesh Generation Workshop (GMGW-3). The goal of the workshop was to assess the state-of-the-art in mesh generation and computational fluid dynamics software. The Common Research Model High-Lift (CRM-HL) variant served as the primary focus of the workshop, and a two-dimensional airfoil section from the CRM-HL was used as a verification test case. Here, the HO-TFG was tasked with generating high-order curved meshes for both geometries, and computing high-order solutions using both Reynolds-averaged Navier–Stokes and scale-resolving formulations. While limited by computational resources, the final results demonstrate the potential of higher-order methods to increase solution accuracy with a lower degree-of-freedom count relative to second-order discretizations.

42 ENGINEERING↗
DOE OSTI2020

Massively parallel transport sweeps on meshes with cyclic dependencies

When solving the first-order form of the linear Boltzmann equation, a common misconception is that the matrix-free computational method of “sweeping the mesh”, used in conjunction with the Discrete Ordinates method, is too complex or does not scale well enough to be implemented in modern high performance computing codes. This has led to considerable efforts in the development of matrix-based methods that are computationally expensive and is partly driven by the requirements placed on modern spatial discretizations. In particular, modern transport codes are required to support higher order elements, a concept that invariably adds a lot of complexity to sweeps because of the introduction of cyclic dependencies with curved mesh cells. In this article we will present a comprehensive implementation of sweeping, to a piecewise-linear DFEM spatial discretization with particular focus on handling cyclic dependencies and possible extensions to higher order spatial discretizations. We find that these methods are implemented in a new C++ simulation framework called Chi-Tech (). We present some typical simulation results with some performance aspects that one can expect during real world simulations, we also present a scaling study to >100k processes where Chi-Tech maintains greater than 80% efficiency solving a total of 87.7 trillion angular flux unknowns for a 116 group simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

A matrix-free hyperviscosity formulation for high-order ALE hydrodynamics

The numerical approximation of compressible hydrodynamics is at the core of high-energy density (HED) multiphysics simulations as shocks are the driving force in experiments like inertial confinement fusion (ICF). In this work, we describe our extension of the hyperviscosity technique, originally developed for shock treatment in finite difference simulations, for use in arbitrarily high-order finite element methods for Lagrangian hydrodynamics. Hyperviscosity enables shock capturing while preserving the high-order properties of the underlying discretization away from the shock region. Specifically, we compute a high-order term based on a product of the mesh length scale to a high power scaled by a hyper-Laplacian operator applied to a scalar field. We then form the total artificial viscosity by taking a non-linear blend of this term and a traditional artificial viscosity term. We also present a matrix-free formulation for computing the finite element based hyper-Laplacian operator. Such matrix-free methods have superior performance characteristics compared to traditional full matrix assembly approaches and offer advantages for GPU based HPC hardware. We demonstrate the numerical convergence of our method and its application to complex, multi-material ALE simulations on high-order (curved) meshes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Mascon distribution techniques for asteroids and comets

The mass-concentration model is an approach that has been used to model the gravitational fields of irregularly shaped bodies such as asteroids and comets. By this approach, the body is treated as a collection of point masses. The method is conceptually simple, easy to program, valid down to the surface, and capable of modeling arbitrary density heterogeneities. How the mass concentrations are distributed as well as how mass is assigned to these concentrations is, however, nontrivial. These aspects significantly affect the accuracy and efficiency of the gravitational model. In this paper, we frame the distribution process in terms of numerical integration applied to finite volume meshes. We describe a new method using unstructured, curvilinear, finite volume meshes to significantly improve the accuracy of the mass-concentration model. We then compare the accuracy and efficiency of several variations of our distribution technique to those from literature using Asteroid Eros and Bennu as example bodies. Our results show that the mascon model can be as accurate as the analytic polyhedral model at the surface using an equivalent number of computational elements—i.e., mascon to surface facets. We report the improvement in the model’s performance can be mainly attributed to the volume mesh topology while mesh curving can provide modest case-dependent improvements.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

Conservative and Accurate Solution Transfer Between High-Order and Low-Order Refined Finite Element Spaces

Here, in this paper, we introduce general transfer operators between high-order and low-order refined finite element spaces that can be used to couple high-order and low-order simulations. Under natural restrictions on the low-order refined space we prove that both the high-to-low-order and low-to-high-order linear mappings are conservative, constant preserving, and high-order accurate. While the proof holds for affine geometries, numerical experiments indicate that the results hold for more general curved meshes. We present several numerical results confirming our analysis and demonstrate the utility of the new mappings in the context of adaptive mesh refinement and conservative multidiscretization coupling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Science & Technology Review: The Road to Exascale Computing

At Lawrence Livermore National Laboratory, we focus on science and technology research to ensure our nation’s security. We also apply that expertise to solve other important national problems in energy, bioscience, and the environment. Science & Technology Review is published eight times a year to communicate, to a broad audience, the Laboratory’s scientific and technological accomplishments in fulfilling its primary missions. The publication’s goal is to help readers understand these accomplishments and appreciate their value to the individual citizen, the nation, and the world. The Department of Energy’s Exascale Computing Project (ECP) and Lawrence Livermore’s RADIUSS (Rapid Application Development via an Institutional Universal Software Stack) initiative benefit from strategically developed software tools. The front cover shows a simulation of advection under twisting rotation that uses high-order finite elements from Livermore’s Modular Finite Element Methods (MFEM) software library and GLVis visualization tool. On the back cover, the logo (also created with GLVis) for the MFEM project illustrates the curved mesh and sub-element resolution used in high-order simulations. MFEM and GLVis are key components of the ECP’s co-design Center for Efficient Exascale Discretizations (CEED) and RADIUSS. MFEM is also part of ECP’s Extreme-Scale Scientific Software Development Kit (xSDK).

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2019

Efficient Entropy Stable Gauss Collocation Methods

The construction of high-order entropy stable collocation schemes on quadrilateral and hexahedral elements has relied on the use of Gauss-Legendre-Lobatto collocation points and their equivalence with summation-by-parts (SBP) finite difference operators. In this work, we show how to efficiently generalize the construction of semidiscrete, entropy stable schemes on tensor product elements to Gauss points and generalized SBP operators. Numerical experiments suggest 8 that the use of Gauss points significantly improves accuracy on curved meshes.

Jesse Chan↗
NASA NTRS1982

Surface contour of a biaxially strained, doubly curved antenna reflective mesh

The elastic membrane equations which describe the deflection of a biaxially tensioned reflective mesh from an idealized surface were developed and solved. The conditions of equilibrium of the forces acting on a membrane element furnish equations which may be used to solve a variety of problems. Configurations considered include continuous, as well as incremental mesh attachment to structural members to form shapes which are approximately parabolic or spherical.

Saylor, A. V.↗
DOE OSTI2023

Local Decomposition of Hexahedral Singular Nodes into Singular Curves

Hexahedral (hex) meshing is a long studied topic in geometry processing with many challenging associated problems. Hex meshes vary from structured to unstructured depending on application or domain of interest. Fully structured meshes require that all interior mesh edges be adjacent to four hexes each. Edges failing this criteria are singular and indicate an unstructured hex mesh. Singular edges join together into singular curves that either form closed cycles, end on the mesh boundary, or end at a singular node, a complex junction of more than two singular curves. Hex meshes with more complex singular nodes tend to have more distorted elements and smaller scaled Jacobian values. In this work, we study the topology of singular nodes. We show that all eight of the most common singular nodes are decomposable into just singular curves. We further show that all singular nodes, regardless of edge valence, are locally decomposable. Finally we demonstrate these decompositions on hex meshes, thereby decreasing their distortion and converting all singular nodes into singular curves. In conclusion, with this decomposition, the enigmatic complexity of 3D singular nodes becomes effectively 2D.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

Examination of the Circle Spline Routine

The Circle Spline routine is currently being used for generating both two and three dimensional spline curves. It was developed for use in ESCHER, a mesh generating routine written to provide a computationally simple and efficient method for building meshes along curved surfaces. Circle Spline is a parametric linear blending spline. Because many computerized machining operations involve circular shapes, the Circle Spline is well suited for both the design and manufacturing processes and shows promise as an alternative to the spline methods currently supported by the Initial Graphics Specification (IGES).

Dolin, R. M.↗
DOE OSTI2022

Accelerating high-order mesh optimization using finite element partial assembly on GPUs

In this paper we present a new GPU-oriented mesh optimization method based on high order finite elements. Our approach relies on node movement with fixed topology, through the Target-Matrix Optimization Paradigm (TMOP) and uses a global nonlinear solve over the whole computational mesh, i.e., all mesh nodes are moved together. A key property of the method is that the mesh optimization process is recast in terms of finite element operations, which allows us to utilize recent advances in the field of GPU-accelerated high order finite element algorithms. For example, we reduce data motion by using tensor factorization and matrix-free methods, which have superior performance characteristics compared to traditional full finite element matrix assembly and offer advantages for GPU based HPC hardware. Furthermore, we describe the major mathematical components of the method along with their efficient GPU-oriented implementation. In addition, we propose an easily reproducible mesh optimization test that can serve as a performance benchmark for the mesh optimization community.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Spectral Mesh-Free Quadrature for Planar Regions Bounded by Rational Parametric Curves

This article presents spectral, mesh-free, Green’s theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region’s boundary curves corresponding to Green’s theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green’s theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of multi-material simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time. We provide an open-source implementation of the algorithm in MATLAB.

97 MATHEMATICS AND COMPUTING↗