A Geometric Space-Time Multigrid Algorithm for the Heat Equation

Köppl

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We study the time-dependent heat equation on its space-time domain that is discretised by a k-spacetree. k-spacetrees are a generalisation of the octree concept and are a discretisation paradigm yielding a multiscale representation of dynamically adaptive Cartesian grids with low memory footprint. The paper presents a full approximation storage geometric multigrid implementation for this setting that combines the smoothing properties of multigrid for the equation's elliptic operator with a multiscale solution propagation in time. While the runtime and memory overhead for tackling the all-in-one space-time problem is bounded, the holistic approach promises to exhibit a better parallel scalability than classical time stepping, adaptive dynamic refinement in space and time fall naturally into place, as well as the treatment of periodic boundary conditions of steady cycle systems, on-time computational steering is eased as the algorithm delivers guesses for the solution's long-term behaviour immediately, and, finally, backward problems arising from the adjoint equation benefit from the the solution being available for any point in space and time. © 2012 Global-Science Press.
Original languageEnglish (US)
Pages (from-to)110-130
Number of pages21
JournalNumerical Mathematics: Theory, Methods and Applications
Volume5
Issue number1
DOIs
StatePublished - Nov 16 2020
Externally publishedYes

Fingerprint Dive into the research topics of 'A Geometric Space-Time Multigrid Algorithm for the Heat Equation'. Together they form a unique fingerprint.

Cite this