hp-Multigrid as Smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows: Part I: Multilevel analysis

Jacobus J.W. van der Vegt, Sander Rhebergen

    Research output: Contribution to journalArticleAcademicpeer-review

    11 Downloads (Pure)

    Abstract

    The hp-Multigrid as Smoother algorithm (hp-MGS) for the solution of higher order accurate space–time discontinuous Galerkin discretizations of advection dominated flows is presented. This algorithm combines p-multigrid with h-multigrid at all p-levels, where the h-multigrid acts as smoother in the p-multigrid. The performance of the hp-MGS algorithm is further improved using semi-coarsening in combination with a new semi-implicit Runge–Kutta method as smoother. A detailed multilevel analysis of the hp-MGS algorithm is presented to obtain more insight into the theoretical performance of the algorithm. As model problem a fourth order accurate space–time discontinuous Galerkin discretization of the advection–diffusion equation is considered. The multilevel analysis shows that the hp-MGS algorithm has excellent convergence rates, both for steady state and time-dependent problems, and low and high cell Reynolds numbers, including highly stretched meshes.
    Original languageEnglish
    Pages (from-to)7537-7563
    Number of pages27
    JournalJournal of computational physics
    Volume231
    Issue number22
    DOIs
    Publication statusPublished - 2012

    Keywords

    • Space–time methods
    • EWI-22732
    • Fourier analysis
    • Multi-level analysis
    • IR-83466
    • Discontinuous Galerkin methods
    • Higher order accurate discretizations
    • Runge–Kutta methods
    • METIS-293266
    • Multigrid algorithms

    Fingerprint Dive into the research topics of 'hp-Multigrid as Smoother algorithm for higher order discontinuous Galerkin discretizations of advection dominated flows: Part I: Multilevel analysis'. Together they form a unique fingerprint.

    Cite this