On a blended Anderson / NGMRES acceleration for the Navier-Stokes Picard iteration: convergence analysis and adaptive depth selection
Year: 2026
Type: preprint
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.
Source: arXiv (Cornell University)
Authors: He, Yunhui, Rebholz, Leo
Institutions: University of Houston, Clemson University
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: U.S. Department of Energy
Award: G839481644
OpenAlex ID: W7161726267