Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Computational efficiency”

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 307 records · Page 17

Assimilation of Multiscale Data into Multifidelity Biogeochemical Models (Final Report)

Quantitative predictions of subsurface processes rely on computational models that capture, with different degrees of fidelity, complex interactions between hydrologic and biogeochemical processes. Molecular- and pore-scale models provide a high-fidelity representation of these processes but are impractical at the field scale. Reduced complexity (e.g., field-scale or data-driven) models sacrifice some degree of fidelity in favor of computational efficiency. Uncertainty and assimilation of data into model predictions, pose a question of model selection: Given a significant difference in computational cost, can a lower-fidelity model be preferable to its higher-fidelity counterpart? Since a predictive model must be computable in reasonable time it has to operate at the field scale, with molecular- and pore-scale data (obtained either from simulations or measurements) determining both the model's structure and parameters. Availability of such multi-resolution data raises a question hitherto undressed in hydrogeology: Can a coarse model dynamically ``learn'' its own structure (e.g., adjust the reaction pathways in its transport module) as more fine-scale data become available during simulations? Our results in multifidelity simulations, data assimilation, and machine learning led us to hypothesize that the answer to these questions is ``yes''. The overarching goal of this project was to confirm this hypothesis by developing scalable, computationally efficient tools for assimilation of data into multiscale models, in which fine-scale data and simulations dynamically inform and autonomously modify coarse-scale models. Our research led to nine manuscripts, three of which have been published and the other six are currently under review.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Data-driven modeling of coarse mesh turbulence for reactor transient analysis using convolutional recurrent neural networks

Advanced nuclear reactors often exhibit complex thermal-fluid phenomena during transients. To accurately capture such phenomena, a coarse-mesh three-dimensional (3-D) modeling capability is desired for modern nuclear-system code. In the coarse-mesh 3-D modeling of advanced-reactor transients that involve flow and heat transfer, accurately predicting the turbulent viscosity is a challenging task that requires an accurate and computationally efficient model to capture the unresolved fine-scale turbulence. In this work, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor. The model has a coarse mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data to ensure accuracy. A novel neural network architecture, combining a densely connected convolutional network and a long-short-term-memory network, is developed that can efficiently learn from the spatial temporal CFD transient simulation results. The neural network model was trained and optimized on a loss-of flow transient and demonstrated high accuracy in predicting the turbulent viscosity field during the whole transient. The trained model's generalization capability was also investigated on two other transients with different inlet conditions. The study demonstrates the potential of applying the proposed data-driven approach to support the coarse-mesh multi-dimensional modeling of advanced reactors.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Kinetic energy classification and smoothing for compact B-spline basis sets in quantum Monte Carlo

Quantum Monte Carlo calculations of defect properties of transition metal oxides have become feasible in recent years due to increases in computing power. As the system size has grown, availability of on-node memory has become a limiting factor. Saving memory while minimizing computational cost is now a priority. The main growth in memory demand stems from the B-spline representation of the single particle orbitals, especially for heavier elements such as transition metals where semi-core states are present. Despite the associated memory costs, splines are computationally efficient. In this paper, we explore alternatives to reduce the memory usage of splined orbitals without significantly affecting numerical fidelity or computational efficiency. We make use of the kinetic energy operator to both classify and smooth the occupied set of orbitals prior to splining. By using a partitioning scheme based on the per-orbital kinetic energy distributions, we show that memory savings of about 50% is possible for select transition metal oxide systems. Finally, for production supercells of practical interest, our scheme incurs a performance penalty of less than 5%.

97 MATHEMATICS AND COMPUTING↗

MLPF: efficient machine-learned particle-flow reconstruction using graph neural networks

In general-purpose particle detectors, the particle-flow algorithm may be used to reconstruct a comprehensive particle-level view of the event by combining information from the calorimeters and the trackers, significantly improving the detector resolution for jets and the missing transverse momentum. In view of the planned high-luminosity upgrade of the CERN Large Hadron Collider (LHC), it is necessary to revisit existing reconstruction algorithms and ensure that both the physics and computational performance are sufficient in an environment with many simultaneous proton–proton interactions (pileup). Machine learning may offer a prospect for computationally efficient event reconstruction that is well-suited to heterogeneous computing platforms, while significantly improving the reconstruction quality over rule-based algorithms for granular detectors. We introduce MLPF, a novel, end-to-end trainable, machine-learned particle-flow algorithm based on parallelizable, computationally efficient, and scalable graph neural network optimized using a multi-task objective on simulated events. We report the physics and computational performance of the MLPF algorithm on a Monte Carlo dataset of top quark–antiquark pairs produced in proton–proton collisions in conditions similar to those expected for the high-luminosity LHC. The MLPF algorithm improves the physics response with respect to a rule-based benchmark algorithm and demonstrates computationally scalable particle-flow reconstruction in a high-pileup environment.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Rotational symmetry relation for efficient response function generation in the coarse mesh transport method COMET

