A balancing domain decomposition by constraints preconditioner for a hybridizable discontinuous Galerkin discretization of an elliptic optimal control problem
By: Sijing Liu, Jinjin Zhang
Potential Business Impact:
Solves tricky math problems faster for better designs.
We consider a hybridizable discontinuous Galerkin (HDG) method for an elliptic distributed optimal control problem and we propose a balancing domain decomposition by constraints (BDDC) preconditioner to solve the discretized system. We establish an error estimate of the HDG methods with explicit tracking of a regularization parameter $\beta$. We observe that the BDDC preconditioner is robust with respect to $\beta$. Numerical results are shown to support our findings.
Similar Papers
Convergence analysis of a balancing domain decomposition method for an elliptic optimal control problem with HDG discretizations
Numerical Analysis
Solves hard math problems much faster.
Stochastic BDDC algorithms
Numerical Analysis
Speeds up computer guesses for tricky problems.
A BDDC method with an adaptive coarse space for three-dimensional advection-diffusion problems
Numerical Analysis
Solves hard math problems faster for science.