New time domain decomposition methods for parabolic optimal control problems II: Neumann-Neumann algorithms
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913213032955904 |
|---|---|
| author | Gander, Martin Jakob Lu, Liu-Di |
| author_facet | Gander, Martin Jakob Lu, Liu-Di |
| contents | We present new Neumann-Neumann algorithms based on a time domain decomposition applied to unconstrained parabolic optimal control problems. After a spatial semi-discretization, the Lagrange multiplier approach provides a coupled forward-backward optimality system, which can be solved using a time domain decomposition. Due to the forward-backward structure of the optimality system, nine variants can be found for the Neumann-Neumann algorithms. We analyze their convergence behavior and determine the optimal relaxation parameter for each algorithm. Our analysis reveals that the most natural algorithms are actually only good smoothers, and there are better choices which lead to efficient solvers. We illustrate our analysis with numerical experiments. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_15522 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | New time domain decomposition methods for parabolic optimal control problems II: Neumann-Neumann algorithms Gander, Martin Jakob Lu, Liu-Di Numerical Analysis Optimization and Control 65M12, 65M55, 65Y05 We present new Neumann-Neumann algorithms based on a time domain decomposition applied to unconstrained parabolic optimal control problems. After a spatial semi-discretization, the Lagrange multiplier approach provides a coupled forward-backward optimality system, which can be solved using a time domain decomposition. Due to the forward-backward structure of the optimality system, nine variants can be found for the Neumann-Neumann algorithms. We analyze their convergence behavior and determine the optimal relaxation parameter for each algorithm. Our analysis reveals that the most natural algorithms are actually only good smoothers, and there are better choices which lead to efficient solvers. We illustrate our analysis with numerical experiments. |
| title | New time domain decomposition methods for parabolic optimal control problems II: Neumann-Neumann algorithms |
| topic | Numerical Analysis Optimization and Control 65M12, 65M55, 65Y05 |
| url | https://arxiv.org/abs/2401.15522 |