The coarse mesh transport code COMET is a continuous energy hybrid stochastic-deterministic neutronics solver with high fidelity and formidable computation speed in solving reactor core problems. Its method is based on the incident flux expansion theory. In this work, we take advantage of the local geometric symmetry in many reactor cores lattices (e.g., fuel lattices and reflector blocks) to develop relations among the flux response expansion coefficients for symmetric surfaces to further improve the computational efficiency of the COMET response function generation tool (method). This is done by a rigorous derivation of the transformation matrices for the angular and spatial expansion moments resulting from a rotation of a coarse mesh by an arbitrary angle. The relations for the response coefficients for the symmetric surfaces can be then written as the Kronecker product of those transformation matrices. The method is implemented into COMET and tested on two advanced high temperature reactor (AHTR) full-length single assembly benchmark problems. The COMET results using the response function library based on the symmetry relations were compared to those using the library directly generated by continuous energy Monte Carlo for all surfaces. It was found that the eigenvalues and stripe-wise fission densities using the two libraries are in statistical agreement as expected. This indicates that the new method maintains the high fidelity of the original COMET method while improving the computational efficiency in the response function generation by 270% to 400%, depending on the local geometric symmetry. This method also reduces the size of the response function library by the same magnitude (270% to 400%). (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗

An adaptive ANOVA-based PCKF for high-dimensional nonlinear inverse modeling

The probabilistic collocation-based Kalman filter (PCKF) is a recently developed approach for solving inverse problems. It resembles the ensemble Kalman filter (EnKF) in every aspect—except that it represents and propagates model uncertainty by polynomial chaos expansion (PCE) instead of an ensemble of model realizations. Previous studies have shown PCKF is a more efficient alternative to EnKF for many data assimilation problems. However, the accuracy and efficiency of PCKF depends on an appropriate truncation of the PCE series. Having more polynomial chaos basis functions in the expansion helps to capture uncertainty more accurately but increases computational cost. Selection of basis functions is particularly important for high-dimensional stochastic problems because the number of polynomial chaos basis functions required to represent model uncertainty grows dramatically as the number of input parameters (random dimensions) increases. In classic PCKF algorithms, the PCE basis functions are pre-set based on users' experience. Also, for sequential data assimilation problems, the basis functions kept in PCE expression remain unchanged in different Kalman filter loops, which could limit the accuracy and computational efficiency of classic PCKF algorithms. To address this issue, we present a new algorithm that adaptively selects PCE basis functions for different problems and automatically adjusts the number of basis functions in different Kalman filter loops. The algorithm is based on adaptive functional ANOVA (analysis of variance) decomposition, which approximates a high-dimensional function with the summation of a set of low-dimensional functions. Thus, instead of expanding the original model into PCE, we implement the PCE expansion on these low-dimensional functions, which is much less costly. We also propose a new adaptive criterion for ANOVA that is more suited for solving inverse problems. The new algorithm was tested with different examples and demonstrated great effectiveness in comparison with non-adaptive PCKF and EnKF algorithms.

97 MATHEMATICS AND COMPUTING↗

On coarse projective integration for atomic deposition in amorphous systems

Direct molecular dynamics simulation of atomic deposition under realistic conditions is notoriously challenging because of the wide range of time scales that must be captured. Numerous simulation approaches have been proposed to address the problem, often requiring a compromise between model fidelity, algorithmic complexity, and computational efficiency. Coarse projective integration, an example application of the “equation-free” framework, offers an attractive balance between these constraints. Here, periodically applied, short atomistic simulations are employed to compute time derivatives of slowly evolving coarse variables that are then used to numerically integrate differential equations over relatively large time intervals. A key obstacle to the application of this technique in realistic settings is the “lifting” operation in which a valid atomistic configuration is recreated from knowledge of the coarse variables. Using Ge deposition on amorphous SiO{sub 2} substrates as an example application, we present a scheme for lifting realistic atomistic configurations comprised of collections of Ge islands on amorphous SiO{sub 2} using only a few measures of the island size distribution. The approach is shown to provide accurate initial configurations to restart molecular dynamics simulations at arbitrary points in time, enabling the application of coarse projective integration for this morphologically complex system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT): Part I. The clear-sky model

