Asymptotic convergence analysis and influence of initial guesses on composite Anderson acceleration (Q6185810)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7785140
Language Label Description Also known as
default for all languages
No label defined
    English
    Asymptotic convergence analysis and influence of initial guesses on composite Anderson acceleration
    scientific article; zbMATH DE number 7785140

      Statements

      Asymptotic convergence analysis and influence of initial guesses on composite Anderson acceleration (English)
      0 references
      0 references
      0 references
      8 January 2024
      0 references
      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.
      0 references
      0 references
      non-stationary Anderson acceleration
      0 references
      fixed-point iteration
      0 references
      dynamic window sizes
      0 references
      Krylov method
      0 references

      Identifiers