Least squares on random points with 2x oversampling matches or beats Smolyak sparse grids on benchmark functions up to dimension 100.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Sparse grids vs. random points for high-dimensional polynomial approximation
Least squares on random points with 2x oversampling matches or beats Smolyak sparse grids on benchmark functions up to dimension 100.