Search NASA⌕ Search

SEARCH · Search NASA

Results for “Power Iteration”

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 55 records · Page 3

First tungsten radiation studies in DIII-D’s ITER baseline demonstration discharges

Abstract ITER Baseline Scenario plasmas were studied in DIII-D using krypton and xenon gases as a proxy for the tungsten that will be present in ITER. These impurities were chosen for having the same radiative loss rate Lz as tungsten would exhibit in the hotter ITER core. Results show that the scenario with these core radiators spans the range of impurity concentration and W radiated fraction expected for ITER, and up to 50% higher values, explored at zero injected torque, as well as 1 Nm and full co-torque injection with T ∼ 3 Nm. Stationary discharges with duration >2–4 τ R are achieved with f rad ⩾ 30% leading to a reduction in confinement of ∼10%, and a comparison with real metal radiators in the same range of f rad shows that the higher Lz at the lower temperatures in these plasmas yields too pessimistic results on the survivability and performance of this scenario in ITER. Simulations of ITER power balance including W radiation show that with concentration up to three times higher than in the DIII-D plasmas the scenario can be stationary, remaining at acceptable core radiated fraction values.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A new approach to three-dimensional neutron transport solution based on the method of characteristics and linear axial approximation

A new approach based on the method of characteristics (MOC) is proposed to solve the neutron transport equation. A new three-dimensional (3D) spatial discretization is applied to avoid the instability issue of the transverse leakage iteration of the traditional 2D/1D approach. In this new approach, the axial and radial variables are discretized in two different ways: the linear expansion is performed in the axial direction, then, the 3D solution of the angular flux is transformed to be the planar solution of 2D angular expansion moments, which are solved by the planar MOC sweeping. Based on the boundary and interface continuity conditions, the 2D expansion moment solution is equivalently transformed to be the solution of the axially averaged angular flux. Using the piecewise averaged angular flux at the top and bottom surfaces of 3D meshes, the planes are coupled to give the 3D angular flux distribution. The 3D CMFD linear system is established from the surface net current of every 3D pin-mesh to accelerate the convergence of power iteration. The STREAM code is extended to be capable of handling 3D problems based on the new approach. Several benchmarks are tested to verify its feasibility and accuracy, including the 3D homogeneous benchmarks and heterogeneous benchmarks. The computational sensitivity is discussed. The results show good accuracy in all tests. With the CMFD acceleration, the convergence is stable. In addition, a pin-cell problem with void gap is calculated. This shows the advantage compared to the traditional 2D/1D MOC methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A general solution strategy of modified power method for higher mode solutions

A general solution strategy of the modified power iteration method for calculating higher eigenmodes has been developed and applied in continuous energy Monte Carlo simulation. The new approach adopts four features: 1) the eigen decomposition of transfer matrix, 2) weight cancellation for higher modes, 3) population control with higher mode weights, and 4) stabilization technique of statistical fluctuations using multi-cycle accumulations. The numerical tests of neutron transport eigenvalue problems successfully demonstrate that the new strategy can significantly accelerate the fission source convergence with stable convergence behavior while obtaining multiple higher eigenmodes at the same time. The advantages of the new strategy can be summarized as 1) the replacement of the cumbersome solution step of high order polynomial equations required by Booth's original method with the simple matrix eigen decomposition, 2) faster fission source convergence in inactive cycles, 3) more stable behaviors in both inactive and active cycles, and 4) smaller variances in active cycles. Advantages 3 and 4 can be attributed to the lower sensitivity of the new strategy to statistical fluctuations due to the multi-cycle accumulations. The application of the modified power method to continuous energy Monte Carlo simulation and the higher eigenmodes up to 4th order are reported for the first time in this paper. -- Graphical abstract: -- Highlights: •Modified power method is applied to continuous energy Monte Carlo simulation. •Transfer matrix is introduced to generalize the modified power method. •All mode based population control is applied to get the higher eigenmodes. •Statistic fluctuation can be greatly reduced using accumulated tally results. •Fission source convergence is accelerated with higher mode solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automatic treatment of the variance estimation bias in TRIPOLI-4 criticality calculations

