Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,711 records · Page 95

Adaptive grid methods for RLV environment assessment and nozzle analysis

Rapid access to highly accurate data about complex configurations is needed for multi-disciplinary optimization and design. In order to efficiently meet these requirements a closer coupling between the analysis algorithms and the discretization process is needed. In some cases, such as free surface, temporally varying geometries, and fluid structure interaction, the need is unavoidable. In other cases the need is to rapidly generate and modify high quality grids. Techniques such as unstructured and/or solution-adaptive methods can be used to speed the grid generation process and to automatically cluster mesh points in regions of interest. Global features of the flow can be significantly affected by isolated regions of inadequately resolved flow. These regions may not exhibit high gradients and can be difficult to detect. Thus excessive resolution in certain regions does not necessarily increase the accuracy of the overall solution. Several approaches have been employed for both structured and unstructured grid adaption. The most widely used involve grid point redistribution, local grid point enrichment/derefinement or local modification of the actual flow solver. However, the success of any one of these methods ultimately depends on the feature detection algorithm used to determine solution domain regions which require a fine mesh for their accurate representation. Typically, weight functions are constructed to mimic the local truncation error and may require substantial user input. Most problems of engineering interest involve multi-block grids and widely disparate length scales. Hence, it is desirable that the adaptive grid feature detection algorithm be developed to recognize flow structures of different type as well as differing intensity, and adequately address scaling and normalization across blocks. These weight functions can then be used to construct blending functions for algebraic redistribution, interpolation functions for unstructured grid generation, forcing functions to attract/repel points in an elliptic system, or to trigger local refinement, based upon application of an equidistribution principle. The popularity of solution-adaptive techniques is growing in tandem with unstructured methods. The difficultly of precisely controlling mesh densities and orientations with current unstructured grid generation systems has driven the use of solution-adaptive meshing. Use of derivatives of density or pressure are widely used for construction of such weight functions, and have been proven very successful for inviscid flows with shocks. However, less success has been realized for flowfields with viscous layers, vortices or shocks of disparate strength. It is difficult to maintain the appropriate mesh point spacing in the various regions which require a fine spacing for adequate resolution. Mesh points often migrate from important regions due to refinement of dominant features. An example of this is the well know tendency of adaptive methods to increase the resolution of shocks in the flowfield around airfoils, but in the incorrect location due to inadequate resolution of the stagnation region. This problem has been the motivation for this research.

Thornburg, Hugh J.↗

An Algebraic Multigrid Solver for Navier-Stokes Problems in the Discrete Second-Order Approximation

An algebraic multigrid scheme is presented for solving the discrete Navier-Stokes equations to second-order accuracy using the defect-correction method. Solutions have been obtained for problems involving both structured and unstructured meshes, with the resolution and resolution grading controlled by global and local mesh refinements. The solver is efficient and robust to the extent that no underrelaxation of variables has been required to ensure convergence, but rates of convergence can be improved with small amounts of underrelaxation of the velocity-pressure coupling. Provided that the computational mesh can resolve the flow field, convergence characteristics are almost mesh independent. Rates of convergence actually improve with refinement, asymptotically approaching mesh independent values. For extremely coarse meshes where dispersive truncation errors would be expected to prevent convergence (or even induce divergence), solutions can still be obtained by using explicit underrelaxation in the iterative cycle.

Webster, R.↗

Efficient Use of Distributed Systems for Scientific Applications

Distributed computing has been regarded as the future of high performance computing. Nationwide high speed networks such as vBNS are becoming widely available to interconnect high-speed computers, virtual environments, scientific instruments and large data sets. One of the major issues to be addressed with distributed systems is the development of computational tools that facilitate the efficient execution of parallel applications on such systems. These tools must exploit the heterogeneous resources (networks and compute nodes) in distributed systems. This paper presents a tool, called PART, which addresses this issue for mesh partitioning. PART takes advantage of the following heterogeneous system features: (1) processor speed; (2) number of processors; (3) local network performance; and (4) wide area network performance. Further, different finite element applications under consideration may have different computational complexities, different communication patterns, and different element types, which also must be taken into consideration when partitioning. PART uses parallel simulated annealing to partition the domain, taking into consideration network and processor heterogeneity. The results of using PART for an explicit finite element application executing on two IBM SPs (located at Argonne National Laboratory and the San Diego Supercomputer Center) indicate an increase in efficiency by up to 36% as compared to METIS, a widely used mesh partitioning tool. The input to METIS was modified to take into consideration heterogeneous processor performance; METIS does not take into consideration heterogeneous networks. The execution times for these applications were reduced by up to 30% as compared to METIS. These results are given in Figure 1 for four irregular meshes with number of elements ranging from 30,269 elements for the Barth5 mesh to 11,451 elements for the Barth4 mesh. Future work with PART entails using the tool with an integrated application requiring distributed systems. In particular this application, illustrated in the document entails an integration of finite element and fluid dynamic simulations to address the cooling of turbine blades of a gas turbine engine design. It is not uncommon to encounter high-temperature, film-cooled turbine airfoils with 1,000,000s of degrees of freedom. This results because of the complexity of the various components of the airfoils, requiring fine-grain meshing for accuracy. Additional information is contained in the original.

