Fixed-point iterations occur naturally and are commonly used in a broad variety of computational science and engineering applications. In practice, fixed-point iterates often converge undesirably slowly, if at all, and procedures for accelerating the convergence are desirable. This talk will focus on a particular acceleration method that originated in work of D. G. Anderson [J. Assoc. Comput. Machinery, 12 (1965), 547-560]. This method has enjoyed considerable success in electronic-structure computations but seems to have been untried or underexploited in many other important applications. Moreover, while other acceleration methods have been extensively studied by mathematicians and numerical analysts, Anderson acceleration has received relatively little attention from them, despite there being many significant unanswered mathematical questions. In this talk, I will outline Anderson acceleration, discuss some of its theoretical properties, and demonstrate its performance in several applications. This work is joint in part with Peng Ni.