Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHigh Order Edge Sensors with $ell^1$ Regularization for Enhanced Discontinuous Galerkin Methods
124
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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 which 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.
rate research
Read More
In this paper, we will develop a class of high order asymptotic preserving (AP) discontinuous Galerkin (DG) methods for nonlinear time-dependent gray radiative transfer equations (GRTEs). Inspired by the work cite{Peng2020stability}, in which stability enhanced high order AP DG methods are proposed for linear transport equations, we propose to pernalize the nonlinear GRTEs under the micro-macro decomposition framework by adding a weighted linear diffusive term. In the diffusive limit, a hyperbolic, namely $Delta t=mathcal{O}(h)$ where $Delta t$ and $h$ are the time step and mesh size respectively, instead of parabolic $Delta t=mathcal{O}(h^2)$ time step restriction is obtained, which is also free from the photon mean free path. The main new ingredient is that we further employ a Picard iteration with a predictor-corrector procedure, to decouple the resulting global nonlinear system to a linear system with local nonlinear algebraic equations from an outer iterative loop. Our scheme is shown to be asymptotic preserving and asymptotically accurate. Numerical tests for one and two spatial dimensional problems are performed to demonstrate that our scheme is of high order, effective and efficient.
This work represents the first endeavor in using ultraweak formulations to implement high-order polygonal finite element methods via the discontinuous Petrov-Galerkin (DPG) methodology. Ultraweak variational formulations are nonstandard in that all the weight of the derivatives lies in the test space, while most of the trial space can be chosen as copies of $L^2$-discretizations that have no need to be continuous across adjacent elements. Additionally, the test spaces are broken along the mesh interfaces. This allows one to construct conforming polygonal finite element methods, termed here as PolyDPG methods, by defining most spaces by restriction of a bounding triangle or box to the polygonal element. The only variables that require nontrivial compatibility across elements are the so-called interface or skeleton variables, which can be defined directly on the element boundaries. Unlike other high-order polygonal methods, PolyDPG methods do not require ad hoc stabilization terms thanks to the crafted stability of the DPG methodology. A proof of convergence of the form $h^p$ is provided and corroborated through several illustrative numerical examples. These include polygonal meshes with $n$-sided convex elements and with highly distorted concave elements, as well as the modeling of discontinuous material properties along an arbitrary interface that cuts a uniform grid. Since PolyDPG methods have a natural a posteriori error estimator a polygonal adaptive strategy is developed and compared to standard adaptivity schemes based on constrained hanging nodes. This work is also accompanied by an open-source $texttt{PolyDPG}$ software supporting polygonal and conventional elements.
In this work, we propose and investigate stable high-order collocation-type discretisations of the discontinuous Galerkin method on equidistant and scattered collocation points. We do so by incorporating the concept of discrete least squares into the discontinuous Galerkin framework. Discrete least squares approximations allow us to construct stable and high-order accurate approximations on arbitrary collocation points, while discrete least squares quadrature rules allow us their stable and exact numerical integration. Both methods are computed efficiently by using bases of discrete orthogonal polynomials. Thus, the proposed discretisation generalises known classes of discretisations of the discontinuous Galerkin method, such as the discontinuous Galerkin collocation spectral element method. We are able to prove conservation and linear $L^2$-stability of the proposed discretisations. Finally, numerical tests investigate their accuracy and demonstrate their extension to nonlinear conservation laws, systems, longtime simulations, and a variable coefficient problem in two space dimensions.
This paper presents a class of novel high-order accurate discontinuous Galerkin (DG) schemes for the compressible Euler equations under gravitational fields. A notable feature of these schemes is that they are well-balanced for a general hydrostatic equilibrium state, and at the same time, provably preserve the positivity of density and pressure. In order to achieve the well-balanced and positivity-preserving properties simultaneously, a novel DG spatial discretization is carefully designed with suitable source term reformulation and a properly modified Harten-Lax-van Leer contact (HLLC) flux. Based on some technical decompositions as well as several key properties of the admissible states and HLLC flux, rigorous positivity-preserving analyses are carried out. It is proven that the resulting well-balanced DG schemes, coupled with strong stability preserving time discretizations, satisfy a weak positivity property, which implies that one can apply a simple existing limiter to effectively enforce the positivity-preserving property, without losing high-order accuracy and conservation. The proposed methods and analyses are applicable to the Euler system with general equation of state. Extensive one- and two-dimensional numerical tests demonstrate the desired properties of these schemes, including the exact preservation of the equilibrium state, the ability to capture small perturbation of such state, the robustness for solving problems involving low density and/or low pressure, and good resolution for smooth and discontinuous solutions.
We present the recent development of hybridizable and embedded discontinuous Galerkin (DG) methods for wave propagation problems in fluids, solids, and electromagnetism. In each of these areas, we describe the methods, discuss their main features, display numerical results to illustrate their performance, and conclude with bibliography notes. The main ingredients in devising these DG methods are (i) a local Galerkin projection of the underlying partial differential equations at the element level onto spaces of polynomials of degree k to parametrize the numerical solution in terms of the numerical trace; (ii) a judicious choice of the numerical flux to provide stability and consistency; and (iii) a global jump condition that enforces the continuity of the numerical flux to obtain a global system in terms of the numerical trace. These DG methods are termed hybridized DG methods, because they are amenable to hybridization (static condensation) and hence to more efficient implementations. They share many common advantages of DG methods and possess some unique features that make them well-suited to wave propagation problems.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
