Search NASA⌕ Search

SEARCH · Search NASA

Results for “arbitrary meshes”

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 451 records · Page 25

Calculation of three-dimensional (3-D) internal flow by means of the velocity-vorticity formulation on a staggered grid

A method has been developed to accurately compute the viscous flow in three-dimensional (3-D) enclosures. This method is the 3-D extension of a two-dimensional (2-D) method developed for the calculation of flow over airfoils. The 2-D method has been tested extensively and has been shown to accurately reproduce experimental results. As in the 2-D method, the 3-D method provides for the non-iterative solution of the incompressible Navier-Stokes equations by means of a fully coupled implicit technique. The solution is calculated on a body fitted computational mesh incorporating a staggered grid methodology. In the staggered grid method, the three components of vorticity are defined at the centers of the computational cell sides, while the velocity components are defined as normal vectors at the centers of the computational cell faces. The staggered grid orientation provides for the accurate definition of the vorticity components at the vorticity locations, the divergence of vorticity at the mesh cell nodes and the conservation of mass at the mesh cell centers. The solution is obtained by utilizing a fractional step solution technique in the three coordinate directions. The boundary conditions for the vorticity and velocity are calculated implicitly as part of the solution. The method provides for the non-iterative solution of the flow field and satisfies the conservation of mass and divergence of vorticity to machine zero at each time step. To test the method, the calculation of simple driven cavity flows have been computed. The driven cavity flow is defined as the flow in an enclosure driven by a moving upper plate at the top of the enclosure. To demonstrate the ability of the method to predict the flow in arbitrary cavities, results will he shown for both cubic and curved cavities.

Stremel, Paul M.↗

Emu v1.1

Emu is a particle-in-cell code for solving the neutrino quantum kinetic equations in 1, 2, or 3 spatial dimensions with arbitrary angular resolution in order to simulate neutrino flavor transformation in neutron star merger and core collapse supernova environments. Emu represents the neutrino distribution function as a set of particles, each of which represent a collection of neutrinos and antineutrinos with unique position and momentum. Each particle carries two density matrices to define the flavor state of the neutrinos and antineutrinos it represents. Emu includes the vacuum, matter, and neutrino self-interaction potentials. Emu calculates the self-interaction potential using PIC deposition and interpolation algorithms that efficiently compute the local number density and flux at particle locations. Emu is implemented in C++ and is based on the AMReX library for high-performance, block-structured adaptive mesh refinement. Emu is parallelized with MPI + OpenMP for CPUs and MPI + CUDA for GPUs.

Willcox, Donald↗

A deterministic verification strategy for electrostatic particle-in-cell algorithms in arbitrary spatial dimensions using the method of manufactured solutions

As simulations of kinetic plasmas continue to increase in scope and complexity, a rigorous and straightforward method for verifying particle-in-cell (PIC) implementations is necessary to ensure their correctness. Here, in this paper, we present a deterministic method for the rigorous verification of multidimensional, multispecies, electrostatic particle-in-cell codes based on the method of manufactured solutions. Specifically, we prove that rigorous verification is possible through the exclusive examination of errors of grid quantities (i.e., moments and/or fields), allowing for a very light-weight and non-intrusive implementation in existing PIC codes. This is a marked improvement over earlier PIC verification approaches (only demonstrated with one species in 1D-1V), which rely on the comparison of cumulative distribution functions, and are invasive on the code base, introduce additional stochastic noise, are significantly more computationally expensive, and lack rigorous convergence properties. Interestingly, we show that different grid quantities feature different rates of convergence with the number of particles and mesh size, impacting the verification process. These theoretical results are confirmed numerically with a multi-species 2D-2V particle-in-cell code, including the ability of the method to detect order reduction due to an incorrect implementation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Tree-based solvers for adaptive mesh refinement code $\scriptsize{FLASH}$ – IV. An X-ray radiation scheme to couple discrete and diffuse X-ray emission sources to the thermochemistry of the interstellar medium

