اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA Polygonal Discontinuous Galerkin Method with Minus One Stabilization
144
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We propose a Discontinuous Galerkin method for the Poisson equation on polygonal tessellations in two dimensions, stabilized by penalizing, locally in each element $K$, a residual term involving the fluxes, measured in the norm of the dual of $H^1(K)$. The scalar product corresponding to such a norm is numerically realized via the introduction of a (minimal) auxiliary space inspired by the Virtual Element Method. Stability and optimal error estimates in the broken $H^1$ norm are proven under a weak shape regularity assumption allowing the presence of very small edges. The results of numerical tests confirm the theoretical estimates.
قيم البحث
اقرأ أيضاً
We introduce a new stabilization for discontinuous Galerkin methods for the Poisson problem on polygonal meshes, which induces optimal convergence rates in the polynomial approximation degree $p$. In the setting of [S. Bertoluzza and D. Prada, A poly
gonal discontinuous Galerkin method with minus one stabilization, ESAIM Math. Mod. Numer. Anal. (DOI: 10.1051/m2an/2020059)], the stabilization is obtained by penalizing, in each mesh element $K$, a residual in the norm of the dual of $H^1(K)$. This negative norm is algebraically realized via the introduction of new auxiliary spaces. We carry out a $p$-explicit stability and error analysis, proving $p$-robustness of the overall method. The theoretical findings are demonstrated in a series of numerical experiments.
In this paper we consider a level set reinitialization technique based on a high-order, local discontinuous Galerkin method on unstructured triangular meshes. A finite volume based subcell stabilization is used to improve the nonlinear stability of t
he method. Instead of the standard hyperbolic level set reinitialization, the flow of time Eikonal equation is discretized to construct an approximate signed distance function. Using the Eikonal equation removes the regularization parameter in the standard approach which allows more predictable behavior and faster convergence speeds around the interface. This makes our approach very efficient especially for banded level set formulations. A set of numerical experiments including both smooth and non-smooth interfaces indicate that the method experimentally achieves design order accuracy.
Numerical simulation of flow problems and wave propagation in heterogeneous media has important applications in many engineering areas. However, numerical solutions on the fine grid are often prohibitively expensive, and multiscale model reduction te
chniques are introduced to efficiently solve for an accurate approximation on the coarse grid. In this paper, we propose an energy minimization based multiscale model reduction approach in the discontinuous Galerkin discretization setting. The main idea of the method is to extract the non-decaying component in the high conductivity regions by identifying dominant modes with small eigenvalues of local spectral problems, and define multiscale basis functions in coarse oversampled regions by constraint energy minimization problems. The multiscale basis functions are in general discontinuous on the coarse grid and coupled by interior penalty discontinuous Galerkin formulation. The minimal degree of freedom in representing high-contrast features is achieved through the design of local spectral problems, which provides the most compressed local multiscale space. We analyze the method for solving Darcy flow problem and show that the convergence is linear in coarse mesh size and independent of the contrast, provided that the oversampling size is appropriately chosen. Numerical results are presented to show the performance of the method for simulation on flow problem and wave propagation in high-contrast heterogeneous media.
We present a parallel computing strategy for a hybridizable discontinuous Galerkin (HDG) nested geometric multigrid (GMG) solver. Parallel GMG solvers require a combination of coarse-grain and fine-grain parallelism to improve time to solution perfor
mance. In this work we focus on fine-grain parallelism. We use Intels second generation Xeon Phi (Knights Landing) many-core processor. The GMG method achieves ideal convergence rates of $0.2$ or less, for high polynomial orders. A matrix free (assembly free) technique is exploited to save considerable memory usage and increase arithmetic intensity. HDG enables static condensation, and due to the discontinuous nature of the discretization, we developed a matrix vector multiply routine that does not require any costly synchronizations or barriers. Our algorithm is able to attain 80% of peak bandwidth performance for higher order polynomials. This is possible due to the data locality inherent in the HDG method. Very high performance is realized for high order schemes, due to good arithmetic intensity, which declines as the order is reduced.
This paper proposes and analyzes an ultra-weak local discontinuous Galerkin scheme for one-dimensional nonlinear biharmonic Schr{o}dinger equations. We develop the paradigm of the local discontinuous Galerkin method by introducing the second-order sp
atial derivative as an auxiliary variable instead of the conventional first-order derivative. The proposed semi-discrete scheme preserves a few physically relevant properties such as the conservation of mass and the conservation of Hamiltonian accompanied by its stability for the targeted nonlinear biharmonic Schr{o}dinger equations. We also derive optimal $L^2$-error estimates of the scheme that measure both the solution and the auxiliary variable. Several numerical studies demonstrate and support our theoretical findings.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
