Search

In this paper, we construct two deep neural network (DNN) approaches based on the hybridized discontinuous Galerkin (HDG) method for solving some elliptic problems. The main idea is to use an HDG scheme for spatial discretization and then estimate solutions using the deep learning idea. In fact, by employing DNN, we can achieve robust methods compared to classical methods for solving noisy and high-dimensional problems. A brief analysis shows that the loss functions corresponding to the proposed methods, which are called DNN-HDG-I and DNN-HDG-II, converge to zero as the mesh step size reduces. By testing several examples in one, two, and three dimensions, we demonstrate the performance of the proposed methods that show their apparent advantages especially compared to classical HDG methods. As we expected, the DNN-HDG methods can efficiently and accurately extract the pattern of the solutions in all three dimensions. To show the superiority of the proposed schemes, the DNN-HDG methods are compared with the classical HDG method for solving a problem involving some noisy data. Specifically, we employ the proposed methods for solving a problem which its exact solution is not accessible and compare it with the HDG solution. In this paper, the uniformly random data and Jacobi polynomial roots are considered, respectively, as the training data on the boundary and quadrature points for approximating integrals. Also, we find that the proposed methods are not required a high number of neurons (at most 30) and hidden layers (at most 10) for satisfactory results with acceptable accuracy. [ABSTRACT FROM AUTHOR]