Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioning algorithms”

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 811 records · Page 45

eQE: An open‐source density functional embedding theory code for the condensed phase

Abstract In this work, we present the main features and algorithmic details of a novel implementation of the frozen density embedding (FDE) formulation of subsystem density functional theory (DFT) that is specifically designed to enable ab initio molecular dynamics (AIMD) simulations of large‐scale condensed‐phase systems containing 1000s of atoms. This code (available at http://eqe.rutgers.edu ) has been given the moniker of embedded Quantum ESPRESSO (eQE) as it is a generalization of the open‐source Quantum ESPRESSO (QE) suite of programs. The strengths of eQE reside in a hierarchical parallelization scheme that allows for an efficient and fully self‐consistent treatment of the electronic structure (via the addition of an additional DIIS extrapolation layer) while simultaneously exploiting the inherent symmetries and periodicities in the system (via sampling of subsystem‐specific first Brillouin zones and utilization of subsystem‐specific basis sets). While bulk liquids and molecular crystals are two classes of systems that exemplify the utility of the FDE approach (as these systems can be partitioned into weakly interacting subunits), we show that eQE has significantly extended this regime of applicability by outperforming standard semilocal Kohn–Sham DFT (KS‐DFT) for large‐scale heterogeneous catalysts with quite different layer‐specific electronic structure and intrinsic periodicities. eQE features very favorable strong parallel scaling for a model system of bulk liquid water composed of 256 water molecules, which allows for a significant decrease in the overall time to solution when compared to KS‐DFT. We show that eQE achieves speedups greater than one order of magnitude ( ) when performing AIMD simulations of such large‐scale condensed‐phase systems as: (1) molecular liquids via bulk liquid water represented by 1024 independent water molecules (3072 atoms with a 25.3× speedup over KS‐DFT), (2) polypeptide/biomolecule solvation via ( gly ) 6 solvated in (H 2 O) 395 (1230 atoms with a 38.6× speedup over KS‐DFT), and (3) molecular crystals via a 3 × 3 × 3 periodic supercell of pentacene (1940 atoms with a 12.0× speedup over KS‐DFT). These results represent a significant improvement over the current state‐of‐the‐art and now enable subsystem DFT‐based AIMD simulations of realistically sized condensed‐phase systems of interest throughout chemistry, physics, and materials science.

Genova, Alessandro↗

Non-smooth Bayesian optimization in tuning scientific applications

Tuning algorithmic parameters to optimize the performance of large, complicated computational codes is an important problem involving finding the optima and identifying regimes defined by non-smooth boundaries in black-box functions. Within the Bayesian optimization framework, the Gaussian process surrogate model produces smooth mean functions, but functions in the tuning problem are often non-smooth, which is exacerbated by the fact that we usually have limited sequential samples from the black-box function. Here, motivated by these issues encountered in tuning, we propose a novel Gaussian process model called a clustered Gaussian process (cGP), where the components are dynamically updated by clustering. In our studies, the performance of cGP can be better than stationary GPs in nearly 90% of the experiments and better than non-stationary GPs in nearly 70% of the repeated experiments while requiring less computational cost. cGP provides a novel approach for dynamic GP, computes more efficiently than recursive partitioning, and discovers non-smoothness regimes. We provide extensive experiments including high-performance computing (HPC) and industrial simulation functions to show the effectiveness of our methods.

97 MATHEMATICS AND COMPUTING↗

In situ and in-transit analysis of cosmological simulations

Abstract Modern cosmological simulations have reached the trillion-element scale, rendering data storage and subsequent analysis formidable tasks. To address this circumstance, we present a new MPI-parallel approach for analysis of simulation data while the simulation runs, as an alternative to the traditional workflow consisting of periodically saving large data sets to disk for subsequent ‘offline’ analysis. We demonstrate this approach in the compressible gasdynamics/ N -body code Nyx, a hybrid $\mbox{MPI}+\mbox{OpenMP}$ MPI + OpenMP code based on the BoxLib framework, used for large-scale cosmological simulations. We have enabled on-the-fly workflows in two different ways: one is a straightforward approach consisting of all MPI processes periodically halting the main simulation and analyzing each component of data that they own (‘ in situ ’). The other consists of partitioning processes into disjoint MPI groups, with one performing the simulation and periodically sending data to the other ‘sidecar’ group, which post-processes it while the simulation continues (‘in-transit’). The two groups execute their tasks asynchronously, stopping only to synchronize when a new set of simulation data needs to be analyzed. For both the in situ and in-transit approaches, we experiment with two different analysis suites with distinct performance behavior: one which finds dark matter halos in the simulation using merge trees to calculate the mass contained within iso-density contours, and another which calculates probability distribution functions and power spectra of various fields in the simulation. Both are common analysis tasks for cosmology, and both result in summary statistics significantly smaller than the original data set. We study the behavior of each type of analysis in each workflow in order to determine the optimal configuration for the different data analysis algorithms.

79 ASTRONOMY AND ASTROPHYSICS↗

Technical Note: Improvements in GEANT4 energy-loss model and the effect on low-energy electron transport in liquid water

Purpose: The GEANT4-DNA physics models are upgraded by a more accurate set of electron cross sections for ionization and excitation in liquid water. The impact of the new developments on low-energy electron transport simulations by the GEANT4 Monte Carlo toolkit is examined for improving its performance in dosimetry applications at the subcellular and nanometer level. Methods: The authors provide an algorithm for an improved implementation of the Emfietzoglou model dielectric response function of liquid water used in the GEANT4-DNA existing model. The algorithm redistributes the imaginary part of the dielectric function to ensure a physically motivated behavior at the binding energies, while retaining all the advantages of the original formulation, e.g., the analytic properties and the fulfillment of the f-sum-rule. In addition, refinements in the exchange and perturbation corrections to the Born approximation used in the GEANT4-DNA existing model are also made. Results: The new ionization and excitation cross sections are significantly different from those of the GEANT4-DNA existing model. In particular, excitations are strongly enhanced relative to ionizations, resulting in higher W-values and less diffusive dose-point-kernels at sub-keV electron energies. Conclusions: An improved energy-loss model for the excitation and ionization of liquid water by low-energy electrons has been implemented in GEANT4-DNA. The suspiciously low W-values and the unphysical long tail in the dose-point-kernel have been corrected owing to a different partitioning of the dielectric function.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

TrustDER: Trusted, Private and Scalable Coordination of Distributed Energy Resources

In this project, the Stanford and SLAC Teams have developed a Trusted, Private and Scalable platform for coordinating Coordination of Distributed Energy Resources (TrustDER). This is a layered system that ensures private, trusted and scalable coordination and monitoring of DERs. It accommodates a variety of resources, such as solar generation, gensets and loads, with a particular focus on battery systems-based resources, as they are a transformational technology experiencing fast growth in adoption by large critical facilities. The platform can be used as standalone or added to existing aggregation systems to enable trust, privacy and resilience. TrustDER consists of layers that address each of the shortcomings of the existing state of the art. Each layer in the platform can operate independently but provides information to the layers above it to enable a novel form of overall coordination architecture. The project consists of several tasks, with each task dedicated to the design of each layer. Task 2 Resource Virtualization defined a software abstraction layer for distributed energy resources (DERs). The goal of this abstraction was to simplify the implementation of algorithms utilizing cooperation of DERs resources in a variety of use cases. Task 3 is on Secure ID for Asset Authentication. Identity Management Systems (IDMS) are a foundational infrastructure for interactions between entities (organizations, users, devices, and services). Secure ID is blockchain-based a distributed identity management system allowing (1) identity provisioning, (2) authentication, (3) authorization, and (4) identity data sharing for IoT-enabled assets on the electricity grid. In this project, the SLAC team focused on designing and testing Keymaker, a protocol for authenticating device identity managed by Secure ID. Task 5 Private and Safe Integration is focused on the design and evaluation of a DER cooperation scheme which allows for the aggregation of DERs without impacting network reliability. The approach is designed based on realistic assumptions regarding data availability, communication infrastructure limitations, and privacy. Task 6 Scalable Distributed Privacy for Information explored how virtualized batteries could be managed privately. Specifically, it examined the case in which a principal provides a partitioned battery to multiple clients. Task 7 Use Cases was to ensure that this technology was applied in relevant situations and scenarios. Primarily, this means that virtualization needed to be employed in a manner that either improved flexibility, bolstered security or privacy, or decreased costs.

25 ENERGY STORAGE↗

A differentiable approach to the maximum independent set problem using dataless neural networks

The success of machine learning solutions for reasoning about discrete structures has brought attention to its adoption within combinatorial optimization algorithms. Such approaches generally rely on supervised learning by leveraging datasets of the combinatorial structures of interest drawn from some distribution of problem instances. Reinforcement learning has also been employed to find such structures. Here, in this paper, we propose a different approach in that no data is required for training the neural networks that produce the solution. In this sense, what we present is not a machine learning solution, but rather one that is dependent on neural networks and where backpropagation is applied to a loss function defined by the structure of the neural network architecture as opposed to a training dataset. In particular, we reduce the popular combinatorial optimization problem of finding a maximum independent set to a neural network and employ a dataless training scheme to refine the parameters of the network such that those parameters yield the structure of interest. Additionally, we propose a universal graph reduction procedure to handle large-scale graphs. The reduction exploits community detection for graph partitioning and is applicable to any graph type and/or density. Experimental results on both real and synthetic graphs demonstrate that our proposed method performs on par or outperforms state-of-the-art learning-based methods in terms of the size of the found set without requiring any training data.

97 MATHEMATICS AND COMPUTING↗

Indoor Occupant Counting by RF Backscattering

Building HVAC (heating, ventilation and air conditioning) consumes approximately 13% of all energy consumption in USA. Motion detectors, cameras and user programmable thermostats have been shown to be ineffective for HVAC controls to save energy, mostly due to the user concerns of comfort, reliability and privacy. A new HVAC control system based on real-time occupant counting that is fully automated, highly accurate, economically sensible and preserving privacy and aesthetics can thus bring forth a disruptive impact to this large energy sector. Our indoor occupant monitoring technology is based on the radio-frequency identification system (RFID), deployed in the room, not on the occupants. One reader with four antennas can be deployed on the ceiling or behind the ceiling panels for every thousand square feet in home, office and assisted living, with or without room partitions. The sticker-like passive tag, 10 cents each and maintenance-free, are profusely hidden on the wall or inside the furniture at arbitrary position, preserving privacy and aesthetics. The large number of tags can realize diverse observation points to accommodate arbitrary room layouts, which is impractical by other active units of camera, infrared, radar or lidar. With 20 tags, the system can reliably detect the number of occupants. For 100 tags, occupant posture and location can be known. The technology has been verified in the research labs and test buildings with very high accuracy. When the real-time occupant number can be accurately known without assuming devices on occupants or occupant motion, the building HVAC system can be automated to achieve building energy saving without sacrificing occupant comfort. According to our limited testing in a few types of building models and the simplified cost calculation, the RFID system has low overall cost in production, deployment, operation and maintenance. The signal processing algorithm based on machine learning requires very small number of training cases as most learning is transferrable for various layouts, and very low computational needs during operation, according to our testing in four different room sizes and layouts. In our preliminary estimate from HVAC saving alone, the RFID system can potentially pay for itself within 1.5 years, in addition to the other enhancement in building automation systems (BAS). Our commercialization strategy and business pitch deck focus on venturing this Cornell occupant monitoring technology into BAS and energy management markets. We have identified three broad BAS market segments of senior living, residential buildings, and office buildings. We have put together the minimum viable product characteristics for these identified segments, including analyses on total cost and competing technologies, as well as the fit and technical gaps for these market segments. We intend to bring the technology to market by licensing or partnering with existing BAS vendors. A list of potential collaborators and licensing partner candidates was assembled for different aspects of integrating our technology into a potential product that can be used with BAS.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Architectures for reasoning in parallel

The research conducted has dealt with rule-based expert systems. The algorithms that may lead to effective parallelization of them were investigated. Both the forward and backward chained control paradigms were investigated in the course of this work. The best computer architecture for the developed and investigated algorithms has been researched. Two experimental vehicles were developed to facilitate this research. They are Backpac, a parallel backward chained rule-based reasoning system and Datapac, a parallel forward chained rule-based reasoning system. Both systems have been written in Multilisp, a version of Lisp which contains the parallel construct, future. Applying the future function to a function causes the function to become a task parallel to the spawning task. Additionally, Backpac and Datapac have been run on several disparate parallel processors. The machines are an Encore Multimax with 10 processors, the Concert Multiprocessor with 64 processors, and a 32 processor BBN GP1000. Both the Concert and the GP1000 are switch-based machines. The Multimax has all its processors hung off a common bus. All are shared memory machines, but have different schemes for sharing the memory and different locales for the shared memory. The main results of the investigations come from experiments on the 10 processor Encore and the Concert with partitions of 32 or less processors. Additionally, experiments have been run with a stripped down version of EMYCIN.

Hall, Lawrence O.↗

Optimal cube-connected cube multiprocessors

Many CFD (computational fluid dynamics) and other scientific applications can be partitioned into subproblems. However, in general the partitioned subproblems are very large. They demand high performance computing power themselves, and the solutions of the subproblems have to be combined at each time step. The cube-connect cube (CCCube) architecture is studied. The CCCube architecture is an extended hypercube structure with each node represented as a cube. It requires fewer physical links between nodes than the hypercube, and provides the same communication support as the hypercube does on many applications. The reduced physical links can be used to enhance the bandwidth of the remaining links and, therefore, enhance the overall performance. The concept and the method to obtain optimal CCCubes, which are the CCCubes with a minimum number of links under a given total number of nodes, are proposed. The superiority of optimal CCCubes over standard hypercubes was also shown in terms of the link usage in the embedding of a binomial tree. A useful computation structure based on a semi-binomial tree for divide-and-conquer type of parallel algorithms was identified. It was shown that this structure can be implemented in optimal CCCubes without performance degradation compared with regular hypercubes. The result presented should provide a useful approach to design of scientific parallel computers.

Sun, Xian-He↗

A decreasing carbon allocation to belowground autotrophic respiration in global forest ecosystems

Belowground autotrophic respiration (RAsoil) depends on carbohydrates from photosynthesis flowing to roots and rhizospheres, and is one of the most important but least understood components in forest carbon cycling. Carbon allocation plays an important role in forest carbon cycling and reflects forest adaptation to changing environmental conditions. However, carbon allocation to RAsoil has not been fully examined at the global scale. To fill this knowledge gap, first, the spatio-temporal patterns of RAsoil from 1981 to 2017 were predicted by a Random Forest (RF) algorithm using the most updated Global Soil Respiration Database (v5) with global environmental variables; second, carbon allocation from photosynthesis to RAsoil (CAB), was calculated as the ratio of RAsoil to gross primary production; and its temporal and spatial patterns were assessed in global forest ecosystems. . Globally, mean RAsoil from forests was 8.9 ± 0.08 Pg C yr-1 (mean ± standard deviation) from 1981 to 2017 with strong spatial variabilities. Temporally, RAsoil increased at a rate of 0.0059 Pg C yr-2, paralleling broader soil respiration changes and indicating increasing carbon respired by roots. Mean CAB was 0.243 ± 0.016 and decreased over time. The temporal trend of CAB varied greatly in space, reflecting uneven responses of CAB to environmental changes. This study is the first attempt to predict global CAB and analyze its temporal and spatial patterns. With the linkage of carbon use efficiency, the developed CAB offers an completely independent approach to quantify global aboveground autotropic respiration spatially and temporally, which could provide crucial insights into carbon flux partition and global carbon cycling under climate change.

Tang, Xiaolu↗

Dependence of Z-R Relations on the Rain Type Classification Scheme

The TRMM Global Validation Program is giving us a unique opportunity to compare radar datasets from different sites since they are analyzed in a relatively uniform procedure. Monthly Ze-R relations for four different sites (i.e, Melbourne Florida, Houston Texas, Darwin Australia and Kwajalein Atoll) were derived. The relations were obtained using the Window Probability Matching Method (WPMM). This version of the PMM relies on matching unconditional probabilities of rain rates, R, and radar reflectivity, Ze, using rain gauge and radar data, respectively. This procedure was done separately for convective and stratiform rain type using the Steiner classification procedure. The radar and gauge data from all sites were quality controlled using the same algorithms, which include also an automatic procedure to filter unreliable rain gauge data upon comparison to radar data. An adjusted power law Z-R for each rain type was also derived by comparing the radar-gauge coincident pairs in order to adjust the total monthly rainfall to match the gauges. The obtained PMM based Ze-R relations are found to be curved lines in log-log space rather than any straight line power law. While the PMM based Ze-R curves were always distinctly different between the convective and stratiform rain, the power law based Z-R, in few cases, was found to be the same for both types. In general, a given reflectivity was matched to a much lower rain intensity in the convective rainfall as compared to that in stratiform rainfall. These findings are inherently contradictory to previous findings based on disdrometer data and suggest some precaution for using the latter Z-R relations on radar data when the partition of stratiform and convective rainfall amount is in concern. The inverse trends in the relations might be caused by effects such as partial beam fillings, the use of different classification schemes, as well as having a distinct difference in the Z-R relations between the initial convective and the trailing transition regions as suggested by recent findings.

Amitai, Eyal↗

Direct numerical simulations for hybrid rocket boundary layers: Performance modeling and scaling

This paper presents a comprehensive performance and scaling analysis of direct numerical simulations for reacting boundary layers, focusing on slab burner configurations. Using a PETSc-based finite volume CFD framework, the study evaluates the scalability and computational cost of flow, chemistry, and radiation evaluations across 2D and 3D simulations. Polymethyl methacrylate (PMMA) is the fuel with pure O 2 as the oxidizer, modeled using a detailed chemical kinetics mechanism with 113 species and 660 reactions. A ray-tracing-based radiation solver, designed for distributed memory applications, is implemented to model radiation heat transfer. Parallel scalability is analyzed for the coupled flow, chemistry, and radiation heat transfer processes. Weak and strong scaling studies are conducted on up to 15,000 computational ranks, revealing robust performance when flow cells exceed 200 per rank. Chemistry evaluations dominate the computational cost in large 3D simulations, accounting for approximately 40% of the total runtime, while flow processes contribute around 35%, and radiation solver contributions remain below 10% due to reduced evaluation frequencies. GPU accelerated chemistry evaluation, implemented with Zero-RK, demonstrates significant promise, achieving up to a 4x speedup for workloads exceeding 30,000 cells per GPU. However, diminishing returns are observed for smaller workloads due to CPU-GPU communication overhead. This study identifies key challenges, including memory bottlenecks and the effects of domain partitioning on flow scalability, while highlighting the potential of GPU-accelerated chemistry to reduce computational costs. In conclusion, these findings provide realizable run configurations for 2D, 3D, and GPU-accelerated cases, offering insights for optimizing reactive flow solvers.

CFD Scalability↗

A cohesive zone treatment for the material point method involving problems of large deformation and damage

A new algorithm is described that permits the use of cohesive zones in the material point method for problems involving large deformation and fracture. In contrast to previous cohesive zone implementations, this method does not utilize massless surface-element particles. Instead, cohesive tractions are computed using the shape function mappings from a reference grid configuration in combination with explicitly defined particle surface normals and surface positions. These normals and relative surface positions are updated each time step according to particle deformation. The tractions are converted to cohesive forces using the nodal areas and mapped back to particles using the same reference shape function mappings. These forces are then remapped by conventional particle-to-grid interpolation as external forces using the current-configuration shape-function mappings. This allows highly compliant cohesive zones to function over jump displacements larger than a grid cell. Upon damage, these interfaces can revert to conventional multi-field contact surfaces. This approach is general and readily applies to two and three dimensions as well as being compatible with damage-field gradient partitioning offering exceptional computational flexibility. The framework for this method enables other capabilities, such as improved contact precision using explicitly defined surface normals and positions, and a method to mitigate spurious material damage at weak discontinuities between stiff brittle materials and soft or compliant materials.

Cohesive zone↗

ATDM LANL FleCSI: Topology and Execution Framework

FleCSI is a compile-time configurable C++ framework designed to support multi-physics application development. As such, FleCSI attempts to provide a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. This means that FleCSI is potentially useful to many different ECP projects. Current support includes multidimensional mesh topology, mesh geometry, and mesh adjacency information, n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures (to identify data dependencies between distributed-memory address spaces). FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent with state-of-the-art task-based runtimes such as Legion and Charm++. The model also provides support for fine-grained, data-parallel execution with backend support for runtimes such as OpenMP and C++17. The FleCSI abstraction layer provides the developer with insulation from the underlying runtimes, while allowing support for multiple runtime systems, including conventional models like asynchronous MPI. The intent is to give developers a concrete set of user-friendly programming tools that can be used now, while allowing flexibility in choosing runtime implementations and optimizations that can be applied to architectures and runtimes that arise in the future. This project is essential to the ECP Ristra Next-Generation Code project, part of ASC ATDM, because it provides a hierarchically parallel programming model that is consistent with the design of modern system architectures, but which allows for the straightforward expression of algorithmic parallelism in a portably performant manner.

97 MATHEMATICS AND COMPUTING↗

Multi-scale coarse-graining of non-conservative interactions in molecular liquids

A new bottom-up procedure for constructing non-conservative (dissipative and stochastic) interactions for dissipative particle dynamics (DPD) models is described and applied to perform hierarchical coarse-graining of a polar molecular liquid (nitromethane). The distant-dependent radial and shear frictions in functional-free form are derived consistently with a chosen form for conservative interactions by matching two-body force-velocity and three-body velocity-velocity correlations along the microscopic trajectories of the centroids of Voronoi cells (clusters), which represent the dissipative particles within the DPD description. The Voronoi tessellation is achieved by application of the K-means clustering algorithm at regular time intervals. Consistently with a notion of many-body DPD, the conservative interactions are determined through the multi-scale coarse-graining (MS-CG) method, which naturally implements a pairwise decomposition of the microscopic free energy. A hierarchy of MS-CG/DPD models starting with one molecule per Voronoi cell and up to 64 molecules per cell is derived. The radial contribution to the friction appears to be dominant for all models. As the Voronoi cell sizes increase, the dissipative forces rapidly become confined to the first coordination shell. For Voronoi cells of two and more molecules the time dependence of the velocity autocorrelation function becomes monotonic and well reproduced by the respective MS-CG/DPD models. A comparative analysis of force and velocity correlations in the atomistic and CG ensembles indicates Markovian behavior with as low as two molecules per dissipative particle. The models with one and two molecules per Voronoi cell yield transport properties (diffusion and shear viscosity) that are in good agreement with the atomistic data. The coarser models produce slower dynamics that can be appreciably attributed to unaccounted dissipation introduced by regular Voronoi re-partitioning as well as by larger numerical errors in mapping out the dissipative forces. The framework presented herein can be used to develop computational models of real liquids which are capable of bridging the atomistic and mesoscopic scales.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

New multi-level codes over GF(q)

Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.

Wu, Jiantian↗

New multilevel codes over GF(q)

Set partitioning to multi-dimensional signal spaces over GF(q), particularly GF sup q-1(q) and GF sup q (q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). Two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum distance d sub min greater than or = d, are presented. These two classes of codes use Reed-Solomon codes as component codes. They can be easily decoded as block length q-1 Reed-Solomon codes or block length q or q + 1 extended Reed-Solomon codes using multi-stage decoding. Many of these codes have larger distances than comparable q-ary block codes, as component codes. Low rate q-ary convolutional codes, work error correcting convolutional codes, and binary-to-q-ary convolutional codes can also be used to construct multi-level trellis codes over GF(q) or binary-to-q-ary trellis codes, some of which have better performance than the above block codes. All of the new codes have simple decoding algorithms based on hard decision multi-stage decoding.

Wu, Jiantian↗

Development and Validation of a Conjugate Heat Transfer Model for the Two-Phase CFD Code NEK-2P

A project is underway to develop, verify and validate an advanced two-phase flow modeling capability for the highly-scalable, high-performance CFD code NEK5000. The goal of the project is to develop a new two-phase version of the NEK5000 code, named NEK-2P, to simulate the two-phase flow and heat transfer phenomena that occur in a Boiling Water Reactor (BWR) fuel bundle under various operating conditions. The NEK-2P two-phase flow models follow the approach used for the Extended Boiling Framework (EBF) [2-3] previously developed at Argonne, but include more fundamental physical models of boiling phenomena and advanced numerical algorithms for improved computational accuracy, robustness, and computational speed. The development of the NEK-2P two-phase solver and the implementation of the Extended Boiling Framework two-phase models were initially supported by Argonne National Laboratory (Argonne) through a Laboratory Directed Research and Development (LDRD) project during FY2014-2016. The development and validation of the two-phase models through analyses of selected two-phase boiling flow experiments was supported by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program in FY2017-2019. This report focuses on the FY2019 development and validation of the Conjugate Heat Transfer (CHT) model for the NEK-2P Two-Phase, Computational Fluid Dynamics (CFD) code. The NEK-2P CHT model calculates the coupled behavior of the fluid and solid domains. In the fluid domain NEK-2P calculates the vapor and liquid phase temperatures, velocities and mass fractions. In the solid domain only the temperatures are calculated. The fluid and solid domains are coupled with a heat flux boundary condition at the fluid-solid interface. The heat flux and the wall temperatures at the fluid-solid interface are updated using the NEK-2P wall heat-flux partitioning model. A wall heat flux boundary condition is also applied to the exterior surface of the solid domain. The CHT model validation was illustrated through the analysis of three of the Becker Critical Heat Flux (CHF) tests. Reasonably good agreement with measured data was obtained in predicting the CHF location and post CHF wall temperature behavior illustrating the ability of the NEK-2P CHT model to simulate the CHF phenomena for a wide range of thermal-hydraulic conditions. Apart from the CHT model development and validation, initial simulations were performed for the Virginia Tech. (VT) 3x3 bare rod bundle experiments including both cold and boiling flow simulations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