Search NASA⌕ Search

SEARCH · Search NASA

Results for “Cartesian 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 145 records · Page 8

A conservative implicit-PIC scheme for the hybrid kinetic-ion fluid-electron plasma model on curvilinear meshes

We report that the hybrid kinetic-ion fluid-electron plasma model is widely used to study challenging multi-scale problems in space and laboratory plasma physics. Here, a novel conservative scheme for this model employing implicit particle-in-cell techniques is extended to arbitrary coordinate systems via curvilinear maps from logical to physical space. The scheme features a fully non-linear electromagnetic formulation with a multi-rate time advance - including sub-cycling and orbit-averaging for the kinetic ions. By careful choice of compatible particle-based kinetic-ion and mesh-based fluid-electron discretizations in curvilinear coordinates, as well as particle-mesh interpolations and implicit midpoint time advance, the scheme is proven to conserve total energy for arbitrary curvilinear meshes. In the electrostatic limit, the method is also proven to conserve total momentum for arbitrary curvilinear meshes. Although momentum is not conserved for arbitrary curvilinear meshes in the electromagnetic case, it is for an important subset of Cartesian tensor-packed meshes. The scheme and its novel conservation properties are demonstrated for several challenging numerical problems using different curvilinear meshes, including a merging flux-rope simulation for a space weather application, and a helical m = 1 mode simulation for magnetic fusion energy application.

97 MATHEMATICS AND COMPUTING↗

TaskAMR

TaskAMR is a Cartesian Block Adaptive Mesh Refinement (AMR) code, written using the Regent/Legion parallel programming system, that solves Finite Volume calculations. We provide implementations for linear advection and gas dynamics.

Pietarila, Jonathan↗

On the Use of Parmetric-CAD Systems and Cartesian Methods for Aerodynamic Design

Automated, high-fidelity tools for aerodynamic design face critical issues in attempting to optimize real-life geometry arid in permitting radical design changes. Success in these areas promises not only significantly shorter design- cycle times, but also superior and unconventional designs. To address these issues, we investigate the use of a parmetric-CAD system in conjunction with an embedded-boundary Cartesian method. Our goal is to combine the modeling capabilities of feature-based CAD with the robustness and flexibility of component-based Cartesian volume-mesh generation for complex geometry problems. We present the development of an automated optimization frame-work with a focus on the deployment of such a CAD-based design approach in a heterogeneous parallel computing environment.

Nemec, Marian↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

An electrostatic Particle-In-Cell code on multi-block structured meshes

We present an electrostatic Particle-In-Cell (PIC) code on multi-block, locally structured, curvilinear meshes called Curvilinear PIC (CPIC). Multi-block meshes are essential to capture complex geometries accurately and with good mesh quality, something that would not be possible with single-block structured meshes that are often used in PIC and for which CPIC was initially developed. In spite of the structured nature of the individual blocks, multi-block meshes resemble unstructured meshes in a global sense and introduce several new challenges, such as the presence of discontinuities in the mesh properties and coordinate orientation changes across adjacent blocks, and polyjunction points where an arbitrary number of blocks meet. In CPIC, these challenges have been met by an approach that features: (1) a curvilinear formulation of the PIC method: each mesh block is mapped from the physical space, where the mesh is curvilinear and arbitrarily distorted, to the logical space, where the mesh is uniform and Cartesian on the unit cube; (2) a mimetic discretization of Poisson's equation suitable for multi-block meshes; and (3) a hybrid (logical-space position/physical-space velocity), asynchronous particle mover that mitigates the performance degradation created by the necessity to track particles as they move across blocks. The numerical accuracy of CPIC was verified using two standard plasma–material interaction tests, which demonstrate good agreement with the corresponding analytic solutions. And compared to PIC codes on unstructured meshes, which have also been used for their flexibility in handling complex geometries but whose performance suffers from issues associated with data locality and indirect data access patterns, PIC codes on multi-block structured meshes may offer the best compromise for capturing complex geometries while also maintaining solution accuracy and computational efficiency.

