Engineering Papers⌕ Search

Engineering topics

Warsa, James S

Publications and source records attributed to Warsa, James S.

Moment-Preserving SN Discretizations for the One-Dimensional Fokker-Planck Equation

The Fokker-Planck equation: (1) Describes the transport and interactions of charged particles, (2) Many small-angle scattering collisions, (3) Asymptotic limit of the Boltzmann equation (Pomraning, 1992), and (4) The Boltzmann collision operator becomes the angular Laplacian. SN angular discretization: (1) Angular flux is collocated at the SN quadrature points, (2) The second-order derivatives in the Laplacian term must be discretized, and (3) Weighted finite-difference method preserves zeroth and first moments (Morel, 1985). Moment-preserving methods: (1) Collocate the Fokker-Planck operator at the SN quadrature points, (2) Develop several related and/or equivalent methods, and (3) Motivated by discretizations for the angular derivative appearing in the transport equation in one-dimensional spherical coordinates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Nonlinear acceleration of SN transport calculations

The use of nonlinear iterative methods, Jacobian-Free Newton-Krylov (JFNK) in particular, for solving eigenvalue problems in transport applications has recently become an active subject of research. While JFNK has been shown to be effective for k-eigenvalue problems, there are a number of input parameters that impact computational efficiency, making it difficult to implement efficiently in a production code using a single set of default parameters. We show that different selections for the forcing parameter in particular can lead to large variations in the amount of computational work for a given problem. In contrast, we present a nonlinear subspace method that sits outside and effectively accelerates nonlinear iterations of a given form and requires only a single input parameter, the subspace size. It is shown to consistently and significantly reduce the amount of computational work when applied to fixed-point iteration, and this combination of methods is shown to be more efficient than JFNK for our application.

97 MATHEMATICS AND COMPUTING↗

Implementation of a cell-wise Block-Gauss-Seidel iterative method for SN transport on a hybrid parallel computer architecture

We have implemented a cell-wise, block-Gauss-Seidel (bGS) iterative algorithm, for the solution of the S{sub n} transport equations on the Roadrunner hybrid, parallel computer architecture. A compute node of this massively parallel machine comprises AMD Opteron cores that are linked to a Cell Broadband Engine{trademark} (Cell/B.E.). LAPACK routines have been ported to the Cell/B.E. in order to make use of its parallel Synergistic Processing Elements (SPEs). The bGS algorithm is based on the LU factorization and solution of a linear system that couples the fluxes for all S{sub n} angles and energy groups on a mesh cell. For every cell of a mesh that has been parallel decomposed on the higher-level Opteron processors, a linear system is transferred to the Cell/B.E. and the parallel LAPACK routines are used to compute a solution, which is then transferred back to the Opteron, where the rest of the computations for the S{sub n} transport problem take place. Compared to standard parallel machines, a hundred-fold speedup of the bGS was observed on the hybrid Roadrunner architecture. Numerical experiments with strong and weak parallel scaling demonstrate the bGS method is viable and compares favorably to full parallel sweeps (FPS) on two-dimensional, unstructured meshes when it is applied to optically thick, multi-material problems. As expected, however, it is not as efficient as FPS in optically thin problems.

97 MATHEMATICS AND COMPUTING↗

Krylov iterative methods and synthetic acceleration for transport in binary statistical media

In particle transport applications there are numerous physical constructs in which heterogeneities are randomly distributed. The quantity of interest in these problems is the ensemble average of the flux, or the average of the flux over all possible material 'realizations.' The Levermore-Pomraning closure assumes Markovian mixing statistics and allows a closed, coupled system of equations to be written for the ensemble averages of the flux in each material. Generally, binary statistical mixtures are considered in which there are two (homogeneous) materials and corresponding coupled equations. The solution process is iterative, but convergence may be slow as either or both materials approach the diffusion and/or atomic mix limits. A three-part acceleration scheme is devised to expedite convergence, particularly in the atomic mix-diffusion limit where computation is extremely slow. The iteration is first divided into a series of 'inner' material and source iterations to attenuate the diffusion and atomic mix error modes separately. Secondly, atomic mix synthetic acceleration is applied to the inner material iteration and S{sub 2} synthetic acceleration to the inner source iterations to offset the cost of doing several inner iterations per outer iteration. Finally, a Krylov iterative solver is wrapped around each iteration, inner and outer, to further expedite convergence. A spectral analysis is conducted and iteration counts and computing cost for the new two-step scheme are compared against those for a simple one-step iteration, to which a Krylov iterative method can also be applied.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Stability analysis of implicit time discretizations for the Compton-scattering Fokker-Planck equation

The Fokker-Planck equation is a widely used approximation for modeling the Compton scattering of photons in high energy density applications. In this paper, we perform a stability analysis of three implicit time discretizations for the Compton-Scattering Fokker-Planck equation. Specifically, we examine (i) a Semi-Implicit (SI) scheme that employs backward-Euler differencing but evaluates temperature-dependent coefficients at their beginning-of-time-step values, (ii) a Fully Implicit (FI) discretization that instead evaluates temperature-dependent coefficients at their end-of-time-step values, and (iii) a Linearized Implicit (LI) scheme, which is developed by linearizing the temperature dependence of the FI discretization within each time step. Our stability analysis shows that the FI and LI schemes are unconditionally stable and cannot generate oscillatory solutions regardless of time-step size, whereas the SI discretization can suffer from instabilities and nonphysical oscillations for sufficiently large time steps. With the results of this analysis, we present time-step limits for the SI scheme that prevent undesirable behavior. We test the validity of our stability analysis and time-step limits with a set of numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fourier analysis of cell-wise Block-Jacobi splitting in two-dimensional geometry

