Convergence analysis of a balancing domain decomposition method for an elliptic optimal control problem with HDG discretizations
By: Sijing Liu, Jinjin Zhang
Potential Business Impact:
Solves hard math problems much faster.
In this work, a balancing domain decomposition by constraints (BDDC) algorithm is applied to the nonsymmetric positive definite linear system arising from the hybridizable discontinuous Galerkin (HDG) discretization of an elliptic distributed optimal control problem. Convergence analysis for the BDDC preconditioned generalized minimal residual (GMRES) solver demonstrates that, when the subdomain size is small enough, the algorithm is robust with respect to the regularization parameter, and the number of iterations is independent of the number of subdomains and depends only slightly on the subdomain problem size. Numerical experiments are performed to confirm the theoretical results.
Similar Papers
A balancing domain decomposition by constraints preconditioner for a hybridizable discontinuous Galerkin discretization of an elliptic optimal control problem
Numerical Analysis
Solves tricky math problems faster for better designs.
A BDDC method with an adaptive coarse space for three-dimensional advection-diffusion problems
Numerical Analysis
Solves hard math problems faster for science.
PGD-based local surrogate models via overlapping domain decomposition: a computational comparison
Numerical Analysis
Makes complex math problems solve 100x faster.