Taylor, Valerie↗

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↗

Error Estimation and h-Adaptivity for Optimal Finite Element Analysis

The objective of adaptive meshing and automatic error control in finite element analysis is to eliminate the need for the application engineer from re-meshing and re-running design simulations to verify numerical accuracy. The user should only need to enter the component geometry and a coarse finite element mesh. The software will then autonomously and adaptively refine this mesh where needed, reducing the error in the fields to a user prescribed value. The ideal end result of the simulation is a measurable quantity (e.g. scattered field, input impedance), calculated to a prescribed error, in less time and less machine memory than if the user applied typical uniform mesh refinement by hand. It would also allow for the simulation of larger objects since an optimal mesh is created.

Cwik, Tom↗

Discrete Data Transfer Technique for Fluid-Structure Interaction

This paper presents a general three-dimensional algorithm for data transfer between dissimilar meshes. The algorithm is suitable for applications of fluid-structure interaction and other high-fidelity multidisciplinary analysis and optimization. Because the algorithm is independent of the mesh topology, we can treat structured and unstructured meshes in the same manner. The algorithm is fast and accurate for transfer of scalar or vector fields between dissimilar surface meshes. The algorithm is also applicable for the integration of a scalar field (e.g., coefficients of pressure) on one mesh and injection of the resulting vectors (e.g., force vectors) onto another mesh. The author has implemented the algorithm in a C++ computer code. This paper contains a complete formulation of the algorithm with a few selected results.

Samareh, Jamshid A.↗

MESHMAKER (MM) V1.5

MeshMaker v1.5 is a code that describes the system geometry and discretizes the domain in problems of flow and transport through porous and fractured media that are simulated using the TOUGH+ [Moridis and Pruess, 2014] or TOUGH2 [Pruess et al., 1999; 2012] families of codes. It is a significantly modified and drastically enhanced version of an earlier simpler facility that was embedded in the TOUGH2 codes [Pruess et al., 1999; 2012], from which it could not be separated. The code (MeshMaker.f90) is a stand-alone product written in FORTRAN 95/2003, is written according to the tenets of Object-Oriented Programming, has a modular structure and can perform a number of mesh generation and processing operations. It can generate two-dimensional radially symmetric (r,z) meshes, and one-, two-, and three-dimensional rectilinear (Cartesian) grids in (x,y,z). The code generates the file MESH, which includes all the elements and connections that describe the discretized simulation domain and conforming to the requirements of the TOUGH+ and TOUGH2 codes. Multiple-porosity processing for simulation of flow in naturally fractured reservoirs can be invoked by means of a keyword MINC, which stands for Multiple INteracting Continua. The MINC process operates on the data of the primary (porous medium) mesh as provided on disk file MESH, and generates a secondary mesh containing fracture and matrix elements with identical data formats on file MINC.

MORIDIS, GEORGE↗

Revised Extended Grid Library

The Revised Eolus Grid Library (REGL) is a mesh-tracking library that was developed for use with the MCNP6TM computer code so that (radiation) particles can track on an unstructured mesh. The unstructured mesh is a finite element representation of any geometric solid model created with a state-of-the-art CAE/CAD tool. The mesh-tracking library is written using modern Fortran and programming standards; the library is Fortran 2003 compliant. The library was created with a defined application programmer interface (API) so that it could easily integrate with other particle tracking/transport codes. The library does not handle parallel processing via the message passing interface (mpi), but has been used successfully where the host code handles the mpi calls. The library is thread-safe and supports the OpenMP paradigm. As a library, all features are available through the API and overall a tight coupling between it and the host code is required. Features of the library are summarized with the following list: Can accommodate first and second order 4, 5, and 6-sided polyhedra; any combination of element types may appear in a single geometry model; parts may not contain tetrahedra mixed with other element types; pentahedra and hexahedra can be together in the same part; robust handling of overlaps and gaps; tracks element-to-element to produce path length results at the element level; finds element numbers for a given mesh location; finds intersection points on element faces for the particle tracks; produce a data file for post processing results analysis; reads Abaqus .inp input (ASCII) files to obtain information for the global mesh-model; supports parallel input processing via mpi; and support parallel particle transport by both mpi and OpenMP.

