Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Geometry meshing”

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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Adaptive Hybridizable Discontinuous Galerkin discretization of the Grad–Shafranov equation by extension from polygonal subdomains

In this work, we propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modeling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved domains with piecewise smooth curved boundaries that may present corners. The solution method we present is based on the hybridizable discontinuous Galerkin method and sidesteps the need for geometry-conforming triangulations thanks to a transfer technique that allows to approximate the solution using only a polygonal subset as computational domain. Moreover, the solver features automatic mesh refinement driven by a residual-based a posteriori error estimator. As the mesh is locally refined, the computational domain is automatically updated in order to always maintain the distance between the actual boundary and the computational boundary of the order of the local mesh diameter. Numerical evidence is presented of the suitability of the estimator as an approximate error measure for physically relevant equilibria with pressure pedestals, internal transport barriers, and current holes on realistic geometries.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

DIF3D-VARIANT 12.0: Updates and New Features

The DIF3D code has been a workhorse of fast reactor analysis work at Argonne National Laboratory for over 40 years. In 1995, a transport option called VARIANT was added to DIF3D to improve the flux solutions for fast reactor problems which we term DIF3D-VARIANT today. DIF3D-VARIANT performs nodal neutron transport calculations using P N or SP N theory in Cartesian and hexagonal two- and three-dimensional geometries. The limited computing capabilities of the time restricted DIF3D-VARIANT to use at most a 6 th order spatial approximation combined with a P3 flux approximation and P1 scattering kernel for a 33 group structure on most studied reactor problems. Computer capabilities have increased steadily since 1995 and today much larger space-angle-energy approximations are possible. This manuscript serves as an update to the theory section of the original DIF3D-VARIANT manual and details more than twenty years of changes made to DIF3D to make version 12 which was released on November 1 st , 2024. The primary focus of the initial work was to extend the space-angle approximations available in DIF3D-VARIANT such that the error due to transport approximations could be better understood. This work was started and completed in 2002 and marked the official version 10. Unfortunately, those higher order approximations could not be used at that time due to the memory constraints of the BPOINTER part of DIF3D (limited to 2 GB). In version 11, completed in 2012, BPOINTER was circumvented in DIF3D-VARIANT for the largest arrays by introducing a Fortran 90 module called LMA (Large Memory Array). This seamlessly replaces all of the functionality of the BPOINTER concept, but it allows 64 bit addressing for every array such that they can be larger than 2 GB. It is now common for DIF3D-VARIANT jobs to consume 50 GB of memory on modern workstations when using high order space-angle approximations and a large number of groups. Many improvements were made to version 11 from 2012 to 2022 when work to create version 12 started. For version 12, several parts of DIF3D were updated to improve performance and thread parallelism was introduced to further reduce the runtime. Numerous minor bugs were discovered in DIF3D-VARIANT as part of the process of creating the perturbation and sensitivity code PERSENT. All of these algorithmic problems were identified in the transition from version 10 to version 11 which prevented DIF3D-VARIANT from running efficiently and reliably. Firstly, the coarse mesh rebalance scheme would routinely diverge and a study detailed in this report demonstrates how it was also typically not effective. This is not a failure of the coarse mesh rebalance methodology, but a failure of its implementation in DIF3D-VARIANT for hexagonal geometries. The fission source extrapolation algorithm was also found to be unreliable on larger group structure problems, leading to divergence in some cases and a negligible improvement in performance overall. Finally, the “Omega” acceleration applied to the partial current solver routine of DIF3D-VARIANT was found to cause DIF3D-VARIANT to converge to the wrong answer. To resolve these issues, both the coarse mesh rebalance and fission source extrapolation were permanently disabled in version 11. The Tchebychev acceleration was put in as a temporary reliable alternative but it is generally inferior to coarse mesh rebalance or coarse mesh finite difference. For the Omega acceleration, the factor was restricted to guarantee that it would not cause follow-on errors in PERSENT. Due to limited funding to support maintenance and development of DIF3D in the last 10 years, no effort was spent since to resolve the outer iteration acceleration. Except for the threading work, all of the changes discussed in this manuscript refer to changes made between version 10 and version 11. Performance comparisons are done to demonstrate the improvements from version 9 to version 12. As will be demonstrated, the updated versi

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2013

