Name
Abstract | ||
|---|---|---|
In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid algorithm and hierarchical surplus-guided local adaptivity. A high-degree basis is used to obtain a high-order method which, given sufficient smoothness, performs significantly better than the piecewise-linear basis. The underlying generalised sparse grid algorithm greedily selects the dimensions and variable interactions that contribute most to the variability of a function. The hierarchical surplus of points within the sparse grid is used as an error criterion for local refinement with the aim of concentrating computational effort within rapidly varying or discontinuous regions. This approach limits the number of points that are invested in `unimportant' dimensions and regions within the high-dimensional domain. We show the utility of the proposed method for non-smooth functions with hundreds of variables. |
Year | Venue | Keywords |
|---|---|---|
2011 | CoRR | sparse grids,data structure,piecewise linear,numerical analysis |
Field | DocType | Volume |
Mathematical optimization,Classification of discontinuities,Interpolation,Sparse approximation,Quadrature (mathematics),Smoothness,Sparse grid,Mathematics | Journal | abs/1110.0010 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John D. Jakeman | 1 | 52 | 7.65 |
| stephen roberts | 2 | 17 | 4.36 |