The central limit (CLT) theorem States conditions under which the mean of a sufficiently large number of independent random variables, each with finite mean and variance, will be approximately normally distributed. The use of Monte Carlo transport codes, such as Tripoli4, relies on those conditions. While these are verified in protection applications (the cycles provide independent measurements of fluxes and related quantities), the hypothesis of independent estimates/cycles is broken in criticality mode. Indeed the power iteration technique used in this mode couples a generation to its progeny. Often, after what is called 'source convergence' this coupling almost disappears (the solution is closed to equilibrium) but for loosely coupled systems, such as for PWR or large nuclear cores, the equilibrium is never found, or at least may take time to reach, and the variance estimation such as allowed by the CLT is under-evaluated. In this paper we first propose, by the mean of two different methods, to evaluate the typical correlation length, as measured in cycles number, and then use this information to diagnose correlation problems and to provide an improved variance estimation. Those two methods are based on Fourier spectral decomposition and on the lag k autocorrelation calculation. A theoretical modeling of the autocorrelation function, based on Gauss-Markov stochastic processes, will also be presented. Tests will be performed with Tripoli4 on a PWR pin cell. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Computing rank‐revealing factorizations of matrices stored out‐of‐core

This paper describes efficient algorithms for computing rank-revealing factorizations of matrices that are too large to fit in main memory (RAM), and must instead be stored on slow external memory devices such as disks (out-of-core or out-of-memory). Traditional algorithms for computing rank-revealing factorizations (such as the column pivoted QR factorization and the singular value decomposition) are very communication intensive as they require many vector-vector and matrix-vector operations, which become prohibitively expensive when data is not in RAM. Randomization allows to reformulate new methods so that large contiguous blocks of the matrix are processed in bulk. The paper describes two distinct methods. The first is a blocked version of column pivoted Householder QR, organized as a “left-looking” method to minimize the number of the expensive write operations. The second method results employs a UTV factorization. It is organized as an algorithm-by-blocks to overlap computations and I/O operations. As it incorporates power iterations, it is much better at revealing the numerical rank. Numerical experiments on several computers demonstrate that the new algorithms are almost as fast when processing data stored on slow memory devices as traditional algorithms are for data stored in RAM.

97 MATHEMATICS AND COMPUTING↗

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↗

Lanczos Algorithm, the Transfer Matrix, and the Signal-to-Noise Problem

This Letter introduces a method for determining the energy spectrum of lattice quantum chromodynamics by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to filter out spurious eigenvalues. Proof-of-principle analyses of the simple harmonic oscillator and the lattice quantum chromodynamics proton mass demonstrate that this method provides faster ground-state convergence than the “effective mass,” which is related to the power-iteration algorithm. Lanczos provides more accurate energy estimates than multistate fits to correlation functions with small imaginary times while achieving comparable statistical precision. Two-sided error bounds are computed for Lanczos results and guarantee that excited-state effects cannot shift Lanczos results far outside their statistical uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Extension of the PINN diffusion model to k-eigenvalue problems

This paper extends our recent work on the Physics-Informed Neural Networks (PINN) approach for the fixed source diffusion models and applies it to the diffusion theory based k-eigenvalue problems. To make the PINN equitable for the eigenvalue problems, we introduce a novel integral regularization term to the loss function in the framework, and allow the direct inference of the principal eigenvalue and the associated eigenfunction. The regularization term enforces a pre-defined value on the integration of the model predictions, and this value can be directly related to a physical property of the system. We also introduce an additional learnable parameter to approximate the principal eigenvalue. As a proof of principle, we solve the one-group two-dimensional k-eigenvalue neutron diffusion equation in this work. We then provide two numerical examples to demonstrate the applicability of the PINN approach. In each example, we solve the k-eigenvalue diffusion equation in a multi-region configuration constrained with a set of Robin boundary conditions for generality. We use a FEM solution based on the power-iteration method to verify the results of the PINN solution. The results showed relative percentage error in the predicted eigenvalue of about 0.77% and about 1.2% for example 1 and example 2, respectively. The mean absolute error in the predicted flux for example 1 is ∼ 0.002 and for example 2 is ∼ 0.0024. These results indicate some preliminary successes of the PINN application to k-eigenvalue problems. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Fission Matrix Capability for MCNP Monte Carlo

In a Monte Carlo criticality calculation, before the tallying of quantities can begin, a converged fission source (the fundamental eigenvector of the fission kernel) is required. Tallies of interest may include powers, absorption rates, leakage rates, or the multiplication factor (the fundamental eigenvalue of the fission kernel, k eff ). Just as in the power iteration method of linear algebra, if the dominance ratio (the ratio of the first and zeroth eigenvalues) is high, many iterations of neutron history simulations are required to isolate the fundamental mode of the problem. Optically large systems have large dominance ratios, and systems containing poor neutron communication between regions are also slow to converge. The fission matrix method, implemented into MCNP, addresses these problems.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Development Status of PROTEUS-MOC

