On Discrete Least-Squares Projection in Unbounded Domain with Random Evaluations and its Application to Parametric Uncertainty Quantification

This work is concerned with approximating multivariate functions in unbounded domain by using discrete least-squares projection with random points evaluations. Particular attention are given to functions with random Gaussian or Gamma parameters. We first demonstrate that the traditional Hermite (Laguerre) polynomials chaos expansion suffers from the \textit{instability} in the sense that an \textit{unfeasible} number of points, which is relevant to the dimension of the approximation space, is needed to guarantee the stability in the least square framework. We then propose to use the Hermite/Laguerre {\em functions} (rather than polynomials) as bases in the expansion. The corresponding design points are obtained by mapping the uniformly distributed random points in bounded intervals to the unbounded domain, which involved a mapping parameter $L$. By using the Hermite/Laguerre {\em functions} and a proper mapping parameter, the stability can be significantly improved even if the number of design points scales \textit{linearly} (up to a logarithmic factor) with the dimension of the approximation space. Apart from the stability, another important issue is the rate of convergence. To speed up the convergence, an effective scaling factor is introduced, and a principle for choosing quasi-optimal scaling factor is discussed. Applications to parametric uncertainty quantification are illustrated by considering a random ODE model together with an elliptic problem with lognormal random input.

[1]  D. Gottlieb,et al.  Numerical analysis of spectral methods : theory and applications , 1977 .

[2]  Chia-Chih Huang,et al.  An efficient method for computing optical waveguides with discontinuous refractive index profiles using spectral collocation method with domain decomposition , 2003 .

[3]  N. Cutland,et al.  On homogeneous chaos , 1991, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  Rudolf Ahlswede,et al.  Strong converse for identification via quantum channels , 2000, IEEE Trans. Inf. Theory.

[5]  Albert Cohen,et al.  On the Stability and Accuracy of Least Squares Approximations , 2011, Foundations of Computational Mathematics.

[6]  Tao Tang,et al.  Combined Hermite spectral-finite difference method for the Fokker-Planck equation , 2002, Math. Comput..

[7]  Dongbin Xiu,et al.  High-Order Collocation Methods for Differential Equations with Random Inputs , 2005, SIAM J. Sci. Comput..

[8]  Julia Charrier,et al.  Strong and Weak Error Estimates for Elliptic Partial Differential Equations with Random Coefficients , 2012, SIAM J. Numer. Anal..

[9]  M. Eldred Recent Advances in Non-Intrusive Polynomial Chaos and Stochastic Collocation Methods for Uncertainty Analysis and Design , 2009 .

[10]  James A. Nichols,et al.  Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients , 2014, Numerische Mathematik.

[11]  Tao Zhou,et al.  On Sparse Interpolation and the Design of Deterministic Interpolation Points , 2013, SIAM J. Sci. Comput..

[12]  Jie Shen,et al.  Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems , 2010, SIAM J. Sci. Comput..

[13]  George E. Karniadakis,et al.  Spectral Polynomial Chaos Solutions of the Stochastic Advection Equation , 2002, J. Sci. Comput..

[14]  Dongbin Xiu,et al.  The Wiener-Askey Polynomial Chaos for Stochastic Differential Equations , 2002, SIAM J. Sci. Comput..

[15]  Weiwei Sun,et al.  Hermite Spectral Methods with a Time-Dependent Scaling for Parabolic Equations in Unbounded Domains , 2005, SIAM J. Numer. Anal..

[16]  Tao Tang,et al.  The Hermite Spectral Method for Gaussian-Type Functions , 1993, SIAM J. Sci. Comput..

[17]  Raul Tempone,et al.  A quasi-optimal sparse grids procedure for groundwater flows , 2014 .

[18]  Albert Cohen,et al.  Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs , 2015 .

[19]  Mehdi Dehghan,et al.  An approximation algorithm for the solution of the nonlinear Lane-Emden type equations arising in astrophysics using Hermite functions collocation method , 2010, Comput. Phys. Commun..

[20]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[21]  Xue Luo,et al.  Hermite Spectral Method to 1-D Forward Kolmogorov Equation and Its Application to Nonlinear Filtering Problems , 2013, IEEE Transactions on Automatic Control.

[22]  D. Xiu Efficient collocational approach for parametric uncertainty analysis , 2007 .

[23]  R. Ghanem,et al.  Stochastic Finite Elements: A Spectral Approach , 1990 .

[24]  Giovanni Migliorati,et al.  Polynomial approximation by means of the random discrete L2 projection and application to inverse problems for PDEs with stochastic data , 2013 .

[25]  I. Babuska,et al.  Finite element-galerkin approximation of the eigenvalues and Eigenvectors of selfadjoint problems , 1989 .

[26]  Jan S. Hesthaven,et al.  Uncertainty analysis for the steady-state flows in a dual throat nozzle , 2005 .

[27]  D. Xiu,et al.  Modeling uncertainty in flow simulations via generalized polynomial chaos , 2003 .

[28]  Marco Caliari,et al.  GSGPEs: A MATLAB code for computing the ground state of systems of Gross-Pitaevskii equations , 2013, Comput. Phys. Commun..

[29]  Fabio Nobile,et al.  A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data , 2008, SIAM J. Numer. Anal..

[30]  Tao Zhou,et al.  Multivariate Discrete Least-Squares Approximations with a New Type of Collocation Grid , 2014, SIAM J. Sci. Comput..

[31]  Tao Tang,et al.  Galerkin Methods for Stochastic Hyperbolic Problems Using Bi-Orthogonal Polynomials , 2012, J. Sci. Comput..

[32]  R. Walters,et al.  Point-Collocation Nonintrusive Polynomial Chaos Method for Stochastic Computational Fluid Dynamics , 2010 .