A Fourier analysis is conducted in two-dimensional (2D) geometry for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) using the cell-wise Block-Jacobi (B1) algorithm. The results of the Fourier analysis show that convergence of cell-wise BJ can degrade, leading to a spectral radius equal to 1, in problems containing optically thin cells. For problems containing cells that are optically thick, instead, the spectral radius tends to O. Hence, in the optically thick-cell regime, cell-wise BJ is rapidly convergent even for problems that are scattering dominated, with a scattering ratio c close to I.

97 MATHEMATICS AND COMPUTING↗

Time-step limits for a Monte Carlo Compton-scattering method

We perform a stability analysis of a Monte Carlo method for simulating the Compton scattering of photons by free electron in high energy density applications and develop time-step limits that avoid unstable and oscillatory solutions. Implementing this Monte Carlo technique in multi physics problems typically requires evaluating the material temperature at its beginning-of-time-step value, which can lead to this undesirable behavior. With a set of numerical examples, we demonstrate the efficacy of our time-step limits.

97 MATHEMATICS AND COMPUTING↗

Stochastic methods for uncertainty quantification in radiation transport

The use of generalized polynomial chaos (gPC) expansions is investigated for uncertainty quantification in radiation transport. The gPC represents second-order random processes in terms of an expansion of orthogonal polynomials of random variables and is used to represent the uncertain input(s) and unknown(s). We assume a single uncertain input-the total macroscopic cross section-although this does not represent a limitation of the approaches considered here. Two solution methods are examined: The Stochastic Finite Element Method (SFEM) and the Stochastic Collocation Method (SCM). The SFEM entails taking Galerkin projections onto the orthogonal basis, which, for fixed source problems, yields a linear system of fully -coupled equations for the PC coefficients of the unknown. For k-eigenvalue calculations, the SFEM system is non-linear and a Newton-Krylov method is employed to solve it. The SCM utilizes a suitable quadrature rule to compute the moments or PC coefficients of the unknown(s), thus the SCM solution involves a series of independent deterministic transport solutions. The accuracy and efficiency of the two methods are compared and contrasted. The PC coefficients are used to compute the moments and probability density functions of the unknown(s), which are shown to be accurate by comparing with Monte Carlo results. Our work demonstrates that stochastic spectral expansions are a viable alternative to sampling-based uncertainty quantification techniques since both provide a complete characterization of the distribution of the flux and the k-eigenvalue. Furthermore, it is demonstrated that, unlike perturbation methods, SFEM and SCM can handle large parameter uncertainty.

97 MATHEMATICS AND COMPUTING↗

Time-step limits for a Monte Carlo Compton-scattering method

Compton scattering is an important aspect of radiative transfer in high energy density applications. In this process, the frequency and direction of a photon are altered by colliding with a free electron. The change in frequency of a scattered photon results in an energy exchange between the photon and target electron and energy coupling between radiation and matter. Canfield, Howard, and Liang have presented a Monte Carlo method for simulating Compton scattering that models the photon-electron collision kinematics exactly. However, implementing their technique in multiphysics problems that include the effects of radiation-matter energy coupling typically requires evaluating the material temperature at its beginning-of-time-step value. This explicit evaluation can lead to unstable and oscillatory solutions. In this paper, we perform a stability analysis of this Monte Carlo method and present time-step limits that avoid instabilities and nonphysical oscillations by considering a spatially independent, purely scattering radiative-transfer problem. Examining a simplified problem is justified because it isolates the effects of Compton scattering, and existing Monte Carlo techniques can robustly model other physics (such as absorption, emission, sources, and photon streaming). Our analysis begins by simplifying the equations that are solved via Monte Carlo within each time step using the Fokker-Planck approximation. Next, we linearize these approximate equations about an equilibrium solution such that the resulting linearized equations describe perturbations about this equilibrium. We then solve these linearized equations over a time step and determine the corresponding eigenvalues, quantities that can predict the behavior of solutions generated by a Monte Carlo simulation as a function of time-step size and other physical parameters. With these results, we develop our time-step limits. This approach is similar to our recent investigation of time discretizations for the Compton-scattering Fokker-Planck equation.

97 MATHEMATICS AND COMPUTING↗

Linear multifrequency-grey acceleration recast for preconditioned Krylov iterations

The linear multifrequency-grey acceleration (LMFGA) technique is used to accelerate the iterative convergence of multigroup thermal radiation diffusion calculations in high energy density simulations. Although it is effective and efficient in one-dimensional calculations, the LMFGA method has recently been observed to significantly degrade under certain conditions in multidimensional calculations with large discontinuities in material properties. To address this deficiency, we recast the LMFGA method in terms of a preconditioned system that is solved with a Krylov method (LMFGK). Results are presented demonstrating that the new LMFGK method always requires fewer iterations than the original LMFGA method. The reduction in iteration count increases with both the size of the time step and the inhomogeneity of the problem. However, for reasons later explained, the LMFGK method can cost more per iteration than the LMFGA method, resulting in lower but comparable efficiency in problems with small time steps and weak inhomogeneities. In problems with large time steps and strong inhomogeneities, the LMFGK method is significantly more efficient than the LMFGA method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