Smoothing analysis of two robust multigrid methods for elliptic optimal control problems
From MaRDI portal
Methods involving semicontinuity and convergence; relaxation (49J45) Optimality conditions for problems involving partial differential equations (49K20) Newton-type methods (49M15) Discrete approximations in optimal control (49M25) Iterative numerical methods for linear systems (65F10) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)
Abstract: In this paper we study and compare two multigrid relaxation schemes with coarsening by two, three, and four for solving elliptic sparse optimal control problems with control constraints. First, we perform a detailed local Fourier analysis (LFA) of a well-known collective Jacobi relaxation (CJR) scheme, where the optimal smoothing factors are derived. This insightful analysis reveals that the optimal relaxation parameters depend on mesh size and regularization parameters, which was not investigated in literature. Second, we propose and analyze a new mass-based Braess-Sarazin relaxation (BSR) scheme, which is proven to provide smaller smoothing factors than the CJR scheme when for a small constant . Here is the regularization parameter and is the spatial mesh step size. These schemes are successfully extended to control-constrained cases through the semi-smooth Newton method. Coarsening by three or four with BSR is competitive with coarsening by two. Numerical examples are presented to validate our theoretical outcomes. The proposed inexact BSR (IBSR) scheme, where two preconditioned conjugate gradients iterations are applied to the Schur complement system, yields better computational efficiency than the CJR scheme.
This page was built for publication: Smoothing analysis of two robust multigrid methods for elliptic optimal control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6394611)