X-ray radiation, in particular radiation between 0.1 and 10 keV, is evident from both point-like sources, such as compact objects and T-Tauri young stellar objects, and extended emission from hot, cooling gas, such as in supernova remnants. The X-ray radiation is absorbed by nearby gas, providing a source of both heating and ionization. While protoplanetary chemistry models now often include X-ray emission from the central young stellar object, simulations of star-forming regions have yet to include X-ray emission coupled to the chemo-dynamical evolution of the gas. We present an extension of the $\scriptsize{TREERAY}$ reverse ray trace algorithm implemented in the flash magnetohydrodynamic code which enables the inclusion of X-ray radiation from 0.1 keV < E γ < 100 keV, dubbed $\scriptsize{XRAYTHESPOT}$. $\scriptsize{XRAYTHESPOT}$ allows for the use of an arbitrary number of bins, minimum and maximum energies, and both temperature-independent and temperature-dependent user-defined cross-sections, along with the ability to include both point and extended diffuse emission and is coupled to the thermochemical evolution. We demonstrate the method with several multibin benchmarks testing the radiation transfer solution and coupling to the thermochemistry. Finally, we show two example star formation science cases for this module: X-ray emission from protostellar accretion irradiating an accretion disc and simulations of molecular clouds with active chemistry, radiation pressure, and protostellar radiation feedback from infrared to X-ray radiation.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulating the pervasive fracture and fragmentation of materials and structures using randomly close-packed Voronoi tessellations.

Under extreme loading conditions most often the extent of material and structural fracture is pervasive in the sense that a multitude of cracks are nucleating, propagating in arbitrary directions, coalescing, and branching. Pervasive fracture is a highly nonlinear process involving complex material constitutive behavior, material softening, localization, surface generation, and ubiquitous contact. Two primary applications in which pervasive fracture is encountered are (1) weapons effects on structures and (2) geomechanics of highly jointed and faulted reservoirs. A pure Lagrangian computational method based on randomly close-packed Voronoi tessellations is proposed as a rational approach for simulating the pervasive fracture of materials and structures. Each Voronoi cell is formulated as a finite element using the reproducing kernel method. Fracture surfaces are allowed to nucleate only at the intercell faces. The randomly seeded Voronoi cells provide an unbiased network for representing cracks. In this initial study two approaches for allowing the new surfaces to initiate are studied: (1) dynamic mesh connectivity and the instantaneous insertion of a cohesive traction when localization is detected, and (2) a discontinuous Galerkin approach in which the interelement tractions are an integral part of the variational formulation, but only become active once localization is detected. Pervasive fracture problems are extremely sensitive to initial conditions and system parameters. Dynamic problems exhibit a form of transient chaos. The primary numerical challenge for this class of problems is the demonstration of model objectivity and, in particular, the identification and demonstration of a measure of convergence for engineering quantities of interest.

97 MATHEMATICS AND COMPUTING↗

Field Model: An Object-Oriented Data Model for Fields

We present an extensible, object-oriented data model designed for field data entitled Field Model (FM). FM objects can represent a wide variety of fields, including fields of arbitrary dimension and node type. FM can also handle time-series data. FM achieves generality through carefully selected topological primitives and through an implementation that leverages the potential of templated C++. FM supports fields where the nodes values are paired with any cell type. Thus FM can represent data where the field nodes are paired with the vertices ("vertex-centered" data), fields where the nodes are paired with the D-dimensional cells in R(sup D) (often called "cell-centered" data), as well as fields where nodes are paired with edges or other cell types. FM is designed to effectively handle very large data sets; in particular FM employs a demand-driven evaluation strategy that works especially well with large field data. Finally, the interfaces developed for FM have the potential to effectively abstract field data based on adaptive meshes. We present initial results with a triangular adaptive grid in R(sup 2) and discuss how the same design abstractions would work equally well with other adaptive-grid variations, including meshes in R(sup 3).

Moran, Patrick J.↗

Treatment of domain integrals in boundary element methods

