The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Anderson Acceleration for Fixed-Point Iterations
Abstract
This paper concerns an acceleration method for fixed-point iterations that originated in work of D. G. Anderson [J. Assoc. Comput. Mach., 12 (1965), pp. 547–560], which we accordingly call Anderson acceleration here. This method has enjoyed considerable success and wide usage in electronic structure computations, where it is known as Anderson mixing; however, it seems to have been untried or underexploited in many other important applications. Moreover, while other acceleration methods have been extensively studied by the mathematics and numerical analysis communities, this method has received relatively little attention from these communities over the years. A recent paper by H. Fang and Y. Saad [Numer. Linear Algebra Appl., 16 (2009), pp. 197–221] has clarified a remarkable relationship of Anderson acceleration to quasi-Newton (secant updating) methods and extended it to define a broader Anderson family of acceleration methods. In this paper, our goals are to shed additional light on Anderson acceleration and to draw further attention to its usefulness as a general tool. We first show that, on linear problems, Anderson acceleration without truncation is “essentially equivalent” in a certain sense to the generalized minimal residual (GMRES) method. We also show that the Type 1 variant in the Fang–Saad Anderson family is similarly essentially equivalent to the Arnoldi (full orthogonalization) method. We then discuss practical considerations for implementing Anderson acceleration and illustrate its performance through numerical experiments involving a variety of applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Efficient iterative schemes for ab initio total-energy calculations using a plane-wave basis set
Kresse, G., & Furthmüller, J. (1996) · Physical Review B · doi:10.1103/physrevb.54.11169 · Cited by 123,652
Kresse, G., & Furthmüller, J. (1996) · Computational Materials Science · doi:10.1016/0927-0256(96)00008-0 · Cited by 75,638
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
Saad, Y., & Schultz, M. H. (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907058 · Cited by 11,154
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
Dennis, J. E., & Schnabel, R. B. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971200 · Cited by 7,615
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
A class of methods for solving nonlinear simultaneous equations
Broyden, C. G. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0198670-6 · Cited by 2,788
Mixture Densities, Maximum Likelihood and the EM Algorithm
Redner, R. A., & Walker, H. F. (1984) · SIAM Review · doi:10.1137/1026034 · Cited by 2,693
Self-citation
Cited by
Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization
Peherstorfer, B., Willcox, K., & Gunzburger, M. (2018) · SIAM Review · doi:10.1137/16m1082469 · Cited by 1,061
Physically based modeling in catchment hydrology at 50: Survey and outlook
Paniconi, C., & Putti, M. (2015) · Water Resources Research · doi:10.1002/2015wr017780 · Cited by 374
A new generation 99 line Matlab code for compliance topology optimization and its extension to 3D
Ferrari, F., & Sigmund, O. (2020) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-020-02629-w · Cited by 265
A review of nonlinear FFT-based computational homogenization methods
Schneider, M. (2021) · Acta Mechanica · doi:10.1007/s00707-021-02962-1 · Cited by 265
Metadata
- Authors
- Walker, H. F., & Ni, P.
- Venue
- SIAM Journal on Numerical Analysis
- Published
- 2011-01
- Volume
- 49
- Issue
- 4
- Pages
- 1715-1735
- ISSN
- 0036-1429 (ISSN-L)
- 1095-7170
- OpenAlex
- W1966801132
- Cited by
- 590
- References
- 26
- FWCI
- 9.57
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Anderson Acceleration for Fixed-Point Iterations. https://app.cochat.ai/papers/10.1137/10078356x
- The paper
- Walker, H. F., & Ni, P. (2011). Anderson Acceleration for Fixed-Point Iterations. SIAM Journal on Numerical Analysis. https://doi.org/10.1137/10078356x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.