Score: 0

Convergence analysis of a balancing domain decomposition method for an elliptic optimal control problem with HDG discretizations

Published: August 19, 2025 | arXiv ID: 2508.13997v1

By: Sijing Liu, Jinjin Zhang

Potential Business Impact:

Solves hard math problems much faster.

Business Areas:
Embedded Systems Hardware, Science and Engineering, Software

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.

Page Count
35 pages

Category
Mathematics:
Numerical Analysis (Math)