اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA GPU-accelerated nodal discontinuous Galerkin method with high-order absorbing boundary conditions and corner/edge compatibility
52
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Discontinuous Galerkin finite element schemes exhibit attractive features for accurate large-scale wave-propagation simulations on modern parallel architectures. For many applications, these schemes must be coupled with non-reflective boundary treatments to limit the size of the computational domain without losing accuracy or computational efficiency, which remains a challenging task. In this paper, we present a combination of a nodal discontinuous Galerkin method with high-order absorbing boundary conditions (HABCs) for cuboidal computational domains. Compatibility conditions are derived for HABCs intersecting at the edges and the corners of a cuboidal domain. We propose a GPU implementation of the computational procedure, which results in a multidimensional solver with equations to be solved on 0D, 1D, 2D and 3D spatial regions. Numerical results demonstrate both the accuracy and the computational efficiency of our approach.
قيم البحث
اقرأ أيضاً
The mass flow rate of Poiseuille flow of rarefied gas through long ducts of two-dimensional cross-sections with arbitrary shape are critical in the pore-network modeling of gas transport in porous media. In this paper, for the first time, the high-or
der hybridizable discontinuous Galerkin (HDG) method is used to find the steady-state solution of the linearized Bhatnagar-Gross-Krook equation on two-dimensional triangular meshes. The velocity distribution function and its traces are approximated in the piecewise polynomial space (of degree up to 4) on the triangular meshes and the mesh skeletons, respectively. By employing a numerical flux that is derived from the first-order upwind scheme and imposing its continuity on the mesh skeletons, global systems for unknown traces are obtained with a few coupled degrees of freedom. To achieve fast convergence to the steady-state solution, a diffusion-type equation for flow velocity that is asymptotic-preserving into the fluid dynamic limit is solved by the HDG simultaneously, on the same meshes. The proposed HDG-synthetic iterative scheme is proved to be accurate and efficient. Specifically, for flows in the near-continuum regime, numerical simulations have shown that, to achieve the same level of accuracy, our scheme could be faster than the conventional iterative scheme by two orders of magnitude, while it is faster than the synthetic iterative scheme based on the finite difference discretization in the spatial space by one order of magnitude. The HDG-synthetic iterative scheme is ready to be extended to simulate rarefied gas mixtures and the Boltzmann collision operator.
This work discusses the application of an affine reconstructed nodal DG method for unstructured grids of triangles. Solving the diffusion terms in the DG method is non-trivial due to the solution representations being piecewise continuous. Hence, the
diffusive flux is not defined on the interface of elements. The proposed numerical approach reconstructs a smooth solution in a parallelogram that is enclosed by the quadrilateral formed by two adjacent triangle elements. The interface between these two triangles is the diagonal of the enclosed parallelogram. Similar to triangles, the mapping of parallelograms from a physical domain to a reference domain is an affine mapping, which is necessary for an accurate and efficient implementation of the numerical algorithm. Thus, all computations can still be performed on the reference domain, which promotes efficiency in computation and storage. This reconstruction does not make assumptions on choice of polynomial basis. Reconstructed DG algorithms have previously been developed for modal implementations of the convection-diffusion equations. However, to the best of the authors knowledge, this is the first practical guideline that has been proposed for applying the reconstructed algorithm on a nodal discontinuous Galerkin method with a focus on accuracy and efficiency. The algorithm is demonstrated on a number of benchmark cases as well as a challenging substantive problem in HED hydrodynamics with highly disparate diffusion parameters.
Some properties of a Local discontinuous Galerkin (LDG) algorithm are demonstrated for the problem of evaluting a second derivative $g = f_{xx}$ for a given $f$. (This is a somewhat unusual problem, but it is useful for understanding the initial tran
sient response of an algorithm for diffusion equations.) LDG uses an auxiliary variable to break this up into two first order equations and then applies techniques by analogy to DG algorithms for advection algorithms. This introduces an asymmetry into the solution that depends on the choice of upwind directions for these two first order equations. When using piecewise linear basis functions, this LDG solution $g_h$ is shown not to converge in an $L_2$ norm because the slopes in each cell diverge. However, when LDG is used in a time-dependent diffusion problem, this error in the second derivative term is transient and rapidly decays away, so that the overall error is bounded. I.e., the LDG approximation $f_h(x,t)$ for a diffusion equation $partial f / partial t = f_{xx}$ converges to the proper solution (as has been shown before), even though the initial rate of change $partial f_h / partial t$ does not converge. We also show results from the Recovery discontinuous Galerkin (RDG) approach, which gives symmetric solutions that can have higher rates of convergence for a stencil that couples the same number of cells.
In this paper we propose and analyze a Discontinuous Galerkin method for a linear parabolic problem with dynamic boundary conditions. We present the formulation and prove stability and optimal a priori error estimates for the fully discrete scheme. M
ore precisely, using polynomials of degree $pgeq 1$ on meshes with granularity $h$ along with a backward Euler time-stepping scheme with time-step $Delta t$, we prove that the fully-discrete solution is bounded by the data and it converges, in a suitable (mesh-dependent) energy norm, to the exact solution with optimal order $h^p + Delta t$. The sharpness of the theoretical estimates are verified through several numerical experiments.
This paper investigates the use of $ell^1$ regularization for solving hyperbolic conservation laws based on high order discontinuous Galerkin (DG) approximations. We first use the polynomial annihilation method to construct a high order edge sensor w
hich enables us to flag troubled elements. The DG approximation is enhanced in these troubled regions by activating $ell^1$ regularization to promote sparsity in the corresponding jump function of the numerical solution. The resulting $ell^1$ optimization problem is efficiently implemented using the alternating direction method of multipliers. By enacting $ell^1$ regularization only in troubled cells, our method remains accurate and efficient, as no additional regularization or expensive iterative procedures are needed in smooth regions. We present results for the inviscid Burgers equation as well as a nonlinear system of conservation laws using a nodal collocation-type DG method as a solver.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
