Semi-coarsening in space and time for the hierarchical transformation multigrid method

Benjamin Peherstorfer, Hans Joachim Bungartz

Research output: Contribution to journalConference article

Abstract

We extend the hierarchical transformation multigrid (HT-MG) method with semi-coarsening in space and time in order to tackle anisotropic problems. Semi-coarsening allows us to smooth on anisotropic grids and, thus to employ more advanced multigrid cycles, e.g. the so-called Q-cycle. Our numerical examples show that we can tackle anisotropic problems with the HT-MG method and the Q-cycle. We do not only apply the multigrid method in space directions but also in time directions where the Q-cycle is beneficial again.

Original languageEnglish (US)
Pages (from-to)2000-2003
Number of pages4
JournalProcedia Computer Science
Volume9
DOIs
StatePublished - Jan 1 2012
Event12th Annual International Conference on Computational Science, ICCS 2012 - Omaha, NB, United States
Duration: Jun 4 2012Jun 6 2012

Fingerprint

Coarsening

Keywords

  • Anisotropic problems
  • Multigrid
  • Semi-coarsening
  • Time-space discretization

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Semi-coarsening in space and time for the hierarchical transformation multigrid method. / Peherstorfer, Benjamin; Bungartz, Hans Joachim.

In: Procedia Computer Science, Vol. 9, 01.01.2012, p. 2000-2003.

Research output: Contribution to journalConference article

Peherstorfer, Benjamin ; Bungartz, Hans Joachim. / Semi-coarsening in space and time for the hierarchical transformation multigrid method. In: Procedia Computer Science. 2012 ; Vol. 9. pp. 2000-2003.
@article{500ae2de94224a91acda31b30d053b5e,
title = "Semi-coarsening in space and time for the hierarchical transformation multigrid method",
abstract = "We extend the hierarchical transformation multigrid (HT-MG) method with semi-coarsening in space and time in order to tackle anisotropic problems. Semi-coarsening allows us to smooth on anisotropic grids and, thus to employ more advanced multigrid cycles, e.g. the so-called Q-cycle. Our numerical examples show that we can tackle anisotropic problems with the HT-MG method and the Q-cycle. We do not only apply the multigrid method in space directions but also in time directions where the Q-cycle is beneficial again.",
keywords = "Anisotropic problems, Multigrid, Semi-coarsening, Time-space discretization",
author = "Benjamin Peherstorfer and Bungartz, {Hans Joachim}",
year = "2012",
month = "1",
day = "1",
doi = "10.1016/j.procs.2012.04.221",
language = "English (US)",
volume = "9",
pages = "2000--2003",
journal = "Procedia Computer Science",
issn = "1877-0509",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - Semi-coarsening in space and time for the hierarchical transformation multigrid method

AU - Peherstorfer, Benjamin

AU - Bungartz, Hans Joachim

PY - 2012/1/1

Y1 - 2012/1/1

N2 - We extend the hierarchical transformation multigrid (HT-MG) method with semi-coarsening in space and time in order to tackle anisotropic problems. Semi-coarsening allows us to smooth on anisotropic grids and, thus to employ more advanced multigrid cycles, e.g. the so-called Q-cycle. Our numerical examples show that we can tackle anisotropic problems with the HT-MG method and the Q-cycle. We do not only apply the multigrid method in space directions but also in time directions where the Q-cycle is beneficial again.

AB - We extend the hierarchical transformation multigrid (HT-MG) method with semi-coarsening in space and time in order to tackle anisotropic problems. Semi-coarsening allows us to smooth on anisotropic grids and, thus to employ more advanced multigrid cycles, e.g. the so-called Q-cycle. Our numerical examples show that we can tackle anisotropic problems with the HT-MG method and the Q-cycle. We do not only apply the multigrid method in space directions but also in time directions where the Q-cycle is beneficial again.

KW - Anisotropic problems

KW - Multigrid

KW - Semi-coarsening

KW - Time-space discretization

UR - http://www.scopus.com/inward/record.url?scp=84896906673&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896906673&partnerID=8YFLogxK

U2 - 10.1016/j.procs.2012.04.221

DO - 10.1016/j.procs.2012.04.221

M3 - Conference article

VL - 9

SP - 2000

EP - 2003

JO - Procedia Computer Science

JF - Procedia Computer Science

SN - 1877-0509

ER -