The spectral green's function nodal method for multigroup slab-geometry fixed-source S{sub N} problems with anisotropic scattering

A generalization of the spectral Green's function (SGF) method is developed for multigroup, fixed-source, slab-geometry discrete ordinates (S{sub N}) problems with anisotropic scattering. The offered SGF method with the one-node block inversion (NBI) iterative scheme converges numerical solutions that are completely free from spatial truncation errors for multigroup slab-geometry S{sub N} problems with scattering anisotropy of order L, provided L < N. As a coarse-mesh numerical method, the SGF method generates numerical solutions that generally do not give detailed information on the problem solution profile, as the grid points can be located considerably away from each other. Therefore, presented here is a technique for the spatial reconstruction of the coarse-mesh solution generated by the multigroup SGF method. Numerical results are given to illustrate the method's accuracy. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Mesh objective stochastic simulations of quasibrittle fracture

Continuum finite element (FE) modeling of damage and failure of quasibrittle structures suffers from the spurious mesh sensitivity due to strain localization. Here this issue has been addressed for deterministic analysis through the development of localization limiters. Here this study proposes a mechanism-based model to mitigate the mesh sensitivity in stochastic FE simulations of quasibrittle fracture. The interest is placed on the analysis of large-size structures, where the mesh size is conveniently chosen to be larger than the width of the fracture process zone as well as the correlation length of the random fields of constitutive properties. The present model is formulated within the framework of continuum damage mechanics. Two localization parameters are introduced to describe the evolution of the damage pattern of each finite element. These parameters are used to guide the energy regularization of the constitutive law, as well as to formulate the mesh-dependent probability distributions of constitutive properties. Depending on the prevailing damage pattern, different energy regularization schemes and mesh dependence of the probability distribution functions are used in the constitutive law. The model is applied to simulate the stochastic failure behavior of quasibrittle structures of different geometries featuring different failure processes including damage initiation, localization, and propagation. It is shown that using fixed probability distribution functions of constitutive properties could lead to strong mesh dependence of the prediction of the mean and variance of the structural load capacity. The probability distribution functions of constitutive properties must be linked to the damage pattern, which may evolve during the failure process. Such a mechanism-based modeling of the probability distributions of constitutive properties is essential for mitigating the spurious mesh sensitivity in stochastic FE analysis of quasibrittle fracture.

42 ENGINEERING↗
DOE OSTI2022

Watershed Workflow: A toolset for parameterizing data-intensive, integrated hydrologic models

Integrated, distributed hydrologic models leverage advances in computational power and data accessibility to improve predictive understanding of the water cycle. While impressive advances in this area of environmental modeling have been accomplished, such models are still rarely used, partially because of difficulty integrating model and data. This research describes the release of Watershed Workflow version 1.2, a new library aiming to automate and enable complex workflows defining inputs to high resolution, integrated, distributed hydrologic models. Watershed Workflow provides tools enabling the discovery, acquisition, mapping, and coordination of watershed geometry, land cover, soil properties, and meteorological data. It enables the construction of unstructured meshes that incorporate this data, and provides tools for automating a “first” simulation on any watershed in the United States. We present the design of the workflow tool, and describe best practices for its usage, culminating in a final example from watershed specification to simulation at the Coweeta Hydrologic Laboratory.

Integrated hydrologic modeling↗
DOE OSTI2022

Neural network–based pore flow field prediction in porous media using super resolution

Direct pore-scale simulations of fluid flow through porous media are computationally expensive to perform for realistic systems. Previous works have demonstrated using the geometry of the microstructure of porous media to predict the velocity fields therein based on neural networks. However, such trained neural networks do not perform well for unseen porous media with a large degree of heterogeneity. In this study we propose that incorporating a coarse velocity field in the input of neural networks is an effective way to improve the prediction performance. The coarse velocity field can be simulated with a low computational cost and provides global information to regularize the ill-posedness of the learning problem, which is usually caused by the use of local geometries due to the computational resource constraints. We show that incorporating the coarse-mesh velocity field significantly improves the prediction accuracy of the fine-mesh velocity field by comparison to the prediction that relies on geometric information alone, especially for the porous medium with a large interior vuggy pore space. We also show the flexibility of training the network in using coarse velocity fields with various resolutions. The results suggest that even using coarse velocity field with a very low resolution, the predictions are still enhanced and close to the ground truths. The feasibility of the method is further demonstrated by testing the trained network on real rocks. This study highlights the merits of incorporating a coarse-mesh velocity field into the input for neural networks, which provides global, physics-based information for the model, thereby improving the model's generalization capability.

42 ENGINEERING↗
DOE OSTI2020

pnnl/pyraabe

Automated Raabe table generationPyRaabe is a Python package to automate Raabe table -- a graph representation of airway geometry -- generation from a triangulated surface of an airway geometry. With a single command, it extracts a centerline from an input 3D surface mesh and subsequently computes the relevant attributes for the Raabe table, including length, diameter, bifurcation angle, and gravity angle. These can be used to inform downstream models, such as the Multiple-Path Particle Dosimetry (MPPD) model.

Colby, Sean M.↗
DOE OSTI2025

Stability and convergence of nuclear detonations in white dwarf collisions

We investigate the numerical stability of thermonuclear detonations in 1D accelerated reactive shocks and 2D binary collisions of equal-mass magnetized and unmagnetized white dwarf stars. To achieve high resolution at initiation sites, we devised geometric gridding and mesh velocity strategies specially adapted to the unique requirements of head-on collisional geometries, scenarios in which one expects maximum production of iron-group products. We study the effects of grid resolution and the limiting of temperature, energy, and reactants for different stellar masses, separations, magnetic fields, inigenerationtial compositions, detonation mechanisms, and limiter parameters across a range of cell sizes from 1 to 100 km. Our results set bounds on the parameter space of limiter amplitudes for which both temperature- and energy-limiting procedures yield consistent and monotonically convergent solutions. Within these bounds, we find that grid resolutions of 5 km or better are necessary for uncertainties in total released energy and iron-group products to drop below 10%. Intermediate-mass products (e.g., calcium) exhibit similar convergence trends but with somewhat greater uncertainty. These conclusions apply equally to pure C/O white dwarfs, multispecies compositions (including helium shells), magnetized and unmagnetized cores, and either single or multiple detonation scenarios.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1983

A basis for the analysis of surface geometry of spiral bevel gears

Geometrical procedures helpful in the fundamental studies of the surface geometry of spiral bevel gears are summarized. These procedures are based upon: (1) fundamental gear geometry and kinematics as exposited by Buckingham, et al; (2) formulas developed from differential geometry; and (3) geometrical concepts developed in recent papers and reports on spiral bevel gear surface geometry. Procedures which characterize the geometry so that the surface parametric equations, the principal radii of curvature, and the meshing kinematics are systematically determined are emphasized. Initially, the focus in on theoretical, logarithmic spiral bevel gears as defined by Buckingham. The gears, however, are difficult to fabricate and are sometimes considered to be too straight. Circular-cut spiral bevel gears are an alternative to this. Surface characteristics of crown circular cut gears are analyzed.

Huston, R. L.↗
NASA NTRS2011

Parametric Modeling in the CAE Process: Creating a Family of Models

This Presentation meant as an example - Give ideas of approaches to use - The significant benefit of PARAMETRIC geometry based modeling The importance of planning before you build Showcase some NX capabilities - Mesh Controls - Associativity - Divide Face - Offset Surface Reminder - This only had to be done once! - Can be used for any cabinet in that "family" Saves a lot of time if pre-planned Allows re-use in the future

