High dimensional polynomial interpolation on sparse grids (Q1968633)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:1968633 |
scientific article; zbMATH DE number 1419509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | High dimensional polynomial interpolation on sparse grids |
scientific article; zbMATH DE number 1419509 |
Statements
High dimensional polynomial interpolation on sparse grids (English)
0 references
21 March 2000
0 references
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.
0 references
multivariate polynomial interpolation
0 references
sparse grids
0 references
least solution
0 references
universal method
0 references
tractability
0 references
0.7929487824440002
0 references
0.7840640544891357
0 references
