Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “convergence”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,603 records · Page 89

Space-Dependent Wielandt Shifts for Multigroup Diffusion Eigenvalue Problems

We present a new concept—the space-dependent Wielandt shift (SDWS)—for accelerating the convergence of the power iteration (PI) scheme for multigroup diffusion k-eigenvalue problems. The SDWS improves on standard Wielandt shift (WS) techniques, which are empirical in nature and are typically effective only when the current estimate of the solution is reasonably converged. By accounting for the physics of the problem through SDWS, we are able to improve the acceleration for the initial iterates when the current estimate of the solution is not close to convergence. Numerical results from one-dimensional problems suggest that, compared to standard WS techniques, the new SDWS techniques can provide upward of a 46% reduction in the number of PIs required for convergence and a 40% reduction in the computational time required. This improvement is sensitive to several problem-dependent factors, such as the geometry and energy-dependence of the problem, the spatial discretization, and the initial guess. The reduction in computational time is also dependent on the linear solver in the PI scheme, as it is well known that WSs can significantly worsen the conditioning of the diffusion linear system. In this paper, we provide a detailed study of the impact of WSs on the performance of several iterative linear solvers. Results from our implementation of SDWS in the three-dimensional (3D) code MPACT show that SDWS can provide similar speedups for 3D multigroup diffusion eigenvalue problems. These results also show that moderate speedups can be obtained by applying SDWS to the coarse mesh finite difference (CMFD) solver in a CMFD-accelerated transport scheme. However, the benefit of doing this may be limited because all but the first few CMFD solves are relatively easy to converge, regardless of the WS used.

Nuclear Science & Technology↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Geographical Variation in Community Divergence: Insights from Tropical Forest Monodominance by Ectomycorrhizal Trees

Convergence occurs in both species traits and community structure, but how convergence at the two scales influences each other remains unclear. To address this question, we focus on tropical forest monodominance, in which a single, often ectomycorrhizal (EM) tree species occasionally dominates forest stands within a landscape otherwise characterized by diverse communities of arbuscular mycorrhizal (AM) trees. Such monodominance is a striking potential example of community divergence resulting in alternative stable states. However, it is observed only in some tropical regions. A diverse suite of AM and EM trees locally codominate forest stands elsewhere. We develop a hypothesis to explain this geographical difference using a simulation model of plant community assembly. Simulation results suggest that in a region with a few EM species (e.g., South America), EM trees experience strong selection for convergent traits that match the abiotic conditions of the environment. Consequently, EM species successfully compete against other species to form monodominant stands via positive plant-soil feedbacks. By contrast, in a region with many EM species (e.g., Southeast Asia), species maintain divergent traits because of complex plant-soil feedbacks, with no species having traits that enable monodominance. An analysis of plant trait data from Borneo and Peruvian Amazon was inconclusive. Furthermore, this work highlights the utility of geographical comparison in understanding the relationship between trait convergence and community convergence.

59 BASIC BIOLOGICAL SCIENCES↗

SIMULATIONS OF WIDE-FIELD WEAK LENSING SURVEYS. I. BASIC STATISTICS AND NON-GAUSSIAN EFFECTS

We study the lensing convergence power spectrum and its covariance for a standard {lambda}CDM cosmology. We run 400 cosmological N-body simulations and use the outputs to perform a total of 1000 independent ray-tracing simulations. We compare the simulation results with analytic model predictions. The semianalytic model based on Smith et al. fitting formula underestimates the convergence power by {approx} 30% at arcmin angular scales. For the convergence power spectrum covariance, the halo model reproduces the simulation results remarkably well over a wide range of angular scales and source redshifts. The dominant contribution at small angular scales comes from the sample variance due to the number fluctuations of halos in a finite survey volume. The signal-to-noise ratio for the convergence power spectrum is degraded by the non-Gaussian covariances by up to a factor of 5 for a weak lensing survey to z{sub s} {approx} 1. The probability distribution of the convergence power spectrum estimators, among the realizations, is well approximated by a {chi}{sup 2} distribution with broadened variance given by the non-Gaussian covariance, but has a larger positive tail. The skewness and kurtosis have non-negligible values especially for a shallow survey. We argue that a prior knowledge on the full distribution may be needed to obtain an unbiased estimate on the ensemble-averaged band power at each angular scale from a finite volume survey.

79 ASTRONOMY AND ASTROPHYSICS↗

Quantifying resolution in cosmological N- body simulations using self-similarity

