===affil2:
University of Maryland
===firstname:
Qifeng
===firstname4:

===firstname3:

===lastname2:
Elman 
===lastname:
Liao
===firstname5:

===affil6:

===lastname3:

===email:
qliao@umd.edu
===lastname6:

===affil5:

===otherauths:

===lastname4:

===affil4:

===lastname7:

===affil7:

===firstname7:

===postal:
Department of Computer Science
University of Maryland
College Park, MD 20742
USA
===firstname6:

===ABSTRACT:
The sparse grid stochastic collocation method is widely used for solving PDEs with random coefficients. However, when the probability space has a high dimensionality, the number of sparse girds can be large. It then becomes every inefficient to construct the collocation solution, by directly solving the discretized problems associated with stochastic realizations at all sampling points. In order to speed up the collocation process, we apply a reduced basis approximation with a greedy algorithm, which can lead to Galerkin equations with very small degrees of freedom. Numerical experiments demonstrate the satisfactory performance of this model reduction technique.
===affil3:

===lastname5:

===affilother:

===title:
Reduced Basis Approximation for the Sparse Grid Stochastic Collocation Method
===firstname2:
Howard