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 253 records · Page 14

Mesh Computing Remote Automatic Workflow

The software suite uses a microservice architecture using Docker and `docker-compose`. The microservices are as follows: 1. User interface. This interface is written in JavaScript using the Svelte framework. It exposes form elements and a 3D visualizer to prompt the user through the definition of microstructure parameters, and setting parameters for mesh generation and refinement. 2. Mesh generator. This is a container running the Python package for DREAM3D to generate a voxelized mesh that represents a microstructure defined by the user in the interface. 3. Cubit runner. This is a secure shell protocol tool that makes the submitting the DREAM mesh to an HPC instance and starts to run Cubit shell commands to smooth the grain boundaries with its `sculpt` library, applies user-defined boundary node sets, and bundles and returns the simulation-ready meshes and input files as a zipped directory.

Harris, BrennanKay↗

PAGOSA Mesh Block Calculator

A method for automatically generating the “mesh namelist block” portion of a PAGOSA input file, which specifies the boundaries and zone sizes of the computational mesh, has been developed. This application standardizes the mesh block for 2-, and 3-dimensional problems and is computed after the user specifies the extent and resolution of the mesh and the number of processors which will be used to run the problem. The inputs may be provided directly through a series of command-line guided questions, or a separate input file. The mesh block is written to both standard output and to disk.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Source Discretization Near Curvilinear Mesh Refinements in One Dimeions (Summer Internship Final Report)

Lawrence Livermore National Lab developed the seismic wave code SW4 for earthquake simulations, and has recently added the ability to specify mesh-refinement interfaces in the curvilinear mesh. The primary purpose of this is to allow for high resolution near the surface, with relatively fewer total points in the mesh leading to shorter computation time. Presently, the code does not allow for point-source forcing terms (commonly used in seismic simulations) to be located near these curvilinear mesh refinement interfaces. The goal of this internship was to investigate the discretization of point-source forcing terms in the seismic wave equation when the sources are located near the interfaces between two curvilinear meshes. Ultimately this will be incorporated into SW4 to allow for more realistic simulations to be carried out in this faster implementation.

97 MATHEMATICS AND COMPUTING↗

Statistical Distributions for Mesh Independent Solutions in ALEGRA

The representation of material heterogeneity (also referred to as "spatial variation") plays a key role in the material failure simulation method used in ALEGRA. ALEGRA is an arbitrary Lagrangian-Eulerian shock and multiphysics code developed at Sandia National Laboratories and contains several methods for incorporating spatial variation into simulations. A desirable property of a spatial variation method is that it should produce consistent stochastic behavior regardless of the mesh used (a property referred to as "mesh independence"). However, mesh dependence has been reported using the Weibull distribution with ALEGRA's spatial variation method. This report describes efforts towards providing additional insight into both the theory and numerical experiments investigating such mesh dependence. In particular, we have implemented a discrete minimum order statistic model with properties that are theoretically mesh independent.

36 MATERIALS SCIENCE↗

Air Blast Mesh Sensitivity and Pressure Mapping Study

Nose cone structural and aerodynamic characteristics are essential for intelligent design of aircraft, spacecraft, and ballistic systems. Finite element analysis can be used to help understand the structural integrity and flight characteristics of different nose cones. A mesh sensitivity study was undertaken for a particular nose cone geometry that was used in tests at LANL facilities in order to confirm the integrity of the meshed geometry. A simple cone that best matched closed-form theoretical solutions was modeled, and received good correlation to the theory. Complexity was then added back to the nose cone. Parameters applied to the simple cone were then implemented in the nose cone geometry giving assurance of accuracy after the geometry was changed. Nose cone results averaged 6.3% error for radial displacement when compared with the theoretical. Hoop stress averaged 6.0% error and meridional stress averaged 5.7% error at the finest mesh level. Meshes showed signs of convergence when compared to all three theoretical solutions. Finally, pressure time-history data from LANL computational fluid dynamics simulations was applied to the surface of the final nose cone geometry. The pressure data was interpolated from pressure gauge locations onto nearby meshed elements, which allowed for FEA software to run simulations on the cone with the pressure data as a loading condition. The pressure mapping resulted in the ability to understand the nose cone’s rigid body motion that in turn can inform design of future nose cones.