The solar energy industry often uses individual steps to empirically compute plane-of-array (POA) irradiance from horizontal irradiance and decompose it to narrow-wavelength bands. Conventional radiative transfer models designed for meteorological applications requires significant computing efforts in practice; however, they provide a physics-based solution of radiance and therefore are capable of computing spectral POA irradiances in a single step. In this study, we integrate the advantages of the current models and develop an innovative radiative transfer model, the Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMS-NIT), to efficiently compute irradiances on inclined photovoltaics (PV) panels for 2002 narrow-wavelength bands from 0.28 to 4.0 um. This study is reported in two parts. Part I presents the methodology and performance evaluation of the new model under clear-sky conditions. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS), which was designed to compute clear-sky irradiances, is employed to rapidly provide the optical properties of a given clear-sky atmosphere. The clear-sky radiances in the narrow-wavelength bands are computed by considering three paths of photon transmission and solving the radiative transfer equation with the single-scattering approximation. The Bi-directional Transmittance Distribution Function (BTDF) of aerosols is given by their single-scattering phase function with a correction using a two-stream approximation. The validation analysis confirms that FARMS-NIT has improved accuracy compared to TMYSPEC as evaluated by both surface observations and a state-of-the-art radiative transfer model. This model substantially improves computational efficiency compared to other radiative transfer models though it uses slightly more computing time than TMYSPEC. Part II of this study addresses the model in cloud-sky conditions and will be published as a companion paper.

14 SOLAR ENERGY↗

An Improved Formulation for Hybridizable Discontinuous Galerkin Fluid-Structure Interaction Modeling with Reduced Computational Expense

Here, this work presents two computational efficiency improvements for the hybridizable discontinuous Galerkin (HDG) fluid-structure interaction (FSI) model presented by Sheldon et al. A new formulation for the solid is presented that eliminates the global displacement, resulting in the velocity being the only global solid variable. This necessitates a change to the solid-mesh displacement coupling, which is accounted for by coupling the local solid displacement to the global mesh displacement. Additionally, the mesh basis and test functions are restricted to linear polynomials, rather than being equal-order with the fluid and solid. This change increases the computational efficiency dynamically, with greater benefit the higher order the computation, when compared to an equal-order formulation. These two improvements result in a 50% reduction in the number of global degrees of freedom for high-order simulations for both the fluid and solid domains, as well as an approximately 50% reduction in the number of local fluid domain degrees of freedom for high-order simulations. Finally, the new, more efficient formulation is compared against that from Sheldon et al. and negligible change of accuracy is found.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Modified Network Alteration Model to Predict Quasi-Static Behavior of the Cross-Linked Polymers During Hydrolytic Aging

Abstract The network alteration theory is utilized to capture the effects of hydrolytic aging on the mechanical integrity of the polymer matrix. Hydrolytic degradation generally considered as a result of two simultaneous chemical phenomena; (i) reduction of the cross-links, and (ii) active chain loss. Assuming the alteration of the chain density is identical to the change of the number average molecular weight along the aging trajectory, the strain energy of polymer matrix can be rewritten as a function of deformation, deformation history, storage time, and aging temperature. The proposed model includes only five physically inspired material parameters. Thus, while it is computationally efficient, it shows good agreement with own experimental data, which performed on various range of accelerated aging temperatures and times. With respect to its computational efficiency, simplicity, accuracy, and interpret-ability, the model is a good choice for advanced implementations in FE programs.

Bahrololoumi, Amir↗

Second-order splitting schemes for a class of reactive systems

We consider the numerical time integration of a class of reaction-transport systems that are described by a set of ordinary differential equations for primary variables. In the governing equations, the terms involved may require the knowledge of secondary variables, which are functions of the primary variables. Specifically, we consider the case where, given the primary variables, the evaluation of the secondary variables is computationally expensive. To solve this class of reaction-transport equations, we develop and demonstrate several computationally efficient splitting schemes, wherein the portions of the governing equations containing chemical reaction terms are separated from those parts containing the transport terms. A computationally efficient solution to the transport sub-step is achieved through the use of linearization or predictor-corrector methods. The splitting schemes are applied to the reactive flow in a continuously stirred tank reactor (CSTR) with the Davis-Skodjie reaction model, to the CO+H{sub 2} oxidation in a CSTR with detailed chemical kinetics, and to a reaction-diffusion system with an extension of the Oregonator model of the Belousov-Zhabotinsky reaction. As demonstrated in the test problems, the proposed splitting schemes, which yield efficient solutions to the transport sub-step, achieve second-order accuracy in time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

User's Guide for TOUGH2-MP - A Massively Parallel Version of the TOUGH2 Code

