High dimensional polynomial interpolation on sparse grids (Q1968633): Difference between revisions

This paper deals with polynomial interpolation on a \(d\)-dimensional cube, where \(d\) is large. The authors suggest to use the least solution at sparse grids with extrema of the Chebyshev polynomials. Obtained error bounds show that the method is universal, i.e., almost optimal for many different function spaces. Numerical results in dimension \(d=\) 10 using up to 652 065 interpolation points are presented.