A systematic and rigorous technique to calculate domain integrals without a volume-fitted mesh has been developed and validated in the context of a boundary element approximation. In the proposed approach, a domain integral involving a continuous or weakly-singular integrand is first converted into a surface integral by means of straight-path integrals that intersect the underlying domain. Then, the resulting surface integral is carried out either via analytic integration over boundary elements or by use of standard quadrature rules. This domain-to-boundary integral transformation is derived from an extension of the fundamental theorem of calculus to higher dimension, and the divergence theorem. In establishing the method, it is shown that the higher-dimensional version of the first fundamental theorem of calculus corresponds to the well-known Poincare lemma. The proposed technique can be employed to evaluate integrals defined over simply- or multiply-connected domains with Lipschitz boundaries which are embedded in an Euclidean space of arbitrary but finite dimension. Combined with the singular treatment of surface integrals that is widely available in the literature, this approach can also be utilized to effectively deal with boundary-value problems involving non-homogeneous source terms by way of a collocation or a Galerkin boundary integral equation method using only the prescribed surface discretization. Sample problems associated with the three-dimensional Poisson equation and featuring the Newton potential are successfully solved by a constant element collocation method to validate this study.

99 GENERAL AND MISCELLANEOUS↗

A moving control volume approach to computing hydrodynamic forces and torques on immersed bodies

Here, we present a moving control volume (CV) approach to computing hydrodynamic forces and torques on complex geometries. The method requires surface and volumetric integrals over a simple and regular Cartesian box that moves with an arbitrary velocity to enclose the body at all times. The moving box is aligned with Cartesian grid faces, which makes the integral evaluation straightforward in an immersed boundary (IB) framework. Discontinuous and noisy derivatives of velocity and pressure at the fluid–structure interface are avoided and far-field (smooth) velo city and pressure information is used. We re-visit the approach to compute hydrodynamic forces and torques through force/torque balance equations in a Lagrangian frame that some of us took in a prior work (Bhalla et al., 2013 [13]). We prove the equivalence of the two approaches for IB methods, thanks to the use of Peskin's delta functions. Both approaches are able to suppress spurious force oscillations and are in excellent agreement, as expected theoretically. Test cases ranging from Stokes to high Reynolds number regimes are considered. We discuss regridding issues for the moving CV method in an adaptive mesh refinement (AMR) context. The proposed moving CV method is not limited to a specific IB method and can also be used, for example, with embedded boundary methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Stellar decomposition: A compact representation for simplicial complexes and beyond

Here, we introduce the Stellar decomposition, a model for efficient topological data structures over a broad range of simplicial and cell complexes. A Stellar decomposition of a complex is a collection of regions indexing the complex’s vertices and cells such that each region has sufficient information to locally reconstruct the star of its vertices, i.e., the cells incident in the region’s vertices. Stellar decompositions are general in that they can compactly represent and efficiently traverse arbitrary complexes with a manifold or non-manifold domain. They are scalable to complexes in high dimension and of large size, and they enable users to easily construct tailored application-dependent data structures using a fraction of the memory required by a corresponding global topological data structure on the complex. As a concrete realization of this model for spatially embedded complexes, we introduce the Stellar tree, which combines a nested spatial tree with a simple tuning parameter to control the number of vertices in a region. Stellar trees exploit the complex’s spatial locality by reordering vertex and cell indices according to the spatial decomposition and by compressing sequential ranges of indices. Stellar trees are competitive with state-of-the-art topological data structures for manifold simplicial complexes and offer significant improvements for cell complexes and non-manifold simplicial complexes. We conclude with a high-level description of several mesh processing and analysis applications that utilize Stellar trees to process large datasets.

97 MATHEMATICS AND COMPUTING↗

Fast and Accurate Intersections on a Sphere

We introduce a fast, high-precision algorithm for calculating intersections between great circle arcs and lines of constant latitude on the unit sphere. We first propose a simplified intersection point formula with improved speed and numerical robustness over the ones traditionally implemented in geoscience software. We then show how algorithms based on the concept of error-free transformations (EFT) can be applied to evaluate this formula within a relative error bound that is on the order of machine precision. Here, we demonstrate that, with a vectorized and parallelized implementation, this enhanced accuracy is achieved with no compute time overhead compared to a direct calculation in hardware floating point, making our algorithm suitable for performance-sensitive applications like regridding of high-resolution climate data. In contrast, evaluating our formula using high-precision data types like quadruple precision and arbitrary precision, or using the robust intersection computation routines from the Computational Geometry Algorithms Library, leads to significant computational overhead, especially since these alternatives inhibit vectorization. More generally, our work demonstrates how EFT techniques can be combined and extended to implement nontrivial geometric calculations with high accuracy and speed.