42 ENGINEERING↗

Multi-Objective Adaptive Mesh Refinement Using Reinforcement Learning

Finite element methods approximate the solution to a partial differential equation (PDE) on a mesh consisting of many elements. In general, using more, smaller elements results in a lower error in the approximation. However, it is often possible to lower the error substantially by only refining, or decreasing the size of, the few elements in the mesh that have the highest error. Adaptive mesh refinement (AMR) is a process that selectively refines regions of a mesh with high error to achieve a desired accuracy in as few degrees of freedom (DOFs) as possible. AMR is favorable compared to uniform refinement, which refines all elements of the mesh equally, because it can often achieve the same accuracy without wasting extra computation time on refinement of elements that already have low error. However, it is difficult to know which elements to refine. In this report we explore ways to choose which elements to refine such that we minimize both the resulting error and the cumulative DOFs used in computation. In particular, we introduce a Pareto-front learning algorithm that trains a policy to give the optimal refinement actions to minimize the cumulative DOFs used to achieve a given target error. Such a policy is useful because it can be deployed on many different problem types where different accuracy levels are desired. Furthermore, training a single policy for a range of target errors allows us to use transfer learning to reduce the required training time.

97 MATHEMATICS AND COMPUTING↗

A Block-Structured Adaptive Mesh Framework to Solve Radiation Transfer Equation in Irregular Embedded Geometries

Radiation transport arises in various scientific, industrial, and medical fields, and understanding its effect in applications is needed to make accurate predictions, safety assessments and performance optimizations. Solving the Radiation Transport Equation (RTE) is challenging due to its integro-differential nature, which involves both differential and integral terms. The differential term describes the change in radiation intensity due to absorption and emission, while the integral term accounts for scattering. The accurate modeling of radiation is further complicated in many applications due to the complex, irregular geometries. Various methods exist for solving the RTE, including the zonal, Monte Carlo, spherical harmonics, discrete ordinates, and finite volume methods. Traditional mesh-based approaches, which rely on structured or unstructured meshes, struggle with irregular geometries due to: a) the difficulty of conforming structured grids to irregular domains, b) challenges in enforcing boundary conditions correctly, and c) the additional computational cost of unstructured mesh methods. This work presents a second-order accurate method for solving the RTE in irregular geometries. The radiation intensity is discretized using the finite-volume method in both spatial and angular directions on regular Cartesian grid blocks. Leveraging the block-structured adaptive mesh refinement (AMR) framework provided by AMReX, our method refines the grid locally to reduce spatial discretization error, ensuring a converged numerical solution while minimizing computational costs elsewhere. A two-stage deferred correction approach is employed: First, a first-order discretization on grid blocks is solved using an algebraic multigrid method in HYPRE. Second, a correction term is applied explicitly to achieve second-order accuracy. The correction term is calculated by approximating the radiation flux on cell faces using a Total Variation Diminishing (TVD) scheme. This approach ensures quick convergence of the multigrid method while preserving higher-order accuracy of the numerical solution. Irregular geometries are resolved as embedded boundaries (EB), resulting in both cut cells and regular cells. In cut cells, we modify the fluxes using face fractions and incorporate additional contributions from EB boundary conditions. To ensure higher-order convergence near the EB interface, the correction term is modified by interpolating the radiation intensity to fictitious ghost points. The implementation takes advantage of modern supercomputers by leveraging AMReX’sMPI/X parallelization strategy where X can be MPI or a GPU accelerator including CUDA, HIP and DPC++. We validate our solver using classical test cases, both with and without EB, demonstrating accuracy and efficiency. Additionally, we analyze the impact of adaptive mesh refinement on solution accuracy and computational cost, highlighting the advantages of our approach for high-resolution radiation transport simulations.

