Abstract
In this paper, we give a proof of the consistency of the finite difference technique on regular sparse grids [7, 18]. We introduce an extrapolation-type discretization of differential operators on sparse grids based on the idea of the combination technique and we show the consistency of this discretization. The equivalence of the new method with that of [7, 18] is established.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Author information
Authors and Affiliations
Additional information
Received February 8, 2000; revised June 8, 2000
Rights and permissions
About this article
Cite this article
Koster, F. A Proof of the Consistency of the Finite Difference Technique on Sparse Grids. Computing 65, 247–261 (2000). https://doi.org/10.1007/s006070070009
Issue Date:
DOI: https://doi.org/10.1007/s006070070009