arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.05295math.NAcs.NA
收藏

具有优化阻尼的非平稳安德森加速度

Non-stationary Anderson acceleration with optimized damping

Kewang Chen, Cornelis Vuik

摘要:

安德森加速(AA)有很长的使用历史,最近的兴趣很强,由于其潜在的能力,显着改善的线性收敛的定点迭代。大多数作者只是简单地使用和分析固定版本的安德森加速度(sAA)与一个恒定的阻尼因子或没有阻尼。很少有人关注非平稳算法。然而,阻尼可能是有用的,有时是至关重要的模拟中,底层的不动点算子不是全局收缩。这个阻尼系数的作用还没有完全了解。在目前的工作中,我们认为非平稳安德森加速算法与优化阻尼(AAoptD)在每一次迭代,以进一步加快线性和非线性迭代通过应用一个额外的廉价优化。我们分析了这个过程,并制定了一个有效的和廉价的实施方案。我们还表明,与固定窗口大小sAA(m)的静态Anderson加速相比,优化阻尼因子与每次迭代中动态包装sAA(m)和sAA(1)有关(交替窗口大小$m$是产生非静态AA的另一个方向)。此外,我们通过大量的数值实验表明,所提出的非平稳安德森加速度与优化的阻尼程序往往比固定AA恒定阻尼或无阻尼收敛得更快。

英文摘要:

Anderson acceleration (AA) has a long history of use and a strong recent interest due to its potential ability to dramatically improve the linear convergence of the fixed-point iteration. Most authors are simply using and analyzing the stationary version of Anderson acceleration (sAA) with a constant damping factor or without damping. Little attention has been paid to nonstationary algorithms. However, damping can be useful and is sometimes crucial for simulations in which the underlying fixed-point operator is not globally contractive. The role of this damping factor has not been fully understood. In the present work, we consider the non-stationary Anderson acceleration algorithm with optimized damping (AAoptD) in each iteration to further speed up linear and nonlinear iterations by applying one extra inexpensive optimization. We analyze this procedure and develop an efficient and inexpensive implementation scheme. We also show that, compared with the stationary Anderson acceleration with fixed window size sAA(m), optimizing the damping factors is related to dynamically packaging sAA(m) and sAA(1) in each iteration (alternating window size $m$ is another direction of producing non-stationary AA). Moreover, we show by extensive numerical experiments that the proposed non-stationary Anderson acceleration with optimized damping procedure often converges much faster than stationary AA with constant damping or without damping.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