On generalized preconditioners for time-parallel parabolic optimal control
The ParaDiag family of algorithms solves differential equations by using preconditioners that
can be inverted in parallel through diagonalization. In the context of optimal control of linear …
can be inverted in parallel through diagonalization. In the context of optimal control of linear …
Absolute-value based preconditioner for complex-shifted Laplacian systems
The complex-shifted Laplacian systems arising in a wide range of applications. In this work,
we propose an absolute-value based preconditioner for solving the complex-shifted …
we propose an absolute-value based preconditioner for solving the complex-shifted …
Block -circulant preconditioners for parabolic optimal control problems
PY Fung, S Hon - arXiv preprint arXiv:2406.00952, 2024 - arxiv.org
In this work, we propose a class of novel preconditioned Krylov subspace methods for
solving an optimal control problem of parabolic equations. Namely, we develop a family of …
solving an optimal control problem of parabolic equations. Namely, we develop a family of …
Diagonalization-based preconditioners and generalized convergence bounds for ParaOpt
The ParaOpt algorithm was recently introduced as a time-parallel solver for optimal-control
problems with a terminal-cost objective, and convergence results have been presented for …
problems with a terminal-cost objective, and convergence results have been presented for …
A Vanka‐based parameter‐robust multigrid relaxation for the Stokes–Darcy Brinkman problems
Y He - Numerical Linear Algebra with Applications, 2023 - Wiley Online Library
We consider a block‐structured multigrid method based on Braess–Sarazin relaxation for
solving the Stokes–Darcy Brinkman equations discretized by the marker and cell scheme. In …
solving the Stokes–Darcy Brinkman equations discretized by the marker and cell scheme. In …