Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Triangle 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 37 records · Page 2

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.

Barth, Timothy J.↗

Improvements to the Unstructured Mesh Generator MESH3D

The AIRPLANE process starts with an aircraft geometry stored in a CAD system. The surface is modeled with a mesh of triangles and then the flow solver produces pressures at surface points which may be integrated to find forces and moments. The biggest advantage is that the grid generation bottleneck of the CFD process is eliminated when an unstructured tetrahedral mesh is used. MESH3D is the key to turning around the first analysis of a CAD geometry in days instead of weeks. The flow solver part of AIRPLANE has proven to be robust and accurate over a decade of use at NASA. It has been extensively validated with experimental data and compares well with other Euler flow solvers. AIRPLANE has been applied to all the HSR geometries treated at Ames over the course of the HSR program in order to verify the accuracy of other flow solvers. The unstructured approach makes handling complete and complex geometries very simple because only the surface of the aircraft needs to be discretized, i.e. covered with triangles. The volume mesh is created automatically by MESH3D. AIRPLANE runs well on multiple platforms. Vectorization on the Cray Y-MP is reasonable for a code that uses indirect addressing. Massively parallel computers such as the IBM SP2, SGI Origin 2000, and the Cray T3E have been used with an MPI version of the flow solver and the code scales very well on these systems. AIRPLANE can run on a desktop computer as well. AIRPLANE has a future. The unstructured technologies developed as part of the HSR program are now targeting high Reynolds number viscous flow simulation. The pacing item in this effort is Navier-Stokes mesh generation.

Thomas, Scott D.↗

Line relaxation methods for the solution of 2D and 3D compressible flows

An implicit finite element based algorithm for the compressible Navier-Stokes equations is outlined, and the solution of the resulting equation by a line relaxation on general meshes of triangles or tetrahedra is described. The problem of generating and adapting unstructured meshes for viscous flows is reexamined, and an approach for both 2D and 3D simulations is proposed. An efficient approach appears to be the use of an implicit/explicit procedure, with the implicit treatment being restricted to those regions of the mesh where viscous effects are known to be dominant. Numerical examples demonstrating the computational performance of the proposed techniques are given.

Hassan, O.↗

Finite element solution of the Euler equations in two and three dimensions

The paper presents a finite element procedure for solving the equations of compressible flow over bodies of arbitrary geometry. The numerical solution algorithm employed is an explicit two-step version of a second order Taylor-Galerkin scheme. The discretization of the computational domain into unstructured meshes of triangles in two dimensions and tetrahedra in three dimensions is performed by an automatic mesh generator. In the approach, the mesh generator is coupled to the finite element solver to produce an adaptive remeshing procedure.

Peiro, J.↗

Unstructured finite element mesh generation and adaptive procedures for CFD

A method is described for generating unstructured meshes of triangles or tetrahedra for computational domains of complex geometrical shape. To illustrate the power of the approach, it is applied to the solution of flows past several complete aircraft configurations. The advocated approach allows for the natural incorporation of mesh adaptivity and this is demonstrated for both inviscid and viscous computations in two and three dimensions.

Peraire, J.↗

Temporal-adaptive Euler/Navier-Stokes algorithm for unsteady aerodynamic analysis of airfoils using unstructured dynamic meshes

A temporal adaptive algorithm for the time-integration of the two-dimensional Euler or Navier-Stokes equations is presented. The flow solver involves an upwind flux-split spatial discretization for the convective terms and central differencing for the shear-stress and heat flux terms on an unstructured mesh of triangles. The temporal adaptive algorithm is a time-accurate integration procedure which allows flows with high spatial and temporal gradients to be computed efficiently by advancing each grid cell near its maximum allowable time step. Results indicate that an appreciable computational savings can be achieved for both inviscid and viscous unsteady airfoil problems using unstructured meshes without degrading spatial or temporal accuracy.

Kleb, William L.↗

Temporal-adaptive Euler/Navier-Stokes algorithm for unsteady aerodynamic analysis of airfoils using unstructured dynamic meshes

A temporal adaptive algorithm for the time-integration of the two-dimensional Euler or Navier-Stokes equations is presented. The flow solver involves an upwind flux-split spatial discretization for the convective terms and central differencing for the shear-stress and heat flux terms on an unstructured mesh of triangles. The temporal adaptive algorithm is a time-accurate integration procedure which allows flows with high spatial and temporal gradients to be computed efficiently by advancing each grid cell near its maximum allowable time step. Results indicate that an appreciable computational savings can be achieved for both inviscid and viscous unsteady airfoil problems using unstructured meshes without degrading spatial or temporal accuracy.

