EUVIMEDEUVIMED entdecken
Crossref

Asymptotic Convergence of Restarted Anderson Acceleration for Certain Normal Linear Systems

Oliver A. Krzysik, Hans De Sterck, Adam Smith

SIAM Journal on Scientific Computing · 31.10.2026 · 48 (5) · S135-S160

DOI: 10.1137/24m1672262 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Scientific Computing, online erschienen am 07.05.2025. Verfasst von Oliver A. Krzysik und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 40 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Anderson acceleration (AA) is widely used for accelerating the convergence of an underlying fixed-point iteration [Formula: see text], [Formula: see text], with [Formula: see text], [Formula: see text]. Despite AA’s widespread use, relatively little is understood theoretically about the extent to which it may accelerate the underlying fixed-point iteration. To this end, we analyze a restarted variant of AA with a restart size of one, a method closely related to GMRES(1). We consider the case of [Formula: see text] with matrix [Formula: see text] either symmetric or skew-symmetric. For both classes of [Formula: see text] we compute the worst-case root-average asymptotic convergence factor of the AA method, partially relying on conjecture in the symmetric setting, proving that it is strictly smaller than that of the underlying fixed-point iteration. For symmetric [Formula: see text], we show that the AA residual iteration corresponds to a fixed-point iteration for solving an eigenvector-dependent nonlinear eigenvalue problem (NEPv), and we show how this can result in the convergence factor strongly depending on the initial iterate, which we quantify exactly in certain special cases. Conversely, for skew-symmetric [Formula: see text] we show that the AA residual iteration is closely related to a power iteration for [Formula: see text], and how this results in the convergence factor being independent of the initial iterate. Supporting numerical results are given, which also indicate the theory is applicable to the more general setting of nonlinear [Formula: see text] with Jacobian at the fixed point that is symmetric or skew-symmetric. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SISC and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://github.com/okrzysik/rAA1-paper-code and in the supplementary material ( M167226_SM.pdf [2.60MB], M167226_SM.zip [8.22MB]). [Formula: see text]

Zitieren

APA

Krzysik, O. A., Sterck, H. D., & Smith, A. (2026). Asymptotic Convergence of Restarted Anderson Acceleration for Certain Normal Linear Systems. SIAM Journal on Scientific Computing, 48(5), S135-S160. https://doi.org/10.1137/24m1672262

Vancouver

Krzysik OA, Sterck HD, Smith A. Asymptotic Convergence of Restarted Anderson Acceleration for Certain Normal Linear Systems. SIAM Journal on Scientific Computing. 2026;48(5):S135-S160. doi:10.1137/24m1672262

BibTeX
@article{Krzysik2026,
  author = {Krzysik, Oliver A. and Sterck, Hans De and Smith, Adam},
  title = {Asymptotic Convergence of Restarted Anderson Acceleration for Certain Normal Linear Systems},
  journal = {SIAM Journal on Scientific Computing},
  year = {2026},
  volume = {48},
  number = {5},
  pages = {S135--S160},
  doi = {10.1137/24m1672262}
}
Kostenlos starten →