36 MATERIALS SCIENCE↗

Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design variables such as the free stream parameters and the planform shape of an isolated wing. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Factors under consideration include the computation of mesh sensitivities that provide a reliable approximation of the objective function gradient, as well as the computation of surface shape sensitivities based on a direct-CAD interface. We present detailed gradient verification studies and then focus on a shape optimization problem for an Apollo-like reentry vehicle. The goal of the optimization is to enhance the lift-to-drag ratio of the capsule by modifying the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design.

Nemec, Marian↗

Physics demonstration and verification of MOOSE framework reactor module meshing capabilities

The recently developed Reactor module in the open-source MOOSE framework includes finite element meshing capabilities for analysis of common reactor geometries. Capabilities in the Reactor module have been employed to generate meshes for physics applications including a sodium-cooled fast reactor core analysis using Griffin, a fast reactor assembly thermal deformation analysis using MOOSE Tensor Mechanics, and a heat-pipe cooled microreactor coupled analysis using Griffin, Bison, and Sockeye. The process to build these meshes using MOOSE's meshing capabilities is described. Physics simulation results using MOOSE-based meshes have been verified to match results which leverage external meshing software such as Cubit or Argonne's Mesh Tools. MOOSE's Reactor module provides significant advantages compared to the use of external meshing tools when analyzing Cartesian and hexagonal reactor lattices using MOOSE-based applications: accessibility to the end user, low barrier to entry for new users, speed of mesh generation, volume preservation of meshed fuel pins, and simplification of analysis workflow when using MOOSE applications.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Extension of the Time-Spectral Approach to Overset Solvers for Arbitrary Motion

Forced periodic flows arise in a broad range of aerodynamic applications such as rotorcraft, turbomachinery, and flapping wing configurations. Standard practice involves solving the unsteady flow equations forward in time until the initial transient exits the domain and a statistically stationary flow is achieved. It is often required to simulate through several periods to remove the initial transient making unsteady design optimization prohibitively expensive for most realistic problems. An effort to reduce the computational cost of these calculations led to the development of the Harmonic Balance method [1, 2] which capitalizes on the periodic nature of the solution. The approach exploits the fact that forced temporally periodic flow, while varying in the time domain, is invariant in the frequency domain. Expanding the temporal variation at each spatial node into a Fourier series transforms the unsteady governing equations into a steady set of equations in integer harmonics that can be tackled with the acceleration techniques afforded to steady-state flow solvers. Other similar approaches, such as the Nonlinear Frequency Domain [3,4,5], Reduced Frequency [6] and Time-Spectral [7, 8, 9] methods, were developed shortly thereafter. Additionally, adjoint-based optimization techniques can be applied [10, 11] as well as frequency-adaptive methods [12, 13, 14] to provide even more flexibility to the method. The Fourier temporal basis functions imply spectral convergence as the number of harmonic modes, and correspondingly number of time samples, N, is increased. Some elect to solve the equations in the frequency domain directly, while others choose to transform the equations back into the time domain to simplify the process of adding this capability to existing solvers, but each harnesses the underlying steady solution in the frequency domain. These temporal projection methods will herein be collectively referred to as Time-Spectral methods. Time-Spectral methods have demonstrated marked success in reducing the computational costs associated with simulating periodic forced flows, but have yet to be fully applied to overset or Cartesian solvers for arbitrary motion with dynamic hole-cutting. Overset and Cartesian grid methodologies are versatile techniques capable of handling complex geometry configurations in practical engineering applications, and the combination of the Time-Spectral approach with this general capability potentially provides an enabling new design and analysis tool. In an arbitrary moving-body scenario for these approaches, a Lagrangian body moves through a fixed Eulerian mesh and mesh points in the Eulerian mesh interior to the solid body are removed (cut or blanked), leaving a hole in the Eulerian mesh. During the dynamic motion some gridpoints in the domain are blanked and do not have a complete set of time-samples preventing a direct implementation of the Time-Spectral method. Murman[6] demonstrated the Time-Spectral approach for a Cartesian solver with a rigid domain motion, wherein the hole cutting remains constant. Similarly, Custer et al. [15, 16] used the NASA overset OVERFLOW solver and limited the amount of relative motion to ensure static hole-cutting and interpolation. Recently, Mavriplis and Mundis[17] demonstrated a qualitative method for applying the Time-Spectral approach to an unstructured overset solver for arbitrary motion. The goal of the current work is to develop a robust and general method for handling arbitrary motion with the Time-Spectral approach within an overset or Cartesian mesh method, while still approaching the spectral convergence rate of the original Time-Spectral approach. The viscous OVERFLOW solver will be augmented with the new Time-Spectral algorithm and the capability of the method for benchmark problems in rotorcraft and turbomachinery will be demonstrated. This abstract begins with a brief synopsis of the Time-Spectral approach for overset grids and provides details of e current approach to allow for arbitrary motion. Model problem results in one and two dimensions are included to demonstrate the viability of the method and the convergence properties. Section IV briefly outlines the implementation into the OVERFLOW solver, and the abstract closes with a description of the benchmark test cases which will be included in the final paper.

