A multigrid algorithm for higher order finite elements on sparse grids
Electronic transactions on numerical analysis, Tome 6 (1997), pp. 63-77
For most types of problems in numerical mathematics, efficient discretization techniques are of crucial importance. This holds for tasks like how to define sets of points to approximate, interpolate, or integrate certain classes of functions as accurate as possible as well as for the numerical solution of differential equations.
Classification :
35J05, 65N15, 65N30, 65N55
Keywords: sparse grids, finite element method, higher order elements, multigrid methods
Keywords: sparse grids, finite element method, higher order elements, multigrid methods
@article{ETNA_1997__6__a15,
author = {Bungartz, Hans-Joachim},
title = {A multigrid algorithm for higher order finite elements on sparse grids},
journal = {Electronic transactions on numerical analysis},
pages = {63--77},
year = {1997},
volume = {6},
zbl = {0903.65087},
language = {en},
url = {http://geodesic.mathdoc.fr/item/ETNA_1997__6__a15/}
}
Bungartz, Hans-Joachim. A multigrid algorithm for higher order finite elements on sparse grids. Electronic transactions on numerical analysis, Tome 6 (1997), pp. 63-77. http://geodesic.mathdoc.fr/item/ETNA_1997__6__a15/