Nonlinear Krylov Acceleration Applied to a Discrete Ordinates Formulation of the k-Eigenvalue Problem

We compare variants of Anderson Mixing with the Jacobian-Free Newton-Krylov and Broyden methods applied to an instance of the k-eigenvalue formulation of the linear Boltzmann transport equation. We present evidence that one variant of Anderson Mixing finds solutions in the fewest number of iterations. We examine and strengthen theoretical results of Anderson Mixing applied to linear problems.Comment: This final revision includes results of the C5G7-MOX problem; Nonlinear Krylov Acceleration Applied to a Discrete Ordinates Formulation of the k-Eigenvalue Problem, Accepted by the Journal of Computational Physics December 201

Preconditioning a mixed discontinuous finite element method for radiation diffusion

We propose a multilevel preconditioning strategy for the iterative solution of large sparse linear systems arising from a finite element discretization of the radiation diffusion equations. In particular, these equations are solved using a mixed finite element scheme in order to make the discretization discontinuous, which is imposed by the application in which the diffusion equation will be embedded. The essence of the preconditioner is to use a continuous finite element discretization of the original, elliptic diffusion equation for preconditioning the discontinuous equations. We have found that this preconditioner is very effective and makes the iterative solution of the discontinuous diffusion equations practical for large problems. This approach should be applicable to discontinuous discretizations of other elliptic equations. We show how our preconditioner is developed and applied to radiation diffusion problems on unstructured, tetrahedral meshes and show numerical results that illustrate its effectiveness. Published in 2004 by John Wiley & Sons, Ltd

Krylov iterative methods applied to multidimensional S[sub n] calculations in the presence of material discontinuities

We show that a Krylov iterative meihod, preconditioned with DSA, can be used to efficiently compute solutions to diffusive problems with discontinuities in material properties. We consider a lumped, linear discontinuous discretization of the S N transport equation with a 'partially consistent' DSA preconditioner. The Krylov method can be implemented in terms of the original S N source iteration coding with little modification. Results from numerical experiments show that replacing source iteration with a preconditioned Krylov method can efficiently solve problems that are virtually intractable with accelerated source iteration. Key Words: Krylov iterative methods, discrete ordinates, deterministic transport methods, diffusion synthetic acceleratio

Krylov subspace iterations for the calculation of K-Eigenvalues with sn transport codes

We apply the Implicitly Restarted Arnoldi Method (IRAM), a Krylov subspace iterative method, to the calculation of k-eigenvalues for criticality problems. We show that the method can be implemented with only modest changes to existing power iteration schemes in an SN transport code. Numerical results on three dimensional unstructured tetrahedral meshes are shown. Although we only compare the IRAM to unaccelerated power iteration, the results indicate that the IRAM is a potentially efficient and powerful technique, especially for problems with dominance ratios approaching unity. Key Words: criticality eigenvalues, Implicitly Restarted Arnoldi Method (IRAM), deterministic transport method

Numerical Evaluation of P-Multigrid Method for the Solution of Discontinuous Galerkin Discretizations of Diffusive Equations

This paper describes numerical experiments with P-multigrid to corroborate analysis, validate the present implementation, and to examine issues that arise in the implementations of the various combinations of relaxation schemes, discretizations and P-multigrid methods. The two approaches to implement P-multigrid presented here are equivalent for most high-order discretization methods such as spectral element, SUPG, and discontinuous Galerkin applied to advection; however it is discovered that the approach that mimics the common geometric multigrid implementation is less robust, and frequently unstable when applied to discontinuous Galerkin discretizations of di usion. Gauss-Seidel relaxation converges 40% faster than block Jacobi, as predicted by analysis; however, the implementation of Gauss-Seidel is considerably more expensive that one would expect because gradients in most neighboring elements must be updated. A compromise quasi Gauss-Seidel relaxation method that evaluates the gradient in each element twice per iteration converges at rates similar to those predicted for true Gauss-Seidel

Fully consistent, linear discontinuous diffusion synthetic acceleration on 3D unstructured meshes

We extend a multi-level preconditioned solution method for a linear discontinuous discretization of the P{sub 1} equations in two-dimensional Cartesian geometry to three-dimensional, unstructured tetrahedral meshes. A diffusion synthetic acceleration (DSA) method based on these P{sub 1} equations is applied to linear discontinuous S{sub N} transport source iterations on tetrahedral meshes. It is a fully consistent method because the P{sub 1} equations and the transport equation are both discretized with a linear discontinuous finite element basis. Fourier analyses and computational results show the DSA scheme is stable and very effective. We compare the fully consistent scheme to other 'partially consistent' DSA methods