Leffell, Joshua Isaac↗

A cell-local finite difference discretization of the low-order quasidiffusion equations for neutral particle transport on unstructured quadrilateral meshes

We present a quasidiffusion (QD) method for solving neutral particle transport problems in Cartesian XY geometry on unstructured quadrilateral meshes, including local refinement capability. Neutral particle transport problems are central to many applications including nuclear reactor design, radiation safety, astrophysics, medical imaging, radiotherapy, nuclear fuel transport/storage, shielding design, and oil well-logging. The primary development is a new discretization of the low-order QD (LOQD) equations based on cell-local finite differences. The accuracy of the LOQD equations depends on proper calculation of special non-linear QD (Eddington) factors from a transport solution. In order to completely define the new QD method, a proper discretization of the transport problem is also presented. The transport equation is discretized by a conservative method of short characteristics with a novel linear approximation of the scattering source term and monotonic, parabolic representation of the angular flux on incoming faces. Analytic and numerical tests are used to test the accuracy and spatial convergence of the non-linear method. All tests exhibit O(h{sup 2}) convergence of the scalar flux on orthogonal, random, and multi-level meshes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗

Handing off the outcome of binary neutron star mergers for accurate and long-term postmerger simulations

In this work, we perform binary neutron star (BNS) merger simulations in full dynamical general relativity with IllinoisGRMHD, on a Cartesian grid with adaptive-mesh refinement. After the remnant black hole has become nearly stationary, the evolution of the surrounding accretion disk on Cartesian grids over long timescales (~1s) is suboptimal, as Cartesian coordinates over-resolve the angular coordinates at large distances, and the accreting plasma flows obliquely across coordinate lines dissipating angular momentum artificially from the disk. To address this, we present the HandOff, a set of computational tools that enables the transfer of general relativistic magnetohydrodynamic (GRMHD) and spacetime data from IllinoisGRMHD to harm3d, a GRMHD code that specializes in modeling black hole accretion disks in static spacetimes over long timescales, making use of general coordinate systems with spherical topology. We demonstrate that the handoff allows for a smooth and reliable transition of GRMHD fields and spacetime data, enabling us to efficiently and reliably evolve BNS dynamics well beyond merger. We also discuss future plans, which involve incorporating advanced equations of state and neutrino physics into BNS simulations using the HandOff approach.

79 ASTRONOMY AND ASTROPHYSICS↗

Ameliorating the Courant-Friedrichs-Lewy condition in spherical coordinates: A double FFT filter method for general relativistic MHD in dynamical spacetimes