TOUGH2-MP is a massively parallel (MP) version of the TOUGH2 code, designed for computationally efficient parallel simulation of isothermal and nonisothermal flows of multicomponent, multiphase fluids in one, two, and three-dimensional porous and fractured media. In recent years, computational requirements have become increasingly intensive in large or highly nonlinear problems for applications in areas such as radioactive waste disposal, CO2 geological sequestration, environmental assessment and remediation, reservoir engineering, and groundwater hydrology. The primary objective of developing the parallel-simulation capability is to significantly improve the computational performance of the TOUGH2 family of codes. The particular goal for the parallel simulator is to achieve orders-of-magnitude improvement in computational time for models with ever-increasing complexity. TOUGH2-MP is designed to perform parallel simulation on multi-CPU computational platforms. An earlier version of TOUGH2-MP (V1.0) was based on the TOUGH2 Version 1.4 with EOS3, EOS9, and T2R3D modules, a software previously qualified for applications in the Yucca Mountain project, and was designed for execution on CRAY T3E and IBM SP supercomputers. The current version of TOUGH2-MP (V2.0) includes all fluid property modules of the standard version TOUGH2 V2.0. It provides computationally efficient capabilities using supercomputers, Linux clusters, or multi-core PCs, and also offers many user-friendly features. The parallel simulator inherits all process capabilities from V2.0 together with additional capabilities for handling fractured media from V1.4. This report provides a quick starting guide on how to set up and run the TOUGH2-MP program for users with a basic knowledge of running the (standard) version TOUGH2 code, The report also gives a brief technical description of the code, including a discussion of parallel methodology, code structure, as well as mathematical and numerical methods used. To familiarize users with the parallel code, illustrative sample problems are presented.

58 GEOSCIENCES↗

Machine Learning Assisted Safety Modeling and Analysis of Advanced Reactors

With the advances in computational power and numerical methods, analysts can now rely on first-principle simulations to predict ultra-fine details in a variety of applications. Advances in machine learning (ML) have produced algorithms that can now learn high-level abstractions via hierarchical models. This project aims to leverage advances in ML techniques and the available high-resolution simulation data to develop a novel modeling and simulation (M\&S) methodology for reactor safety analysis. While application-agnostic ML techniques are available, complex physics constraints need to be incorporated into ML techniques to build ML-based closures for computationally efficient predictive simulations. This project intends to develop a physics-guided data-driven multi-scale methodology for M\&S of advanced reactors. The project focuses on thermal fluid (T/F) phenomena, which play major roles in advanced reactor safety. Specifically, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor (SFR). The model has a coarse-mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data with Reynolds-averaged Navier-Stokes (RANS) turbulence model to ensure accuracy. Three different neural networks are developed and tested for loss-of-flow transients in the hot pool of SFR, i.e. the densely connected convolutional neural network (DCNN), long-short-term-memory network based on proper orthogonal decomposition (POD-LSTM), and the DCNN informed by LSTM (DCNN-LSTM). The performances of these three neural networks are evaluated based on baseline models. The DCNN-LSTM model has been chosen for further hyperparameter optimization. Furthermore, based on a simplified two-dimensional case, uncertainty quantification (UQ) of the developed ML-based closure are investigated with three methods, i.e. Monte Carlo dropout, deep ensemble, and Bayesian neural network. The developed ML-based turbulent viscosity closure relation based on deep ensemble is then integrated into the system analysis module SAM and serves as a term in the conservation equations. Such a SAM-ML based procedure guarantees that the obtained results are consistent with the physical constraints of the thermal-fluid system. The SAM-ML simulation on the same loss-of-flow transient showed comparable accuracy with the CFD simulation but with a much coarser mesh setup. Last but not least, the ML-based closure improvement with the support of higher-fidelity data from large eddy simulation (LES) is discussed. As a first step towards this direction, a baseline LES simulation is performed to obtain comparable data with RANS results. Based on the early results, future investigation on further improving the ML-based closure is discussed. We believe the developed approach that combines scientific machine learning with nuclear system analysis code can benefit the advanced reactor community as more accurate safety analyses will better characterize reactor safety margins and reduce licensing efforts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Ps and Qs: Quantization-Aware Pruning for Efficient Low Latency Neural Network Inference