Environmental sciences↗

Comparing field data using Alpert multi-wavelets

In this paper we introduce a method to compare sets of full-field data using Alpert tree-wavelet transforms. The Alpert tree-wavelet methods transform the data into a spectral space allowing the comparison of all points in the fields by comparing spectral amplitudes. The methods are insensitive to translation, scale and discretization and can be applied to arbitrary geometries. This makes them especially well suited for comparison of field data sets coming from two different sources such as when comparing simulation field data to experimental field data. We have developed both global and local error metrics to quantify the error between two fields. Additionally, we verify the methods on two-dimensional and three-dimensional discretizations of analytical functions. Furthermore, we then deploy the methods to compare full-field strain data from a simulation of elastomeric syntactic foam.

42 ENGINEERING↗

Determining Columbia and Snake River Project Tailrace and Forebay Zones of Hydraulic Influence using MASS2 Modeling

Although fisheries biology studies are frequently performed at US Army Corps of Engineers (USACE) projects along the Columbia and Snake Rivers, there is currently no consistent definition of the ``forebay'' and ``tailrace'' regions for these studies. At this time, each study may use somewhat arbitrary lines (e.g., the Boat Restriction Zone) to define the upstream and downstream limits of the study, which may be significantly different at each project. Fisheries researchers are interested in establishing a consistent definition of project forebay and tailrace regions for the hydroelectric projects on the lower Columbia and Snake rivers. The Hydraulic Extent of a project was defined by USACE (Brad Eppard, USACE-CENWP) as follows: The river reach directly upstream (forebay) and downstream (tailrace) of a project that is influenced by the normal range of dam operations. Outside this reach, for a particular river discharge, changes in dam operations cannot be detected by hydraulic measurement. The purpose of this study was to, in consultation with USACE and regional representatives, develop and apply a consistent set of criteria for determining the hydraulic extent of each of the projects in the lower Columbia and Snake rivers. A 2D depth-averaged river model, MASS2, was applied to the Snake and Columbia Rivers. New computational meshes were developed most reaches and the underlying bathymetric data updated to the most current survey data. The computational meshes resolved each spillway bay and turbine unit at each project and extended from project to project. MASS2 was run for a range of total river flows and each flow for a range of project operations at each project. The modeled flow was analyzed to determine the range of velocity magnitude differences and the range of flow direction differences at each location in the computational mesh for each total river flow. Maps of the differences in flow direction and velocity magnitude were created. USACE fishery biologists requested data analysis to determine the project hydraulic extent based on the following criteria: 1) For areas where the mean velocities are less than 4 ft/s, the water velocity differences between operations are not greater than 0.5 ft/sec and /or the differences in water flow direction are not greater than 10 degrees, 2) If mean water velocity is 4.0 ft/second or greater the boundary is determined using the differences in water flow direction (i.e., not greater than 10 degrees). Based on these criteria, and excluding areas with a mean velocity of less than 0.1 ft/s (within the error of the model), a final set of graphics were developed that included data from all flows and all operations. Although each hydroelectric project has a different physical setting, there were some common results. The downstream hydraulic extent tended to be greater than the hydraulic extent in the forebay. The hydraulic extent of the projects tended to be larger at the mid-range flows. At higher flows, the channel geometry tends to reduce the impact of project operations.

54 ENVIRONMENTAL SCIENCES↗

Vectorization, threading, and cache-blocking considerations for hydrocodes on emerging architectures

This work reports on considerations for improving computational performance in preparation for current and expected changes to computer architecture. The algorithms studied will include increasingly complex prototypes for radiation hydrodynamics codes, such as gradient routines and diffusion matrix assembly (e.g., in [1-6]). The meshes considered for the algorithms are structured or unstructured meshes. The considerations applied for performance improvements are meant to be general in terms of architecture (not specifically graphical processing unit (GPUs) or multi-core machines, for example) and include techniques for vectorization, threading, tiling, and cache blocking. Out of a survey of optimization techniques on applications such as diffusion and hydrodynamics, we make general recommendations with a view toward making these techniques conceptually accessible to the applications code developer. Published 2015. This article is a U.S. Government work and is in the public domain in the USA.

