On Efficient Algorithms for Computing near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples
On Efficient Algorithms for Computing near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples