EUVIMEDEUVIMED entdecken
Crossref

Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems

Xue Feng, M. Paul Laiu, Thomas Strohmer

SIAM Journal on Scientific Computing · 31.10.2026 · 48 (5) · S436-S461

DOI: 10.1137/24m1676922 ↗

Kurz gefasst

Fachartikel in der Zeitschrift SIAM Journal on Scientific Computing, online erschienen am 28.10.2025. Verfasst von Xue Feng und 2 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 41 Literaturangaben. Gefördert von: U.S. Department of Energy, National Institutes of Health, National Science Foundation.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Anderson acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson–Picard (AAP) method. Despite introducing more “slow” Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP “converges” to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally [Formula: see text]-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided. 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/xue1993/AAP.git and in the supplementary materials ( AAP-main.zip [2.06MB]). [Formula: see text]

Förderung

  • U.S. Department of Energy
  • National Institutes of Health
  • National Science Foundation

Zitieren

APA

Feng, X., Laiu, M. P., & Strohmer, T. (2026). Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems. SIAM Journal on Scientific Computing, 48(5), S436-S461. https://doi.org/10.1137/24m1676922

Vancouver

Feng X, Laiu MP, Strohmer T. Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems. SIAM Journal on Scientific Computing. 2026;48(5):S436-S461. doi:10.1137/24m1676922

BibTeX
@article{Feng2026,
  author = {Feng, Xue and Laiu, M. Paul and Strohmer, Thomas},
  title = {Convergence Analysis of the Alternating Anderson–Picard Method for Nonlinear Fixed-Point Problems},
  journal = {SIAM Journal on Scientific Computing},
  year = {2026},
  volume = {48},
  number = {5},
  pages = {S436--S461},
  doi = {10.1137/24m1676922}
}
Kostenlos starten →