On the convergence of iterative solvers for polygonal discontinuous Galerkin discretizations
From MaRDI portal
(Redirected from Publication:1746923)
Abstract: We study the convergence of iterative linear solvers for discontinuous Galerkin discretizations of systems of hyperbolic conservation laws with polygonal mesh elements compared with that of traditional triangular elements. We solve the semi-discrete system of equations by means of an implicit time discretization method, using iterative solvers such as the block Jacobi method and GMRES. We perform a von Neumann analysis to analytically study the convergence of the block Jacobi method for the two-dimensional advection equation on four classes of regular meshes: hexagonal, square, equilateral-triangular, and right-triangular. We find that hexagonal and square meshes give rise to smaller eigenvalues, and thus result in faster convergence of Jacobi's method. We perform numerical experiments with variable velocity fields, irregular, unstructured meshes, and the Euler equations of gas dynamics to confirm and extend these results. We additionally study the effect of polygonal meshes on the performance of block ILU(0) and Jacobi preconditioners for the GMRES method.
Recommendations
- Convergence of the Discontinuous Galerkin Method for Discontinuous Solutions
- Iterated discrete polynomially based Galerkin methods.
- Convergence of a discontinuous Galerkin multiscale method
- Discontinuous Galerkin methods for the biharmonic problem on polygonal and polyhedral meshes
- Discontinuous Galerkin methods using poly-sinc approximation
- Publication:4868414
- Improved convergence rates for some discrete Galerkin methods
- Sub-optimal convergence of non-symmetric discontinuous Galerkin methods for odd polynomial approximations
- On discontinuous Galerkin methods
Cites work
- A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
- A discontinuous Galerkin method based on a Taylor basis for the compressible flows on arbitrary grids
- A vertex-centered, dual discontinuous Galerkin method
- Adaptive remeshing for compressible flow computations
- Delaunay refinement algorithms for triangular mesh generation
- Diagonally Implicit Runge–Kutta Methods for Stiff O.D.E.’s
- Finite Volume Methods for Hyperbolic Problems
- High-order CFD methods: current status and perspective
- Nested Dissection of a Regular Finite Element Mesh
- New perspectives on polygonal and polyhedral finite element methods
- Newton-GMRES Preconditioning for Discontinuous Galerkin Discretizations of the Navier–Stokes Equations
- Numerical experiments with parallel orderings for ILU preconditioners
- Preconditioning methods for discontinuous Galerkin solutions of the Navier-Stokes equations
- Runge--Kutta discontinuous Galerkin methods for convection-dominated problems
- The effect of ordering on preconditioned conjugate gradients
- The elimination form of the inverse and its application to linear programming
- Time step restrictions for Runge-Kutta discontinuous Galerkin methods on triangular grids
- \texttt{PolyMesher}: a general-purpose mesh generator for polygonal elements written in Matlab
Cited in
(5)- Polytopal discontinuous Galerkin discretization of brain multiphysics flow dynamics
- Convergence in the incompressible limit of new discontinuous Galerkin methods with general quadrilateral and hexahedral elements
- On an iterative process for the grid conjugation problem with iterations on the boundary of the solution discontinuity
- A polygonal discontinuous Galerkin method with minus one stabilization
- A polygonal discontinuous Galerkin formulation for contact mechanics in fluid-structure interaction problems
This page was built for publication: On the convergence of iterative solvers for polygonal discontinuous Galerkin discretizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746923)