97 MATHEMATICS AND COMPUTING↗

LIP: The Livermore Interpolation Package Version 1.1

This report describes LIP, the Livermore Interpolation Package. Because LIP is a standalone version of the interpolation package in the Livermore Equation of State (LEOS) access library, the initials LIP alternatively stand for the 'LEOS Interpolation Package'. LIP was totally rewritten from the package described in. In particular, the independent variables are now referred to as x and y, since the package need not be restricted to equation of state data, which uses variables {rho} (density) and T (temperature). LIP is primarily concerned with the interpolation of two-dimensional data on a rectangular mesh. The interpolation methods provided include piecewise bilinear, reduced (12-term) bicubic, and bicubic Hermite (biherm). There is a monotonicity-preserving variant of the latter, known as bimond. For historical reasons, there is also a biquadratic interpolator, but this option is not recommended for general use. In addition to direct interpolation of two-dimensional data, LIP includes a facility for inverse interpolation (at present, only in the second independent variable). For completeness, however, the package also supports a compatible one-dimensional interpolation capability. Parametric interpolation of points on a two-dimensional curve can be accomplished by treating the components as a pair of one-dimensional functions with a common independent variable. LIP has an object-oriented design, but it is implemented in ANSI Standard C for efficiency and compatibility with existing applications. First, a 'LIP interpolation object' is created and initialized with the data to be interpolated. Then the interpolation coefficients for the selected method are computed and added to the object. The current version has options to instead estimate derivative values or merely store data in the object. It is then possible to pass the object to functions that interpolate or invert the interpolant at an arbitrary number of points. The first section of this report describes the overall design of the package, including both forward and inverse interpolation. Sections 2-5 describe each interpolation method in detail. The software that implements this design is summarized function-by-function in Section 6. For a complete example of package usage, refer to Section 7. The report concludes with a few brief notes on possible software enhancements. For guidance on adding other functional forms to LIP, refer to Appendix B. The reader who is primarily interested in using LIP to solve a problem should skim Section 1, then skip to Sections 6.1-4. Finally, jump ahead to Section 7 and study the example. The remaining sections can be referred to in case more details are desired. Changes since the previous version of this document include the new Section 1.4 that discusses partial setup options and Section 6.3 that discusses the new function lip{_}setup{_}interp that implements them. Section 6.1 and the example in Section 7 have been modified accordingly.

99 GENERAL AND MISCELLANEOUS↗

Sandia's Current Energy Conversion module for Flexible-Mesh Delft3D flow solver v. 1.0

The DOE has funded Sandia National Labs (SNL) to develop an open-source modeling tool to guide the design and layout of marine hydrokinetic (MHK) arrays to maximize power production while minimizing environmental effects. This modeling framework simulates flows through and around a MHK arrays while quantifying environmental responses. As an augmented version of the Dutch company, Deltares’s, environmental hydrodynamics code, Delft3D, SNL-Delft3D-CEC-FM includes a new module that simulates energy conversion (momentum withdrawal) by MHK current energy conversion devices with commensurate changes in the turbulent kinetic energy and its dissipation rate. SNL-Delft3D-CEC-FM modified the Delft3D flexible mesh flow solver, DFlowFM. The Following is a description of Deltares’s open-source code Delft3D from which Delft3D-CEC is built upon. “Delft3D is a world leading 3D modeling suite to investigate hydrodynamics, sediment transport and morphology and water quality for fluvial, estuarine and coastal environments. As per 1 January 2011, the Delft3D flow (FLOW), morphology (MOR) and waves (WAVE) modules are available in open source. The software is used and has proven his capabilities on many places around the world, like the Netherlands, USA, Hong Kong, Singapore, Australia, Venice, etc. The software is continuously improved and developed with innovating advanced modelling techniques as consequence of the research work of our institute and to stay world leading. The FLOW module is the heart of Delft3D and is a multi-dimensional (2D or 3D) hydrodynamic (and transport) simulation program which calculates non-steady flow and transport phenomena resulting from tidal and meteorological forcing on a curvilinear, boundary fitted grid or spherical coordinates. In 3D simulations, the vertical grid is defined following the so-called sigma coordinate approach or Z-layer approach. The MOR module computes sediment transport (both suspended and bed total load) and morphological changes for an arbitrary number of cohesive and non-cohesive fractions. Both currents and waves act as driving forces and a wide variety of transport formulae have been incorporated. For the suspended load this module connects to the 2D or 3D advection-diffusion solver of the FLOW module; density effects may be taken into account. An essential feature of the MOR module is the dynamic feedback with the FLOW and WAVE modules, which allow the flows and waves to adjust themselves to the local bathymetry and allows for simulations on any time scale from days (storm impact) to centuries (system dynamics). It can keep track of the bed composition to build up a stratigraphic record. The MOR module may be extended to include extensive features to simulate dredging and dumping scenarios. For over 30 years Deltares has been in the forefront of these types of combined morphological simulation techniques.”

