AN ADAPTIVE STOCHASTIC GALERKIN METHOD FOR RANDOM ELLIPTIC OPERATORS

We derive an adaptive solver for random elliptic boundary value problems, using techniques from adaptive wavelet methods. Substituting wavelets by polynomials of the random parameters leads to a modular solver for the parameter dependence of the random solution, which combines with any discretization on the spatial domain. In addition to selecting active polynomial modes, this solver can adaptively construct a separate spatial discretization for each of their coefficients. We show convergence of the solver in this general setting, along with a computable bound for the mean square error, and an optimality property in the case of a single spatial discretization. Numerical computations demonstrate convergence of the solver and compare it to a sparse tensor product construction.