arXiv Analytics

Sign in

arXiv:1909.04638 [math.NA]AbstractReferencesReviewsResources

Anderson acceleration for contractive and noncontractive operators

Sara Pollock, Leo Rebholz

Published 2019-09-10Version 1

A one-step analysis of Anderson acceleration with general algorithmic depths is presented. The resulting residual bounds within both contractive and noncontractive settings clearly show the balance between the contributions from the higher and lower order terms, which are both dependent on the success of the optimization problem solved at each step of the algorithm. In the contractive setting, the bounds sharpen previous convergence and acceleration results. The bounds rely on sufficient linear independence of the differences between consecutive residuals, rather than assumptions on the boundedness of the optimization coefficients. Several numerical tests illustrate the analysis primarily in the noncontractive setting, and demonstrate the use of the method on a nonlinear Helmholtz equation and the steady Navier-Stokes equations with high Reynolds number in three spatial dimensions.

Related articles:
arXiv:1805.04211 [math.NA] (Published 2018-05-11)
Anderson accelerated fixed-stress splitting schemes for consolidation of unsaturated porous media
arXiv:1510.04246 [math.NA] (Published 2015-10-14)
Accelerating the Uzawa Algorithm