Numerical simulations of merging compact objects and their remnants form the theoretical foundation for gravitational wave and multimessenger astronomy. While Cartesian-coordinate-based adaptive mesh refinement is commonly used for simulations, spherical-like coordinates are more suitable for nearly spherical remnants and azimuthal flows due to lower numerical dissipation in the evolution of fluid angular momentum, as well as requiring fewer numbers of computational cells. However, the use of spherical coordinates to numerically solve hyperbolic partial differential equations can result in severe Courant-Friedrichs-Lewy (CFL) stability condition time step limitations, which can make simulations prohibitively expensive. This paper addresses this issue for the numerical solution of coupled spacetime and general relativistic magnetohydrodynamics evolutions by introducing a double fast Fourier transform (FFT) filter and implementing it within the fully message passing interface (mpi)-parallelized sphericalnr framework in the einstein toolkit. In conclusion, we demonstrate the effectiveness and robustness of the filtering algorithm by applying it to a number of challenging code tests, and show that it passes these tests effectively, demonstrating convergence while also increasing the time step significantly compared to unfiltered simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Large-eddy simulations of Richtmyer Meshkov instability in a converging geometry

The Richtmyer-Meshkov instability (RMI) refers to the baroclinic generation of vorticity at a perturbed density interface when impacted by a shock wave. It is often thought of as the impulsive limit of the Rayleigh-Taylor instability. While the RMI has been widely covered in planar geometries, the present simulations investigate the mixing of materials resulting from the interaction of an imploding cylindrical shock wave with a concentric interface, perturbed in both axial and azimuthal directions, which separates outside air from SF{sub 6} (initially 5 times denser) confined in a 90{sup o} wedge. Two incident shocks of Mach numbers M{sub i} = 1.3 and 2.0 at initial impact are tested. These canonical simulations support recent work on understanding the compressible turbulent mixing in converging geometries relevant to both inertial confinement fusion and core-collapse supernova dynamics. Initial irregularities in the density interface form the misalignment between density and pressure gradients required to initiate a first RMI. A second RMI occurs after the initial shock has converged down the wedge, reflected off the axis and reshocks the distorted interface. Reshock interactions of decreasing intensity follow successively. Due to the converging geometry, the accelerated or decelerated motion of the interface also generates Rayleigh-Taylor instabilities. Secondary Kelvin-Helmholtz instabilities develop along the sides of the interpenetrating fingering structures. The energetic reshock produces a large dynamical range of turbulent scales, requiring the utilization of large-eddy simulation (LES). We employed the stretched-vortex subgrid-scale model of turbulent and scalar transport based on an explicit structural modeling of small-scale dynamics. The imploding nature of the flow is particularly suitable for the use of adaptive mesh refinement (AMR) provided by the parallel block-structured AMR framework AMROC. The Favre-filtered Navier-Stokes equations are solved on each Cartesian uniform subgrid of the mesh hierarchy. A weighted, essentially nonoscillatory scheme is used to capture discontinuities but reverts to a low-numerical dissipation, explicit, tuned center-difference stencil in the smooth or turbulent flow regions, optimal for the functioning of our explicit LES. The computational domain is discretized with 95 x 95 x 64 cubic cells on the base grid (64 points in the periodic axial direction), with three additional levels of refinement based on the local density gradient, reducing the computational expenses compared to the equivalent finest unigrid 760 x 760 x 512 problem. The interpenetration of the two fluids after the reshock is clearly discernible in Fig. 1. The mixing is visualized by using isosurfaces of the heavy-fluid mass fraction {psi}. The mixture is colored red as {psi} = 0.90, yellow as {psi} = 0.5, and green as {psi} = 0.1. To illustrate the multiscale nature of the turbulent mixing, we observe that the initial perturbation wavelength is 100 times larger than the finest grid size, which is itself about 100 times larger than the estimated smallest physical scale in the flow - the Kolmogorov scale - where the viscous dissipation of energy occurs. Incident shocks of higher Mach number (e.g., M{sub i} = 2.0) focus the flow further towards the axis, leading to a stronger turbulent mixing.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A high-order Lagrangian discontinuous Galerkin hydrodynamic method for quadratic cells using a subcell mesh stabilization scheme

