On a blended Anderson / NGMRES acceleration for the Navier-Stokes Picard iteration: convergence analysis and adaptive depth selection
Abstract
Anderson acceleration (AA) and nonlinear GMRES (NGMRES) have been successfully applied to improve the efficiency and robustness of many nonlinear solvers, with each being shown to have certain advantages over the other. There are two differences between the AA and NGMRES algorithms: the extrapolations are different, and AA uses fixed point residuals in the optimization problem while NGMRES uses true nonlinear residuals. Motivated by recent AA and NGMRES analyses and numerical testing, we consider a blend of AA and NGMRES that uses the AA extrapolation and the true nonlinear residuals for the optimization problem. To focus our study, we consider the blended method applied to the Picard iteration for the Navier-Stokes equations, but many of the ideas developed herein are extendable to a wide variety of nonlinear systems and solvers. We provide a convergence analysis and proof of acceleration of the blended method, provide a detailed numerical comparison of AA, NMGRES and the blended method for several benchmark tests, and develop an effective adaptive depth strategy.
Related
- Convergence and acceleration of a nonlinear fixed-point iteration for computing the Fitness Centrality of general graphs
- Online adaptive non-intrusive model reduction via manifold interpolation and subspace updates: application to FSI convergence acceleration
- Accelerating the Improved Arrow--Hurwicz Iteration via the Anderson Algorithm for Steady-State Navier--Stokes Equations
- An Equivalence result for sketched Anderson Acceleration and sketched GMRES
- A nonmonotone globalization framework for Anderson acceleration for contractive and nonexpansive fixed point problems
BibTeX
@misc{he2026blended,
title = {{On a blended Anderson / NGMRES acceleration for the Navier-Stokes Picard iteration: convergence analysis and adaptive depth selection}},
author = {Yunhui He and Leo Rebholz},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2605.17664},
eprint = {2605.17664},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.17664},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - On a blended Anderson / NGMRES acceleration for the Navier-Stokes Picard iteration: convergence analysis and adaptive depth selection
AU - Yunhui He
AU - Leo Rebholz
PY - 2026
DA - 2026/09/04
PB - arXiv
DO - 10.48550/arxiv.2605.17664
UR - https://arxiv.org/abs/2605.17664
AB - Anderson acceleration (AA) and nonlinear GMRES (NGMRES) have been successfully applied to improve the efficiency and robustness of many nonlinear solvers, with each being shown to have certain advantages over the other. There are two differences between the AA and NGMRES algorithms: the extrapolations are different, and AA uses fixed point residuals in the optimization problem while NGMRES uses true nonlinear residuals. Motivated by recent AA and NGMRES analyses and numerical testing, we consider a blend of AA and NGMRES that uses the AA extrapolation and the true nonlinear residuals for the optimization problem. To focus our study, we consider the blended method applied to the Picard iteration for the Navier-Stokes equations, but many of the ideas developed herein are extendable to a wide variety of nonlinear systems and solvers. We provide a convergence analysis and proof of acceleration of the blended method, provide a detailed numerical comparison of AA, NMGRES and the blended method for several benchmark tests, and develop an effective adaptive depth strategy.
ER -