We prove convergence rates of linear sampling recovery of functions in abstract Bochner spaces satisfying weighted summability of their generalized polynomial chaos expansion coefficients. The underlying algorithm is a function-valued extension of the least squares method widely used and thoroughly studied in scalar-valued function recovery. We apply our theory to two core problems in Computational Uncertainty Quantification. First, we address non-intrusive approximations of solutions to parametric elliptic or parabolic PDEs with log-normal inputs, using a finite set of particular solvers. Second, we consider approximating infinite-dimensional holomorphic functions that arise as solutions to more general parametric PDEs with Gaussian random field inputs. This approach yields substantial improvements in the state of the art for these problems. Importantly, our framework unifies log-normal and affine input models. In the affine case, we obtain convergence rates that improve known results by a logarithmic factor.
Categories: math.NA cs.NA