Search NASA⌕ Search

SEARCH · Search NASA

Results for “POLYGONAL 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

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↗
DOE OSTI2019

A high-order discontinuous Galerkin method for level set problems on polygonal meshes

We propose and analyze discontinuous Galerkin schemes for solving level set equations on polygonal meshes. For linear equations, we assume that the velocity is given only on the cell surface. Velocity inside mesh cells is approximated using virtual element projectors on polynomial spaces. For nonlinear equations, we use the Taylor expansion to approximate the normalized solution gradient. Here, we analyze the new schemes for a set of typical level set problems using square and polygonal meshes. The numerical results indicate great potential for using polygonal meshes in applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The virtual element method (VEM) is a Galerkin approximation method that extends the finite element method to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method (FEM) for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. We numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular and square meshes where the method coincides with the P 1 - P 0 Scott-Vogelius scheme, which is well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A virtual element generalization on polygonal meshes of the Scott-Vogelius finite element method for the 2-D Stokes problem

The Virtual Element Method (VEM) is a Galerkin approximation method that extends the Finite Element Method (FEM) to polytopal meshes. In this paper, we present a conforming formulation that generalizes the Scott-Vogelius finite element method for the numerical approximation of the Stokes problem to polygonal meshes in the framework of the virtual element method. In particular, we consider a straightforward application of the virtual element approximation space for scalar elliptic problems to the vector case and approximate the pressure variable through discontinuous polynomials. We assess the effectiveness of the numerical approximation by investigating the convergence on a manufactured solution problem and a set of representative polygonal meshes. Finally, we numerically show that this formulation is convergent with optimal convergence rates except for the lowest-order case on triangular meshes, where the method coincides with the $\mathbb{P}_1$ – $\mathbb{P}_0$ Scott-Vogelius scheme, and on square meshes, which are situations that are well-known to be unstable.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Conservative high-order data transfer method on generalized polygonal meshes

A conservative data transfer (remap) between two meshes is an important step of arbitrary Lagrangian-Eulerian (ALE) hydrodynamics simulations. High-order numerical methods for ALE simulations require both high-order (curvilinear) meshes and high-order remap algorithms. Here we develop a conservative and bounds-preserving method for accurate remapping of discrete fields on generalized polygonal meshes with curvilinear edges. The properties of the proposed method are studied theoretically and numerically for various (smooth and non-smooth) mesh deformations and discrete fields that represent smooth and discontinuous functions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Discontinuous finite element solution of the radiation diffusion equation on arbitrary polygonal meshes and locally adapted quadrilateral grids

In this paper, we propose a piece-wise linear discontinuous (PWLD) finite element discretization of the diffusion equation for arbitrary polygonal meshes. It is based on the standard diffusion form and uses the symmetric interior penalty technique, which yields a symmetric positive definite linear system matrix. A preconditioned conjugate gradient algorithm is employed to solve the linear system. Piece-wise linear approximations also allow a straightforward implementation of local mesh adaptation by allowing unrefined cells to be interpreted as polygons with an increased number of vertices. Several test cases, taken from the literature on the discretization of the radiation diffusion equation, are presented: random, sinusoidal, Shestakov, and Z meshes are used. The last numerical example demonstrates the application of the PWLD discretization to adaptive mesh refinement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Discontinuous diffusion synthetic acceleration for S{sub n} transport on 2D arbitrary polygonal meshes

In this paper, a Diffusion Synthetic Acceleration (DSA) technique applied to the S{sub n} radiation transport equation is developed using Piece-Wise Linear Discontinuous (PWLD) finite elements on arbitrary polygonal grids. The discretization of the DSA equations employs an Interior Penalty technique, as is classically done for the stabilization of the diffusion equation using discontinuous finite element approximations. The penalty method yields a system of linear equations that is Symmetric Positive Definite (SPD). Thus, solution techniques such as Preconditioned Conjugate Gradient (PCG) can be effectively employed. Algebraic MultiGrid (AMG) and Symmetric Gauss–Seidel (SGS) are employed as conjugate gradient preconditioners for the DSA system. AMG is shown to be significantly more efficient than SGS. Fourier analyses are carried out and we show that this discontinuous finite element DSA scheme is always stable and effective at reducing the spectral radius for iterative transport solves, even for grids with high-aspect ratio cells. Numerical results are presented for different grid types: quadrilateral, hexagonal, and polygonal grids as well as grids with local mesh adaptivity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Virtual element approximations of the time-fractional nonlinear convection-diffusion equation on polygonal meshes

We extend the Virtual Element Method to a two-dimensional unsteady nonlinear convection-diffusion equation characterized by a fractional-order derivative with respect to the time variable. Our methodology is based on three fundamental technical components: a fractional version of the Grunwald-Letnikov approximation, discrete maximal regularity, and the regularity theory associated with non-linearity. We prove the method's well-posedness, i.e., the approximate solution's existence and uniqueness to the time-fractional convection-diffusion equation with a Lipschitz nonlinear source term. The fully discrete scheme inherently maintains stability and consistency by leveraging the discrete maximal regularity and the energy projection operator. The convergence in the L 2 -norm and H 1 -norm to various mesh configurations is validated by numerical results, underlining the practical effectiveness of the proposed method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Development of a P 2 element with optimal L 2 convergence for biharmonic equation

It is well known that convergence rate of finite element approximation is suboptimal in the L 2 norm for solving biharmonic equations when P 2 or Q 2 element is used. The goal of this paper is to derive a weak Galerkin (WG) P 2 element with the L 2 optimal convergence rate by assuming the exact solution sufficiently smooth. In addition, our new WG finite element method can be applied to general mesh such as hybrid mesh, polygonal mesh or mesh with hanging node. The numerical experiments have been conducted on different meshes including hybrid meshes with mixed of pentagon and rectangle and mixed of hexagon and triangle.

Mu, Lin↗
DOE OSTI2017

Recovering Topology of Nested Volumes Represented by Single Closed Surfaces

As scientific computing abilities continue to advance, so too have the efforts to model and simulate highly complex geometries in radiation environments. Modeling has advanced from primitive constructive solid geometry (CSG) to voxelized models, and now to high fidelity polygon mesh models. While polygon mesh surface models are very accurate, most Monte Carlo codes do not allow for their direct use. Often they are converted to voxel or tetrahedral mesh models and then used with the physics codes. The Direct Accelerated Geometry Monte Carlo (DAGMC) software package has the ability to efficiently run transport calculations directly on tessellated surface models. Typically the surface meshes used for DAGMC calculations come from CAD-based geometry models generated by solid modeling software. In some cases geometries of interest, like human phantoms, are generated by other means and may not contain all of the necessary information for particle transport. For example, mesh geometries in the OBJ file format contain vertex and connectivity data for each surface, but do not have any information about surface topology. These types of file formats necessitate a tool that can build a hierarchy of surfaces and reconstruct the topological information. The generate hierarchy tool was developed for this purpose. The following summary will explain the algorithm behind the tool, describe a test case, and finally demonstrate a real-world application of the tool with an MCNP5 calculation that directly uses a polygon mesh human phantom.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2013

Generating Inviscid and Viscous Fluid-Flow Simulations over an Aircraft Surface Using a Fluid-Flow Mesh

Fluid-flow simulation over a computer-generated aircraft surface is generated using inviscid and viscous simulations. A fluid-flow mesh of fluid cells is obtained. At least one inviscid fluid property for the fluid cells is determined using an inviscid fluid simulation that does not simulate fluid viscous effects. A set of intersecting fluid cells that intersects the aircraft surface are identified. One surface mesh polygon of the surface mesh is identified for each intersecting fluid cell. A boundary-layer prediction point for each identified surface mesh polygon is determined. At least one boundary-layer fluid property for each boundary-layer prediction point is determined using the at least one inviscid fluid property of the corresponding intersecting fluid cell and a boundary-layer simulation that simulates fluid viscous effects. At least one updated fluid property for at least one fluid cell is determined using the at least one boundary-layer fluid property and the inviscid fluid simulation.

Rodriguez, David L.↗
DOE OSTI2018

Finite deformation cohesive polygonal finite elements for modeling pervasive fracture

In this work, we introduce a framework for modeling dynamic fracture problems using cohesive polygonal finite elements. Random polygonal meshes provide a robust, efficient method for generating an unbiased network of fracture surfaces. Further, these meshes have more facets per element than standard triangle or quadrilateral meshes, providing more possible facets per element to insert cohesive surfaces. This property of polygonal meshes is advantageous for the modeling of pervasive fracture. We use both Wachspress and maximum entropy shape functions to form a finite element basis over the polygons. Fracture surfaces are captured through dynamically inserted cohesive zone elements at facets between the polygons in the mesh. Contact is enforced through a penalty method that is applied to both closed cohesive surfaces and general interpenetration of two polygonal elements. Finally, several numerical examples are presented that illustrate the capabilities of the method and demonstrate convergence of solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Design, analysis and numerical experiments for the virtual element p and hp approximations of elliptic eigenvalue problems

We discuss the p- and the hp-versions of the virtual element method for the approximation of the eigenvalues of elliptic operators with a potential term on polygonal meshes. An application of this model is provided by the Schr¨odinger equation with a pseudo-potential term. We present in details the analysis of the p-version of the method, proving the exponential convergence in the case of analytic eigenfunctions. The theoretical results are supplied with a wide set of experiments. We also show numerically that, in the case of eigenfunctions with finite Sobolev regularity, an exponential approximation of the eigenvalues in terms of the cubic root of the number of degrees of freedom can be obtained by employing hp-refinements. Importantly, the geometric flexibility of polygonal meshes is exploited in the construction of the hp-spaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

A posteriori error estimation and adaptivity in hp virtual elements

An explicit and computable error estimator for the hp version of the virtual element method (VEM), together with lower and upper bounds with respect to the exact energy error, is presented. Such error estimator is employed to provide, following the approach of Melenk and Wohlmuth (Adv Comput Math 15(1–4):311–331, 2001), hp adaptive mesh refinements for very general polygonal meshes. In addition, a novel VEM hp Clément quasi-interpolant, instrumental for the a posteriori error analysis, is introduced. The performances of the adaptive method are validated by a number of numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

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↗