@Article{NMTMA-5-1,
author = {},
title = {A Geometric Space-Time Multigrid Algorithm for the Heat Equation},
journal = {Numerical Mathematics: Theory, Methods and Applications},
year = {2012},
volume = {5},
number = {1},
pages = {110--130},
abstract = {<p style="text-align: justify;">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&#39;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&#39;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.</p>},
issn = {2079-7338},
doi = {https://doi.org/10.4208/nmtma.m12si07},
url = {https://global-sci.com/article/90659/a-geometric-space-time-multigrid-algorithm-for-the-heat-equation}
}