Asset Details
Do you wish to reserve the book?
ANDERSON ACCELERATION FOR FIXED-POINT ITERATIONS
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
ANDERSON ACCELERATION FOR FIXED-POINT ITERATIONS
Do you wish to request the book?
ANDERSON ACCELERATION FOR FIXED-POINT ITERATIONS
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
ANDERSON ACCELERATION FOR FIXED-POINT ITERATIONS
2011
Overview
This paper concerns an acceleration method for fixed-point iterations that originated in work of D. G. Anderson [J. Assoc. Comput. Mach., 12 (1965), pp. 547–560], which we accordingly call Anderson acceleration here. This method has enjoyed considerable success and wide usage in electronic structure computations, where it is known as Anderson mixing; however, it seems to have been untried or underexploited in many other important applications. Moreover, while other acceleration methods have been extensively studied by the mathematics and numerical analysis communities, this method has received relatively little attention from these communities over the years. A recent paper by H. Fang and Y. Saad [Numer. Linear Algebra Appl., 16 (2009), pp. 197–221] has clarified a remarkable relationship of Anderson acceleration to quasi-Newton (secant updating) methods and extended it to define a broader Anderson family of acceleration methods. In this paper, our goals are to shed additional light on Anderson acceleration and to draw further attention to its usefulness as a general tool. We first show that, on linear problems, Anderson acceleration without truncation is \"essentially equivalent\" in a certain sense to the generalized minimal residual (GMRES) method. We also show that the Type 1 variant in the Fang—Saad Anderson family is similarly essentially equivalent to the Arnoldi (full orthogonalization) method. We then discuss practical considerations for implementing Anderson acceleration and illustrate its performance through numerical experiments involving a variety of applications.
Publisher
Society for Industrial and Applied Mathematics
Subject
/ Exact sciences and technology
/ Global analysis, analysis on manifolds
/ Linear and multilinear algebra, matrix theory
/ Matrices
/ Methods
/ Numerical analysis in abstract spaces
/ Numerical analysis. Scientific computation
/ Numerical methods in probability and statistics
/ Sciences and techniques of general use
/ Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds
