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

Curved Mesh Correction And Adaptation Tool to Improve COMPASS Electromagnetic Analyses

SLAC performs large-scale simulations for the next-generation accelerator design using higher-order finite elements. This method requires using valid curved meshes and adaptive mesh refinement in complex 3D curved domains to achieve its fast rate of convergence. ITAPS has developed a procedure to address those mesh requirements to enable petascale electromagnetic accelerator simulations by SLAC. The results demonstrate that those correct valid curvilinear meshes can not only make the simulation more reliable but also improve computational efficiency up to 30%. This paper presents a procedure to track moving adaptive mesh refinement in curved domains. The procedure is capable of generating suitable curvilinear meshes to enable large-scale accelerator simulations. The procedure can generate valid curved meshes with substantially fewer elements to improve the computational efficiency and reliability of the COMPASS electromagnetic analyses. Future work will focus on the scalable parallelization of all steps for petascale simulations.

43 PARTICLE ACCELERATORS↗

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

Diffusion Synthetic Acceleration for High Order S{sub N} Transport on Meshes with Curved Surfaces

Thermal radiation transport is integral to multiphysics applications such as inertial confinement fusion and astrophysics. Materials in these problems can be exceptionally optically thick and diffusive. A transport solver must be capable of accurate and efficient solutions to such problems. Previously, Woods et al. established a proof-of-concept for high order (HO) discontinuous Galerkin finite element (DGFEM) transport on meshes with curved surfaces. They numerically demonstrated the spatial convergence is order p + 1. Remarkably, these convergence rates are relatively invariant to the amount of curvature of the spatial mesh. We present here an extension of this work that demonstrates a rapidly-convergent iterative solver for the FEM transport equations on meshes with curved sides. We use the modified interior penalty (MIP) diffusion synthetic acceleration (DSA) established by Wang and Ragusa. The partially consistent MIP equations stem from the symmetric interior penalty (IP) derivation of the diffusion equation. The IP method is not stable for optically thick cells so it was combined with the diffusion conforming form (DCF), a discretized diffusion equation derived from the discretized S N equations that is not stable for intermediate optical thicknesses. The MIP equations adapt a 'switch' to the IP method in optically thinner regions and the DCF method in optically thicker regions. The literature does not reveal any Fourier analyses performed for iterative transport on meshes with curved surfaces. Wang and Ragusa performed a Fourier analysis for orthogonal meshes and our results appear to be as expected. Previous literature has reported on some of the sensitivities that affect the spectral radius of DSA schemes: polynomial order, and scattering ratios. Presently, we focus on the sensitivity of the spectral radius to polynomial order, scattering ratio, the constant C, and mesh curvature for varying cell thicknesses. We also numerically study the behavior of the spectral radius to verify our DSA implementation. A sequence of problems is designed to exercise the acceleration. As the problems become more optically thick and diffusive, the accelerated solution continues to converge toward the analytic solution. We employ the Modular Finite Element Methods (MFEM) package, developed at Lawrence Livermore National Laboratory, to generate the linear algebraic system of equations for each angle in the discrete ordinates quadrature set, and use UMFPack to solve this system of equations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Efficient Sweep-Based Solver for the S N Equations on High-Order Meshes

In this study, we propose a graph-based sweep algorithm for solving the steady-state, monoenergetic discrete ordinates on meshes of high-order (HO) curved mesh elements. Our spatial discretization consists of arbitrarily HO discontinuous Galerkin finite elements using upwinding at mesh element faces. To determine mesh element sweep ordering, we define a directed, weighted graph whose vertices correspond to mesh elements and whose edges correspond to mesh element upwind dependencies. This graph is made acyclic by removing select edges in a way that approximately minimizes the sum of removed edge weights. Once the set of removed edges is determined, transport sweeps are performed by lagging the upwind dependency associated with the removed edges. The proposed algorithm is tested on several two-dimensional and three-dimensional meshes composed of HO curved mesh elements.

97 MATHEMATICS AND COMPUTING↗

Community Project for Accelerator Science and Simulation-3

The focus of the Rensselaer efforts for COMPASS-3 was the development of parallel mesh adaptation procedures for high-order unstructured meshes where elements must be curved to properly approximate the domain geometry. The procedures developed were integrated into the ACE3P accelerator modeling code. Areas of development included: High order curved mesh representations that can provide the orders of geometric approximation needed. A curved mesh adaptation procedure that can match an adaptively defined anisotropic mesh metric field. In-memory integration of these procedures with the Omega3P code to provide an effective parallel adaptive simulation work flow. Improved dynamic load balancing tools that account for the degrees of freedom associated with the various order mesh entities (vertices, edges, faces and regions).

42 ENGINEERING↗

High Order Finite Elements S{sub N} Transport in X-Y Geometry on Meshes with Curved Surfaces

Radiation hydrodynamics is useful to model astrophysics, ICF, and glass manufacturing. A large amount of research has been conducted to understand how to solve hydrodynamics equations using high-order finite elements. Researchers at LLNL have developed a general high-order FEM library, Modular Finite Element Methods (MFEM), to enable this research. The BLAST code uses MFEM to evolve the Lagrangian hydrodynamics equations, resulting in meshes with higher order curved surfaces. Our research focuses on the requirements for high order finite element solutions of the radiation transport equation with the eventual goal of studying the complete high-order radiation hydrodynamics solution methodology. For this research we used MFEM to develop a proof-of-concept code that solves the high order finite element transport equations in Cartesian coordinates on meshes with curved surfaces. We have solved several test problems to assess the behavior of our method. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

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↗

On the Computation of Integral Curves in Adaptive Mesh Refinement Vector Fields

Integral curves, such as streamlines, streaklines, pathlines, and timelines, are an essential tool in the analysis of vector field structures, offering straightforward and intuitive interpretation of visualization results. While such curves have a long-standing tradition in vector field visualization, their application to Adaptive Mesh Refinement (AMR) simulation results poses unique problems. AMR is a highly effective discretization method for a variety of physical simulation problems and has recently been applied to the study of vector fields in flow and magnetohydrodynamic applications. The cell-centered nature of AMR data and discontinuities in the vector field representation arising from AMR level boundaries complicate the application of numerical integration methods to compute integral curves. In this paper, we propose a novel approach to alleviate these problems and show its application to streamline visualization in an AMR model of the magnetic field of the solar system as well as to a simulation of two incompressible viscous vortex rings merging.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗

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

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

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↗

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↗

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↗

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↗

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↗