The PROTEUS-MOC solver is intended to resolve the outstanding computational challenges that the PROTEUS-SN is limited by and bridge the gap between PROTEUS-SN and existing homogenized structured grid solvers. The primary push behind all of this work is to carry out coupled thermal-mechanical, fluid dynamics, and neutronics physics problems. The PROTEUS-MOC development has taken advantage of the combined experience with PROTEUS-SN and DeCART with the goal of producing a tool which combines the best features of both tools. Taking the DeCART tool as the model, it merges a subgroup cross section interpolation technique with a 2D method of characteristics approach and a 1D SN formulation. DeCART has been specifically demonstrated to be accurate on PWR and VHTR problems, but it has displayed several issues with regard to accuracy on thin axial mesh sizes which are attributable to the 2D1D scheme it is built upon. There are also notable problems with performance and scalability all of which we hope to resolve in PROTEUS-MOC. PROTEUS-MOC is at its core, based upon the success achieved with MOCFE which demonstrated excellent parallelization with respect to angle and good parallelization with respect to space. More recent efforts have indicated parallelization with respect to energy is also feasible. The work completed yielded a novel methodology where the axial basis functions are treated separately from the radial ones, but the geometry is extruded. This eliminates the need to carry out and store 3D ray tracing data and simultaneously allows the coarse axial node sizes typical with DeCART. To rapidly build a prototype, a standard power iteration algorithm was constructed using an unpreconditioned GMRES solution algorithm for solving the flux vector in each fission source iteration. The new PROTEUS-MOC solver was deployed on two test problems: Takeda and a heterogeneous cylindrical heavy water system. The Takeda benchmark problem is a standard homogeneous test problem which was previously found to be too difficult for the 3D MOCFE code to solve. Using the PROTEUS-MOC we were able to show space-angle convergence although full convergence requires further improvements in performance. The second benchmark problem was constructed more for future work than this year, but the results generated are promising indicating that it will be very useful in highlighting the weaknesses and strengths of the PROTEUS-MOC tool. While we are far from a production tool, the results included in this report give us confidence that we are on the right path to constructing an interceding code between the plethora of structured grid homogenized assembly solvers and the supercomputer consuming PROTEUS-SN code. With time, the creation of a suitable preconditioner along with typical optimization should reduce the performance shortcomings that are observable today.

Marin-Lafleche, A.↗

Statistical Coverage Concerns in a Revised k-Effective of the World Problem [Slides]

A revised version of k-Effective of the World is defined specifically to stress current Monte Carlo power iteration techniques. Results of numerous independent Monte Carlo calculations show that even for batch sizes that are typically considered reasonable (5-10K), incorrect results for k are obtained with non-trivial probability. The causes for what makes a problem prone to having these difficulties are identified and advice for criticality safety practitioners is provided.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Eigenfunction Decomposition of Reactor Perturbations and Transitions Using MCNP Monte Carlo

Monte Carlo criticality calculations for nuclear reactors have typically only been able to find the primary eigenvalue and eigenmode. With the new fission matrix capability in MCNP6, it becomes possible to solve for higher modes, which are useful in wide variety of analyses. As a test case of this new capability, two reactor models in both a base configuration and a perturbed configuration were simulated in MCNP to generate fission matrices. Tools were written to find a relatively small number of eigenpairs of the resulting matrices, whereupon it was found that the implicitly restarted Arnoldi method outperformed the previously used power iteration as an eigenvalue algorithm by a factor of 1500 for a 3600 × 3600 sparse matrix.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

MREG V1.1 : a multi-scale image registration algorithm for SAR applications.

MREG V1.1 is the sixth generation SAR image registration algorithm developed by the Signal Processing&Technology Department for Synthetic Aperture Radar applications. Like its predecessor algorithm REGI, it employs a powerful iterative multi-scale paradigm to achieve the competing goals of sub-pixel registration accuracy and the ability to handle large initial offsets. Since it is not model based, it allows for high fidelity tracking of spatially varying terrain-induced misregistration. Since it does not rely on image domain phase, it is equally adept at coherent and noncoherent image registration. This document provides a brief history of the registration processors developed by Dept. 5962 leading up to MREG V1.1, a full description of the signal processing steps involved in the algorithm, and a user's manual with application specific recommendations for CCD, TwoColor MultiView, and SAR stereoscopy.

Eichel, Paul H.↗

Acceleration of Monte Carlo Criticality Calculations Using Deterministic-Based Starting Sources

