Asymptotic convergence analysis and influence of initial guesses on composite Anderson acceleration
In this paper, polynomial residual update formulas for nonstationary \(AA(m, AA(1))\) are investigated and the authors find that \(AA(m, AA(1))\) with general initial guesses is a multi-Krylov method and it possesses a memory effect. For the linear problem, \(AA(m, AA(1))\) potentially has higher order (at most) polynomial degree and a stronger memory effect than that of \(AA(m)\) at the \(k\)-th iteration. The influence of an initial guess on the asymptotic convergence factor of \(AA(1, AA(1))\) is explored. A scaling invariance property of the initial guess \(x_0\) for \(AA(1, AA(1))\) methods in the linear case are presented. The influence of the initial guess on the asymptotic convergence factor of \(AA(n)\) and \(AA(m, AA(n))\) for both linear and nonlinear problems is numerically tested.
- Anderson acceleration as a Krylov method with application to convergence analysis
- Linear Asymptotic Convergence of Anderson Acceleration: Fixed-Point Analysis
- On the asymptotic linear convergence speed of Anderson acceleration, Nesterov acceleration, and nonlinear GMRES
- The effect of Anderson acceleration on superlinear and sublinear convergence
- Composite Anderson acceleration method with two window sizes and optimized damping
- A comparative study on methods for convergence acceleration of iterative vector sequences
- A Proof That Anderson Acceleration Improves the Convergence Rate in Linearly Converging Fixed-Point Methods (But Not in Those Converging Quadratically)
- Accelerating with rank-one updates
- Anderson acceleration for a class of nonsmooth fixed-point problems
- Anderson acceleration for contractive and noncontractive operators
- Anderson acceleration for fixed-point iterations
- Anderson-accelerated convergence of Picard iterations for incompressible Navier-Stokes equations
- Benchmarking results for the Newton-Anderson method
- Comments on: ``Anderson acceleration, mixing and extrapolation
- Composing scalable nonlinear algebraic solvers
- Composite Anderson acceleration method with two window sizes and optimized damping
- Convergence analysis for Anderson acceleration
- Design and Application of a Gradient-Weighted Moving Finite Element Code I: in One Dimension
- Elliptic preconditioner for accelerating the self-consistent field iteration in Kohn-Sham density functional theory
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- GMRESR: a family of nested GMRES methods
- Introduction to the numerical analysis of incompressible viscous flows.
- Iterative Procedures for Nonlinear Integral Equations
- Iterative Solution of Nonlinear Equations in Several Variables
- Krylov subspace acceleration for nonlinear multigrid schemes
- Krylov Subspace Acceleration of Nonlinear Multigrid with Application to Recirculating Flows
- KSSOLV -- a MATLAB toolbox for solving the Kohn-Sham equations
- Linear Asymptotic Convergence of Anderson Acceleration: Fixed-Point Analysis
- Local improvement results for Anderson acceleration with inaccurate function evaluations
- Nonlinear Krylov and moving nodes in the method of lines
- On the asymptotic linear convergence speed of Anderson acceleration applied to ADMM
- On the asymptotic linear convergence speed of Anderson acceleration, Nesterov acceleration, and nonlinear GMRES
- On the similarities between the quasi-Newton inverse least squares method and GMRES
- Solution of the discretized incompressible Navier-Stokes equations with the GMRES method
- Solver composition across the PDE/linear algebra barrier
- Two classes of multisecant methods for nonlinear acceleration
This page was built for publication: Asymptotic convergence analysis and influence of initial guesses on composite Anderson acceleration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185810)
