Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems
From MaRDI portal
Publication:6043327
DOI10.1016/J.CPC.2018.07.007arXiv1606.08740WikidataQ129511157 ScholiaQ129511157MaRDI QIDQ6043327FDOQ6043327
Authors: Phanish Suryanarayana, Phanisri P. Pratapa, John E. Pask 
Publication date: 5 May 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Abstract: We present the Alternating Anderson-Richardson (AAR) method: an efficient and scalable alternative to preconditioned Krylov solvers for the solution of large, sparse linear systems on high performance computing platforms. Specifically, we generalize the recently proposed Alternating Anderson-Jacobi (AAJ) method (Pratapa et al., J. Comput. Phys. (2016), 306, 43--54) to include preconditioning, discuss efficient parallel implementation, and provide serial MATLAB and parallel C/C++ implementations. In serial applications to nonsymmetric systems, we find that AAR is comparably robust to GMRES, using the same preconditioning, while often outperforming it in time to solution; and find AAR to be more robust than Bi-CGSTAB for the problems considered. In parallel applications to the Helmholtz and Poisson equations, we find that AAR shows superior strong and weak scaling to GMRES, Bi-CGSTAB, and Conjugate Gradient (CG) methods, using the same preconditioning, with consistently shorter times to solution at larger processor counts. Finally, in massively parallel applications to the Poisson equation, on up to 110,592 processors, we find that AAR shows superior strong and weak scaling to CG, with shorter minimum time to solution. We thus find that AAR offers a robust and efficient alternative to current state-of-the-art solvers, with increasing advantages as the number of processors grows.
Full work available at URL: https://arxiv.org/abs/1606.08740
parallel computingRichardson iterationelectronic structure calculationslinear systems of equationsAnderson extrapolation
Cites Work
- SPARC: accurate and efficient finite-difference formulation and parallel implementation of density functional theory: isolated clusters
- Direct Methods for Sparse Linear Systems
- Preconditioning techniques for large linear systems: A survey
- Anderson acceleration for fixed-point iterations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Iterative Procedures for Nonlinear Integral Equations
- An analysis for the DIIS acceleration method used in quantum chemistry calculations
- Parallel iterative methods for sparse linear systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Iterative solution of large sparse systems of equations. Transl. from the German
- SPARC: accurate and efficient finite-difference formulation and parallel implementation of density functional theory: extended systems
- Coarse-graining Kohn-Sham density functional theory
- Non-periodic finite-element formulation of Kohn-Sham density functional theory
- A characterization of the behavior of the Anderson acceleration on linear problems
- Title not available (Why is that?)
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- Hiding global communication latency in the GMRES algorithm on massively parallel machines
- An improved GBPi-CG algorithm suitable for distributed parallel computing
- Augmented Lagrangian formulation of orbital-free density functional theory
- A mesh-free convex approximation scheme for Kohn-sham density functional theory
- A Technique for Accelerating the Convergence of Restarted GMRES
- Acceleration of the Jacobi iterative method by factors exceeding 100 using scheduled relaxation
- Anderson acceleration of the Jacobi iterative method: an efficient alternative to Krylov methods for large, sparse linear systems
- Nonlinear acceleration of coupled fluid-structure transient thermal problems by Anderson mixing
- Leveraging Anderson acceleration for improved convergence of iterative solutions to transport systems
- Embedded divide-and-conquer algorithm on hierarchical real-space grids: parallel molecular dynamics simulation based on linear-scaling density functional theory
- Higher-order finite-difference formulation of periodic orbital-free density functional theory
- Parallel and distributed processing and applications. International symposium, ISPA 2003, Aizu-Wakamatsu, Japan, July 2--4, 2003. Proceedings
- SQDFT: spectral quadrature method for large-scale parallel \(\mathcal{O}(N)\) Kohn-Sham calculations at high temperature
Cited In (5)
- Projection Improved SPAI Preconditioner for FGMRES
- tpSpMV: a two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures
- Unifying relations between iterative linear equation solvers and explicit Euler approximations for associated parabolic regularized equations
- Uzawa-type and augmented Lagrangian methods for double saddle point systems
- An accelerated staggered scheme for variational phase-field models of brittle fracture
This page was built for publication: Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6043327)
