Convergence analysis of Anderson-type acceleration of Richardson's iteration

Lupo Pasini, Massimiliano

doi:10.1002/nla.2241

Title: Convergence analysis of Anderson-type acceleration of Richardson's iteration

Journal Article · Wed Apr 03 00:00:00 EDT 2019 · Numerical Linear Algebra with Applications

DOI:https://doi.org/10.1002/nla.2241· OSTI ID:1511931

^[1]

Emory Univ., Atlanta, GA (United States). Dept. of Mathematics and Computer Science; Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States). National Center for Computational Sciences

We consider here Anderson extrapolation to accelerate the (stationary) Richardson iterative method for sparse linear systems. Using an Anderson mixing at periodic intervals, we assess how this benefits convergence to a prescribed accuracy. The method, named alternating Anderson–Richardson, has appealing properties for high-performance computing, such as the potential to reduce communication and storage in comparison to more conventional linear solvers. We establish sufficient conditions for convergence, and we evaluate the performance of this technique in combination with various preconditioners through numerical examples. Furthermore, we propose an augmented version of this technique.

View Accepted Manuscript (DOE)

View Accepted Manuscript (Publisher)

Cite

Export

Save

Research Organization:: Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)

Sponsoring Organization:: USDOE Office of Science (SC)

Grant/Contract Number:: AC05-00OR22725

OSTI ID:: 1511931

Alternate ID(s):: OSTI ID: 1504993

Journal Information:: Numerical Linear Algebra with Applications, Vol. 26, Issue 4; ISSN 1070-5325

Publisher:: WileyCopyright Statement

Country of Publication:: United States

Language:: English

Citation Metrics:

Cited by: 5 works

Citation information provided by
Web of Science

References (19)

Reducing the bandwidth of sparse symmetric matrices Cuthill, E.; McKee, J. Proceedings of the 1969 24th national conference on - https://doi.org/10.1145/800195.805928	conference	January 1969
A characterization of the behavior of the Anderson acceleration on linear problems Potra, Florian A.; Engler, Hans Linear Algebra and its Applications, Vol. 438, Issue 3 https://doi.org/10.1016/j.laa.2012.09.008	journal	February 2013
Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods: Part II Golub, Gene H.; Varga, Richard S. Numerische Mathematik, Vol. 3, Issue 1 https://doi.org/10.1007/BF01386014	journal	December 1961
Two classes of multisecant methods for nonlinear acceleration Fang, Haw-ren; Saad, Yousef Numerical Linear Algebra with Applications, Vol. 16, Issue 3 https://doi.org/10.1002/nla.617	journal	March 2009
Benchmarking optimization software with performance profiles Dolan, Elizabeth D.; Moré, Jorge J. Mathematical Programming, Vol. 91, Issue 2 https://doi.org/10.1007/s101070100263	journal	January 2002
Numerical Analysis of Fixed Point Algorithms in the Presence of Hardware Faults Stoyanov, Miroslav; Webster, Clayton SIAM Journal on Scientific Computing, Vol. 37, Issue 5 https://doi.org/10.1137/140991406	journal	January 2015
Iterative Methods for Sparse Linear Systems Saad, Yousef https://doi.org/10.1137/1.9780898718003	book	January 2003
GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems Saad, Youcef; Schultz, Martin H. SIAM Journal on Scientific and Statistical Computing, Vol. 7, Issue 3 https://doi.org/10.1137/0907058	journal	July 1986
Hierarchical Krylov and nested Krylov methods for extreme-scale computing McInnes, Lois Curfman; Smith, Barry; Zhang, Hong Parallel Computing, Vol. 40, Issue 1 https://doi.org/10.1016/j.parco.2013.10.001	journal	January 2014
Alternating Anderson–Richardson method: An efficient alternative to preconditioned Krylov methods for large, sparse linear systems Suryanarayana, Phanish; Pratapa, Phanisri P.; Pask, John E. Computer Physics Communications, Vol. 234 https://doi.org/10.1016/j.cpc.2018.07.007	journal	January 2019
Anderson acceleration of the Jacobi iterative method: An efficient alternative to Krylov methods for large, sparse linear systems Pratapa, Phanisri P.; Suryanarayana, Phanish; Pask, John E. Journal of Computational Physics, Vol. 306 https://doi.org/10.1016/j.jcp.2015.11.018	journal	February 2016
Domain Decomposition Preconditioners for Communication-Avoiding Krylov Methods on a Hybrid CPU/GPU Cluster Yamazaki, Ichitaro; Rajamanickam, Sivasankaran; Boman, Erik G. SC14: International Conference for High Performance Computing, Networking, Storage and Analysis https://doi.org/10.1109/SC.2014.81	conference	November 2014
Convergence Analysis for Anderson Acceleration Toth, Alex; Kelley, C. T. SIAM Journal on Numerical Analysis, Vol. 53, Issue 2 https://doi.org/10.1137/130919398	journal	January 2015
Preconditioning Techniques for Large Linear Systems: A Survey Benzi, Michele Journal of Computational Physics, Vol. 182, Issue 2 https://doi.org/10.1006/jcph.2002.7176	journal	November 2002
Anderson Acceleration for Fixed-Point Iterations Walker, Homer F.; Ni, Peng SIAM Journal on Numerical Analysis, Vol. 49, Issue 4 https://doi.org/10.1137/10078356X	journal	January 2011
The Tchebychev iteration for nonsymmetric linear systems Manteuffel, Thomas A. Numerische Mathematik, Vol. 28, Issue 3 https://doi.org/10.1007/BF01389971	journal	September 1977
Iterative Procedures for Nonlinear Integral Equations Anderson, Donald G. Journal of the ACM, Vol. 12, Issue 4 https://doi.org/10.1145/321296.321305	journal	October 1965
Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods: Part I Golub, Gene H.; Varga, Richard S. Numerische Mathematik, Vol. 3, Issue 1 https://doi.org/10.1007/bf01386013	journal	December 1961
Benchmarking Optimization Software with Performance Profiles Dolan, Elizabeth D.; Moré, Jorge J. arXiv https://doi.org/10.48550/arxiv.cs/0102001	text	January 2001

Similar Records

Anderson acceleration of the Jacobi iterative method: An efficient alternative to Krylov methods for large, sparse linear systems

Journal Article · Tue Dec 01 00:00:00 EST 2015 · Journal of Computational Physics · OSTI ID:1511931

Pratapa, Phanisri P.; Suryanarayana, Phanish; Pask, John E.

Analysis of Monte Carlo accelerated iterative methods for sparse linear systems: Analysis of Monte Carlo accelerated iterative methods for sparse linear systems

Journal Article · Sun Mar 05 00:00:00 EST 2017 · Numerical Linear Algebra with Applications · OSTI ID:1511931

Benzi, Michele; Evans, Thomas M.; Hamilton, Steven P.; +2 more

Alternating Anderson–Richardson method: An efficient alternative to preconditioned Krylov methods for large, sparse linear systems

Journal Article · Thu Jul 19 00:00:00 EDT 2018 · Computer Physics Communications · OSTI ID:1511931

Suryanarayana, Phanish; Pratapa, Phanisri P.; Pask, John E.

Related Subjects

97 MATHEMATICS AND COMPUTING
Anderson acceleration
fixed-point scheme
projection method
Richardson iteration

Title: Convergence analysis of Anderson-type acceleration of Richardson's iteration

Citation Formats

References (19)

Similar Records

Related Subjects