Comparison between reduced basis and stochastic collocation methods for elliptic problems

• Published in: Journal of Scientific Computing (ISSN: 0885-7474), vol. 59, num. 1, p. 187-216
• New York: Springer Verlag, 2014

The stochastic collocation method has recently been applied to stochastic problems that can be transformed into parametric systems. Meanwhile, the reduced basis method, primarily developed for solving parametric systems, has been recently used to deal with stochastic problems. In this work, we aim at comparing the performance of the two methods when applied to the solution of linear stochastic elliptic problems. Two important comparison criteria are considered: 1) convergence results of the approximation error; 2) computational costs for both offline construction and online evaluation. Numerical experiments are performed for problems from low dimensions O(1) to moderate dimensions O(10) and to high dimensions O(100). The main result stemming from our comparison is that the reduced basis method converges better in theory and faster in practice than the stochastic collocation method for smooth problems, and is more suitable for large scale and high dimensional stochastic problems when considering computational costs.

Keywords: sparse grid ; reduced basis method ; stochastic collocation method ; convergence analysis ; offline-online computational splitting procedures ; greedy algorithm ; stochastic elliptic problem

Note:

EPFL MATHICSE report 34.2012

Reference

• EPFL-ARTICLE-187602
• doi:10.1007/s10915-013-9764-2
• View record in Web of Science
• URL: http://mathicse.epfl.ch/files/content/sites/mathicse/files/Mathicse%20reports%202012/34.2012_PC-AQ-GR.pdf

Record created on 2013-07-24, modified on 2017-05-12