On the Choice of Design Points for Least Square Polynomial Approximations with Application to Uncertainty Quantification
Zhen Gao 1, Tao Zhou 2*1 School of Mathematical Sciences, Ocean University of China, Qingdao, China.
2 Institute of Computational Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China.
Received 13 August 2013; Accepted (in revised version) 6 February 2014
Available online 9 May 2014
In this work, we concern with the numerical comparison between different kinds of design points in least square (LS) approach on polynomial spaces. Such a topic is motivated by uncertainty quantification (UQ). Three kinds of design points are considered, which are the Sparse Grid (SG) points, the Monte Carlo (MC) points and the Quasi Monte Carlo (QMC) points. We focus on three aspects during the comparison: (i) the convergence properties; (ii) the stability, i.e. the properties of the resulting condition number of the design matrix; (iii) the robustness when numerical noises are present in function values. Several classical high dimensional functions together with a random ODE model are tested. It is shown numerically that (i) neither the MC sampling nor the QMC sampling introduce the low convergence rate, namely, the approach achieves high order convergence rate for all cases provided that the underlying functions admit certain regularity and enough design points are used; (ii)The use of SG points admits better convergence properties only for very low dimensional problems (say d≤2); (iii)The QMC points, being deterministic, seem to be a good choice for higher dimensional problems not only for better convergence properties but also in the stability point of view.AMS subject classifications: 65C20, 65M70
Notice: Undefined variable: pac in /var/www/html/readabs.php on line 165
Key words: Least square, polynomial approximations, uncertainty quantification, condition number.
Email: firstname.lastname@example.org (Z. Gao), email@example.com (T. Zhou)