Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA discontinuous Galerkin method by patch reconstruction for convection-diffusion-reaction problems over polytopic meshes
109
0
0.0
(
0
)
Added by
Di Yang
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
In this article, using the weighted discrete least-squares, we propose a patch reconstruction finite element space with only one degree of freedom per element. As the approximation space, it is applied to the discontinuous Galerkin methods with the upwind scheme for the steady-state convection-diffusion-reaction problems over polytopic meshes. The optimal error estimates are provided in both diffusion-dominated and convection-dominated regimes. Furthermore, several numerical experiments are presented to verify the theoretical error estimates, and to well approximate boundary layers and/or internal layers.
rate research
Read More
We propose a new discontinuous Galerkin method based on the least-squares patch reconstruction for the biharmonic problem. We prove the optimal error estimate of the proposed method. The two-dimensional and three-dimensional numerical examples are presented to confirm the accuracy and efficiency of the method with several boundary conditions and several types of polygon meshes and polyhedral meshes.
We present a Petrov-Gelerkin (PG) method for a class of nonlocal convection-dominated diffusion problems. There are two main ingredients in our approach. First, we define the norm on the test space as induced by the trial space norm, i.e., the optimal test norm, so that the inf-sup condition can be satisfied uniformly independent of the problem. We show the well-posedness of a class of nonlocal convection-dominated diffusion problems under the optimal test norm with general assumptions on the nonlocal diffusion and convection kernels. Second, following the framework of Cohen et al.~(2012), we embed the original nonlocal convection-dominated diffusion problem into a larger mixed problem so as to choose an enriched test space as a stabilization of the numerical algorithm. In the numerical experiments, we use an approximate optimal test norm which can be efficiently implemented in 1d, and study its performance against the energy norm on the test space. We conduct convergence studies for the nonlocal problem using uniform $h$- and $p$-refinements, and adaptive $h$-refinements on both smooth manufactured solutions and solutions with sharp gradient in a transition layer. In addition, we confirm that the PG method is asymptotically compatible.
A discontinuous Galerkin method by patch reconstruction is proposed for Stokes flows. A locally divergence-free reconstruction space is employed as the approximation space, and the interior penalty method is adopted which imposes the normal component penalty terms to cancel out the pressure term. Consequently, the Stokes equation can be solved as an elliptic system instead of a saddle-point problem due to such weak form. The number of degree of freedoms of our method is the same as the number of elements in the mesh for different order of accuracy. The error estimations of the proposed method are given in a classical style, which are then verified by some numerical examples.
We adapt a symmetric interior penalty discontinuous Galerkin method using a patch reconstructed approximation space to solve elliptic eigenvalue problems, including both second and fourth order problems in 2D and 3D. It is a direct extension of the method recently proposed to solve corresponding boundary value problems, and the optimal error estimates of the approximation to eigenfunctions and eigenvalues are instant consequences from existing results. The method enjoys the advantage that it uses only one degree of freedom on each element to achieve very high order accuracy, which is highly preferred for eigenvalue problems as implied by Zhangs recent study [J. Sci. Comput. 65(2), 2015]. By numerical results, we illustrate that higher order methods can provide much more reliable eigenvalues. To justify that our method is the right one for eigenvalue problems, we show that the patch reconstructed approximation space attains the same accuracy with fewer degrees of freedom than classical discontinuous Galerkin methods. With the increasing of the polynomial order, our method can even achieve a better performance than conforming finite element methods, such methods are traditionally the methods of choice to solve problems with high regularities.
Discontinuous Galerkin (DG) methods are extensions of the usual Galerkin finite element methods. Although there are vast amount of studies on DG methods, most of them have assumed shape-regularity conditions on meshes for both theoretical error analysis and practical computations. In this paper, we present a new symmetric interior penalty DG scheme with a modified penalty term. We show that, without imposing the shape-regularity condition on the meshes, the new DG scheme inherits all of the good properties of standard DG methods, and is thus robust on anisotropic meshes. Numerical experiments confirm the theoretical error estimates obtained.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