computational fluid dynamics (CFD)↗

DISCO: A 3D MOVING-MESH MAGNETOHYDRODYNAMICS CODE DESIGNED FOR THE STUDY OF ASTROPHYSICAL DISKS

This work presents the publicly available moving-mesh magnetohydrodynamics (MHD) code DISCO. DISCO is efficient and accurate at evolving orbital fluid motion in two and three dimensions, especially at high Mach numbers. DISCO employs a moving-mesh approach utilizing a dynamic cylindrical mesh that can shear azimuthally to follow the orbital motion of the gas. The moving mesh removes diffusive advection errors and allows for longer time-steps than a static grid. MHD is implemented in DISCO using an HLLD Riemann solver and a novel constrained transport (CT) scheme that is compatible with the mesh motion. DISCO is tested against a wide variety of problems, which are designed to test its stability, accuracy, and scalability. In addition, several MHD tests are performed which demonstrate the accuracy and stability of the new CT approach, including two tests of the magneto-rotational instability, one testing the linear growth rate and the other following the instability into the fully turbulent regime.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

ESCHER: An interactive mesh-generating editor for preparing finite-element input

ESCHER is an interactive mesh generation and editing program designed to help the user create a finite-element mesh, create additional input for finite-element analysis, including initial conditions, boundary conditions, and slidelines, and generate a NEUTRAL FILE that can be postprocessed for input into several finite-element codes, including ADINA, ADINAT, DYNA, NIKE, TSAAS, and ABUQUS. Two important ESCHER capabilities, interactive geometry creation and mesh archival storge are described in detail. Also described is the interactive command language and the use of interactive graphics. The archival storage and restart file is a modular, entity-based mesh data file. Modules of this file correspond to separate editing modes in the mesh editor, with data definition syntax preserved between the interactive commands and the archival storage file. Because ESCHER was expected to be highly interactive, extensive user documentation was provided in the form of an interactive HELP package.

Oakes, W. R., Jr.↗

Isoparametric 3-D Finite Element Mesh Generation Using Interactive Computer Graphics

An isoparametric 3-D finite element mesh generator was developed with direct interface to an interactive geometric modeler program called POLYGON. POLYGON defines the model geometry in terms of boundaries and mesh regions for the mesh generator. The mesh generator controls the mesh flow through the 2-dimensional spans of regions by using the topological data and defines the connectivity between regions. The program is menu driven and the user has a control of element density and biasing through the spans and can also apply boundary conditions, loads interactively.

Kayrak, C.↗

Box truss analysis and technology development. Task 1: Mesh analysis and control

An analytical tool was developed to model, analyze and predict RF performance of box truss antennas with reflective mesh surfaces. The analysis system is unique in that it integrates custom written programs for cord tied mesh surfaces, thereby drastically reducing the cost of analysis. The analysis system is capable of determining the RF performance of antennas under any type of manufacturing or operating environment by integrating together the various disciplines of design, finite element analysis, surface best fit analysis and RF analysis. The Integrated Mesh Analysis System consists of six separate programs: The Mesh Tie System Model Generator, The Loadcase Generator, The Model Optimizer, The Model Solver, The Surface Topography Solver and The RF Performance Solver. Additionally, a study using the mesh analysis system was performed to determine the effect of on orbit calibration, i.e., surface adjustment, on a typical box truss antenna.

Bachtell, E. E.↗

Flow structure capturing on overset patched meshes

