Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
520487 | Journal of Computational Physics | 2013 | 22 Pages |
Abstract
We compare a variant 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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Matthew T. Calef, Erin D. Fichtl, James S. Warsa, Markus Berndt, Neil N. Carlson,