اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn agglomeration-based massively parallel non-overlapping additive Schwarz preconditioner for high-order discontinuous Galerkin methods on polytopic grids
93
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this article we design and analyze a class of two-level non-overlapping additive Schwarz preconditioners for the solution of the linear system of equations stemming from discontinuous Galerkin discretizations of second-order elliptic partial differential equations on polytopic meshes. The preconditioner is based on a coarse space and a non-overlapping partition of the computational domain where local solvers are applied in parallel. In particular, the coarse space can potentially be chosen to be non-embedded with respect to the finer space; indeed it can be obtained from the fine grid by employing agglomeration and edge coarsening techniques. We investigate the dependence of the condition number of the preconditioned system with respect to the diffusion coefficient and the discretization parameters, i.e., the mesh size and the polynomial degree of the fine and coarse spaces. Numerical examples are presented which confirm the theoretical bounds.
قيم البحث
اقرأ أيضاً
In this paper we design and analyze a uniform preconditioner for a class of high order Discontinuous Galerkin schemes. The preconditioner is based on a space splitting involving the high order conforming subspace and results from the interpretation o
f the problem as a nearly-singular problem. We show that the proposed preconditioner exhibits spectral bounds that are uniform with respect to the discretization parameters, i.e., the mesh size, the polynomial degree and the penalization coefficient. The theoretical estimates obtained are supported by several numerical simulations.
We present a new class of iterative schemes for solving initial value problems (IVP) based on discontinuous Galerkin (DG) methods. Starting from the weak DG formulation of an IVP, we derive a new iterative method based on a preconditioned Picard iter
ation. Using this approach, we can systematically construct explicit, implicit and semi-implicit schemes with arbitrary order of accuracy. We also show that the same schemes can be constructed by solving a series of correction equations based on the DG weak formulation. The accuracy of the schemes is proven to be $min{2p+1, K+1}$ with $p$ the degree of the DG polynomial basis and $K$ the number of iterations. The stability is explored numerically; we show that the implicit schemes are $A$-stable at least for $0 leq p leq 9$. Furthermore, we combine the methods with a multilevel strategy to accelerate their convergence speed. The new multilevel scheme is intended to provide a flexible framework for high order space-time discretizations and to be coupled with space-time multigrid techniques for solving partial differential equations (PDEs). We present numerical examples for ODEs and PDEs to analyze the performance of the new methods. Moreover, the newly proposed class of methods, due to its structure, is also a competitive and promising candidate for parallel in time algorithms such as Parareal, PFASST, multigrid in time, etc.
In this paper we analyse the convergence properties of V-cycle multigrid algorithms for the numerical solution of the linear system of equations arising from discontinuous Galerkin discretization of second-order elliptic partial differential equation
s on polytopal meshes. Here, the sequence of spaces that stands at the basis of the multigrid scheme is possibly non nested and is obtained based on employing agglomeration with possible edge/face coarsening. We prove that the method converges uniformly with respect to the granularity of the grid and the polynomial approximation degree p, provided that the number of smoothing steps, which depends on p, is chosen sufficiently large.
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 stabili
ty 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.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
