.png){kind=icon}
.png){kind=icon}
Return
A Generalized Alternating Anderson Acceleration Method
.png){kind=icon}
PRE
AI
DOI：10.1007/s10915-026-03302-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work, we propose a generalized alternating Anderson acceleration method, a periodic scheme composed of t fixed-point iteration steps, interleaved with s steps of Anderson acceleration with window size m, to solve linear and nonlinear problems. This allows flexibility to use different combinations of fixed-point iteration and Anderson iteration. We present a convergence analysis of the proposed scheme for accelerating the Richardson iteration in the linear case, with a focus on specific parameter choices of interest. Specifically, we prove convergence of the proposed method under contractive fixed-point iteration and provide a sufficient condition for convergence when the Richardson iteration matrix is diagonalizable and noncontractive. To demonstrate the broader applicability of our proposed method, we use it to accelerate Jacobi iteration, Gauss–Seidel iteration, Picard iteration, gradient descent, and the alternating direction method of multipliers in solving partial differential equations and nonlinear, nonsmooth optimization problems. The numerical results illustrate that the proposed scheme is more efficient than the existing windowed Anderson acceleration and alternating Anderson ( $$s=1$$ ) in terms of iteration number and CPU time for careful choice of parameters m, s, t.
Keywords:
Alternating Anderson acceleration
Fixed point iteration
Convergence analysis
ADMM