Efficient Smoothers for All-at-once Multigrid Methods for Poisson and Stokes Control Problems

Abstract : In the present paper we concentrate on an important issue in constructing a good multigrid solver: the choice of an efficient smoother. We will introduce all-at-once multigrid solvers for optimal control problems which show robust convergence in the grid size and in the regularization parameter. We will refer to recent publications that guarantee such a convergence behavior. These publications do not pay much attention to the construction of the smoother and suggest to use a normal equation smoother. We will see that using a Gauss Seidel like variant of this smoother, the overall multigrid solver is speeded up by a factor of about two with no additional work. The author will give a proof which indicates that also the Gauss Seidel like variant of the smoother is covered by the convergence theory. Numerical experiments suggest that the proposed method are competitive with Vanka type methods.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01286444
Contributor : Hal Ifip <>
Submitted on : Thursday, March 10, 2016 - 5:34:57 PM
Last modification on : Friday, December 1, 2017 - 1:12:48 AM
Document(s) archivé(s) le : Sunday, November 13, 2016 - 3:11:36 PM

File

978-3-662-45504-3_33_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Stefan Takacs. Efficient Smoothers for All-at-once Multigrid Methods for Poisson and Stokes Control Problems. 26th Conference on System Modeling and Optimization (CSMO), Sep 2013, Klagenfurt, Austria. pp.337-347, ⟨10.1007/978-3-662-45504-3_33⟩. ⟨hal-01286444⟩

Share

Metrics

Record views

74

Files downloads

15