Two classes of multisecant methods for nonlinear acceleration

By Haw-ren Fang, Y. Saad. Numerical Linear Algebra with Applications, 2009

358 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Anderson Acceleration for Fixed-Point Iterations (2011, methodology): “A recent paper by Fang and Saad [19] summarizes these and a great deal of related work in addition to providing a number of new developments.”
Fast and Robust Iterative Closest Point (2020, background): “…∗ 1 , . . . , θ ∗ m ) is the solution to the following linear least-squares problem: It has been shown that Anderson acceleration is a quasi-Newton method for ﬁnding a root of the residual function [39], and it can improve the convergence rate for ﬁxed-point iterations that converge linearly [51].”
Accelerating Smooth Games by Manipulating Spectral Shapes (2020, methodology): “Anderson acceleration and its extension RNA are similar to quasi-Newton (Fang and Saad, 2009), but remains ﬁrst-order methods.”