Brown, Christopher J.↗
NASA NTRS2015

Multi-Resolution Unstructured Grid-Generation for Geophysical Applications on the Sphere

An algorithm for the generation of non-uniform unstructured grids on ellipsoidal geometries is described. This technique is designed to generate high quality triangular and polygonal meshes appropriate for general circulation modelling on the sphere, including applications to atmospheric and ocean simulation, and numerical weather predication. Using a recently developed Frontal-Delaunay-refinement technique, a method for the construction of high-quality unstructured ellipsoidal Delaunay triangulations is introduced. A dual polygonal grid, derived from the associated Voronoi diagram, is also optionally generated as a by-product. Compared to existing techniques, it is shown that the Frontal-Delaunay approach typically produces grids with near-optimal element quality and smooth grading characteristics, while imposing relatively low computational expense. Initial results are presented for a selection of uniform and non-uniform ellipsoidal grids appropriate for large-scale geophysical applications. The use of user-defined mesh-sizing functions to generate smoothly graded, non-uniform grids is discussed.

Weather↗
DOE OSTI2013

Fast mix table construction for material discretization

An effective hybrid Monte Carlo-deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a 'mix table,' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in O(number of voxels x log number of mixtures) time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation. (authors)

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

Fast Mix Table Construction for Material Discretization

An effective hybrid Monte Carlo--deterministic implementation typically requires the approximation of a continuous geometry description with a discretized piecewise-constant material field. The inherent geometry discretization error can be reduced somewhat by using material mixing, where multiple materials inside a discrete mesh voxel are homogenized. Material mixing requires the construction of a ``mix table,'' which stores the volume fractions in every mixture so that multiple voxels with similar compositions can reference the same mixture. Mix table construction is a potentially expensive serial operation for large problems with many materials and voxels. We formulate an efficient algorithm to construct a sparse mix table in $O(\text{number of voxels}\times \log \text{number of mixtures})$ time. The new algorithm is implemented in ADVANTG and used to discretize continuous geometries onto a structured Cartesian grid. When applied to an end-of-life MCNP model of the High Flux Isotope Reactor with 270 distinct materials, the new method improves the material mixing time by a factor of 100 compared to a naive mix table implementation.

Johnson, Seth R↗
DOE OSTI2016

Gyrokinetic particle simulation of a field reversed configuration

Gyrokinetic particle simulation of the field-reversed configuration (FRC) has been developed using the gyrokinetic toroidal code (GTC). The magnetohydrodynamic equilibrium is mapped from cylindrical coordinates to Boozer coordinates for the FRC core and scrape-off layer (SOL), respectively. A field-aligned mesh is constructed for solving self-consistent electric fields using a semi-spectral solver in a partial torus FRC geometry. This new simulation capability has been successfully verified and driftwave instability in the FRC has been studied using the gyrokinetic simulation for the first time. Initial GTC simulations find that in the FRC core, the ion-scale driftwave is stabilized by the large ion gyroradius. In the SOL, the driftwave is unstable on both ion and electron scales.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

PROTEUS-MOC User Manual

The PROTEUS-MOC code is a three-dimensional (3D) neutron transport code based on the finite element mesh and the method of characteristics (MOC) which combines a 2D MOC with the discontinuous Galerkin finite element method for the axial direction. Thus, for PROTEUS-MOC, a 3D geometry is represented with by the implicit extrusion of a single 2D planar geometry with different material assignments allowable on each plane. The code requires four input files for a steady-state calculation without the thermal feedback: a driver input, a mesh input, a cross section input, and a material assignment input. With thermal feedback, a T/H input file is needed. For kinetics, a kinetics driver input file is required. The PROTEUS-MOC software produces a text output file as well as a data file which includes integral and average quantities such on fluxes, powers, temperatures, densities, etc. The detailed output file can be converted to the VTK format using the post processing code so that the outputs can be visualized using a visualization software such as VisIt.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