ABSTRACT We demonstrate that testing for self-similarity in scale-free simulations provides an excellent tool to quantify the resolution at small scales of cosmological N-body simulations. Analysing two-point correlation functions measured in simulations using abacus , we show how observed deviations from self-similarity reveal the range of time and distance scales in which convergence is obtained. While the well-converged scales show accuracy below 1 per cent, our results show that, with a small force softening length, the spatial resolution is essentially determined by the mass resolution. At later times, the lower cut-off scale on convergence evolves in comoving units as a−1/2 (a being the scale factor), consistent with a hypothesis that it is set by two-body collisionality. A corollary of our results is that N-body simulations, particularly at high red-shift, contain a significant spatial range in which clustering appears converged with respect to the time-stepping and force softening but has not actually converged to the physical continuum result. The method developed can be applied to determine the resolution of any clustering statistic and extended to infer resolution limits for non-scale-free simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Testing dark matter halo properties using self-similarity

ABSTRACT We use self-similarity in N-body simulations of scale-free models to test for resolution dependence in the mass function and two-point correlation functions of dark matter haloes. We use 10243 particle simulations performed with abacus , and compare results obtained with two halo finders: friends-of-friends (fof ), and rockstar . The fof mass functions show a systematic deviation from self-similarity which is explained by resolution dependence of the fof mass assignment previously reported in the literature. Weak evidence for convergence is observed only starting from haloes of several thousand particles, and mass functions are overestimated by at least as much as $20-25{{\ \rm per\ cent}}$ for haloes of 50 particles. The mass function of the default rockstar halo catalogue (with bound virial spherical overdensity mass), on the other hand, shows good convergence of the order of 50 to 100 particles per halo, with no detectable evidence at the few percent level of any systematic dependence for larger particle number. Tests show that the mass unbinding procedure in rockstar is the key factor in obtaining this much improved resolution. Applying the same analysis to the halo–halo two point correlation function, we find again strong evidence for convergence only for rockstar haloes, at separations sufficiently large so that haloes do not overlap. At these separations, we can exclude dependence on resolution at the $5-10{{\ \rm per\ cent}}$ level once haloes have of the order of 50 to 100 particles. At smaller separations results are not converged even at significantly larger particle number, and bigger simulations would be required to establish the resolution required for convergence.

79 ASTRONOMY AND ASTROPHYSICS↗

Low-Scaling Algorithm for Nudged Elastic Band Calculations Using a Surrogate Machine Learning Model

We present the incorporation of a surrogate Gaussian process regression (GPR) atomistic model to greatly accelerate the rate of convergence of classical nudged elastic band (NEB) calculations. In our surrogate model approach, the cost of converging the elastic band no longer scales with the number of moving images on the path. This provides a far more efficient and robust transition state search. In contrast to a conventional NEB calculation, the algorithm presented here eliminates any need for manipulating the number of images to obtain a converged result. This is achieved by inventing a new convergence criteria that exploits the probabilistic nature of the GPR to use uncertainty estimates of all images in combination with the force in the saddle point in the target model potential. In conclusion, our method is an order of magnitude faster in terms of function evaluations than the conventional NEB method with no accuracy loss for the converged energy barrier values.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Designs from Local Random Quantum Circuits with SU ( d ) Symmetry

