TY - JOUR
T1 - High-order discontinuous Galerkin method for solving Elliptic interface problems
AU - Chen, Min Hung
AU - Wu, Rong Jhao
N1 - Publisher Copyright:
© 2016, Mathematical Society of the Rep. of China. All rights reserved.
PY - 2016
Y1 - 2016
N2 - In this study, we develop a high-order accurate discontinuous Galerkin scheme using curvilinear quadrilateral elements for solving elliptic interface problems. To maintain accuracy for curvilinear quadrilateral elements with Qk-polynomial basis functions, we select Legendre-Gauss-Lobatto quadrature rules with k + 2 integration points, including end points, on each edge. Numerical experiments show quadrature rules are appropriate and the numerical solution converges with the order k + 1. Moreover, we implement the Uzawa method to rewrite the original linear system into smaller linear systems. The resulting method is three times faster than the original system. We also find that high-order methods are more efficient than low-order methods. Based on this result, we conclude that under the condition of limited computational resources, the best approach for achieving optimal accuracy is to solve a problem using the coarsest mesh and local spaces with the highest degree of polynomials.
AB - In this study, we develop a high-order accurate discontinuous Galerkin scheme using curvilinear quadrilateral elements for solving elliptic interface problems. To maintain accuracy for curvilinear quadrilateral elements with Qk-polynomial basis functions, we select Legendre-Gauss-Lobatto quadrature rules with k + 2 integration points, including end points, on each edge. Numerical experiments show quadrature rules are appropriate and the numerical solution converges with the order k + 1. Moreover, we implement the Uzawa method to rewrite the original linear system into smaller linear systems. The resulting method is three times faster than the original system. We also find that high-order methods are more efficient than low-order methods. Based on this result, we conclude that under the condition of limited computational resources, the best approach for achieving optimal accuracy is to solve a problem using the coarsest mesh and local spaces with the highest degree of polynomials.
UR - http://www.scopus.com/inward/record.url?scp=84989848795&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84989848795&partnerID=8YFLogxK
U2 - 10.11650/tjm.20.2016.7612
DO - 10.11650/tjm.20.2016.7612
M3 - Article
AN - SCOPUS:84989848795
SN - 1027-5487
VL - 20
SP - 1185
EP - 1202
JO - Taiwanese Journal of Mathematics
JF - Taiwanese Journal of Mathematics
IS - 5
ER -