Convergence Properties of a Linear Diffusion-Acceleration Method for k-Eigenvalue Transport Problems

Abstract

Most methods that use low-order operators to accelerate the iterative solution of transport eigenvalue problems employ nonlinear functionals of the transport solution (such as Eddington tensors) in their low-order equations, which are themselves standard eigenvalue problems. Here, we discuss linear diffusion synthetic acceleration (DSA) for -eigenvalue problems, which belongs to a family of methods that has received less attention than its nonlinear counterparts. We review the history of these linear methods as far as we know it and describe theoretical questions that to our knowledge have remained unanswered. With these methods, a low-order problem is solved after each transport step for an updated eigenvalue and an additive correction to the eigenfunction. These low-order problems are not standard eigenvalue problems, for they contain residuals as fixed sources. The low-order problems admit infinitely many solutions (updated and additive correction to the eigenfunction), and the solution that is obtained depends on the initial guess and iterative method chosen for the low-order problems. Experience has shown that when the low-order problems are solved with a powerlike iteration method and certain initial guesses, they yield solutions that cause rapid convergence to the correct high-order solution. We study the convergence properties of this algorithm applied to two model problems: an infinite homogeneous medium and a one-cell problem. For the infinite homogeneous problem, we present a Fourier analysis of the linear DSA method, which demonstrates that when the low-order problems are solved using a powerlike iteration scheme, the linear DSA scheme provides immediate convergence of the -eigenvalue and rapid convergence of the eigenfunction (much like DSA applied to scattering iterations in fixed-source problems). For the one-cell problems, we find that the linear scheme for -eigenvalue problems performs approximately as well as DSA for fixed-source problems. The latter analysis reveals a quantitative bound on the consistency between low- and high-order operators that is necessary and sufficient for convergence of those problems. With some theoretical foundations for the linear methods now established, we turn to numerical testing. We find, as others have before us using different low-order operators, that the method works well in practice. We provide numerical results from reactor problems in which our linear DSA is approximately as effective as the more widely used nonlinear methods. Our theoretical and numerical results add to the body of evidence that the linear methodology offers a simple path to rapid convergence of -eigenvalue problems, especially for codes that already employ linear low-order operators to converge scattering iterations.