Kleb, William L.↗

Shock interference studies on a circular cylinder at Mach 16

This paper presents the results of a computational study on the shock interference problems on a cylindrical body typical of an engine inlet cowl leading edge at a nominal Mach number of 16. The two-dimensional Navier-Stokes equations are solved assuming the flow to be in chemical and thermal equilibrium and using a finite element method. The algorithm employs a cell-centered fully implicit upwind scheme. Adaptively generated unstructured meshes of triangles and quadrilaterals are employed. Under certain conditions the finite element code resulted in oscillatory solutions for shock interference at Mach 16. Some of the causes of the unsteady behavior are identified, and to the extent possible, such situations are avoided in the present application. Two shock interference conditions involving a Type IV (supersonic jet) and a Type III (attaching shear layer) are solved. The results are compared with available experimental data and reasonable agreement is observed. A semi-empirical method is also used to estimate the maximum surface heat flux and static pressure.

Prabhu, Ramadas K.↗

Analysis and Improvement of Upwind and Centered Schemes on Quadrilateral and Triangular Meshes

Second-order accurate upwind and centered schemes are presented in a framework that facilitates their analysis and comparison. The upwind scheme employed consists of a reconstruction step (MUSCL approach) followed by an upwind step (Roe's flux-difference splitting). The two centered schemes are of Lax-Friedrichs (L-F) type. They are the nonstaggered versions of the Nessyahu-Tadmor (N-T) scheme and the CE/SE method with epilson = 1/2. The upwind scheme is extended to the case of two spatial dimensions (2D) in a straightforward manner. The N-T and CE/SE schemes are extended in a manner similar to the 2D extensions of the CE/SE scheme by Wang and Chang for a triangular mesh and by Zhang, Yu, and Chang for a quadrilateral mesh. The slope estimates, however, are simplified. Fourier stability and accuracy analyses are carried out for these schemes for the standard 1D and the 2D quadrilateral mesh cases. In the nonstandard case of a triangular mesh, the triangles must be paired up when analyzing the upwind and N-T schemes. An observation resulting in an extended N-T scheme which is faster and uses only one-third of the storage for flow data compared with the CE/SE method is presented. Numerical results are shown. Other improvements to the schemes are discussed.

Huynh, H. T.↗

Self-Avoiding Walks Over Adaptive Triangular Grids

Space-filling curves is a popular approach based on a geometric embedding for linearizing computational meshes. We present a new O(n log n) combinatorial algorithm for constructing a self avoiding walk through a two dimensional mesh containing n triangles. We show that for hierarchical adaptive meshes, the algorithm can be locally adapted and easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the runtime partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗

Three-Dimensional Morphological Analysis of ALH84001 Magnetite Using Electron Tomography

We report here the crystal morphologies of MV-1 and ALH84001 magnetites as calculated by back-projection using electron tomography. In the present study, we used a 300 keV TEM with a field emission gun (Tecnai F-30 from FEI Inc.), equipped with a 2048 x 2048 pixel CCD camera from Gatan Inc. to image magnetite crystals over tilt ranges of approx. +/- 72 deg in 2 deg tilt intervals. The images were aligned for back-projection, either manually, or through the use of fiducial 5 nm Au spheres affixed to the specimen prior to microscopy. Three-dimensional (3-D) reconstructions were computed using weighted back-projection of the tilted views. The tomograms were viewed and analyzed as a series of slices 1.0 nm thick, taken parallel to the specimen-supporting grid, using the IMOD software package. The shape of each magnetite crystal was determined by defining the external contour of a given magnetite in each slice and assembling a stack of these contours in 3-D. To aid in visualization, the stacked contour array was reduced to an optimal mesh by Delaunay triangulation. The surface normal to each of the triangles in the mesh was calculated and the triangle faces colored according to the orientation of that surface normal relative to the principal crystallographic axis of magnetite. Green surfaces correspond to {111} orientations, blue surfaces to {100} orientations, and red surfaces to {110} orientations. Triangles whose surface normal did not correspond to one of the principal axes were colored gray. Within the experimental and numerical uncertainties of the deconvolution, the tomographic reconstruction of both MV-1 and ALH84001 magnetites are equivalent and correspond to a truncated hexa-octahedral morphology.

Thomas-Keprta, Kathie L.↗

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↗

The design and application of upwind schemes on unstructured meshes

Solution and mesh generation algorithms for solving the Euler equations on unstructured meshes consisting of triangle and quadrilateral control volumes are presented. Cell-centered and mesh-vertex upwind finite-volume schemes are developed which utilize multi-dimensional monotone linear reconstruction procedures. These algorithms differ from existing algorithms (even on structured meshes). Numerical results in two dimensions are presented.

Barth, Timothy J.↗

Self-Avoiding Walks over Adaptive Triangular Grids

In this paper, we present a new approach to constructing a "self-avoiding" walk through a triangular mesh. Unlike the popular approach of visiting mesh elements using space-filling curves which is based on a geometric embedding, our approach is combinatorial in the sense that it uses the mesh connectivity only. We present an algorithm for constructing a self-avoiding walk which can be applied to any unstructured triangular mesh. The complexity of the algorithm is O(n x log(n)), where n is the number of triangles in the mesh. We show that for hierarchical adaptive meshes, the algorithm can be easily parallelized by taking advantage of the regularity of the refinement rules. The proposed approach should be very useful in the run-time partitioning and load balancing of adaptive unstructured grids.

Heber, Gerd↗

Improved C 1 shape functions for simplex meshes

Using continuously-differentiable (C 1 ) interpolation methods previously developed for computer visualization and other applications, a new class of shape functions is constructed and applied to electrostatic (ES) Particle-In-Cell (PIC) simulations on simplex (triangle or tetrahedral) meshes. The resulting shape functions are non-negative and partition unity,and lead to a reduction of shot noise and aliasing associated with particle interpolation to and from the mesh. For an energy-conserving implementation as chosen, C 1 interpolation of the potential leads to a continuous (C 0 ) electric field, with associated improved fidelity of particle motion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Surface Remeshing with Robust High-Order Reconstruction

Remeshing is an important problem in variety of applications, such as finite element methods and geometry processing. Surface remeshing poses some unique challenges, as it must deliver not only good mesh quality but also good geometric accuracy. For applications such as finite elements with high-order elements (quadratic or cubic elements), the geometry must be preserved to high-order (third-order or higher) accuracy, since low-order accuracy may undermine the convergence of numerical computations. The problem is particularly challenging if the CAD model is not available for the underlying geometry, and is even more so if the surface meshes contain some inverted elements. We describe remeshing strategies that can simultaneously produce high-quality triangular meshes, untangling mildly folded triangles and preserve the geometry to high-order of accuracy. Our approach extends our earlier works on high-order surface reconstruction and mesh optimization by enhancing its robustness with a geometric limiter for under-resolved geometries. We also integrate high-order surface reconstruction with surface mesh adaptation techniques, which alter the number of triangles and nodes. We demonstrate the utilization of our method to meshes for high-order finite elements, biomedical image-based surface meshes, and complex interface meshes in fluid simulations.

Ray, Navamita↗

Third order maximum-principle-satisfying direct discontinuous Galerkin methods for time dependent convection diffusion equations on unstructured triangular meshes

We develop 3rd order maximum-principle-satisfying direct discontinuous Galerkin methods [8], [9], [19] and [21] for convection diffusion equations on unstructured triangular mesh. We carefully calculate the normal derivative numerical flux across element edges and prove that, with proper choice of parameter pair (β 0 ,β 1 ) in the numerical flux formula, the quadratic polynomial solution satisfies strict maximum principle. The polynomial solution is bounded within the given range and third order accuracy is maintained. There is no geometric restriction on the meshes and obtuse triangles are allowed in the partition. As a result, a sequence of numerical examples are carried out to demonstrate the accuracy and capability of the maximum-principle-satisfying limiter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Meshes optimized for discrete exterior calculus (DEC).

We study the optimization of an energy function used by the meshing community to measure and improve mesh quality. This energy is non-traditional because it is dependent on both the primal triangulation and its dual Voronoi (power) diagram. The energy is a measure of the mesh's quality for usage in Discrete Exterior Calculus (DEC), a method for numerically solving PDEs. In DEC, the PDE domain is triangulated and this mesh is used to obtain discrete approximations of the continuous operators in the PDE. The energy of a mesh gives an upper bound on the error of the discrete diagonal approximation of the Hodge star operator. In practice, one begins with an initial mesh and then makes adjustments to produce a mesh of lower energy. However, we have discovered several shortcomings in directly optimizing this energy, e.g. its non-convexity, and we show that the search for an optimized mesh may lead to mesh inversion (malformed triangles). We propose a new energy function to address some of these issues.

97 MATHEMATICS AND COMPUTING↗