New time domain decomposition methods for parabolic control problems I: Dirichlet-Neumann and Neumann-Dirichlet algorithms

08/24/2023
by   Martin Jakob Gander, et al.
0

We present new Dirichlet-Neumann and Neumann-Dirichlet algorithms with a time domain decomposition applied to unconstrained parabolic optimal control problems. After a spatial semi-discretization, we use the Lagrange multiplier approach to derive a coupled forward-backward optimality system, which can then be solved using a time domain decomposition. Due to the forward-backward structure of the optimality system, three variants can be found for the Dirichlet-Neumann and Neumann-Dirichlet 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2023

Dirichlet-Neumann and Neumann-Neumann Methods for Elliptic Control Problems

We present the Dirichlet-Neumann (DN) and Neumann-Neumann (NN) methods a...
research
12/23/2022

Domain Decomposition Methods for Elliptic Problems with High Contrast Coefficients Revisited

In this paper, we revisit the nonoverlapping domain decomposition method...
research
12/15/2019

Symplectic Runge-Kutta discretization of a regularized forward-backward sweep iteration for optimal control problems

Li, Chen, Tai E. (J. Machine Learning Research, 2018) have proposed ...
research
06/28/2023

A new error analysis for parabolic Dirichlet boundary control problems

In this paper, we consider the finite element approximation to a parabol...
research
07/18/2023

Cross-points in the Dirichlet-Neumann method II: a geometrically convergent variant

When considered as a standalone iterative solver for elliptic boundary v...
research
08/26/2021

An efficient unconditionally stable method for Dirichlet partitions in arbitrary domains

A Dirichlet k-partition of a domain is a collection of k pairwise disjoi...
research
09/04/2022

Smoothers Based on Nonoverlapping Domain Decomposition Methods for H(𝐜𝐮𝐫𝐥) Problems: A Numerical Study

This paper presents a numerical study on multigrid algorithms of V-cycle...

Please sign up or login with your details

Forgot password? Click here to reset