An adaptive multigrid strategy for convection-diffusion problems

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For the solution of convection-diffusion problems we present a multilevel self-adaptive mesh-refinement algorithm to resolve locally strong varying behavior, like boundary and interior layers. The method is based on discontinuous Galerkin (Baumann-Oden DG) discretization. The recursive mesh-adaptation is interwoven with the multigrid solver. The solver is based on multigrid V-cycles with damped block-Jacobi relaxation as a smoother, Grid transfer operators are chosen in agreement with the Galerkin structure of the discretization, and local grid-refinement is taken care of by the transfer of local truncation errors between overlapping parts of the grid. We propose an error indicator based on the comparison of the discrete solution on the finest grid and its restriction to the next coarser grid. It refines in regions, where this difference is too large, Several results of numerical experiments are presented which illustrate the performance of the method. © Springer-Vei-lag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Vasileva, D., Kuut, A., & Hemker, P. W. (2006). An adaptive multigrid strategy for convection-diffusion problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3743 LNCS, pp. 138–145). https://doi.org/10.1007/11666806_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free