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,261 records · Page 70

Implementation of Krylov acceleration method for 3D S{sub N} transport code AETIUS with unstructured tetrahedral mesh - 25557

We have been developing an in-house deterministic neutron and gamma transport solver, AETIUS (An Easy modeling Transport code using Unstructured tetrahedral mesh, Shared memory parallel). To achieve fast results, BiCGStab (one of the Krylov acceleration methods) was implemented as a within-group iteration solver. In this paper, two test problems (simple double cube problem and helical tube in the outer cube problem) were used to verify the acceleration performance. The number of iterations and the calculation time were demonstrated and compared with the source iteration. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Transient MOC with frequency transform and DSA on unstructured mesh

We present an implementation of the transient method of characteristics (MOC) with isotropic time derivatives, accelerated by diffusion synthetic acceleration (DSA). The fully implicit frequency transform method is used to solve the transient problem with analytic precursor integration. The code works on meshes composed of almost any of the commonly used non-curvilinear finite element types, and can handle the deformation of geometry in time-dependent transport calculations. We present results of a continuous Fourier analysis for the transient multigroup DSA problem, and representative benchmarking results are presented for the C5G7-TD benchmark in 2D showing reasonable performance and agreement compared to other codes. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

The Study of Lightbridge Metallic Fuel Rods in MOOSE for Meshing Capabilities and Studying Lightbridge Metallic Fuel Rods with MOOSE

Supporting INL’s mission to transform our nation’s energy future, notably through innovative nuclear energy solutions, this project focuses on modeling accidental tolerant fuel. In collaboration with MIT, we modeled with MOOSE-based tools the Lightbridge metallic fuel design. Lightbridge fuel is envisioned to enable higher power output and larger safety margins for both current and advanced nuclear reactors. We present here the advanced meshing capabilities developed and preliminary physics results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Visualization of Scalar Adaptive Mesh Refinement Data

Adaptive Mesh Refinement (AMR) is a highly effective computation method for simulations that span a large range of spatiotemporal scales, such as astrophysical simulations, which must accommodate ranges from interstellar to sub-planetary. Most mainstream visualization tools still lack support for AMR grids as a first class data type and AMR code teams use custom built applications for AMR visualization. The Department of Energy's (DOE's) Science Discovery through Advanced Computing (SciDAC) Visualization and Analytics Center for Enabling Technologies (VACET) is currently working on extending VisIt, which is an open source visualization tool that accommodates AMR as a first-class data type. These efforts will bridge the gap between general-purpose visualization applications and highly specialized AMR visual analysis applications. Here, we give an overview of the state of the art in AMR scalar data visualization research.

42 ENGINEERING↗

Parallel Computation of Three-Dimensional Flows using Overlapping Grids with Adaptive Mesh Refinement

This paper describes an approach for the numerical solution of time-dependent partial differential equations in complex three-dimensional domains. The domains are represented by overlapping structured grids, and block-structured adaptive mesh refinement (AMR) is employed to locally increase the grid resolution. In addition, the numerical method is implemented on parallel distributed-memory computers using a domain-decomposition approach. The implementation is flexible so that each base grid within the overlapping grid structure and its associated refinement grids can be independently partitioned over a chosen set of processors. A modified bin-packing algorithm is used to specify the partition for each grid so that the computational work is evenly distributed amongst the processors. All components of the AMR algorithm such as error estimation, regridding, and interpolation are performed in parallel. The parallel time-stepping algorithm is illustrated for initial-boundary-value problems involving a linear advection-diffusion equation and the (nonlinear) reactive Euler equations. Numerical results are presented for both equations to demonstrate the accuracy and correctness of the parallel approach. Exact solutions of the advection-diffusion equation are constructed, and these are used to check the corresponding numerical solutions for a variety of tests involving different overlapping grids, different numbers of refinement levels and refinement ratios, and different numbers of processors. The problem of planar shock diffraction by a sphere is considered as an illustration of the numerical approach for the Euler equations, and a problem involving the initiation of a detonation from a hot spot in a T-shaped pipe is considered to demonstrate the numerical approach for the reactive case. For both problems, the solutions are shown to be well resolved on the finest grid. The parallel performance of the approach is examined in detail for the shock diffraction problem.

42 ENGINEERING↗

Enhancements to the Combinatorial Geometry Particle Tracker in the Mercury Monte Carlo Transport Code: Embedded Meshes and Domain Decomposition

Two enhancements to the combinatorial geometry (CG) particle tracker in the Mercury Monte Carlo transport code are presented. The first enhancement is a hybrid particle tracker wherein a mesh region is embedded within a CG region. This method permits efficient calculations of problems with contain both large-scale heterogeneous and homogeneous regions. The second enhancement relates to the addition of parallelism within the CG tracker via spatial domain decomposition. This permits calculations of problems with a large degree of geometric complexity, which are not possible through particle parallelism alone. In this method, the cells are decomposed across processors and a particles is communicated to an adjacent processor when it tracks to an interprocessor boundary. Applications that demonstrate the efficacy of these new methods are presented.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data

The visualization and analysis of AMR-based simulations is integral to the process of obtaining new insight in scientific research. We present a new method for performing query-driven visualization and analysis on AMR data, with specific emphasis on time-varying AMR data. Our work introduces a new method that directly addresses the dynamic spatial and temporal properties of AMR grids which challenge many existing visualization techniques. Further, we present the first implementation of query-driven visualization on the GPU that uses a GPU-based indexing structure to both answer queries and efficiently utilize GPU memory. We apply our method to two different science domains to demonstrate its broad applicability.

97 MATHEMATICS AND COMPUTING↗

Monotonicity conditions in the nodal mimetic finite difference method for diffusion problems on quadrilateral meshes

A set of sufficient and necessary conditions for the local stiffness matrix of the nodal mimetic finite difference method on quadrilaterals is derived under which such matrix is a singular M-matrix. These conditions are directly related to the shape of the quadrilaterals and to the value of the off-diagonal elements and they are illustrated by the new concept, here introduced, of monotonicity region. When such conditions are satisfied, the global matrix for the Poisson problem with Dirichlet boundary conditions is a singular M-matrix. After setting the boundary condition, yields a monotone matrix operator and we prove that the final discretization possesses a Discrete Maximum Principle.

97 MATHEMATICS AND COMPUTING↗

Compressing unstructured mesh data from simulations using machine learning

The amount of data output from a computer simulation has grown to terabytes and petabytes as increasingly complex simulations are being run on massively parallel systems. As we approach exaflop computing in the next decade, it is expected that the I/O subsystem will not be able to write out these large volumes of data. In this paper, we explore the use of machine learning to compress the data before it is written out. Despite the computational constraints that limit us to using very simple learning algorithms, our results show that machine learning is a viable option for compressing unstructured data. Furthermore, we demonstrate that by simply using a better sampling algorithm to generate the training set, we can obtain more accurate results compared to random sampling, but at no extra cost. Further, by carefully selecting and incorporating points with high prediction error, we can improve reconstruction accuracy without sacrificing the compression rate.

97 MATHEMATICS AND COMPUTING↗