The present paper describes the application of a simple, robust stable implicit approach to solutions of the conservative equations of gasdynamics on either composite or overset meshes to capture flow structures such as shocks with high resolution in complex geometric domains. Without requiring special flux conservative operators, but rather, interpolating conservative variable data at mesh boundaries, the well posed upwind method provides accurate and oscillation free solutions, even when shocks cross the interior patch boundaries. In three problems with flow complexities that require grid refinement, the paper demonstrates the capability to conveniently carry out for gasdynamics the adaptive refined meshing strategy in overset patches proposed by Berger and Oliger (1984), and it extends this technique to rapidly convergent implicit methods for the Euler and Navier-Stokes equations. The numerical experiments show concretely, in a realistic aerodynamic problem, the savings in mesh points (about an order of magnitude here in two dimensions) for similar accuracy that flow structure aligned adaptive patched meshing affords compared to uniform grid refinement.

Venkatapathy, E.↗

Approaches to the automatic generation and control of finite element meshes

The algorithmic approaches being taken to the development of finite element mesh generators capable of automatically discretizing general domains without the need for user intervention are discussed. It is demonstrated that because of the modeling demands placed on a automatic mesh generator, all the approaches taken to date produce unstructured meshes. Consideration is also given to both a priori and a posteriori mesh control devices for automatic mesh generators as well as their integration with geometric modeling and adaptive analysis procedures.

Shephard, Mark S.↗

Mesh surfaces for reflector applications

The topics of mesh reflectors, methods of analysis, measurements, problems of current interest, and future research, are those which should be addressed in assessing the current state of metallic mesh technology for spaceborne reflector antennas. The study of the properties of the conducting mesh material is discussed. To calculate the radiation patterns of antennas with conducting mesh reflectors, the electromagnetic properties of the mesh material must be integrated into an appropriate reflector antenna computer code. Such a code would take into account such factors as the curvature of the reflector surface, the radiation pattern(s) of the feed(s), etc. Many organizations have developed their own codes for these calculations. An excellent example of such a code is the one developed by Rahmat-Samii and Lee.

Kauffman, Frank↗

Turbulent flow calculations using unstructured and adaptive meshes

A method of efficiently computing turbulent compressible flow over complex two dimensional configurations is presented. The method makes use of fully unstructured meshes throughout the entire flow-field, thus enabling the treatment of arbitrarily complex geometries and the use of adaptive meshing techniques throughout both viscous and inviscid regions of flow-field. Mesh generation is based on a locally mapped Delaunay technique in order to generate unstructured meshes with highly-stretched elements in the viscous regions. The flow equations are discretized using a finite element Navier-Stokes solver, and rapid convergence to steady-state is achieved using an unstructured multigrid algorithm. Turbulence modeling is performed using an inexpensive algebraic model, implemented for use on unstructured and adaptive meshes. Compressible turbulent flow solutions about multiple-element airfoil geometries are computed and compared with experimental data.

Mavriplis, Dimitri J.↗

Numerical aspects of computing high Reynolds number flows on unstructured meshes

An edge-data structure describing a mesh edge-wise given the vertices of each edge and neighboring cell information is used developing algorithms for the Navier-Stokes equations on triangular meshes. Edge formulas for the Galerkin and finite-element discretization of gradient, divergence, Hessian, and Laplacian operators are derived. A simple edge formula is derived for the discretization of the Laplacian operator, where precise theoretical conditions for a discrete maximum principle can be ascertained. Practical issues associated with solving the Navier-Stokes equations on unstructured meshes are addressed, along with issues concerning the generation of highly stretched triangular meshes and the modeling of turbulence on unstructured meshes. A turbulence modeling strategy is proposed, and numerical results for a high-Reynolds-number flow about single- and multielement airfoils are discussed.

Barth, Timothy J.↗

An adaptively-refined Cartesian mesh solver for the Euler equations

A method for adaptive refinement of a Cartesian mesh for the solution of the steady Euler equations is presented. The algorithm creates an initial uniform mesh and cuts the body out of that mesh. The mesh is then refined based on body curvature. Next, the solution is converged to a steady state using a linear reconstruction and Roe's approximate Riemann solver. Solution-adaptive refinement of the mesh is then applied to resolve high-gradient regions of the flow. The numerical results presented show the flexibility of this approach and the accuracy attainable by solution-based refinement.

De Zeeuw, Darren↗