V-cycle Multigrid Algorithms for Discontinuous Galerkin Methods on Non-nested Polytopic Meshes

In this paper we analyze the convergence properties of V -cycle multigrid algorithms for the numerical solution of the linear system of equations stemming from discontinuous Galerkin discretization of second-order elliptic partial differential equations on polytopic meshes. Here, the sequence of spa...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of scientific computing Jg. 78; H. 1; S. 625 - 652
Hauptverfasser: Antonietti, P. F., Pennesi, G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.01.2019
Springer Nature B.V
Schlagworte:
Algorithms
Coarsening
Computational Mathematics and Numerical Analysis
Convergence
Elliptic functions
Galerkin method
Mathematical analysis
Mathematical and Computational Engineering
Mathematical and Computational Physics
Mathematics
Mathematics and Statistics
Methods
Multigrid methods
Partial differential equations
Polynomials
Theoretical
Multi-level methods
Discontinuous Galerkin
65F10
Non-nested spaces
65M55
cycle
65N22
Polygonal grids
ISSN:0885-7474, 1573-7691
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we analyze the convergence properties of V -cycle multigrid algorithms for the numerical solution of the linear system of equations stemming from discontinuous Galerkin discretization of second-order elliptic partial differential equations on polytopic 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 algorithms 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 minimum number of smoothing steps, which depends on p , is chosen sufficiently large.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-7474
1573-7691
DOI:10.1007/s10915-018-0783-x