A comparison of approaches for the construction of reduced basis for stochastic Galerkin matrix equations
We examine different approaches to an efficient solution of the stochastic Galerkin (SG) matrix equations coming from the Darcy flow problem with different, uncertain coefficients in apriori known subdomains. The solution of the SG system of equations is usually a very challenging task. A relatively new approach to the solution of the SG matrix equations is the reduced basis (RB) solver, which looks for a low-rank representation of the solution. The construction of the RB is usually done iteratively...