The generation of k -designs (pseudorandom distributions that emulate the Haar measure up to k moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive understanding of this problem for ordinary random circuits, the crucial situations in which symmetries or conservation laws are in play are known to pose fundamental challenges and remain little understood. Here, we construct explicit local unitary ensembles that can achieve high-order unitary k -designs under transversal continuous symmetry, in the particularly important SU ( d ) case. Specifically, we define the convolutional quantum alternating (CQA) group generated by 4-local SU ( d ) -symmetric Hamiltonians as well as associated 4-local SU ( d ) -symmetric random unitary circuit ensembles and prove that they form and converge to SU ( d ) -symmetric k -designs, respectively, for all k < n ( n − 3 ) / 2 , with n being the number of qudits. A key technique that we employ to obtain the results is the Okounkov-Vershik approach to S n representation theory. To study the convergence time of the CQA ensemble, we develop a numerical method using the Young orthogonal form and the S n branching rule. We provide strong evidence for a subconstant spectral gap and certain convergence time scales of various important circuit architectures, which contrast with the symmetry-free case. We also provide comprehensive explanations of the difficulties and limitations in rigorously analyzing the convergence time using methods that have been effective for cases without symmetries, including Knabe’s local gap threshold and Nachtergaele’s martingale methods. This suggests that a novel approach is likely necessary for understanding the convergence time of SU ( d ) -symmetric local random circuits. Published by the American Physical Society 2024

Li, Zimu (ORCID:0000000314736492)↗

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We suggest a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent network partitions. Using previous observations of ADMM trajectories for a given system under varying load, the method trains a recurrent neural network (RNN) to predict the converged values of dual and consensus variables. Given a new realization of system load, a small number of initial ADMM iterations is taken as input to infer the converged values and directly inject them into the iteration. We empirically demonstrate that the online injection of these values into the ADMM iteration accelerates convergence by a significant factor for partitioned 14-, 118-and 2848-bus test systems under differing load scenarios. The proposed method has several advantages: it maintains the security of private decision variables inherent in consensus ADMM; inference is fast and so may be used in online settings; RNN-generated predictions can dramatically improve time to convergence but, by construction, can never result in infeasible ADMM subproblems; it can be easily integrated into existing software implementations. While we focus on the ADMM formulation of distributed DC-OPF in this paper, the ideas presented are naturally extended to other distributed optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Examination of Semi-Analytical Solution Methods in the Coarse Operator of Parareal Algorithm for Power System Simulation

With continuing advances in high-performance parallel computing platforms, parallel algorithms have become powerful tools for development of faster than real-time power system dynamic simulations. In particular, it has been demonstrated in recent years that parallel-in-time (Parareal) algorithms have the potential to achieve such an ambitious goal. Here, the selection of a fast and reasonably accurate coarse operator of the Parareal algorithm is crucial for its effective utilization and performance. This paper examines semi-analytical solution (SAS) methods as the coarse operators of the Parareal algorithm and explores performance of the SAS methods to the standard numerical time integration methods. Two promising time-power series-based SAS methods were considered; Adomian decomposition method and Homotopy analysis method with a windowing approach for improving the convergence. Numerical performance case studies on 10-generator 39-bus system and 327-generator 2383-bus system were performed for these coarse operators over different disturbances, evaluating the number of Parareal iterations, computational time, and stability of convergence. All the coarse operators tested with different scenarios have converged to the same corresponding true solution (if they are convergent) and the SAS methods provide comparable computational speed, while having more stable convergence to the true solution in many cases.

97 MATHEMATICS AND COMPUTING↗

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗

TH-E-17A-06: Anatomical-Adaptive Compressed Sensing (AACS) Reconstruction for Thoracic 4-Dimensional Cone-Beam CT

Purpose: The Feldkamp-Davis-Kress (FDK) algorithm currently used for clinical thoracic 4-dimensional (4D) cone-beam CT (CBCT) reconstruction suffers from noise and streaking artifacts due to projection under-sampling. Compressed sensing theory enables reconstruction of under-sampled datasets via total-variation (TV) minimization, but TV-minimization algorithms such as adaptive-steepest-descent-projection-onto-convex-sets (ASD-POCS) often converge slowly and are prone to over-smoothing anatomical details. These disadvantages can be overcome by incorporating general anatomical knowledge via anatomy segmentation. Based on this concept, we have developed an anatomical-adaptive compressed sensing (AACS) algorithm for thoracic 4D-CBCT reconstruction. Methods: AACS is based on the ASD-POCS framework, where each iteration consists of a TV-minimization step and a data fidelity constraint step. Prior to every AACS iteration, four major thoracic anatomical structures - soft tissue, lungs, bony anatomy, and pulmonary details - were segmented from the updated solution image. Based on the segmentation, an anatomical-adaptive weighting was applied to the TV-minimization step, so that TV-minimization was enhanced at noisy/streaky regions and suppressed at anatomical structures of interest. The image quality and convergence speed of AACS was compared to conventional ASD-POCS using an XCAT digital phantom and a patient scan. Results: For the XCAT phantom, the AACS image represented the ground truth better than the ASD-POCS image, giving a higher structural similarity index (0.93 vs. 0.84) and lower absolute difference (1.1*10{sup 4} vs. 1.4*10{sup 4}). For the patient case, while both algorithms resulted in much less noise and streaking than FDK, the AACS image showed considerably better contrast and sharpness of the vessels, tumor, and fiducial marker than the ASD-POCS image. In addition, AACS converged over 50% faster than ASD-POCS in both cases. Conclusions: The proposed AACS algorithm was shown to reconstruct thoracic 4D-CBCT images more accurately and with faster convergence compared to ASD-POCS. The superior image quality and rapid convergence makes AACS promising for future clinical use.

60 APPLIED LIFE SCIENCES↗

Mechanisms initiating deep convection over complex terrain during COPS.

Precipitating convection in a mountain region of moderate topography is investigated, with particular emphasis on its initiation in response to boundary-layer and mid- and upper-tropospheric forcing mechanisms. The data used in the study are from COPS (Convective and Orographically-induced Precipitation Study) that took place in southwestern Germany and eastern France in the summer of 2007. It is found that the initiation of precipitating convection can be roughly classified as being due to either: (i) surface heating and low-level flow convergence; (ii) surface heating and moisture supply overcoming convective inhibition during latent and/or potential instability; or (iii) mid-tropospheric dynamical processes due to mesoscale convergence lines and forced mean vertical motion. These phenomena have to be adequately represented in models in order to improve quantitative precipitation forecast. Selected COPS cases are analyzed and classified into these initiation categories. Although only a subset of COPS data (mainly radiosondes, surface weather stations, radar and satellite data) are used here, it is shown that convective systems are captured in considerable detail by sensor synergy. Convergence lines were observed by Doppler radar in the location where deep convection is triggered several hours later. The results suggest that in many situations, observations of the location and timing of convergence lines will facilitate the nowcasting of convection. Further on, forecasting of the initiation of convection is significantly complicated if advection of potentially convective air masses over changing terrain features plays a major role. The passage of a frontal structure over the Vosges - Rhine valley - Black Forest orography was accompanied by an intermediate suppression of convection over the wide Rhine valley. Further downstream, an intensification of convection was observed over the Black Forest due to differential surface heating, a convergence line, and the flow generated by a gust front.

54 ENVIRONMENTAL SCIENCES↗

Designing a parallel Feel-the-Way clustering algorithm on HPC systems

This paper introduces a new parallel clustering algorithm, named Feel-the-Way clustering algorithm, that provides better or equivalent convergence rate than the traditional clustering methods by optimizing the synchronization and communication costs. Our algorithm design centers on how to optimize three factors simultaneously: reduced synchronizations, improved convergence rate, and retained same or comparable optimization cost. To compare the optimization cost, we use the Sum of Square Error (SSE) cost as the metric, which is the sum of the square distance between each data point and its assigned clusters. Compared with the traditional MPI k-means algorithm, the new Feel-the-Way algorithm requires less communications among participating processes. As for the convergence rate, the new algorithm requires fewer number of iterations to converge. As for the optimization cost, it obtains the SSE costs that are close to the k-means algorithm. In the paper, we first design the full-step Feel-the-Way k-means clustering algorithm that can significantly reduce the number of iterations that are required by the original k-means clustering method. Next, we improve the performance of the full-step algorithm by adopting an optimized sampling-based approach, named reassignment-history-aware sampling. Our experimental results show that the optimized sampling-based Feel-the-Way method is significantly faster than the widely used k-means clustering method, and can provide comparable optimization costs. More extensive experiments with several synthetic datasets and real-world datasets (e.g., MNIST, CIFAR-10, ENRON, and PLACES-2) show that the new parallel algorithm can outperform the open source MPI k-means library by up to 110% on a high-performance computing system using 4,096 CPU cores. In addition, the new algorithm can take up to 51% fewer iterations to converge than the k-means clustering algorithm.

97 MATHEMATICS AND COMPUTING↗

An Easy Method To Accelerate An Iterative Algebraic Equation Solver

This article proposes to add a simple term to an iterative algebraic equation solver with an order n convergence rate, and to raise the order of convergence to (2n - 1). In particular, a simple algebraic equation solver with the 5th order convergence but uses only 4 function values in each iteration, is described in details. When this scheme is applied to a Newton-Raphson method of the quadratic convergence for a system of algebraic equations, a cubic convergence can be achieved with an low overhead cost of function evaluation that can be ignored as the size of the system increases.

97 MATHEMATICS AND COMPUTING↗

An Investigation into Solution Verification for CFD-DEM

This report presents the study of the convergence behavior of the computational fluid dynamicsdiscrete element method (CFD-DEM) method, specifically National Energy Technology Laboratory’s (NETL) open source MFiX code (MFiX-DEM) with a diffusion based particle-tocontinuum filtering scheme. In particular, this study focused on determining if the numerical method had a solution in the high-resolution limit where the grid size is smaller than the particle size. To address this uncertainty, fixed particle beds of two primary configurations were studied: i) fictitious beds where the particles are seeded with a random particle generator, and ii) instantaneous snapshots from a transient simulation of an experimentally relevant problem. Both problems considered a uniform inlet boundary and a pressure outflow. The CFD grid was refined from a few particle diameters down to 1/6 th of a particle diameter. The pressure drop between two vertical elevations, averaged across the bed cross-section was considered as the system response quantity of interest. A least-squares regression method was used to extrapolate the grid-dependent results to an approximate “grid-free” solution in the limit of infinite resolution. The results show that the diffusion based scheme does yield a converging solution. However, the convergence is more complicated than encountered in simpler, single-phase flow problems showing strong oscillations and, at times, oscillations superimposed on top of globally non-monotonic behavior. The challenging convergence behavior highlights the importance of using at least four grid resolutions in solution verification problems so that (over-determined) regression-based extrapolation methods may be applied to approximate the grid-free solution. The grid-free solution is very important in solution verification and VVUQ exercise in general as the difference between it and the reference solution largely determines the numerical uncertainty. By testing different randomized particle configurations of the same general problem (for the fictitious case) or different instances of freezing a transient simulation, the numerical uncertainties appeared to be on the same order of magnitude as ensemble or time averaging uncertainties. By testing different drag laws, almost all cases studied show that model form uncertainty in this one, very important closure relation was larger than the numerical uncertainty, at least with a reasonable CFD grid, roughly five particle diameters. In this study, the diffusion width (filtering length scale) was mostly set at a constant of six particle diameters. A few exploratory tests were performed to show that similar convergence behavior was observed for diffusion widths greater than approximately two particle diameters. However, this subject was not investigated in great detail because determining an appropriate filter size is really a validation question which must be determined by comparison to experimental or highly accurate numerical data. Future studies are being considered targeting solution verification of transient simulations as well as validation of the filter size with direct numerical simulation data.