Validation of Actuator Disk, Actuator Line and Sliding Mesh Methods within the LAVA Solver

In this study the implementation of actuator-disk, actuator-line and sliding-mesh methodologies in the Launch Ascent and Vehicle Aerodynamics (LAVA) solver is described and validated against several test-cases. The different models are validated against available numerical as well as experimental data. Both steady and unsteady Reynolds-Averaged Navier-Stokes (RANS) simulations using the Spallart Allmaras (SA) turbulence model are performed for several different configurations representative of aeroscience applications. The first part of the paper is focused on the verification and validation of the implemented propulsor models. The first validation case is a theoretical rotor in hover, compared with the 1D analytical solution derived from momentum theory. The second validation is the Rotor-Airframe Interaction Model of Georgia Institute of Technology (GIT), representing the application of actuator disks to top-mounted rotorcraft vehicles or unmanned aerial vehicles (UAVs). The third case is a representative configuration for tip-mounted rotor-craft vehicles such as NASA’s X57 airplane. The second part of the paper shows the implemented models applied to realistic engineering configurations such as NASA’s X57 airplane and the R4 Advanced Ducted Propellor (ADT). A modification to the actuator line method in order to represent the blade geometry more closely is proposed and comparisons with simulations modeling the blade utilizing a sliding-mesh approach are made.

ARMD↗
DOE OSTI2018

Algorithmic Improvements to MCNP5 for High-Resolution Fusion Neutronics Analyses

Neutronics analyses of the ITER experimental fusion reactor rely on increasingly complex geometry models and estimates of energy-dependent neutron flux and radiation dose-rate distributions generated at ever higher resolutions. There are significant practical challenges with applying the Monte Carlo N-Particle (MCNP) continuous-energy transport code to high-resolution analyses. For models consisting of more than 100 000 surfaces and cells, geometry initialization can take several hours, thus slowing down model integration and transport analysis efforts. In multithreaded simulations, the amount of memory consumed by superimposed mesh tally data increases in proportion to the number of threads. This behavior limits either the tally resolution or the number of processor cores that can be utilized in the simulation. This paper describes algorithmic improvements that were implemented in a modified version of MCNP5 to overcome these limitations. These improvements are referred to as the Oak Ridge National Laboratory Transformative Neutronics (ORNL-TN) upgrade. Here, a comparison of the performance and memory usage of both MCNP5 and ORNL-TN on several relevant fusion neutronics models is presented. In these tests and in actual high-resolution neutronics analyses, ORNL-TN reduces geometry processing times from hours to a few seconds and increases in-memory mesh tally capacity from the order of 10 8 to 10 10 space-energy bins.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1989

Detection of edges using local geometry

Researchers described a new representation, the local geometry, for early visual processing which is motivated by results from biological vision. This representation is richer than is often used in image processing. It extracts more of the local structure available at each pixel in the image by using receptive fields that can be continuously rotated and that go to third order spatial variation. Early visual processing algorithms such as edge detectors and ridge detectors can be written in terms of various local geometries and are computationally tractable. For example, Canny's edge detector has been implemented in terms of a local geometry of order two, and a ridge detector in terms of a local geometry of order three. The edge detector in local geometry was applied to synthetic and real images and it was shown using simple interpolation schemes that sufficient information is available to locate edges with sub-pixel accuracy (to a resolution increase of at least a factor of five). This is reasonable even for noisy images because the local geometry fits a smooth surface - the Taylor series - to the discrete image data. Only local processing was used in the implementation so it can readily be implemented on parallel mesh machines such as the MPP. Researchers expect that other early visual algorithms, such as region growing, inflection point detection, and segmentation can also be implemented in terms of the local geometry and will provide sufficiently rich and robust representations for subsequent visual processing.

Gualtieri, J. A.↗