A new automatic approach that uses approximate deterministic solutions for providing the starting fission source for Monte Carlo eigenvalue calculations was evaluated in this analysis. By accelerating the Monte Carlo source convergence and decreasing the number of cycles that has to be skipped before the tally's estimation, this approach was found to increase the efficiency of the overall simulation, even with the inclusion of the extra computational time required by the deterministic calculation. This approach was also found to increase the reliability of the Monte Carlo criticality calculations of loosely coupled systems because the use of the better starting source reduces the likelihood of producing an undersampled k eff due to the inadequate source convergence. The efficiency improvement was demonstrated using two of the standard test problems devised by the OECD/NEA Expert Group on Source Convergence in Criticality-Safety Analysis to measure the source convergence in Monte Carlo criticality calculations. For a fixed uncertainty objective, this approach increased the efficiency of the overall simulation by factors between 1.2 and 3 depending on the difficulty of the source convergence in these problems. The reliability improvement was demonstrated in a modified version of the 'k eff of the world' problem that was specifically designed to demonstrate the limitations of the current Monte Carlo power iteration techniques. For this problem, the probability of obtaining a clearly undersampled k eff decreased from 5% with a uniform starting source to zero with a deterministic starting source when batch sizes with more than 15,000 neutron/cycle were used.

42 ENGINEERING↗

Use of Generalized Davidson Eigenvalue Solver for Coarse Mesh Finite Difference Acceleration

This paper summarizes improvements in the coarse mesh finite difference (CMFD) performance by focusing on the eigenvalue solution methodology. The current solution technique uses a shifted power iteration with the PETSc solver package. A generalized Davidson methodology has been implemented into MPACT using the Trilinos solver package. The new generalized Davidson solver shows significant improvements in the overall runtime for the CMFD acceleration scheme and the overall MPACT performance. The performance improves between 5 and 27 times for the CMFD runtime. This results in a speedup of between 2.5 to 5 times on the overall solution time for MPACT.

Collins, Benjamin↗

Improvements in the mesh-based convergence diagnostics for Monte Carlo eigenvalue simulations

Using the Monte Carlo method to compute eigenvalue problems based on the power iteration method is widely used. However, the convergence needs accurate diagnostics method in order to maintain the accuracy of the results and the efficiency of the simulation. Recently, we used the linear regression model for convergence diagnostics based on the local information, the mesh-wise cycle-wise flux estimates. Our previous analyses examined properties and demonstrated certain capability of this method. However, several aspects still need further investigation. In this paper, we use additional simulation examples and perform comparisons in order to better understand the capabilities and limitations of this diagnostics method. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Neutron noise calculations in a hexagonal geometry and comparison with analytical solutions

This paper presents the development of a neutronic and kinetic solver for hexagonal geometries. The tool is developed based on the diffusion theory with multi-energy groups and multi-groups of delayed neutron precursors allowing the solutions of forward and adjoint problems of static and dynamic states, and is applicable to both thermal and fast systems with hexagonal geometries. In the dynamic problems, the small stationary fluctuations of macroscopic cross sections are considered as noise sources, and then the induced first order noise is calculated fully in the frequency domain. Numerical algorithms for solving the static and noise equations are implemented with a spatial discretization based on finite differences and a power iterative solution. A coarse mesh finite difference method has been adopted for speeding up the convergence. Since no other numerical tool could calculate frequency-dependent noise in hexagonal geometry, validation calculations have been performed and benchmarked to analytical solutions based on a 2-D homogeneous system with two-energy groups and one-group of delayed neutron precursor, in which point-like perturbations of thermal absorption cross section at central and non-central positions are considered as noise sources. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerated Monte Carlo Fission Source Convergence with Fission Matrix and Kernel Density Estimators

Accurate solution of the k-eigenvalue form of the Boltzmann radiation transport equation is required in many application areas, including nuclear reactor analysis and criticality safety. Monte Carlo calculations are free of the discretization errors inherent to deterministic methods and therefore offer the most accurate solutions. However, converging the fission source can be difficult for many problems, resulting in either a substantial computational overhead or potential inaccuracies that negate many of the benefits of using Monte Carlo methods. Difficulty in converging the fission source occurs for two distinct reasons. The first is the existence of a high dominance ratio in the problem (i.e. the largest and second largest eigenvalues have approximately the same magnitude). The second difficulty arises due to undersampling of the fission source because an insufficient number of particle histories are simulated. The first difficulty is shared by deterministic solvers when using power iteration, while the second difficulty is unique to Monte Carlo solvers. In practice, both difficulties may be present in the same problem, compounding the difficulty in achieving a converged distribution. In this paper, we consider a new approach to accelerate the convergence of the fission source based on combining the use of fission matrix methods with kernel density estimators (KDEs). It has been observed that deterministic fission matrix methods show the potential to accelerate the convergence of the fission source in Monte Carlo criticality calculations but may introduce significant additional noise for difficult problems. In this paper, we have demonstrated the use of a KDE approach in combination with the fission matrix acceleration. Although the addition of the KDE initially slows the convergence of the fission matrix acceleration, it decreases the magnitude of the noise while still offering significantly improved convergence relative to analog Monte Carlo. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