Volume 26, 2020
|Number of page(s)||26|
|Published online||13 November 2020|
Diagonalization-based parallel-in-time algorithms for parabolic PDE-constrained optimization problems
School of Mathematics and Statistics, Northeast Normal University,
130024, P.R. China.
2 NCMIS & LSEC, Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, P.R. China.
* Corresponding author: email@example.com
Accepted: 10 March 2020
Solving parabolic PDE-constrained optimization problems requires to take into account the discrete time points all-at-once, which means that the computation procedure is often time-consuming. It is thus desirable to design robust and analyzable parallel-in-time (PinT) algorithms to handle this kind of coupled PDE systems with opposite evolution directions. To this end, for two representative model problems which are, respectively, the time-periodic PDEs and the initial-value PDEs, we propose a diagonalization-based approach that can reduce dramatically the computational time. The main idea lies in carefully handling the associated time discretization matrices that are denoted by Bper and Bini for the two problems. For the first problem, we diagonalize Bper directly and this results in a direct PinT algorithm (i.e., non-iterative). For the second problem, the main idea is to design a suitable approximation B̂per of Bini, which naturally results in a preconditioner of the discrete KKT system. This preconditioner can be used in a PinT pattern, and for both the Backward-Euler method and the trapezoidal rule the clustering of the eigenvalues and singular values of the preconditioned matrix is justified. Compared to existing preconditioners that are designed by approximating the Schur complement of the discrete KKT system, we show that the new preconditioner leads to much faster convergence for certain Krylov subspace solvers, e.g., the GMRES and BiCGStab methods. Numerical results are presented to illustrate the advantages of the proposed PinT algorithm.
Mathematics Subject Classification: 65M55 / 65M12 / 65M15 / 65Y05
Key words: Parabolic PDE-constrained optimization / PinT algorithm / diagonalization technique / preconditioner / GMRES / BiCGStab
© EDP Sciences, SMAI 2020
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.