No Arabic abstract
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 transient 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 develop a nested hybridizable discontinuous Galerkin (HDG) method to numerically solve the Maxwells equations coupled with the hydrodynamic model for the conduction-band electrons in metals. By means of a static condensation to eliminate the degrees of freedom of the approximate solution defined in the elements, the HDG method yields a linear system in terms of the degrees of freedom of the approximate trace defined on the element boundaries. Furthermore, we propose to reorder these degrees of freedom so that the linear system accommodates a second static condensation to eliminate a large portion of the degrees of freedom of the approximate trace, thereby yielding a much smaller linear system. For the particular metallic structures considered in this paper, the resulting linear system obtained by means of nested static condensations is a block tridiagonal system, which can be solved efficiently. We apply the nested HDG method to compute the second harmonic generation (SHG) on a triangular coaxial periodic nanogap structure. This nonlinear optics phenomenon features rapid field variations and extreme boundary-layer structures that span multiple length scales. Numerical results show that the ability to identify structures which exhibit resonances at $omega$ and $2omega$ is paramount to excite the second harmonic response.
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-order 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.
We present a generic technique, automated by computer-algebra systems and available as open-source software cite{scuff-em}, for efficient numerical evaluation of a large family of singular and nonsingular 4-dimensional integrals over triangle-product domains, such as those arising in the boundary-element method (BEM) of computational electromagnetism. To date, practical implementation of BEM solvers has often required the aggregation of multiple disparate integral-evaluation schemes to treat all of the distinct types of integrals needed for a given BEM formulation; in contrast, our technique allows many different types of integrals to be handled by the emph{same} algorithm and the same code implementation. Our method is a significant generalization of the Taylor--Duffy approach cite{Taylor2003,Duffy1982}, which was originally presented for just a single type of integrand; in addition to generalizing this technique to a broad class of integrands, we also achieve a significant improvement in its efficiency by showing how the emph{dimension} of the final numerical integral may often be reduced by one. In particular, if $n$ is the number of common vertices between the two triangles, in many cases we can reduce the dimension of the integral from $4-n$ to $3-n$, obtaining a closed-form analytical result for $n=3$ (the common-triangle case).
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.