Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique

Details Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique

2007-10-02

arxiv.org/abs/0710.0491v2

Mathematics

Numerical Analysis

Scientific paper

Sparse grids are tailored to the approximation of smooth high-dimensional functions. On a $d$-dimensional tensor product space, the number of grid points is $N = \mathcal O(h^{-1} |\log h|^{d-1})$, where $h$ is a mesh parameter. The so-called combination technique, based on hierarchical decomposition and extrapolation, requires specific multivariate error expansions of the discretisation error on Cartesian grids to hold. We derive such error expansions for linear difference schemes through an error correction technique of semi-discretisations. We obtain overall error formulae of the type $\epsilon = \mathcal{O} (h^p |\log h|^{d-1})$ and analyse the convergence, with its dependence on dimension and smoothness, by examples of linear elliptic and parabolic problems, with numerical illustrations in up to eight dimensions.

Affiliated with

Also associated with

No associations

Rating

Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of Linear Difference Schemes in the Sparse Grid Combination Technique will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-7145