High dimensional polynomial interpolation on sparse grids (Q1968633): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TESTPACK / rank | |||
Normal rank | |||
Revision as of 21:25, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | High dimensional polynomial interpolation on sparse grids |
scientific article |
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
