Numer. Math. Theor. Meth. Appl., 10 (2017), pp. 689-710.
Published online: 2017-10
Cited by
- BibTex
- RIS
- TXT
In this paper we introduce high dimensional tensor product interpolation for the combination technique. In order to compute the sparse grid solution, the discrete numerical subsolutions have to be extended by interpolation. If unsuitable interpolation techniques are used, the rate of convergence is deteriorated. We derive the necessary framework to preserve the error structure of high order finite difference solutions of elliptic partial differential equations within the combination technique framework. This strategy enables us to obtain high order sparse grid solutions on the full grid. As exemplifications for the case of order four we illustrate our theoretical results by two test examples with up to four dimensions.
}, issn = {2079-7338}, doi = {https://doi.org/10.4208/nmtma.2017.m1511}, url = {http://global-sci.org/intro/article_detail/nmtma/12365.html} }In this paper we introduce high dimensional tensor product interpolation for the combination technique. In order to compute the sparse grid solution, the discrete numerical subsolutions have to be extended by interpolation. If unsuitable interpolation techniques are used, the rate of convergence is deteriorated. We derive the necessary framework to preserve the error structure of high order finite difference solutions of elliptic partial differential equations within the combination technique framework. This strategy enables us to obtain high order sparse grid solutions on the full grid. As exemplifications for the case of order four we illustrate our theoretical results by two test examples with up to four dimensions.