TY - JOUR
T1 - Error analysis of HDG approximations for elliptic variational inequality
T2 - obstacle problem
AU - Zhao, M.
AU - Wu, H.
AU - Xiong, C.
N1 - Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/6/1
Y1 - 2019/6/1
N2 - In this article, we study the HDG approximation for the obstacle problem, i.e., variational inequalities, with remarkable convergence properties. Using polynomials of degree k ≥ 0 for both the potential u and the flux q, we show that the approximations of the potential and flux converge in L2 with the optimal order of k + 1. The approximate trace of the potential is proved to converge with optimal order k + 1 in L2. Finally, numerical results are presented to verify these theoretical results.
AB - In this article, we study the HDG approximation for the obstacle problem, i.e., variational inequalities, with remarkable convergence properties. Using polynomials of degree k ≥ 0 for both the potential u and the flux q, we show that the approximations of the potential and flux converge in L2 with the optimal order of k + 1. The approximate trace of the potential is proved to converge with optimal order k + 1 in L2. Finally, numerical results are presented to verify these theoretical results.
KW - Elliptic variational inequality
KW - Error analysis
KW - HDG
UR - https://www.scopus.com/pages/publications/85048520147
U2 - 10.1007/s11075-018-0556-5
DO - 10.1007/s11075-018-0556-5
M3 - Article
AN - SCOPUS:85048520147
SN - 1017-1398
VL - 81
SP - 445
EP - 463
JO - Numerical Algorithms
JF - Numerical Algorithms
IS - 2
ER -