Convergence Analysis of the Alternating Anderson-Picard Method for Nonlinear Fixed-point Problems
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912477661364224 |
|---|---|
| author | Feng, Xue Laiu, M. Paul Strohmer, Thomas |
| author_facet | Feng, Xue Laiu, M. Paul Strohmer, Thomas |
| contents | Anderson Acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson-Picard (AAP) method. Despite introducing more ``slow'' Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP ``converges'' to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally $q$-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_10472 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Convergence Analysis of the Alternating Anderson-Picard Method for Nonlinear Fixed-point Problems Feng, Xue Laiu, M. Paul Strohmer, Thomas Numerical Analysis Anderson Acceleration (AA) has been widely used to solve nonlinear fixed-point problems due to its rapid convergence. This work focuses on a variant of AA in which multiple Picard iterations are performed between each AA step, referred to as the Alternating Anderson-Picard (AAP) method. Despite introducing more ``slow'' Picard iterations, this method has been shown to be efficient and even more robust in both linear and nonlinear cases. However, there is a lack of theoretical analysis for AAP in the nonlinear case. In this paper, we address this gap by establishing the equivalence between AAP and a multisecant-GMRES method that uses GMRES to solve a multisecant linear system at each iteration. From this perspective, we show that AAP ``converges'' to the Newton-GMRES method. Specifically, as the residual approaches zero, the multisecant matrix, the approximate Jacobian inverse, the search direction, and the optimization gain of AAP converge to their counterparts in the Newton-GMRES method. These connections provide insights for analyzing the asymptotic convergence properties of AAP. Consequently, we show that AAP is locally $q$-linear convergent and provide an upper bound for the convergence factor of AAP. To validate the theoretical results, numerical examples are provided. |
| title | Convergence Analysis of the Alternating Anderson-Picard Method for Nonlinear Fixed-point Problems |
| topic | Numerical Analysis |
| url | https://arxiv.org/abs/2407.10472 |