Chartand, Chris↗

LIP: The Livermore Interpolation Package, Version 1.3

This report describes LIP, the Livermore Interpolation Package. Because LIP is a stand-alone version of the interpolation package in the Livermore Equation of State (LEOS) access library, the initials LIP alternatively stand for the ''LEOS Interpolation Package''. LIP was totally rewritten from the package described in [1]. In particular, the independent variables are now referred to as x and y, since the package need not be restricted to equation of state data, which uses variables {rho} (density) and T (temperature). LIP is primarily concerned with the interpolation of two-dimensional data on a rectangular mesh. The interpolation methods provided include piecewise bilinear, reduced (12-term) bicubic, and bicubic Hermite (biherm). There is a monotonicity-preserving variant of the latter, known as bimond. For historical reasons, there is also a biquadratic interpolator, but this option is not recommended for general use. A birational method was added at version 1.3. In addition to direct interpolation of two-dimensional data, LIP includes a facility for inverse interpolation (at present, only in the second independent variable). For completeness, however, the package also supports a compatible one-dimensional interpolation capability. Parametric interpolation of points on a two-dimensional curve can be accomplished by treating the components as a pair of one-dimensional functions with a common independent variable. LIP has an object-oriented design, but it is implemented in ANSI Standard C for efficiency and compatibility with existing applications. First, a ''LIP interpolation object'' is created and initialized with the data to be interpolated. Then the interpolation coefficients for the selected method are computed and added to the object. Since version 1.1, LIP has options to instead estimate derivative values or merely store data in the object. (These are referred to as ''partial setup'' options.) It is then possible to pass the object to functions that interpolate or invert the interpolant at an arbitrary number of points. The first section of this report describes the overall design of the package, including both forward and inverse interpolation. Sections 2-6 describe each interpolation method in detail. The software that implements this design is summarized function-by-function in Section 7. For a complete example of package usage, refer to Section 8. The report concludes with a few brief notes on possible software enhancements. For guidance on adding other functional forms to LIP, refer to Appendix B. The reader who is primarily interested in using LIP to solve a problem should skim Section 1, then skip to Sections 7.1-4. Finally, jump ahead to Section 8 and study the example. The remaining sections can be referred to in case more details are desired. Changes since version 1.1 of this document include the new Section 3.2.1 that discusses derivative estimation and new Section 6 that discusses the birational interpolation method. Section numbers following the latter have been modified accordingly.

97 MATHEMATICS AND COMPUTING↗

LIP: The Livermore Interpolation Package, Version 1.4

