z-logo
Premium
Fast iterative solver for the optimal control of time‐dependent PDEs with Crank–Nicolson discretization in time
Author(s) -
Leveque Santolo,
Pearson John W.
Publication year - 2022
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.2419
Subject(s) - preconditioner , discretization , mathematics , schur complement , solver , eigenvalues and eigenvectors , backward euler method , generalized minimal residual method , multigrid method , linear system , mathematical optimization , mathematical analysis , partial differential equation , physics , quantum mechanics
In this article, we derive a new, fast, and robust preconditioned iterative solution strategy for the all‐at‐once solution of optimal control problems with time‐dependent PDEs as constraints, including the heat equation and the non‐steady convection–diffusion equation. After applying an optimize‐then‐discretize approach, one is faced with continuous first‐order optimality conditions consisting of a coupled system of PDEs. As opposed to most work in preconditioning the resulting discretized systems, where a (first‐order accurate) backward Euler method is used for the discretization of the time derivative, we employ a (second‐order accurate) Crank–Nicolson method in time. We apply a carefully tailored invertible transformation for symmetrizing the matrix, and then derive an optimal preconditioner for the saddle‐point system obtained. The key components of this preconditioner are an accurate mass matrix approximation, a good approximation of the Schur complement, and an appropriate multigrid process to apply this latter approximation—these are constructed using our work in transforming the matrix system. We prove the optimality of the approximation of the Schur complement through bounds on the eigenvalues, and test our solver against a widely‐used preconditioner for the linear system arising from a backward Euler discretization. These demonstrate the effectiveness and robustness of our solver with respect to mesh‐sizes, regularization parameter, and diffusion coefficient.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here