GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Choosing the forcing terms in an inexact Newton method
SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
A comparative study on methods for convergence acceleration of iterative vector sequences
Journal of Computational Physics
Any Nonincreasing Convergence Curve is Possible for GMRES
SIAM Journal on Matrix Analysis and Applications
Iterative Procedures for Nonlinear Integral Equations
Journal of the ACM (JACM)
An overview of the Trilinos project
ACM Transactions on Mathematical Software (TOMS) - Special issue on the Advanced CompuTational Software (ACTS) Collection
Provable algorithms for parallel generalized sweep scheduling
Journal of Parallel and Distributed Computing
Anderson Acceleration for Fixed-Point Iterations
SIAM Journal on Numerical Analysis
Hi-index | 31.45 |
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.