Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems
From MaRDI portal
Publication:6043327
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.
Cites work
- scientific article; zbMATH DE number 2166998 (Why is no real title available?)
- A Technique for Accelerating the Convergence of Restarted GMRES
- A characterization of the behavior of the Anderson acceleration on linear problems
- A mesh-free convex approximation scheme for Kohn-sham density functional theory
- Acceleration of the Jacobi iterative method by factors exceeding 100 using scheduled relaxation
- An analysis for the DIIS acceleration method used in quantum chemistry calculations
- An improved GBPi-CG algorithm suitable for distributed parallel computing
- Anderson acceleration for fixed-point iterations
- Anderson acceleration of the Jacobi iterative method: an efficient alternative to Krylov methods for large, sparse linear systems
- Augmented Lagrangian formulation of orbital-free density functional theory
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Coarse-graining Kohn-Sham density functional theory
- Direct Methods for Sparse Linear Systems
- Embedded divide-and-conquer algorithm on hierarchical real-space grids: parallel molecular dynamics simulation based on linear-scaling density functional theory
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Hiding global communication latency in the GMRES algorithm on massively parallel machines
- Higher-order finite-difference formulation of periodic orbital-free density functional theory
- Iterative Procedures for Nonlinear Integral Equations
- Iterative solution of large sparse systems of equations. Transl. from the German
- Leveraging Anderson acceleration for improved convergence of iterative solutions to transport systems
- Non-periodic finite-element formulation of Kohn-Sham density functional theory
- Nonlinear acceleration of coupled fluid-structure transient thermal problems by Anderson mixing
- Parallel and distributed processing and applications. International symposium, ISPA 2003, Aizu-Wakamatsu, Japan, July 2--4, 2003. Proceedings
- Parallel iterative methods for sparse linear systems
- Preconditioning techniques for large linear systems: A survey
- Reducing the effect of global communication in \(\text{GMRES} (m)\) and CG on parallel distributed memory computers
- SPARC: accurate and efficient finite-difference formulation and parallel implementation of density functional theory: extended systems
- SPARC: accurate and efficient finite-difference formulation and parallel implementation of density functional theory: isolated clusters
- 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)