We present here a Lagrangian discontinuous Galerkin (DG) hydrodynamic method that is up to third-order accurate using subcell mesh stabilization (SMS) for compressible flows on quadratic meshes in two-dimensional (2D) Cartesian coordinates. Similar to the second-order accurate Lagrangian DG method with linear meshes, the physical evolution equations for the specific volume, velocity, and specific total energy are discretized using a modal DG method with Taylor series polynomials. The Riemann velocity at the vertices of a curvilinear cell, and the corresponding surface forces, are calculated by solving a multidirectional approximate Riemann problem. Curvilinear cells (e.g., quadratic quadrilateral meshes in this work) have many deformational degrees of freedom, and with these cells, they can deform in unphysical ways. Likewise, the Riemann solution at an edge vertex differs from the one at the corner of a cell. With SMS, each quadratic quadrilateral cell is decomposed into four quadrilateral subcells, that move in a Lagrangian manner. The edge vertex is surrounded by four subcells so that it is similar to the vertex at the cell corner. SMS can detect inconsistent density fields between the cell and subcells. The difference between these two density fields is used to correct the stress (pressure) input to the Riemann solver. This SMS scheme enables stable mesh motion and accurate solutions in the context of a Lagrangian high-order DG method that is up to third-order with quadratic cells. We also present effective limiting strategies that ensure monotonicity of the primitive variables with the high-order DG method. This Lagrangian DG hydrodynamic method with SMS conserves mass, momentum, and total energy. A suite of test problems are calculated to demonstrate the designed order of accuracy (up to third-order accurate) of this method, and that the Lagrangian DG method using SMS preserves cylindrical symmetry on 1D radial flow problems with an equal-angle polar quadratic mesh.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical homogenization of concrete microstructures without explicit meshes

Life management of electric hydro or nuclear power plants requires to estimate long-term concrete properties on facilities, for obvious safety and serviceability reasons. Decades-old structures are foreseen to be operational for several more decades. As a large number of different concrete formulations are found in EDF facilities, empirical models based on many experiments cannot be an option for a large fleet of power plant buildings. To build predictive models, homogenization techniques offer an appealing alternative. To properly upscale creep, especially at long term, a rather precise description of the microstructure is required. However, the complexity of the morphology of concrete poses several challenges. In particular, concrete is formulated to maximize the packing density of the granular skeleton, leading to aggregates spanning several length scales with small inter particle spacings. Thus, explicit meshing of realistic concrete microstructures is either out of reach of current meshing algorithms or would produce a number of degrees of freedom far higher than the current generic FEM codes capabilities. This paper proposes a method to deal with complex matrix-inclusions microstructures such as the ones encountered at the mortar or concrete scales, without explicitly meshing them. The microstructure is superimposed to an independent mesh, which is a regular Cartesian grid. This inevitably yields so called 'gray elements', spanning across multiple phases. As the reliability of the estimate of the effective properties highly depends on the behavior affected to these gray elements, special attention is paid to them. As far as the question of the solvers is concerned, generic FEM codes are found to lack efficiency: they cannot reach high enough levels of discretization with classical free meshes, and they do not take advantage of the regular structure of the mesh. Thus, a specific finite differences/finite volumes solver has been developed. At first, generic off-the-shelf linear system solvers were used. To further improve the efficiency in terms of memory requirements, specific variants of the preconditioned conjugate gradient were implemented. This allowed to homogenize the conductivity of a concrete-like microstructure using more than 10{sup 9} degrees of freedom on a rather common hardware for 2010 (a PC embedding 48 GB of RAM). Taking benefit of the properties of the regular Cartesian grid we have also investigated a multi-level method to improve the CPU efficiency of the code.

36 MATERIALS SCIENCE↗

l3d2vtk: An MCNPTools Utility to Enable LNK3DNT File Visualization & Post-Processing