97 MATHEMATICS AND COMPUTING↗

Dose Rate Evaluation for the ES-3100 Package with HEU Content Using MCNP, ADVANTG, Monaco, and MAVRIC

This paper presents a comparative study of dose rate calculations for the ES-3100 package with highly enriched uranium (HEU) content for different source configurations using computer codes: (1) MCNP; (2) Automated Variance Reduction Generator (ADVANTG)/MCNP; (3) Monaco; and (4) Monaco with Automated Variance Reduction using Importance Calculations (MAVRIC). The Model ES-3100 package was developed at the Y-12 National Security Complex for domestic and international transportation of Type B fissile radioactive material. In this study, six different source configurations (i.e., solid cylinder, cylindrical hemi-shell, cylindrical shell, rectangular plate, cylindrical rod, or cylindrical segment form) having 36 kg of HEU metal inside the package containment vessel (based on configurations in the ES-3100/HEU safety analysis report for packaging) are evaluated. Dose rates at the package surfaces and 1 m from the package surfaces are calculated for these different source configurations. MCNP and Monaco cases are run without any biasing options to accelerate the convergence. Consistent Adjoint Driven Importance Sampling (CADIS) and Forward-Weighted CADIS (FW-CADIS) methods developed at the Oak Ridge National Laboratory are implemented in ADVANTG/MCNP and MAVRIC codes to accelerate the convergence. ADVANTG generates variance reduction parameters using Denovo code, and MCNP is used with the variance reduction parameters to accelerate the convergence. MAVRIC uses Denovo code to construct an importance map and a biased source distribution that are supplied to Monaco to accelerate the Monte Carlo simulation. The FW-CADIS option in ADVANTG and MAVRIC is used to accelerate the convergence in this study. The accelerated convergence cases (ADVANTG/MCNP and MAVRIC) are about 100 times faster with 100 times less particle simulation than those cases run without biasing options (analog MCNP and analog Monaco). The MCNP, ADVANTG/MCNP, Monaco, and MAVRIC calculated dose rates at the package surfaces and at 1 m from the package surfaces for the different source configurations are compared and are found to be in general agreement.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Evaluation of Solver and Time Stepping Options and RIA Demonstration

This report summarizes Bison development and application in three areas: • Development of the layered 1D approach to permit its use with the reference residual convergence criterion that is widely used for 2D and 3D Bison simulations. For higher-dimensional simulations, this approach has resulted in significant improvements in robustness and solution efficiency, and it is expected to result in similar benefits for 1D simulations of light water reactor (LWR) rods. • A study on the effects of the chosen convergence tolerances on solution difficulty and accuracy was performed for a prototypical layered 1D simulation of an LWR fuel rod. The effect of convergence tolerance on iteration counts, run times, and several quantities of interest in the solution are compared for the various convergence tolerance. This study will be helpful for guiding the choice of convergence tolerances. • A demonstration of a reactivity insertion accident (RIA) simulation with Bison within the coupled VERA code was performed. The MPACT neutron transport code and the CTF thermal-hydraulic code provided inputs to Bison for a postulated control rod ejection scenario. This demonstrates the ability of the VERA environment to consider coupling effects not only for normal operation, but for accident conditions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