Martz, Roger L.↗

Photocathodes with protective in-situ graphene gas barrier films and method of making the same

According to an embodiment of the present disclosure, a photocathode may include: a mesh having a first surface and a second surface facing away from the first surface, and including metallic, semiconductor or ceramic mesh grid with micron-sized openings in the mesh; a photosensitive film on the first surface of the mesh and extending at least partially into the openings of the mesh; and a graphene layer including one or more graphene sheets on the second surface of the mesh.

Moody, Nathan↗

Alternative low cost electrodes for hybrid flow batteries

An electrode for use in an all-iron redox flow battery is provided. In one example, the electrode may include a plastic mesh; and a coating on the plastic mesh. The coating may be a hydrophilic coating or a conductive coating and the electrode may have an electrode reaction potential is less than 0.8V. Further, a method of manufacturing a coated plastic mesh electrode for use in an all-iron redox flow battery is provided. In one example method, the steps include fabricating a plastic mesh, treating the plastic mesh by applying a solvent treatment or a plasma treatment or a mechanical abrasion treatment; coating the plastic mesh with a material selected from: carbon inks, metal oxides, and hydrophilic polymers.

Evans, Craig E.↗

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↗

A practical model for fluid flow in discrete-fracture porous media by using the numerical manifold method

Here in this study, a numerical manifold method (NMM) model is developed to analyze flow in porous media with discrete fractures in a non-conforming mesh. This new model is based on a two-cover-mesh system with a uniform triangular mathematical mesh and boundary/fracture-divided physical covers, where local independent cover functions are defined. The overlapping parts of the physical covers are elements where the global approximation is defined by the weighted average of the physical cover functions. The mesh is generated by a tree-cutting algorithm. A new model that does not introduce additional degrees of freedom (DOF) for fractures was developed for fluid flow in fractures. The fracture surfaces that belong to different physical covers are used to represent fracture flow in the direction of the fractures. In the direction normal to the fractures, the fracture surfaces are regarded as Dirichlet boundaries to exchange fluxes with the rock matrix. Furthermore, fractures that intersect with Dirichlet or Neumann boundaries are considered. Simulation examples are designed to verify the efficiency of the tree-cutting algorithm, the calculation's independency from the mesh orientation, and accuracy when modeling porous media that contain fractures with multiple intersections and different orientations. The simulation results show good agreement with available analytical solutions. Finally, the model is applied to cases that involve nine intersecting fractures and a complex network of 100 fractures, both of which achieve reasonable results. The new model is very practical for modeling flow in fractured porous media, even for a geometrically complex fracture network with large hydraulic conductivity contrasts between fractures and the matrix.

58 GEOSCIENCES↗

Smoothed boundary method for simulating incompressible flow in complex geometries

Simulating flow through porous media with explicit considerations of complex microstructures is very challenging using conventional sharp-interface methods because of the difficulties in generating meshes conformal to complex geometries. In this work, a diffuse interface embedded boundary method known as the Smoothed Boundary Method (SBM) is utilized to facilitate simulations of fluid dynamics involving complex geometries. In diffuse-interface methods, the geometry is described by a domain parameter. The SBM allows the straightforward reformulation of the time-dependent Navier-Stokes equations in terms of this domain parameter, using only algebraic identities. Thus, enforcing the appropriate boundary conditions at the irregular embedded boundary is greatly simplified. Adaptive mesh refinement is used to increase the accuracy of the diffuse interface method by allowing thinner interfacial thickness to be used in the domain parameter. Here, the SBM-formulated Navier-Stokes equations are solved with the Finite Difference Method on refined mesh systems. Sharp-interface Finite Element Method simulations using the commercial software COMSOL on body-conforming meshes are also provided for comparison. Favorable agreement between the two methods is observed. Since it is no longer necessary for the mesh to conform to the complex geometry, the grid system for the SBM simulations can be generated rapidly and without additional manual interventions, making the entire simulation process more expedient.

36 MATERIALS SCIENCE↗

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part I: Lagrangian and indirect Euler AMR algorithms

