Back to Search
Start Over
Comments on 'Anderson Acceleration, Mixing and Extrapolation'
- Source :
- Numerical Algorithms. 80:135-234
- Publication Year :
- 2018
- Publisher :
- Springer Science and Business Media LLC, 2018.
-
Abstract
- 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.
- Subjects :
- Iterative method
Applied Mathematics
Numerical analysis
Extrapolation
Acceleration (differential geometry)
010103 numerical & computational mathematics
Fixed point
01 natural sciences
010101 applied mathematics
Rate of convergence
Theory of computation
Calculus
0101 mathematics
Mixing (physics)
Mathematics
Subjects
Details
- ISSN :
- 15729265 and 10171398
- Volume :
- 80
- Database :
- OpenAIRE
- Journal :
- Numerical Algorithms
- Accession number :
- edsair.doi...........1b104ab9ec2ac378aaf77c9cc3cf24b7