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 QIDQ6043327
John Ernest Pask, Phanish Suryanarayana, Phanisri P. Pratapa
Publication date: 5 May 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1606.08740
parallel computingelectronic structure calculationsRichardson iterationlinear systems of equationsAnderson extrapolation
Related Items
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 ⋮ Projection Improved SPAI Preconditioner for FGMRES ⋮ Uzawa-Type and Augmented Lagrangian Methods for Double Saddle Point Systems ⋮ An accelerated staggered scheme for variational phase-field models of brittle fracture
Cites Work
- Unnamed Item
- Unnamed Item
- Augmented Lagrangian formulation of orbital-free density functional theory
- A mesh-free convex approximation scheme for Kohn-sham density functional theory
- An analysis for the DIIS acceleration method used in quantum chemistry calculations
- Embedded divide-and-conquer algorithm on hierarchical real-space grids: parallel molecular dynamics simulation based on linear-scaling density functional theory
- Leveraging Anderson acceleration for improved convergence of iterative solutions to transport systems
- 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
- Higher-order finite-difference formulation of periodic orbital-free density functional theory
- An improved GBPi-CG algorithm suitable for distributed parallel computing
- Non-periodic finite-element formulation of Kohn-Sham density functional theory
- Iterative solution of large sparse systems of equations. Transl. from the German
- Parallel and distributed processing and applications. International symposium, ISPA 2003, Aizu-Wakamatsu, Japan, July 2--4, 2003. Proceedings
- SPARC: accurate and efficient finite-difference formulation and parallel implementation of density functional theory: isolated clusters
- 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
- A characterization of the behavior of the Anderson acceleration on linear problems
- Coarse-graining Kohn-Sham density functional theory
- SPARC: accurate and efficient finite-difference formulation and parallel implementation of density functional theory: extended systems
- Anderson Acceleration for Fixed-Point Iterations
- Direct Methods for Sparse Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Hiding Global Communication Latency in the GMRES Algorithm on Massively Parallel Machines
- Nonlinear acceleration of coupled fluid–structure transient thermal problems by Anderson mixing
- A Technique for Accelerating the Convergence of Restarted GMRES
- Iterative Procedures for Nonlinear Integral Equations
- SQDFT: spectral quadrature method for large-scale parallel \(\mathcal{O}(N)\) Kohn-Sham calculations at high temperature