This paper describes recent work to develop and incorporate a utility program into the MCNPTools package that enables LNK3DNT file visualization & post-processing. A LNK3DNT file is a binary Cartesian, cylindrical, or spherical structured mesh file that describes material and material relative density distributions by mesh voxel. This mesh file format is principally used by the PARTISN discrete-ordinates radiation-transport code. However, the MCNP ® Monte Carlo radiation-transport code can use LNK3DNT files to specify geometry, and the MCNP code can produce LNK3DNT files representing a user-defined region of the MCNP constructive solid geometry (CSG). Because of the use of LNK3DNT files as MCNP input and output and with other computer codes, improving the ability to visualize and/or quantitatively post-process LNK3DNT files benefits end users. In particular, it is helpful to visually verify that the material and density distributions are as expected. Also, an analyst can orient viewers with respect to other in formation, e.g., by co-plotting a voxelized representation of MCNP CSG with mesh tally and/or particle track results. However, until now, the only capability to interactively interrogate LNK3DNT files is through a 2-D slice plotter provided by the Monte Carlo Application ToolKit (MCATK), which is not currently distributed outside of Los Alamos National Laboratory. The utility created as part of this work converts LNK3DNT binary files to an ASCII XML-based StructuredMesh VTK (.vts) file. The geometries supported are 1-D spherical and cylindrical ( r ), 1-D Cartesian ( x ), 2-D cylindrical ( r-z and r-θ ) and Cartesian ( x-y ), and 3-D cylindrical ( r-z-θ ) and Cartesian ( x-y-z ). This file format is chosen to minimize external dependencies (e.g., on an HDF5 library) and to provide a file that can be interrogated by the user in a text editor or standard visualization applications (e.g., ParaView or VisIt). However, other file formats may provide more utility such as XDMF, which can use HDF5 and is discussed further as something to explore as future work. This paper is organized as follows: a brief introduc tion to the MCNPTools library and utility programs is given, the LNK3DNT-to-VTK (l3d2vtk) utility functionality is de scribed, and then an example post-processing workflow using the ParaView application is given.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An advanced algorithm for construction of Integral Transport Matrix Method operators using accumulation of single cell coupling factors

The Integral Transport Matrix Method (ITMM) has been shown to be an effective method for solving the neutron transport equation in large domains on massively parallel architectures. In the limit of very large number of processors, the speed of the algorithm, and its suitability for unstructured meshes, i.e. other than an ordered Cartesian grid, is limited by the construction of four matrix operators required for obtaining the solution in each sub-domain. The existing algorithm used for construction of these matrix operators, termed the differential mesh sweep, is computationally expensive and was developed for a structured grid. This work proposes the use of a new algorithm for construction of these operators based on the construction of a single, fundamental matrix representing the transport of a particle along every possible path throughout the sub-domain mesh. Each of the operators is constructed by multiplying an element of this fundamental matrix by two factors dependent only upon the operator being constructed and on properties of the emitting and incident cells. The ITMM matrix operator construction time for the new algorithm is demonstrated to be shorter than the existing algorithm in all tested cases with both isotropic and anisotropic scattering considered. While also being a more efficient algorithm on a structured Cartesian grid, the new algorithm is promising in its geometric robustness and potential for being applied to an unstructured mesh, with the ultimate goal of application to an unstructured tetrahedral mesh on a massively parallel architecture. (authors)

97 MATHEMATICS AND COMPUTING↗

An adaptive grid-based all hexahedral meshing algorithm based on 2-refinement.

Most adaptive mesh generation algorithms employ a 3-refinement method. This method, although easy to employ, provides a mesh that is often too coarse in some areas and over refined in other areas. Because this method generates 27 new hexes in place of a single hex, there is little control on mesh density. This paper presents an adaptive all-hexahedral grid-based meshing algorithm that employs a 2-refinement method. 2-refinement is based on dividing the hex to be refined into eight new hexes. This method allows a greater control on mesh density when compared to a 3-refinement procedure. This adaptive all-hexahedral meshing algorithm provides a mesh that is efficient for analysis by providing a high element density in specific locations and a reduced mesh density in other areas. In addition, this tool can be effectively used for inside-out hexahedral grid based schemes, using Cartesian structured grids for the base mesh, which have shown great promise in accommodating automatic all-hexahedral algorithms. This adaptive all-hexahedral grid-based meshing algorithm employs a 2-refinement insertion method. This allows greater control on mesh density when compared to 3-refinement methods. This algorithm uses a two layer transition zone to increase element quality and keeps transitions from lower to higher mesh densities smooth. Templates were introduced to allow both convex and concave refinement.

99 GENERAL AND MISCELLANEOUS↗