排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
High dimensional polynomial interpolation on sparse grids 总被引:2,自引:0,他引:2
Barthelmann Volker Novak Erich Ritter Klaus 《Advances in Computational Mathematics》2000,12(4):273-288
We study polynomial interpolation on a d-dimensional cube, where d is large. We suggest to use the least solution at sparse grids with the extrema of the Chebyshev polynomials. The polynomial
exactness of this method is almost optimal. Our error bounds show that the method is universal, i.e., almost optimal for many
different function spaces. We report on numerical experiments for d = 10 using up to 652 065 interpolation points.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
1