This report describes LIP, the Livermore Interpolation Package. Because LIP is a stand-alone version of the interpolation package in the Livermore Equation of State (LEOS) access library, the initials LIP alternatively stand for the 'LEOS Interpolation Package'. LIP was totally rewritten from the package described in [1]. In particular, the independent variables are now referred to as x and y, since the package need not be restricted to equation of state data, which uses variables {rho} (density) and T (temperature). LIP is primarily concerned with the interpolation of two-dimensional data on a rectangular mesh. The interpolation methods provided include piecewise bilinear, reduced (12-term) bicubic, and bicubic Hermite (biherm). There is a monotonicity-preserving variant of the latter, known as bimond. For historical reasons, there is also a biquadratic interpolator, but this option is not recommended for general use. A birational method was added at version 1.3. In addition to direct interpolation of two-dimensional data, LIP includes a facility for inverse interpolation (at present, only in the second independent variable). For completeness, however, the package also supports a compatible one-dimensional interpolation capability. Parametric interpolation of points on a two-dimensional curve can be accomplished by treating the components as a pair of one-dimensional functions with a common independent variable. LIP has an object-oriented design, but it is implemented in ANSI Standard C for efficiency and compatibility with existing applications. First, a 'LIP interpolation object' is created and initialized with the data to be interpolated. Then the interpolation coefficients for the selected method are computed and added to the object. Since version 1.1, LIP has options to instead estimate derivative values or merely store data in the object. (These are referred to as 'partial setup' options.) It is then possible to pass the object to functions that interpolate or invert the interpolant at an arbitrary number of points. The first section of this report describes the overall design of the package, including both forward and inverse interpolation. Sections 2-6 describe each interpolation method in detail. The software that implements this design is summarized function-by-function in Section 7. For a complete example of package usage, refer to Section 8. The report concludes with a few brief notes on possible software enhancements. For guidance on adding other functional forms to LIP, refer to Appendix B. The reader who is primarily interested in using LIP to solve a problem should skim Section 1, then skip to Sections 7.1-4. Finally, jump ahead to Section 8 and study the example. The remaining sections can be referred to in case more details are desired. Changes since version 1.1 of this document include the new Section 3.2.1 that discusses derivative estimation and new Section 6 that discusses the birational interpolation method. Section numbers following the latter have been modified accordingly.

97 MATHEMATICS AND COMPUTING↗

Flexible Spatial Partitions in MPACT Through Module-Based Data Passing

As part of the Consortium for Advanced Simulation of Light Water Reactors (CASL), the Virtual Environment for Reactor Applications (VERA) is being developed to provide high-fidelity multiphysics simulations of nuclear reactor cores. The MPACT code being developed collaboratively by Oak Ridge National Laboratory and the University of Michigan is the primary deterministic neutron transport solver available within VERA. MPACT employs the 2D/1D method to solve 3D problems using 2D method of characteristics (MOC) radial transport solvers with 1D nodal expansion method-based P3 (NEM-P3) axial transport solvers, which are coupled using axial and radial transverse leakages. A 3D coarse mesh finite difference (CMFD) solver is used to provide accelerated convergence and stability. Quarter-core problems in MPACT are typically run on moderately sized clusters ({approx}500-10,000 cores). As such, it relies heavily on spatial decomposition, both radially and axially, using MPI data communication along spatial domain boundaries to pass angular flux boundary condition and neighboring data. The initial spatial decomposition strategy implemented into MPACT overlaid a Cartesian grid over the core to form the domain boundaries. With this approach, a single buffer spanning across the entire boundary between two spatial domains is passed to a domain's neighbor. Additionally, only one neighboring domain index was allowed in each direction. For example, the entire eastern boundary of a domain must be the entire western boundary of the corresponding neighbour's domain. This implementation helped to execute cases on several thousand cores, where substantial radial decomposition was used. The default for several years was to use assembly decomposition, which yielded 73 radial partitions in the Watts Bar Unit 1 (WBN1) models being analyzed. However, as CASL formed stronger connections with industry partners, there was a strong push to allow MPACT to run on fewer cores, preferably in the 500-1,000 core range. Such cases require much less radial decomposition, typically with 8-16 radial domains on each plane. Unfortunately, the previous decomposition strategy is very limited in its ability to yield well-balanced domains, and it does not permit partitions with an arbitrary number of domains, particularly with small numbers of radial domains (3, 5, 7, 11, 13, etc.). With these limitations, a more flexible approach that provided more even-load balancing was needed. The details of this new strategy are outlined here, along with insights to its advantages. The examples provided are for the WBN1 core, which has been the focus of several initial CASL analyses. It is worth noting that spatial decomposition strategies have been employed in many codes with focus on a number of different transport methodologies. The references cited are not exhaustive as this has been very important research topic across many areas.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