Many applications of physics and engineering involve wide ranges of time and spatial scales. The numerical simulation of localized small scales such as shock waves and material interfaces requires a large number of computational cells in these regions. For these applications, Lagrangian and Arbitrary-Lagrangian-Eulerian (ALE) related methods are engaging since the moving mesh feature naturally brings mesh cells on shock discontinuities and material interfaces are carefully captured. In addition, Adaptive-Mesh-Refinement (AMR) strategies aim to optimize computational resources by concentrating finer mesh cells only in areas of interest while using coarser cells elsewhere. A key but challenging AMR requirement consists in efficiently distributing the computational effort to achieve high accuracy without the prohibitive computational costs associated with uniformly fine grids. Here, in this document, the coupling of the p4est AMR library with a cell-centered Lagrangian scheme is presented with the goal to perform reliable 3D Lagrangian-AMR and indirect Euler-AMR multi-material simulations. In particular, it is shown that starting from a 3D indirect ALE code, the memory management and load balancing requirements can be delegated to an external library (here the p4est library) to unlock ALE-AMR capabilities. First, we present a strategy to transcribe the octant-based connectivity of the 3D AMR framework with that of an unstructured mesh of polygonal cells used in Lagrangian hydrodynamics. Then, we show how refinement and coarsening operations must be adapted to the particular Lagrangian framework to ensure the conservation of volume during those steps. Finally, several numerical test cases are presented that demonstrate the capabilities of the Lagrangian-AMR and indirect Euler-AMR algorithms.

3D cell-centered Lagrangian numerical scheme↗

A multiscale control volume finite element method for advection–diffusion equations

Summary We present a new stabilized method for advection–diffusion equations, which combines a control volume FEM formulation of the governing equations with a novel multiscale approximation of the total flux. The latter incorporates information about the exact solution that cannot be represented on the mesh. To define this flux, we solve the governing equations along suitable mesh segments under the assumption that the flux varies linearly along these segments. This procedure yields second‐order accurate fluxes on the edges of the mesh. Then, we use curl‐conforming elements of the same order to lift these edge fluxes into the mesh elements. In so doing, we obtain a stabilized control volume FEM formulation that is second‐order accurate and does not require mesh‐dependent stabilization parameters. Numerical convergence studies on uniform and nonuniform grids along with several standard advection tests illustrate the computational properties of the new method. Published 2015. This article is a U.S. Government work and is in the public domain in the USA.

Bochev, Pavel↗

Compact feature-aware Hermite-style high-order surface reconstruction

High-order surface reconstruction is now a commonly used technique for mesh generation and adaptation, geometric and physical modeling, and high-order numerical methods for solving partial differential equations (PDEs). However, surface reconstruction from a relatively coarse mesh remained a challenging problem, especially for surfaces with sharp features. Here in this paper, we introduce a new method to address this challenge by improving the previous state of the art, including continuous moving frames (CMF) and weighted averaging of local fittings (WALF) (Eng Comput 28 (2012)), in two aspects. First, we significantly improve the robustness of reconstruction from coarse meshes using a Hermite-style least squares approximation to incorporate normals of the surface and tangents of the feature curves. Second, we ensure both G 0 continuity and high-order accuracy of the reconstruction near sharp features by generating parametric surface elements with an iterative feature-aware parameterization. We present the theoretical framework of our method and compare it against point-based methods in terms of accuracy and stability. We demonstrate the use of the proposed technique in generating high-order meshes for finite element methods, and show that it enables nearly identical solutions as using the meshes generated from exact geometry, while allowing additional flexibility.

42 ENGINEERING↗

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↗

Rapid particle generation from an STL file and related issues in the application of material point methods to complex objects

Abstract In this paper, we focus on three issues related to applications of material point methods (MPMs) to objects with complex geometries. They are material point generation, compatibility of material points with a mesh, and sensitivity to mesh orientation. An efficient method of generating material points from a stereolithography (STL) file is introduced. This material point generation method is independent of the mesh used in MPM calculations. The compatibility between the material points and the mesh is then studied. We also show that the original MPM and the dual domain material point (DDMP) method are sensitive to mesh orientation. These issues are related to the calculation of the internal force and are concerns of the MPMs. They become more prominent when MPMs are applied to complex geometries. Our numerical results show that the recently developed local stress difference (LSD) algorithm (Perez et al. in J Comp Phys 498:112681, 2024) can be used to effectively address them.

36 MATERIALS SCIENCE↗