4.6 Article

Comments on Anderson Acceleration, Mixing and Extrapolation

期刊

NUMERICAL ALGORITHMS
卷 80, 期 1, 页码 135-234

出版社

SPRINGER
DOI: 10.1007/s11075-018-0549-4

关键词

Fixed point problems; Picard iteration; Convergence acceleration; Anderson Acceleration; Anderson Mixing; Root-finding problems

向作者/读者索取更多资源

The Extrapolation Algorithm is a technique devised in 1962 for accelerating the rate of convergence of slowly converging Picard iterations for fixed point problems. Versions to this technique are now called Anderson Acceleration in the applied mathematics community and Anderson Mixing in the physics and chemistry communities, and these are related to several other methods extant in the literature. We seek here to broaden and deepen the conceptual foundations for these methods, and to clarify their relationship to certain iterative methods for root-finding problems. For this purpose, the Extrapolation Algorithm will be reviewed in some detail, and selected papers from the existing literature will be discussed, both from conceptual and implementation perspectives.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据