Anderson acceleration of the Jacobi iterative method: an efficient alternative to Krylov methods for large, sparse linear systems
DOI10.1016/J.JCP.2015.11.018zbMATH Open1352.65110OpenAlexW2364308289MaRDI QIDQ729311FDOQ729311
John E. Pask, Phanish Suryanarayana, Phanisri P. Pratapa
Publication date: 20 December 2016
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcp.2015.11.018
Recommendations
- Acceleration of the Jacobi iterative method by factors exceeding 100 using scheduled relaxation
- Convergence analysis of Anderson-type acceleration of Richardson's iteration.
- How to generate effective block Jacobi preconditioners for solving large sparse linear systems
- Acceleration of the scheduled relaxation Jacobi method: promising strategies for solving large, sparse linear systems
- Accelerated residual methods for the iterative solution of systems of equations
Helmholtz equationparallel computingPoisson equationfixed-point iterationJacobi methodlinear systems of equationsnonsymmetric matrixAnderson extrapolation
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Cites Work
- Title not available (Why is that?)
- Two classes of multisecant methods for nonlinear acceleration
- 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
- Numerical mathematics.
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Augmented Lagrangian formulation of orbital-free density functional theory
- 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
- Nonlinear acceleration of coupled fluid–structure transient thermal problems by Anderson mixing
- Leveraging Anderson acceleration for improved convergence of iterative solutions to transport systems
- Elliptic preconditioner for accelerating the self-consistent field iteration in Kohn-Sham density functional theory
- An Iterative Least-Square Method Suitable for Solving Large Sparse Matrices
Cited In (16)
- Uzawa-Type and Augmented Lagrangian Methods for Double Saddle Point Systems
- Projection Improved SPAI Preconditioner for FGMRES
- Large scale \textit{ab-initio} simulations of dislocations
- Nonmonotone globalization for Anderson acceleration via adaptive regularization
- Anderson acceleration based on the \(\mathcal{H}^{- s}\) Sobolev norm for contractive and noncontractive fixed-point operators
- Unifying relations between iterative linear equation solvers and explicit Euler approximations for associated parabolic regularized equations
- An iterative method for 2D inverse scattering problems by alternating reconstruction of medium properties and wavefields: theory and application to the inversion of elastic waveforms
- Iterative preconditioned methods in Krylov spaces: trends of the 21st century
- Acceleration of the scheduled relaxation Jacobi method: promising strategies for solving large, sparse linear systems
- A new Jacobi-type iteration method for solving M-matrix or nonnegative linear systems
- Cyclic density functional theory: a route to the first principles simulation of bending in nanostructures
- SQDFT: spectral quadrature method for large-scale parallel \(\mathcal{O}(N)\) Kohn-Sham calculations at high temperature
- Alternating Anderson-Richardson method: an efficient alternative to preconditioned Krylov methods for large, sparse linear systems
- Anderson acceleration method of finding steady-state particle size distribution for a wide class of aggregation-fragmentation models
- Least squares methods in Krylov subspaces
- Efficient relaxed-Jacobi smoothers for multigrid on parallel computers
This page was built for publication: Anderson acceleration of the Jacobi iterative method: an efficient alternative to 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 Q729311)