Efficient machine learning implementations optimized for inference in hardware have wide-ranging benefits, depending on the application, from lower inference latency to higher data throughput and reduced energy consumption. Two popular techniques for reducing computation in neural networks are pruning, removing insignificant synapses, and quantization, reducing the precision of the calculations. In this work, we explore the interplay between pruning and quantization during the training of neural networks for ultra low latency applications targeting high energy physics use cases. Techniques developed for this study have potential applications across many other domains. We study various configurations of pruning during quantization-aware training, which we term quantization-aware pruning, and the effect of techniques like regularization, batch normalization, and different pruning schemes on performance, computational complexity, and information content metrics. We find that quantization-aware pruning yields more computationally efficient models than either pruning or quantization alone for our task. Further, quantization-aware pruning typically performs similar to or better in terms of computational efficiency compared to other neural architecture search techniques like Bayesian optimization. Surprisingly, while networks with different training configurations can have similar performance for the benchmark application, the information content in the network can vary significantly, affecting its generalizability.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Partially Collapsed Gibbs Samplers for Linear Inverse Problems and Applications to X-ray Imaging

Deblurring is one of the most common linear inverse problems in imaging, and most methods for deblurring an image assume that the convolution kernel, the so-called point spread function (PSF), is known or attempt to reconstruct the PSF simultaneously with the image. For many experimental imaging systems, like high energy X-ray radiography systems, the PSF must be computed from calibration imagery. The associated inverse problem is large-scale, so, in order to compute meaningful uncertainties with the reconstruction, it is common to use hierarchical Bayesian models and Markov chain Monte Carlo methods for sampling from the posterior. Classical Gibbs samplers can suffer from long autocorrelation lengths in the Markov chain when the reconstructed quantity in the inverse problem is finely discretized, resulting in poor computational efficiency of the Markov chain. In this work we present partially collapsed Gibbs samplers for linear inverse problems that greatly decrease correlations in the Markov chain, thus increasing the computational efficiency of the algorithms, and we present the results of the enhanced samplers on the problem of reconstructing the point spread function for an X-ray imaging system at the U.S. Department of Energy's Nevada National Security Site.

97 MATHEMATICS AND COMPUTING↗

Thermo-hydraulic steam pipe models for district heating simulations: Simplifications to balance accuracy and simulation speed

Steam piping networks are essential for optimizing performance in industrial processes and district heating systems. However, dynamic models that balance thermo-hydraulic accuracy with computational efficiency remain limited. In response, this paper presents a new discretized steam pipe model based on the plug flow approach, capturing key thermo-hydraulic behaviors while simplifying steam phase change processes. Implemented in Modelica, the model accurately calculates temperature and pressure distributions along steam pipelines. To improve computational efficiency for district-scale simulations, five model simplifications are introduced: lumped thermo-hydraulic functions, empirical correlations, fluid state approximations, steady-state dynamics and inclusion of flow derivatives. These simplified models achieve 85%-98% accuracy in predicting pressure drop and condensation losses, including dynamic condensate behavior during pipe warm-up—a factor often overlooked in existing models. The models support diverse network configurations, scaling effectively to systems with multiple distribution pipes and connected building loads. Discrete models provide detailed insights but exhibit a cubic increase in simulation time as the network scales by N connected building O(N 2.42 ). In contrast, lumped models simulate 10–28 times faster than discrete, offering quadratic scaling of simulation time O(N 1.73 ). However, they still require 6 times more computation time than a lossless network, highlighting the inherent computational challenges of modeling compressible fluid flow. In conclusion, the steady-state lumped variant, with its near-linear scalability in computational time O(N 1.01 ), emerges as an efficient solution for preliminary design evaluations and extensive parametric studies.

15 GEOTHERMAL ENERGY↗

Comparison of Different Upscaling Methods for Predicting Thermal Conductivity of Complex Heterogeneous Materials System: Application on Nuclear Waste Forms

To develop a strategy in thermal conductivity prediction of a complex heterogeneous materials system, loaded nuclear waste forms, the computational efficiency and accuracy of different upscaling methods have been evaluated. The effective thermal conductivity, obtained from microstructure information and local thermal conductivity of different components, is critical in predicting the life and performance of waste form during storage. Several methods, including the Taylor model, Sachs model, self-consistent model, and statistical upscaling method, were developed and implemented. Microstructure based finite element method (FEM) prediction results were used to as benchmark to determine the accuracy of the different upscaling methods. Micrographs from waste forms with varying waste loadings were used in the prediction of thermal conductivity in FEM and homogenization methods. Prediction results demonstrated that in term of efficiency, boundary models (e.g., Taylor model and Sachs model) are stronger than the self-consistent model, statistical upscaling method, and finite element method. However, when balancing computational efficiency and accuracy, statistical upscaling is a useful method in predicting effective thermal conductivity for nuclear waste forms.

36 MATERIALS SCIENCE↗